%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : KRS110+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 : n017.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:32 EDT 2024 % Result : Unsatisfiable 0.50s 0.60s % Output : CNFRefutation 0.50s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : KRS110+1 : TPTP v8.2.0. Released v3.1.0. % 0.03/0.11 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.11/0.32 % Computer : n017.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 12:16:53 EDT 2024 % 0.11/0.32 % CPUTime : % 0.18/0.54 start to proof:theBenchmark % 0.50/0.59 %------------------------------------------- % 0.50/0.59 % File :CSE---1.7 % 0.50/0.59 % Problem :theBenchmark % 0.50/0.59 % Transform :cnf % 0.50/0.59 % Format :tptp:raw % 0.50/0.59 % Command :java -jar mcs_scs.jar %d %s % 0.50/0.59 % 0.50/0.59 % Result :Theorem 0.000000s % 0.50/0.59 % Output :CNFRefutation 0.000000s % 0.50/0.59 %------------------------------------------- % 0.50/0.59 %------------------------------------------------------------------------------ % 0.50/0.59 % File : KRS110+1 : TPTP v8.2.0. Released v3.1.0. % 0.50/0.59 % Domain : Knowledge Representation (Semantic Web) % 0.50/0.59 % Problem : DL Test: t10.3 % 0.50/0.59 % Version : Especial. % 0.50/0.59 % English : % 0.50/0.59 % 0.50/0.59 % Refs : [Bec03] Bechhofer (2003), Email to G. Sutcliffe % 0.50/0.59 % : [TR+04] Tsarkov et al. (2004), Using Vampire to Reason with OW % 0.50/0.59 % Source : [Bec03] % 0.50/0.59 % Names : inconsistent_description-logic-Manifest611 [Bec03] % 0.50/0.59 % 0.50/0.59 % Status : Unsatisfiable % 0.50/0.59 % Rating : 0.00 v5.2.0, 0.33 v5.1.0, 0.00 v3.1.0 % 0.50/0.59 % Syntax : Number of formulae : 37 ( 1 unt; 0 def) % 0.50/0.59 % Number of atoms : 103 ( 25 equ) % 0.50/0.59 % Maximal formula atoms : 5 ( 2 avg) % 0.50/0.59 % Number of connectives : 69 ( 3 ~; 0 |; 30 &) % 0.50/0.59 % ( 8 <=>; 28 =>; 0 <=; 0 <~>) % 0.50/0.59 % Maximal formula depth : 6 ( 5 avg) % 0.50/0.59 % Maximal term depth : 1 ( 1 avg) % 0.50/0.59 % Number of predicates : 16 ( 15 usr; 0 prp; 1-2 aty) % 0.50/0.59 % Number of functors : 1 ( 1 usr; 1 con; 0-0 aty) % 0.50/0.59 % Number of variables : 88 ( 84 !; 4 ?) % 0.50/0.59 % SPC : FOF_UNS_RFO_SEQ % 0.50/0.59 % 0.50/0.59 % Comments : Sean Bechhofer says there are some errors in the encoding of % 0.50/0.59 % datatypes, so this problem may not be perfect. At least it's % 0.50/0.59 % still representative of the type of reasoning required for OWL. % 0.50/0.59 %------------------------------------------------------------------------------ % 0.50/0.59 fof(cUnsatisfiable_substitution_1,axiom, % 0.50/0.59 ! [A,B] : % 0.50/0.59 ( ( A = B % 0.50/0.59 & cUnsatisfiable(A) ) % 0.50/0.59 => cUnsatisfiable(B) ) ). % 0.50/0.59 % 0.50/0.59 fof(ca_Ax2_substitution_1,axiom, % 0.50/0.59 ! [A,B] : % 0.50/0.59 ( ( A = B % 0.50/0.59 & ca_Ax2(A) ) % 0.50/0.59 => ca_Ax2(B) ) ). % 0.50/0.59 % 0.50/0.59 fof(cowlNothing_substitution_1,axiom, % 0.50/0.59 ! [A,B] : % 0.50/0.59 ( ( A = B % 0.50/0.59 & cowlNothing(A) ) % 0.50/0.59 => cowlNothing(B) ) ). % 0.50/0.59 % 0.50/0.59 fof(cowlThing_substitution_1,axiom, % 0.50/0.59 ! [A,B] : % 0.50/0.59 ( ( A = B % 0.50/0.59 & cowlThing(A) ) % 0.50/0.59 => cowlThing(B) ) ). % 0.50/0.59 % 0.50/0.59 fof(cp_substitution_1,axiom, % 0.50/0.59 ! [A,B] : % 0.50/0.59 ( ( A = B % 0.50/0.59 & cp(A) ) % 0.50/0.59 => cp(B) ) ). % 0.50/0.59 % 0.50/0.59 fof(cpxcomp_substitution_1,axiom, % 0.50/0.59 ! [A,B] : % 0.50/0.59 ( ( A = B % 0.50/0.59 & cpxcomp(A) ) % 0.50/0.59 => cpxcomp(B) ) ). % 0.50/0.59 % 0.50/0.59 fof(ra_Px1_substitution_1,axiom, % 0.50/0.59 ! [A,B,C] : % 0.50/0.59 ( ( A = B % 0.50/0.59 & ra_Px1(A,C) ) % 0.50/0.59 => ra_Px1(B,C) ) ). % 0.50/0.59 % 0.50/0.59 fof(ra_Px1_substitution_2,axiom, % 0.50/0.60 ! [A,B,C] : % 0.50/0.60 ( ( A = B % 0.50/0.60 & ra_Px1(C,A) ) % 0.50/0.60 => ra_Px1(C,B) ) ). % 0.50/0.60 % 0.50/0.60 fof(rf_substitution_1,axiom, % 0.50/0.60 ! [A,B,C] : % 0.50/0.60 ( ( A = B % 0.50/0.60 & rf(A,C) ) % 0.50/0.60 => rf(B,C) ) ). % 0.50/0.60 % 0.50/0.60 fof(rf_substitution_2,axiom, % 0.50/0.60 ! [A,B,C] : % 0.50/0.60 ( ( A = B % 0.50/0.60 & rf(C,A) ) % 0.50/0.60 => rf(C,B) ) ). % 0.50/0.60 % 0.50/0.60 fof(rf1_substitution_1,axiom, % 0.50/0.60 ! [A,B,C] : % 0.50/0.60 ( ( A = B % 0.50/0.60 & rf1(A,C) ) % 0.50/0.60 => rf1(B,C) ) ). % 0.50/0.60 % 0.50/0.60 fof(rf1_substitution_2,axiom, % 0.50/0.60 ! [A,B,C] : % 0.50/0.60 ( ( A = B % 0.50/0.60 & rf1(C,A) ) % 0.50/0.60 => rf1(C,B) ) ). % 0.50/0.60 % 0.50/0.60 fof(rinvF_substitution_1,axiom, % 0.50/0.60 ! [A,B,C] : % 0.50/0.60 ( ( A = B % 0.50/0.60 & rinvF(A,C) ) % 0.50/0.60 => rinvF(B,C) ) ). % 0.50/0.60 % 0.50/0.60 fof(rinvF_substitution_2,axiom, % 0.50/0.60 ! [A,B,C] : % 0.50/0.60 ( ( A = B % 0.50/0.60 & rinvF(C,A) ) % 0.50/0.60 => rinvF(C,B) ) ). % 0.50/0.60 % 0.50/0.60 fof(rinvF1_substitution_1,axiom, % 0.50/0.60 ! [A,B,C] : % 0.50/0.60 ( ( A = B % 0.50/0.60 & rinvF1(A,C) ) % 0.50/0.60 => rinvF1(B,C) ) ). % 0.50/0.60 % 0.50/0.60 fof(rinvF1_substitution_2,axiom, % 0.50/0.60 ! [A,B,C] : % 0.50/0.60 ( ( A = B % 0.50/0.60 & rinvF1(C,A) ) % 0.50/0.60 => rinvF1(C,B) ) ). % 0.50/0.60 % 0.50/0.60 fof(rinvS_substitution_1,axiom, % 0.50/0.60 ! [A,B,C] : % 0.50/0.60 ( ( A = B % 0.50/0.60 & rinvS(A,C) ) % 0.50/0.60 => rinvS(B,C) ) ). % 0.50/0.60 % 0.50/0.60 fof(rinvS_substitution_2,axiom, % 0.50/0.60 ! [A,B,C] : % 0.50/0.60 ( ( A = B % 0.50/0.60 & rinvS(C,A) ) % 0.50/0.60 => rinvS(C,B) ) ). % 0.50/0.60 % 0.50/0.60 fof(rs_substitution_1,axiom, % 0.50/0.60 ! [A,B,C] : % 0.50/0.60 ( ( A = B % 0.50/0.60 & rs(A,C) ) % 0.50/0.60 => rs(B,C) ) ). % 0.50/0.60 % 0.50/0.60 fof(rs_substitution_2,axiom, % 0.50/0.60 ! [A,B,C] : % 0.50/0.60 ( ( A = B % 0.50/0.60 & rs(C,A) ) % 0.50/0.60 => rs(C,B) ) ). % 0.50/0.60 % 0.50/0.60 fof(xsd_integer_substitution_1,axiom, % 0.50/0.60 ! [A,B] : % 0.50/0.60 ( ( A = B % 0.50/0.60 & xsd_integer(A) ) % 0.50/0.60 => xsd_integer(B) ) ). % 0.50/0.60 % 0.50/0.60 fof(xsd_string_substitution_1,axiom, % 0.50/0.60 ! [A,B] : % 0.50/0.60 ( ( A = B % 0.50/0.60 & xsd_string(A) ) % 0.50/0.60 => xsd_string(B) ) ). % 0.50/0.60 % 0.50/0.60 %----Thing and Nothing % 0.50/0.60 fof(axiom_0,axiom, % 0.50/0.60 ! [X] : % 0.50/0.60 ( cowlThing(X) % 0.50/0.60 & ~ cowlNothing(X) ) ). % 0.50/0.60 % 0.50/0.60 %----String and Integer disjoint % 0.50/0.60 fof(axiom_1,axiom, % 0.50/0.60 ! [X] : % 0.50/0.60 ( xsd_string(X) % 0.50/0.60 <=> ~ xsd_integer(X) ) ). % 0.50/0.60 % 0.50/0.60 %----Equality cUnsatisfiable % 0.50/0.60 fof(axiom_2,axiom, % 0.50/0.60 ! [X] : % 0.50/0.60 ( cUnsatisfiable(X) % 0.50/0.60 <=> ( ? [Y] : % 0.50/0.60 ( rs(X,Y) % 0.50/0.60 & ca_Ax2(Y) ) % 0.50/0.60 & ! [Y] : % 0.50/0.60 ( rs(X,Y) % 0.50/0.60 => cpxcomp(Y) ) ) ) ). % 0.50/0.60 % 0.50/0.60 %----Equality cp % 0.50/0.60 fof(axiom_3,axiom, % 0.50/0.60 ! [X] : % 0.50/0.60 ( cp(X) % 0.50/0.60 <=> ~ ? [Y] : ra_Px1(X,Y) ) ). % 0.50/0.60 % 0.50/0.60 %----Equality cpxcomp % 0.50/0.60 fof(axiom_4,axiom, % 0.50/0.60 ! [X] : % 0.50/0.60 ( cpxcomp(X) % 0.50/0.60 <=> ? [Y0] : ra_Px1(X,Y0) ) ). % 0.50/0.60 % 0.50/0.60 %----Equality ca_Ax2 % 0.50/0.60 fof(axiom_5,axiom, % 0.50/0.60 ! [X] : % 0.50/0.60 ( ca_Ax2(X) % 0.50/0.60 <=> ( cp(X) % 0.50/0.60 & ? [Y] : % 0.50/0.60 ( rinvS(X,Y) % 0.50/0.60 & cp(Y) ) ) ) ). % 0.50/0.60 % 0.50/0.60 %----Functional: rf % 0.50/0.60 fof(axiom_6,axiom, % 0.50/0.60 ! [X,Y,Z] : % 0.50/0.60 ( ( rf(X,Y) % 0.50/0.60 & rf(X,Z) ) % 0.50/0.60 => Y = Z ) ). % 0.50/0.60 % 0.50/0.60 %----Functional: rf1 % 0.50/0.60 fof(axiom_7,axiom, % 0.50/0.60 ! [X,Y,Z] : % 0.50/0.60 ( ( rf1(X,Y) % 0.50/0.60 & rf1(X,Z) ) % 0.50/0.60 => Y = Z ) ). % 0.50/0.60 % 0.50/0.60 %----Inverse: rinvF % 0.50/0.60 fof(axiom_8,axiom, % 0.50/0.60 ! [X,Y] : % 0.50/0.60 ( rinvF(X,Y) % 0.50/0.60 <=> rf(Y,X) ) ). % 0.50/0.60 % 0.50/0.60 %----Inverse: rinvF1 % 0.50/0.60 fof(axiom_9,axiom, % 0.50/0.60 ! [X,Y] : % 0.50/0.60 ( rinvF1(X,Y) % 0.50/0.60 <=> rf1(Y,X) ) ). % 0.50/0.60 % 0.50/0.60 %----Inverse: rinvS % 0.50/0.60 fof(axiom_10,axiom, % 0.50/0.60 ! [X,Y] : % 0.50/0.60 ( rinvS(X,Y) % 0.50/0.60 <=> rs(Y,X) ) ). % 0.50/0.60 % 0.50/0.60 %----Functional: rs % 0.50/0.60 fof(axiom_11,axiom, % 0.50/0.60 ! [X,Y,Z] : % 0.50/0.60 ( ( rs(X,Y) % 0.50/0.60 & rs(X,Z) ) % 0.50/0.60 => Y = Z ) ). % 0.50/0.60 % 0.50/0.60 %----i2003_11_14_17_21_12565 % 0.50/0.60 fof(axiom_12,axiom, % 0.50/0.60 cUnsatisfiable(i2003_11_14_17_21_12565) ). % 0.50/0.60 % 0.50/0.60 fof(axiom_13,axiom, % 0.50/0.60 ! [X,Y] : % 0.50/0.60 ( rs(X,Y) % 0.50/0.60 => rf(X,Y) ) ). % 0.50/0.60 % 0.50/0.60 fof(axiom_14,axiom, % 0.50/0.60 ! [X,Y] : % 0.50/0.60 ( rs(X,Y) % 0.50/0.60 => rf1(X,Y) ) ). % 0.50/0.60 % 0.50/0.60 %------------------------------------------------------------------------------ % 0.50/0.60 %------------------------------------------- % 0.50/0.60 % Proof found % 0.50/0.60 % SZS status Theorem for theBenchmark % 0.50/0.60 % SZS output start Proof % 0.50/0.60 %ClaNum:57(EqnAxiom:29) % 0.50/0.60 %VarNum:99(SingletonVarNum:47) % 0.50/0.60 %MaxLitNum:4 % 0.50/0.60 %MaxfuncDepth:1 % 0.50/0.60 %SharedTerms:2 % 0.50/0.60 [30]P1(a1) % 0.50/0.60 [31]~P2(x311) % 0.50/0.60 [32]P14(x321)+P4(x321) % 0.50/0.60 [33]~P3(x331)+P5(x331) % 0.50/0.60 [34]~P14(x341)+~P4(x341) % 0.50/0.60 [35]~P1(x351)+P3(f2(x351)) % 0.50/0.60 [36]~P3(x361)+P5(f3(x361)) % 0.50/0.60 [37]P5(x371)+P6(x371,f4(x371)) % 0.50/0.60 [39]~P7(x391)+P6(x391,f6(x391)) % 0.50/0.60 [40]~P3(x401)+P8(x401,f3(x401)) % 0.50/0.60 [41]~P1(x411)+P13(x411,f2(x411)) % 0.50/0.60 [38]P7(x381)+~P6(x381,x382) % 0.50/0.60 [42]~P5(x421)+~P6(x421,x422) % 0.50/0.60 [44]~P10(x442,x441)+P9(x441,x442) % 0.50/0.60 [45]~P13(x451,x452)+P9(x451,x452) % 0.50/0.60 [46]~P12(x462,x461)+P11(x461,x462) % 0.50/0.60 [47]~P13(x471,x472)+P11(x471,x472) % 0.50/0.60 [48]~P9(x482,x481)+P10(x481,x482) % 0.50/0.60 [49]~P11(x492,x491)+P12(x491,x492) % 0.50/0.60 [50]~P13(x502,x501)+P8(x501,x502) % 0.50/0.60 [51]~P8(x512,x511)+P13(x511,x512) % 0.50/0.60 [43]~P13(x432,x431)+P7(x431)+~P1(x432) % 0.50/0.60 [53]~P9(x533,x531)+E(x531,x532)+~P9(x533,x532) % 0.50/0.60 [54]~P11(x543,x541)+E(x541,x542)+~P11(x543,x542) % 0.50/0.60 [55]~P13(x553,x551)+E(x551,x552)+~P13(x553,x552) % 0.50/0.60 [52]~P5(x521)+~P8(x521,x522)+P3(x521)+~P5(x522) % 0.50/0.60 [56]~P13(x561,x562)+P1(x561)+~P3(x562)+~P7(f5(x561)) % 0.50/0.60 [57]~P13(x571,x572)+P1(x571)+~P3(x572)+P13(x571,f5(x571)) % 0.50/0.60 %EqnAxiom % 0.50/0.60 [1]E(x11,x11) % 0.50/0.60 [2]E(x22,x21)+~E(x21,x22) % 0.50/0.60 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33) % 0.50/0.60 [4]~E(x41,x42)+E(f2(x41),f2(x42)) % 0.50/0.60 [5]~E(x51,x52)+E(f3(x51),f3(x52)) % 0.50/0.60 [6]~E(x61,x62)+E(f4(x61),f4(x62)) % 0.50/0.60 [7]~E(x71,x72)+E(f6(x71),f6(x72)) % 0.50/0.60 [8]~E(x81,x82)+E(f5(x81),f5(x82)) % 0.50/0.60 [9]~P1(x91)+P1(x92)+~E(x91,x92) % 0.50/0.60 [10]~P2(x101)+P2(x102)+~E(x101,x102) % 0.50/0.60 [11]~P4(x111)+P4(x112)+~E(x111,x112) % 0.50/0.60 [12]~P14(x121)+P14(x122)+~E(x121,x122) % 0.50/0.60 [13]~P5(x131)+P5(x132)+~E(x131,x132) % 0.50/0.60 [14]~P3(x141)+P3(x142)+~E(x141,x142) % 0.50/0.60 [15]P13(x152,x153)+~E(x151,x152)+~P13(x151,x153) % 0.50/0.60 [16]P13(x163,x162)+~E(x161,x162)+~P13(x163,x161) % 0.50/0.60 [17]P9(x172,x173)+~E(x171,x172)+~P9(x171,x173) % 0.50/0.60 [18]P9(x183,x182)+~E(x181,x182)+~P9(x183,x181) % 0.50/0.60 [19]P12(x192,x193)+~E(x191,x192)+~P12(x191,x193) % 0.50/0.60 [20]P12(x203,x202)+~E(x201,x202)+~P12(x203,x201) % 0.50/0.60 [21]P8(x212,x213)+~E(x211,x212)+~P8(x211,x213) % 0.50/0.60 [22]P8(x223,x222)+~E(x221,x222)+~P8(x223,x221) % 0.50/0.60 [23]~P7(x231)+P7(x232)+~E(x231,x232) % 0.50/0.60 [24]P11(x242,x243)+~E(x241,x242)+~P11(x241,x243) % 0.50/0.60 [25]P11(x253,x252)+~E(x251,x252)+~P11(x253,x251) % 0.50/0.60 [26]P10(x262,x263)+~E(x261,x262)+~P10(x261,x263) % 0.50/0.60 [27]P10(x273,x272)+~E(x271,x272)+~P10(x273,x271) % 0.50/0.60 [28]P6(x282,x283)+~E(x281,x282)+~P6(x281,x283) % 0.50/0.60 [29]P6(x293,x292)+~E(x291,x292)+~P6(x293,x291) % 0.50/0.60 % 0.50/0.60 %------------------------------------------- % 0.50/0.60 cnf(59,plain, % 0.50/0.60 (~P3(x591)+~P6(x591,x592)), % 0.50/0.60 inference(scs_inference,[],[33,42])). % 0.50/0.60 cnf(60,plain, % 0.50/0.60 (~E(a1,x601)+P3(f2(x601))), % 0.50/0.60 inference(scs_inference,[],[30,35,9])). % 0.50/0.60 cnf(61,plain, % 0.50/0.60 (P3(f2(a1))), % 0.50/0.60 inference(equality_inference,[],[60])). % 0.50/0.60 cnf(62,plain, % 0.50/0.60 (~P6(f2(a1),x621)), % 0.50/0.60 inference(scs_inference,[],[61,59])). % 0.50/0.60 cnf(66,plain, % 0.50/0.60 (P5(f3(f2(a1)))), % 0.50/0.60 inference(scs_inference,[],[30,36,35])). % 0.50/0.60 cnf(74,plain, % 0.50/0.60 ($false), % 0.50/0.60 inference(scs_inference,[],[30,62,66,39,42,43,41]), % 0.50/0.60 ['proof']). % 0.50/0.60 % SZS output end Proof % 0.50/0.60 % Total time :0.000000s %------------------------------------------------------------------------------