# Generated with http://eulersharp.sourceforge.net/ version 1.5.23 on 27 May 2006 12:19:16 GMT @prefix log: . @prefix e: . (!log:semantics !log:semantics)!log:conjunction => { @prefix p0: . @prefix q: . @prefix list: . @prefix e: . @prefix xsd: . @prefix : . @prefix log: . @prefix rdfs: . @prefix math: . @prefix owl: . @prefix rdf: . {{:path a owl:TransitiveProperty} e:evidence . {{:oneway rdfs:subPropertyOf :path} e:evidence . {:angers :oneway :nantes} e:evidence } => { {:angers :path :nantes} e:evidence }. {{:path a owl:TransitiveProperty} e:evidence . {{:oneway rdfs:subPropertyOf :path} e:evidence . {:lemans :oneway :angers} e:evidence } => { {:lemans :path :angers} e:evidence }. {{:path a owl:TransitiveProperty} e:evidence . {{:oneway rdfs:subPropertyOf :path} e:evidence . {:chartres :oneway :lemans} e:evidence } => { {:chartres :path :lemans} e:evidence }. {{:oneway rdfs:subPropertyOf :path} e:evidence . {:paris :oneway :chartres} e:evidence } => { {:paris :path :chartres} e:evidence }} => { {:paris :path :lemans} e:evidence }} => { {:paris :path :angers} e:evidence }} => { {:paris :path :nantes} e:evidence }. # Proof found in 262 steps (6548 steps/sec) using 1 engine (54 triples) }.