%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : KRS115+1 : TPTP v8.2.0. Released v3.1.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % Computer : n011.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:33 EDT 2024 % Result : Unsatisfiable 0.47s 0.66s % Output : CNFRefutation 0.47s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.11 % Problem : KRS115+1 : TPTP v8.2.0. Released v3.1.0. % 0.08/0.11 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.10/0.31 % Computer : n011.cluster.edu % 0.10/0.31 % Model : x86_64 x86_64 % 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.31 % Memory : 8042.1875MB % 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64 % 0.10/0.31 % CPULimit : 300 % 0.10/0.31 % WCLimit : 300 % 0.10/0.31 % DateTime : Wed Jun 19 13:58:24 EDT 2024 % 0.16/0.32 % CPUTime : % 0.45/0.54 start to proof:theBenchmark % 0.47/0.65 %------------------------------------------- % 0.47/0.65 % File :CSE---1.7 % 0.47/0.65 % Problem :theBenchmark % 0.47/0.65 % Transform :cnf % 0.47/0.65 % Format :tptp:raw % 0.47/0.65 % Command :java -jar mcs_scs.jar %d %s % 0.47/0.65 % 0.47/0.65 % Result :Theorem 0.080000s % 0.47/0.65 % Output :CNFRefutation 0.080000s % 0.47/0.66 %------------------------------------------- % 0.47/0.66 %------------------------------------------------------------------------------ % 0.47/0.66 % File : KRS115+1 : TPTP v8.2.0. Released v3.1.0. % 0.47/0.66 % Domain : Knowledge Representation (Semantic Web) % 0.47/0.66 % Problem : DL Test: t2.2 % 0.47/0.66 % Version : Especial. % 0.47/0.66 % English : % 0.47/0.66 % 0.47/0.66 % Refs : [Bec03] Bechhofer (2003), Email to G. Sutcliffe % 0.47/0.66 % : [TR+04] Tsarkov et al. (2004), Using Vampire to Reason with OW % 0.47/0.66 % Source : [Bec03] % 0.47/0.66 % Names : inconsistent_description-logic-Manifest617 [Bec03] % 0.47/0.66 % 0.47/0.66 % Status : Unsatisfiable % 0.47/0.66 % Rating : 0.00 v3.1.0 % 0.47/0.66 % Syntax : Number of formulae : 27 ( 1 unt; 0 def) % 0.47/0.66 % Number of atoms : 78 ( 18 equ) % 0.47/0.66 % Maximal formula atoms : 7 ( 2 avg) % 0.47/0.66 % Number of connectives : 54 ( 3 ~; 0 |; 24 &) % 0.47/0.66 % ( 4 <=>; 23 =>; 0 <=; 0 <~>) % 0.47/0.66 % Maximal formula depth : 7 ( 5 avg) % 0.47/0.66 % Maximal term depth : 1 ( 1 avg) % 0.47/0.66 % Number of predicates : 13 ( 12 usr; 0 prp; 1-2 aty) % 0.47/0.66 % Number of functors : 1 ( 1 usr; 1 con; 0-0 aty) % 0.47/0.66 % Number of variables : 61 ( 56 !; 5 ?) % 0.47/0.66 % SPC : FOF_UNS_RFO_SEQ % 0.47/0.66 % 0.47/0.66 % Comments : Sean Bechhofer says there are some errors in the encoding of % 0.47/0.66 % datatypes, so this problem may not be perfect. At least it's % 0.47/0.66 % still representative of the type of reasoning required for OWL. % 0.47/0.66 %------------------------------------------------------------------------------ % 0.47/0.66 fof(cUnsatisfiable_substitution_1,axiom, % 0.47/0.66 ! [A,B] : % 0.47/0.66 ( ( A = B % 0.47/0.66 & cUnsatisfiable(A) ) % 0.47/0.66 => cUnsatisfiable(B) ) ). % 0.47/0.66 % 0.47/0.66 fof(cowlNothing_substitution_1,axiom, % 0.47/0.66 ! [A,B] : % 0.47/0.66 ( ( A = B % 0.47/0.66 & cowlNothing(A) ) % 0.47/0.66 => cowlNothing(B) ) ). % 0.47/0.66 % 0.47/0.66 fof(cowlThing_substitution_1,axiom, % 0.47/0.66 ! [A,B] : % 0.47/0.66 ( ( A = B % 0.47/0.66 & cowlThing(A) ) % 0.47/0.66 => cowlThing(B) ) ). % 0.47/0.66 % 0.47/0.66 fof(cp1_substitution_1,axiom, % 0.47/0.66 ! [A,B] : % 0.47/0.66 ( ( A = B % 0.47/0.66 & cp1(A) ) % 0.47/0.66 => cp1(B) ) ). % 0.47/0.66 % 0.47/0.66 fof(cp2_substitution_1,axiom, % 0.47/0.66 ! [A,B] : % 0.47/0.66 ( ( A = B % 0.47/0.66 & cp2(A) ) % 0.47/0.66 => cp2(B) ) ). % 0.47/0.66 % 0.47/0.66 fof(cp2xcomp_substitution_1,axiom, % 0.47/0.66 ! [A,B] : % 0.47/0.66 ( ( A = B % 0.47/0.66 & cp2xcomp(A) ) % 0.47/0.66 => cp2xcomp(B) ) ). % 0.47/0.66 % 0.47/0.66 fof(ra_Px1_substitution_1,axiom, % 0.47/0.66 ! [A,B,C] : % 0.47/0.66 ( ( A = B % 0.47/0.66 & ra_Px1(A,C) ) % 0.47/0.66 => ra_Px1(B,C) ) ). % 0.47/0.66 % 0.47/0.66 fof(ra_Px1_substitution_2,axiom, % 0.47/0.66 ! [A,B,C] : % 0.47/0.66 ( ( A = B % 0.47/0.66 & ra_Px1(C,A) ) % 0.47/0.66 => ra_Px1(C,B) ) ). % 0.47/0.66 % 0.47/0.66 fof(rf1_substitution_1,axiom, % 0.47/0.66 ! [A,B,C] : % 0.47/0.66 ( ( A = B % 0.47/0.66 & rf1(A,C) ) % 0.47/0.66 => rf1(B,C) ) ). % 0.47/0.66 % 0.47/0.66 fof(rf1_substitution_2,axiom, % 0.47/0.66 ! [A,B,C] : % 0.47/0.66 ( ( A = B % 0.47/0.66 & rf1(C,A) ) % 0.47/0.66 => rf1(C,B) ) ). % 0.47/0.66 % 0.47/0.66 fof(rf2_substitution_1,axiom, % 0.47/0.66 ! [A,B,C] : % 0.47/0.66 ( ( A = B % 0.47/0.66 & rf2(A,C) ) % 0.47/0.66 => rf2(B,C) ) ). % 0.47/0.66 % 0.47/0.66 fof(rf2_substitution_2,axiom, % 0.47/0.66 ! [A,B,C] : % 0.47/0.66 ( ( A = B % 0.47/0.66 & rf2(C,A) ) % 0.47/0.66 => rf2(C,B) ) ). % 0.47/0.66 % 0.47/0.66 fof(rr_substitution_1,axiom, % 0.47/0.66 ! [A,B,C] : % 0.47/0.66 ( ( A = B % 0.47/0.66 & rr(A,C) ) % 0.47/0.66 => rr(B,C) ) ). % 0.47/0.66 % 0.47/0.66 fof(rr_substitution_2,axiom, % 0.47/0.66 ! [A,B,C] : % 0.47/0.66 ( ( A = B % 0.47/0.66 & rr(C,A) ) % 0.47/0.66 => rr(C,B) ) ). % 0.47/0.66 % 0.47/0.66 fof(xsd_integer_substitution_1,axiom, % 0.47/0.66 ! [A,B] : % 0.47/0.66 ( ( A = B % 0.47/0.66 & xsd_integer(A) ) % 0.47/0.66 => xsd_integer(B) ) ). % 0.47/0.66 % 0.47/0.66 fof(xsd_string_substitution_1,axiom, % 0.47/0.66 ! [A,B] : % 0.47/0.66 ( ( A = B % 0.47/0.66 & xsd_string(A) ) % 0.47/0.66 => xsd_string(B) ) ). % 0.47/0.66 % 0.47/0.66 %----Thing and Nothing % 0.47/0.66 fof(axiom_0,axiom, % 0.47/0.66 ! [X] : % 0.47/0.66 ( cowlThing(X) % 0.47/0.66 & ~ cowlNothing(X) ) ). % 0.47/0.66 % 0.47/0.66 %----String and Integer disjoint % 0.47/0.66 fof(axiom_1,axiom, % 0.47/0.66 ! [X] : % 0.47/0.66 ( xsd_string(X) % 0.47/0.66 <=> ~ xsd_integer(X) ) ). % 0.47/0.66 % 0.47/0.66 %----Equality cUnsatisfiable % 0.47/0.66 fof(axiom_2,axiom, % 0.47/0.66 ! [X] : % 0.47/0.66 ( cUnsatisfiable(X) % 0.47/0.66 <=> ( ? [Y] : % 0.47/0.66 ( rf2(X,Y) % 0.47/0.66 & cp2(Y) ) % 0.47/0.66 & ? [Y] : % 0.47/0.66 ( rf1(X,Y) % 0.47/0.66 & cp1(Y) ) % 0.47/0.66 & ? [Y] : % 0.47/0.66 ( rr(X,Y) % 0.47/0.66 & cowlThing(Y) ) ) ) ). % 0.47/0.66 % 0.47/0.66 %----Super cp1 % 0.47/0.66 fof(axiom_3,axiom, % 0.47/0.66 ! [X] : % 0.47/0.66 ( cp1(X) % 0.47/0.66 => cp2xcomp(X) ) ). % 0.47/0.66 % 0.47/0.66 %----Equality cp2 % 0.47/0.66 fof(axiom_4,axiom, % 0.47/0.66 ! [X] : % 0.47/0.66 ( cp2(X) % 0.47/0.66 <=> ~ ? [Y] : ra_Px1(X,Y) ) ). % 0.47/0.66 % 0.47/0.66 %----Equality cp2xcomp % 0.47/0.66 fof(axiom_5,axiom, % 0.47/0.66 ! [X] : % 0.47/0.66 ( cp2xcomp(X) % 0.47/0.66 <=> ? [Y0] : ra_Px1(X,Y0) ) ). % 0.47/0.66 % 0.47/0.66 %----Super cowlThing % 0.47/0.66 fof(axiom_6,axiom, % 0.47/0.66 ! [X] : % 0.47/0.66 ( cowlThing(X) % 0.47/0.66 => ! [Y0,Y1] : % 0.47/0.66 ( ( rf1(X,Y0) % 0.47/0.66 & rf1(X,Y1) ) % 0.47/0.66 => Y0 = Y1 ) ) ). % 0.47/0.66 % 0.47/0.66 %----Super cowlThing % 0.47/0.66 fof(axiom_7,axiom, % 0.47/0.66 ! [X] : % 0.47/0.66 ( cowlThing(X) % 0.47/0.66 => ! [Y0,Y1] : % 0.47/0.66 ( ( rf2(X,Y0) % 0.47/0.66 & rf2(X,Y1) ) % 0.47/0.66 => Y0 = Y1 ) ) ). % 0.47/0.66 % 0.47/0.66 %----i2003_11_14_17_21_30578 % 0.47/0.66 fof(axiom_8,axiom, % 0.47/0.66 cUnsatisfiable(i2003_11_14_17_21_30578) ). % 0.47/0.66 % 0.47/0.66 fof(axiom_9,axiom, % 0.47/0.66 ! [X,Y] : % 0.47/0.66 ( rr(X,Y) % 0.47/0.66 => rf2(X,Y) ) ). % 0.47/0.66 % 0.47/0.66 fof(axiom_10,axiom, % 0.47/0.66 ! [X,Y] : % 0.47/0.66 ( rr(X,Y) % 0.47/0.66 => rf1(X,Y) ) ). % 0.47/0.66 % 0.47/0.66 %------------------------------------------------------------------------------ % 0.47/0.66 %------------------------------------------- % 0.47/0.66 % Proof found % 0.47/0.66 % SZS status Theorem for theBenchmark % 0.47/0.66 % SZS output start Proof % 0.47/0.66 %ClaNum:42(EqnAxiom:23) % 0.47/0.66 %VarNum:61(SingletonVarNum:29) % 0.47/0.66 %MaxLitNum:6 % 0.47/0.67 %MaxfuncDepth:1 % 0.47/0.67 %SharedTerms:2 % 0.47/0.67 [24]P1(a1) % 0.47/0.67 [25]~P2(x251) % 0.47/0.67 [26]P11(x261)+P3(x261) % 0.47/0.67 [27]~P5(x271)+P4(x271) % 0.47/0.67 [28]~P11(x281)+~P3(x281) % 0.47/0.67 [29]~P1(x291)+P5(f2(x291)) % 0.47/0.67 [30]~P1(x301)+P6(f3(x301)) % 0.47/0.67 [31]P6(x311)+P7(x311,f4(x311)) % 0.47/0.67 [33]~P4(x331)+P7(x331,f6(x331)) % 0.47/0.67 [34]~P1(x341)+P8(x341,f2(x341)) % 0.47/0.67 [35]~P1(x351)+P9(x351,f3(x351)) % 0.47/0.67 [36]~P1(x361)+P10(x361,f5(x361)) % 0.47/0.67 [32]P4(x321)+~P7(x321,x322) % 0.47/0.67 [37]~P6(x371)+~P7(x371,x372) % 0.47/0.67 [38]~P10(x381,x382)+P8(x381,x382) % 0.47/0.67 [39]~P10(x391,x392)+P9(x391,x392) % 0.47/0.67 [40]~P8(x403,x401)+E(x401,x402)+~P8(x403,x402) % 0.47/0.67 [41]~P9(x413,x411)+E(x411,x412)+~P9(x413,x412) % 0.47/0.67 [42]~P8(x421,x422)+~P9(x421,x423)+P1(x421)+~P5(x422)+~P10(x421,x424)+~P6(x423) % 0.47/0.67 %EqnAxiom % 0.47/0.67 [1]E(x11,x11) % 0.47/0.67 [2]E(x22,x21)+~E(x21,x22) % 0.47/0.67 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33) % 0.47/0.67 [4]~E(x41,x42)+E(f2(x41),f2(x42)) % 0.47/0.67 [5]~E(x51,x52)+E(f3(x51),f3(x52)) % 0.47/0.67 [6]~E(x61,x62)+E(f4(x61),f4(x62)) % 0.47/0.67 [7]~E(x71,x72)+E(f6(x71),f6(x72)) % 0.47/0.67 [8]~E(x81,x82)+E(f5(x81),f5(x82)) % 0.47/0.67 [9]~P1(x91)+P1(x92)+~E(x91,x92) % 0.47/0.67 [10]~P2(x101)+P2(x102)+~E(x101,x102) % 0.47/0.67 [11]~P3(x111)+P3(x112)+~E(x111,x112) % 0.47/0.67 [12]~P11(x121)+P11(x122)+~E(x121,x122) % 0.47/0.67 [13]~P4(x131)+P4(x132)+~E(x131,x132) % 0.47/0.67 [14]~P5(x141)+P5(x142)+~E(x141,x142) % 0.47/0.67 [15]P9(x152,x153)+~E(x151,x152)+~P9(x151,x153) % 0.47/0.67 [16]P9(x163,x162)+~E(x161,x162)+~P9(x163,x161) % 0.47/0.67 [17]P10(x172,x173)+~E(x171,x172)+~P10(x171,x173) % 0.47/0.67 [18]P10(x183,x182)+~E(x181,x182)+~P10(x183,x181) % 0.47/0.67 [19]~P6(x191)+P6(x192)+~E(x191,x192) % 0.47/0.67 [20]P7(x202,x203)+~E(x201,x202)+~P7(x201,x203) % 0.47/0.67 [21]P7(x213,x212)+~E(x211,x212)+~P7(x213,x211) % 0.47/0.67 [22]P8(x222,x223)+~E(x221,x222)+~P8(x221,x223) % 0.47/0.67 [23]P8(x233,x232)+~E(x231,x232)+~P8(x233,x231) % 0.47/0.67 % 0.47/0.67 %------------------------------------------- % 0.47/0.67 cnf(44,plain, % 0.47/0.67 (~P5(x441)+P7(x441,f6(x441))), % 0.47/0.67 inference(scs_inference,[],[27,33])). % 0.47/0.67 cnf(45,plain, % 0.47/0.67 (~E(a1,x451)+P5(f2(x451))), % 0.47/0.67 inference(scs_inference,[],[24,29,9])). % 0.47/0.67 cnf(46,plain, % 0.47/0.67 (P5(f2(a1))), % 0.47/0.67 inference(equality_inference,[],[45])). % 0.47/0.67 cnf(47,plain, % 0.47/0.67 (~E(a1,x471)+P6(f3(x471))), % 0.47/0.67 inference(scs_inference,[],[24,30,9])). % 0.47/0.67 cnf(48,plain, % 0.47/0.67 (P6(f3(a1))), % 0.47/0.67 inference(equality_inference,[],[47])). % 0.47/0.67 cnf(49,plain, % 0.47/0.67 (~P7(f3(a1),x491)), % 0.47/0.67 inference(scs_inference,[],[48,37])). % 0.47/0.67 cnf(53,plain, % 0.47/0.67 (~P4(f3(a1))), % 0.47/0.67 inference(scs_inference,[],[48,37,44,33])). % 0.47/0.67 cnf(59,plain, % 0.47/0.67 (~E(f3(a1),x591)+P6(x591)), % 0.47/0.67 inference(scs_inference,[],[49,31,19])). % 0.47/0.67 cnf(61,plain, % 0.47/0.67 (~E(a1,x611)+P8(x611,f2(x611))), % 0.47/0.67 inference(scs_inference,[],[24,34,9])). % 0.47/0.67 cnf(62,plain, % 0.47/0.67 (P8(a1,f2(a1))), % 0.47/0.67 inference(equality_inference,[],[61])). % 0.47/0.67 cnf(67,plain, % 0.47/0.67 (~E(a1,x671)+P9(x671,f3(x671))), % 0.47/0.67 inference(scs_inference,[],[24,35,9])). % 0.47/0.67 cnf(68,plain, % 0.47/0.67 (P9(a1,f3(a1))), % 0.47/0.67 inference(equality_inference,[],[67])). % 0.47/0.67 cnf(73,plain, % 0.47/0.67 (~E(a1,x731)+P10(x731,f5(x731))), % 0.47/0.67 inference(scs_inference,[],[24,36,9])). % 0.47/0.67 cnf(74,plain, % 0.47/0.67 (P10(a1,f5(a1))), % 0.47/0.67 inference(equality_inference,[],[73])). % 0.47/0.67 cnf(79,plain, % 0.47/0.67 (P8(x791,f5(a1))+~E(a1,x791)), % 0.47/0.67 inference(scs_inference,[],[74,38,22])). % 0.47/0.67 cnf(80,plain, % 0.47/0.67 (P8(a1,f5(a1))), % 0.47/0.67 inference(equality_inference,[],[79])). % 0.47/0.67 cnf(82,plain, % 0.47/0.67 (E(f2(a1),x821)+~E(f5(a1),x821)), % 0.47/0.67 inference(scs_inference,[],[62,80,23,40])). % 0.47/0.67 cnf(84,plain, % 0.47/0.67 (~P4(f2(a1))+~E(f5(a1),f3(a1))), % 0.47/0.67 inference(scs_inference,[],[53,62,80,23,40,9,11,12,13])). % 0.47/0.67 cnf(87,plain, % 0.47/0.67 (E(f2(a1),f5(a1))), % 0.47/0.67 inference(equality_inference,[],[82])). % 0.47/0.67 cnf(88,plain, % 0.47/0.67 (P9(x881,f5(a1))+~E(a1,x881)), % 0.47/0.67 inference(scs_inference,[],[74,39,15])). % 0.47/0.67 cnf(89,plain, % 0.47/0.67 (P9(a1,f5(a1))), % 0.47/0.67 inference(equality_inference,[],[88])). % 0.47/0.67 cnf(90,plain, % 0.47/0.67 (E(f5(a1),f2(a1))), % 0.47/0.67 inference(scs_inference,[],[87,2])). % 0.47/0.67 cnf(92,plain, % 0.47/0.67 (P9(a1,f2(a1))), % 0.47/0.67 inference(scs_inference,[],[87,89,46,2,14,16])). % 0.47/0.67 cnf(94,plain, % 0.47/0.67 (~P6(f2(a1))+P6(f5(a1))), % 0.47/0.67 inference(scs_inference,[],[74,87,89,46,2,14,16,18,19])). % 0.47/0.67 cnf(95,plain, % 0.47/0.67 (~P4(f2(a1))+P4(f5(a1))), % 0.47/0.67 inference(scs_inference,[],[74,87,89,46,2,14,16,18,19,13])). % 0.47/0.67 cnf(107,plain, % 0.47/0.67 (~P4(f5(a1))+P4(f2(a1))), % 0.47/0.67 inference(scs_inference,[],[90,13])). % 0.47/0.67 cnf(117,plain, % 0.47/0.67 (~E(f3(a1),f2(a1))+P6(f5(a1))), % 0.47/0.67 inference(scs_inference,[],[94,59])). % 0.47/0.67 cnf(118,plain, % 0.47/0.67 (P4(f5(a1))), % 0.47/0.67 inference(scs_inference,[],[46,95,27])). % 0.47/0.67 cnf(119,plain, % 0.47/0.67 (P4(f2(a1))), % 0.47/0.67 inference(scs_inference,[],[118,107])). % 0.47/0.67 cnf(120,plain, % 0.47/0.67 (~E(f5(a1),f3(a1))), % 0.47/0.67 inference(scs_inference,[],[119,84])). % 0.47/0.67 cnf(132,plain, % 0.47/0.67 (P6(f5(a1))), % 0.47/0.67 inference(scs_inference,[],[92,68,117,41])). % 0.47/0.67 cnf(136,plain, % 0.47/0.67 ($false), % 0.47/0.67 inference(scs_inference,[],[68,89,120,132,37,41]), % 0.47/0.67 ['proof']). % 0.47/0.67 % SZS output end Proof % 0.47/0.67 % Total time :0.080000s %------------------------------------------------------------------------------