%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : KRS165+1 : TPTP v8.2.0. Released v3.1.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % Computer : n027.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 300s % DateTime : Mon Jun 24 10:08:45 EDT 2024 % Result : Theorem 0.49s 0.63s % Output : CNFRefutation 0.59s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : KRS165+1 : TPTP v8.2.0. Released v3.1.0. % 0.03/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.11/0.32 % Computer : n027.cluster.edu % 0.11/0.32 % Model : x86_64 x86_64 % 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.32 % Memory : 8042.1875MB % 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.32 % CPULimit : 300 % 0.11/0.32 % WCLimit : 300 % 0.11/0.32 % DateTime : Wed Jun 19 14:26:53 EDT 2024 % 0.11/0.32 % CPUTime : % 0.48/0.55 start to proof:theBenchmark % 0.49/0.63 %------------------------------------------- % 0.49/0.63 % File :CSE---1.7 % 0.49/0.63 % Problem :theBenchmark % 0.49/0.63 % Transform :cnf % 0.49/0.63 % Format :tptp:raw % 0.49/0.63 % Command :java -jar mcs_scs.jar %d %s % 0.49/0.63 % 0.49/0.63 % Result :Theorem 0.040000s % 0.49/0.63 % Output :CNFRefutation 0.040000s % 0.49/0.63 %------------------------------------------- % 0.49/0.63 %------------------------------------------------------------------------------ % 0.49/0.63 % File : KRS165+1 : TPTP v8.2.0. Released v3.1.0. % 0.49/0.63 % Domain : Knowledge Representation (Semantic Web) % 0.49/0.63 % Problem : Two classes may be different names for the same set of individuals % 0.49/0.63 % Version : Especial. % 0.49/0.63 % English : % 0.49/0.63 % 0.49/0.63 % Refs : [Bec03] Bechhofer (2003), Email to G. Sutcliffe % 0.49/0.63 % : [TR+04] Tsarkov et al. (2004), Using Vampire to Reason with OW % 0.49/0.63 % Source : [Bec03] % 0.49/0.63 % Names : positive_equivalentClass-Manifest002 [Bec03] % 0.49/0.63 % 0.49/0.63 % Status : Theorem % 0.49/0.63 % Rating : 0.00 v5.3.0, 0.09 v5.2.0, 0.00 v3.1.0 % 0.49/0.63 % Syntax : Number of formulae : 4 ( 0 unt; 0 def) % 0.49/0.63 % Number of atoms : 14 ( 0 equ) % 0.49/0.63 % Maximal formula atoms : 8 ( 3 avg) % 0.49/0.63 % Number of connectives : 14 ( 4 ~; 0 |; 5 &) % 0.49/0.63 % ( 3 <=>; 2 =>; 0 <=; 0 <~>) % 0.49/0.63 % Maximal formula depth : 6 ( 4 avg) % 0.49/0.63 % Maximal term depth : 1 ( 1 avg) % 0.49/0.63 % Number of predicates : 6 ( 6 usr; 0 prp; 1-1 aty) % 0.49/0.63 % Number of functors : 0 ( 0 usr; 0 con; --- aty) % 0.49/0.63 % Number of variables : 7 ( 7 !; 0 ?) % 0.49/0.63 % SPC : FOF_THM_EPR_NEQ % 0.49/0.63 % 0.49/0.63 % Comments : Sean Bechhofer says there are some errors in the encoding of % 0.49/0.63 % datatypes, so this problem may not be perfect. At least it's % 0.49/0.63 % still representative of the type of reasoning required for OWL. % 0.49/0.63 %------------------------------------------------------------------------------ % 0.49/0.63 %----Thing and Nothing % 0.49/0.63 fof(axiom_0,axiom, % 0.49/0.63 ! [X] : % 0.49/0.63 ( cowlThing(X) % 0.49/0.63 & ~ cowlNothing(X) ) ). % 0.49/0.63 % 0.49/0.63 %----String and Integer disjoint % 0.49/0.63 fof(axiom_1,axiom, % 0.49/0.63 ! [X] : % 0.49/0.63 ( xsd_string(X) % 0.49/0.63 <=> ~ xsd_integer(X) ) ). % 0.49/0.63 % 0.49/0.63 %----Equality cCar % 0.49/0.63 fof(axiom_2,axiom, % 0.49/0.63 ! [X] : % 0.49/0.63 ( cCar(X) % 0.49/0.63 <=> cAutomobile(X) ) ). % 0.49/0.63 % 0.49/0.63 %----Thing and Nothing % 0.49/0.63 %----String and Integer disjoint % 0.49/0.63 %----Super cAutomobile % 0.49/0.63 %----Super cCar % 0.49/0.63 fof(the_axiom,conjecture, % 0.49/0.63 ( ! [X] : % 0.49/0.63 ( cowlThing(X) % 0.49/0.63 & ~ cowlNothing(X) ) % 0.49/0.63 & ! [X] : % 0.49/0.63 ( xsd_string(X) % 0.49/0.63 <=> ~ xsd_integer(X) ) % 0.49/0.63 & ! [X] : % 0.49/0.63 ( cAutomobile(X) % 0.49/0.63 => cCar(X) ) % 0.49/0.63 & ! [X] : % 0.49/0.63 ( cCar(X) % 0.49/0.63 => cAutomobile(X) ) ) ). % 0.49/0.63 % 0.49/0.63 %------------------------------------------------------------------------------ % 0.49/0.63 %------------------------------------------- % 0.49/0.63 % Proof found % 0.49/0.63 % SZS status Theorem for theBenchmark % 0.49/0.63 % SZS output start Proof % 0.49/0.63 %ClaNum:13(EqnAxiom:0) % 0.49/0.63 %VarNum:9(SingletonVarNum:5) % 0.49/0.63 %MaxLitNum:5 % 0.49/0.63 %MaxfuncDepth:0 % 0.49/0.63 %SharedTerms:13 % 0.49/0.63 %goalClause: 6 7 8 9 10 11 12 13 % 0.49/0.63 [1]~P1(x11) % 0.49/0.63 [2]P5(x21)+P4(x21) % 0.49/0.63 [3]~P3(x31)+P2(x31) % 0.49/0.63 [4]~P2(x41)+P3(x41) % 0.49/0.63 [5]~P5(x51)+~P4(x51) % 0.49/0.63 [6]P1(a1)+P4(a2)+P2(a3)+P3(a4)+~P5(a2) % 0.49/0.63 [7]P1(a1)+P5(a2)+P2(a3)+P3(a4)+~P4(a2) % 0.49/0.63 [8]P1(a1)+P4(a2)+P2(a3)+~P5(a2)+~P2(a4) % 0.49/0.63 [9]P1(a1)+P4(a2)+P3(a4)+~P5(a2)+~P3(a3) % 0.49/0.63 [10]P1(a1)+P5(a2)+P2(a3)+~P4(a2)+~P2(a4) % 0.49/0.63 [11]P1(a1)+P5(a2)+P3(a4)+~P4(a2)+~P3(a3) % 0.49/0.63 [12]P1(a1)+P4(a2)+~P5(a2)+~P2(a4)+~P3(a3) % 0.49/0.63 [13]P1(a1)+P5(a2)+~P4(a2)+~P2(a4)+~P3(a3) % 0.49/0.63 %EqnAxiom % 0.49/0.63 % 0.49/0.63 %------------------------------------------- % 0.49/0.64 cnf(18,plain, % 0.49/0.64 (P4(a2)+P2(a3)+P3(a4)+~P5(a2)), % 0.49/0.64 inference(scs_inference,[],[1,6])). % 0.49/0.64 cnf(19,plain, % 0.49/0.64 (P5(a2)+P2(a3)+P3(a4)+~P4(a2)), % 0.49/0.64 inference(scs_inference,[],[1,7])). % 0.49/0.64 cnf(20,plain, % 0.49/0.64 (P4(a2)+P2(a3)+~P5(a2)+~P2(a4)), % 0.49/0.64 inference(scs_inference,[],[1,8])). % 0.49/0.64 cnf(21,plain, % 0.49/0.64 (P4(a2)+P3(a4)+~P5(a2)+~P3(a3)), % 0.49/0.64 inference(scs_inference,[],[1,9])). % 0.49/0.64 cnf(22,plain, % 0.49/0.64 (P5(a2)+P2(a3)+~P4(a2)+~P2(a4)), % 0.49/0.64 inference(scs_inference,[],[1,10])). % 0.49/0.64 cnf(23,plain, % 0.49/0.64 (P5(a2)+P3(a4)+~P4(a2)+~P3(a3)), % 0.49/0.64 inference(scs_inference,[],[1,11])). % 0.49/0.64 cnf(24,plain, % 0.49/0.64 (P4(a2)+~P5(a2)+~P2(a4)+~P3(a3)), % 0.49/0.64 inference(scs_inference,[],[1,12])). % 0.49/0.64 cnf(25,plain, % 0.49/0.64 (P5(a2)+~P4(a2)+~P2(a4)+~P3(a3)), % 0.49/0.64 inference(scs_inference,[],[1,13])). % 0.49/0.64 cnf(29,plain, % 0.49/0.64 (P5(a2)+P2(a3)+P3(a4)), % 0.49/0.64 inference(scs_inference,[],[2,19])). % 0.49/0.64 cnf(30,plain, % 0.49/0.64 (~P4(a2)+P2(a3)+P3(a4)), % 0.49/0.64 inference(scs_inference,[],[29,5])). % 0.49/0.64 cnf(31,plain, % 0.49/0.64 (P2(a3)+P3(a4)+~P5(a2)), % 0.49/0.64 inference(scs_inference,[],[30,18])). % 0.49/0.64 cnf(32,plain, % 0.49/0.64 (P2(a4)+P2(a3)+~P5(a2)), % 0.49/0.64 inference(scs_inference,[],[31,3])). % 0.49/0.64 cnf(33,plain, % 0.49/0.64 (P4(a2)+P2(a3)+~P5(a2)), % 0.49/0.64 inference(scs_inference,[],[32,20])). % 0.49/0.64 cnf(34,plain, % 0.49/0.64 (~P5(a2)+P2(a3)), % 0.49/0.64 inference(scs_inference,[],[33,5])). % 0.49/0.64 cnf(35,plain, % 0.49/0.64 (P4(a2)+P2(a3)), % 0.49/0.64 inference(scs_inference,[],[34,2])). % 0.49/0.64 cnf(36,plain, % 0.49/0.64 (P2(a3)+P3(a4)), % 0.49/0.64 inference(scs_inference,[],[35,30])). % 0.49/0.64 cnf(37,plain, % 0.59/0.64 (P3(a3)+P3(a4)), % 0.59/0.64 inference(scs_inference,[],[36,4])). % 0.59/0.64 cnf(38,plain, % 0.59/0.64 (P4(a2)+P3(a4)+~P5(a2)), % 0.59/0.64 inference(scs_inference,[],[37,21])). % 0.59/0.64 cnf(39,plain, % 0.59/0.64 (~P5(a2)+P3(a4)), % 0.59/0.64 inference(scs_inference,[],[38,5])). % 0.59/0.64 cnf(40,plain, % 0.59/0.64 (P4(a2)+P3(a4)), % 0.59/0.64 inference(scs_inference,[],[39,2])). % 0.59/0.64 cnf(41,plain, % 0.59/0.64 (P5(a2)+P3(a4)+~P3(a3)), % 0.59/0.64 inference(scs_inference,[],[40,23])). % 0.59/0.64 cnf(42,plain, % 0.59/0.64 (~P3(a3)+P3(a4)), % 0.59/0.64 inference(scs_inference,[],[41,39])). % 0.59/0.64 cnf(43,plain, % 0.59/0.64 (~P2(a3)+P3(a4)), % 0.59/0.64 inference(scs_inference,[],[42,4])). % 0.59/0.64 cnf(44,plain, % 0.59/0.64 (P3(a4)), % 0.59/0.64 inference(scs_inference,[],[43,36])). % 0.59/0.64 cnf(45,plain, % 0.59/0.64 (P4(a2)+~P2(a4)+~P3(a3)), % 0.59/0.64 inference(scs_inference,[],[2,24])). % 0.59/0.64 cnf(46,plain, % 0.59/0.64 (~P5(a2)+~P2(a4)+~P3(a3)), % 0.59/0.64 inference(scs_inference,[],[45,5])). % 0.59/0.64 cnf(47,plain, % 0.59/0.64 (~P4(a2)+~P2(a4)+~P3(a3)), % 0.59/0.64 inference(scs_inference,[],[46,25])). % 0.59/0.64 cnf(48,plain, % 0.59/0.64 (P5(a2)+~P2(a4)+~P3(a3)), % 0.59/0.64 inference(scs_inference,[],[47,2])). % 0.59/0.64 cnf(49,plain, % 0.59/0.64 (~P2(a4)+~P3(a3)), % 0.59/0.64 inference(scs_inference,[],[48,46])). % 0.59/0.64 cnf(50,plain, % 0.59/0.64 (~P3(a3)), % 0.59/0.64 inference(scs_inference,[],[44,49,3])). % 0.59/0.64 cnf(51,plain, % 0.59/0.64 (~P2(a3)), % 0.59/0.64 inference(scs_inference,[],[50,4])). % 0.59/0.64 cnf(53,plain, % 0.59/0.64 (P5(a2)+~P4(a2)+~P2(a4)), % 0.59/0.64 inference(scs_inference,[],[51,22])). % 0.59/0.64 cnf(55,plain, % 0.59/0.64 (P4(a2)), % 0.59/0.64 inference(scs_inference,[],[51,35])). % 0.59/0.64 cnf(56,plain, % 0.59/0.64 (~P4(a2)+~P2(a4)), % 0.59/0.64 inference(scs_inference,[],[53,5])). % 0.59/0.64 cnf(58,plain, % 0.59/0.64 ($false), % 0.59/0.64 inference(scs_inference,[],[55,44,56,3]), % 0.59/0.64 ['proof']). % 0.59/0.64 % SZS output end Proof % 0.59/0.64 % Total time :0.040000s %------------------------------------------------------------------------------