%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : KRS074+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 : n014.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:24 EDT 2024 % Result : Unsatisfiable 0.50s 0.59s % Output : CNFRefutation 0.50s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : KRS074+1 : TPTP v8.2.0. Released v3.1.0. % 0.00/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.11/0.33 % Computer : n014.cluster.edu % 0.11/0.33 % Model : x86_64 x86_64 % 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.33 % Memory : 8042.1875MB % 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.33 % CPULimit : 300 % 0.11/0.33 % WCLimit : 300 % 0.11/0.33 % DateTime : Wed Jun 19 14:19:38 EDT 2024 % 0.11/0.33 % CPUTime : % 0.18/0.54 start to proof:theBenchmark % 0.48/0.58 %------------------------------------------- % 0.48/0.58 % File :CSE---1.7 % 0.48/0.58 % Problem :theBenchmark % 0.48/0.58 % Transform :cnf % 0.48/0.58 % Format :tptp:raw % 0.48/0.58 % Command :java -jar mcs_scs.jar %d %s % 0.48/0.58 % 0.48/0.58 % Result :Theorem 0.000000s % 0.48/0.58 % Output :CNFRefutation 0.000000s % 0.48/0.58 %------------------------------------------- % 0.48/0.58 %------------------------------------------------------------------------------ % 0.48/0.58 % File : KRS074+1 : TPTP v8.2.0. Released v3.1.0. % 0.48/0.58 % Domain : Knowledge Representation (Semantic Web) % 0.48/0.58 % Problem : DL Test: t10.3 % 0.48/0.58 % Version : Especial. % 0.48/0.58 % English : % 0.48/0.58 % 0.48/0.58 % Refs : [Bec03] Bechhofer (2003), Email to G. Sutcliffe % 0.48/0.58 % : [TR+04] Tsarkov et al. (2004), Using Vampire to Reason with OW % 0.48/0.58 % Source : [Bec03] % 0.48/0.58 % Names : inconsistent_description-logic-Manifest011 [Bec03] % 0.48/0.58 % 0.48/0.58 % Status : Unsatisfiable % 0.48/0.58 % Rating : 0.00 v3.1.0 % 0.48/0.58 % Syntax : Number of formulae : 30 ( 1 unt; 0 def) % 0.48/0.58 % Number of atoms : 85 ( 21 equ) % 0.48/0.58 % Maximal formula atoms : 7 ( 2 avg) % 0.48/0.58 % Number of connectives : 58 ( 3 ~; 0 |; 26 &) % 0.48/0.58 % ( 5 <=>; 24 =>; 0 <=; 0 <~>) % 0.48/0.58 % Maximal formula depth : 9 ( 5 avg) % 0.48/0.58 % Maximal term depth : 1 ( 1 avg) % 0.48/0.58 % Number of predicates : 13 ( 12 usr; 0 prp; 1-2 aty) % 0.48/0.58 % Number of functors : 1 ( 1 usr; 1 con; 0-0 aty) % 0.48/0.58 % Number of variables : 73 ( 71 !; 2 ?) % 0.48/0.58 % SPC : FOF_UNS_RFO_SEQ % 0.48/0.58 % 0.48/0.58 % Comments : Sean Bechhofer says there are some errors in the encoding of % 0.48/0.58 % datatypes, so this problem may not be perfect. At least it's % 0.48/0.58 % still representative of the type of reasoning required for OWL. % 0.48/0.58 %------------------------------------------------------------------------------ % 0.48/0.58 fof(cUnsatisfiable_substitution_1,axiom, % 0.48/0.58 ! [A,B] : % 0.48/0.58 ( ( A = B % 0.48/0.58 & cUnsatisfiable(A) ) % 0.48/0.58 => cUnsatisfiable(B) ) ). % 0.48/0.58 % 0.48/0.58 fof(cowlNothing_substitution_1,axiom, % 0.48/0.58 ! [A,B] : % 0.48/0.58 ( ( A = B % 0.48/0.58 & cowlNothing(A) ) % 0.48/0.58 => cowlNothing(B) ) ). % 0.48/0.58 % 0.48/0.58 fof(cowlThing_substitution_1,axiom, % 0.48/0.58 ! [A,B] : % 0.48/0.58 ( ( A = B % 0.48/0.58 & cowlThing(A) ) % 0.48/0.58 => cowlThing(B) ) ). % 0.48/0.58 % 0.48/0.58 fof(cp_substitution_1,axiom, % 0.48/0.58 ! [A,B] : % 0.48/0.58 ( ( A = B % 0.48/0.58 & cp(A) ) % 0.48/0.58 => cp(B) ) ). % 0.48/0.58 % 0.48/0.58 fof(rf_substitution_1,axiom, % 0.48/0.58 ! [A,B,C] : % 0.48/0.58 ( ( A = B % 0.48/0.58 & rf(A,C) ) % 0.48/0.58 => rf(B,C) ) ). % 0.48/0.58 % 0.48/0.58 fof(rf_substitution_2,axiom, % 0.48/0.58 ! [A,B,C] : % 0.48/0.58 ( ( A = B % 0.48/0.58 & rf(C,A) ) % 0.48/0.58 => rf(C,B) ) ). % 0.48/0.58 % 0.48/0.58 fof(rf1_substitution_1,axiom, % 0.48/0.58 ! [A,B,C] : % 0.48/0.58 ( ( A = B % 0.48/0.58 & rf1(A,C) ) % 0.48/0.58 => rf1(B,C) ) ). % 0.48/0.58 % 0.48/0.58 fof(rf1_substitution_2,axiom, % 0.48/0.58 ! [A,B,C] : % 0.48/0.58 ( ( A = B % 0.48/0.58 & rf1(C,A) ) % 0.48/0.58 => rf1(C,B) ) ). % 0.48/0.58 % 0.48/0.58 fof(rinvF_substitution_1,axiom, % 0.48/0.58 ! [A,B,C] : % 0.48/0.58 ( ( A = B % 0.48/0.58 & rinvF(A,C) ) % 0.48/0.58 => rinvF(B,C) ) ). % 0.50/0.58 % 0.50/0.58 fof(rinvF_substitution_2,axiom, % 0.50/0.58 ! [A,B,C] : % 0.50/0.58 ( ( A = B % 0.50/0.58 & rinvF(C,A) ) % 0.50/0.58 => rinvF(C,B) ) ). % 0.50/0.58 % 0.50/0.58 fof(rinvF1_substitution_1,axiom, % 0.50/0.58 ! [A,B,C] : % 0.50/0.58 ( ( A = B % 0.50/0.58 & rinvF1(A,C) ) % 0.50/0.58 => rinvF1(B,C) ) ). % 0.50/0.58 % 0.50/0.58 fof(rinvF1_substitution_2,axiom, % 0.50/0.58 ! [A,B,C] : % 0.50/0.58 ( ( A = B % 0.50/0.58 & rinvF1(C,A) ) % 0.50/0.58 => rinvF1(C,B) ) ). % 0.50/0.58 % 0.50/0.58 fof(rinvS_substitution_1,axiom, % 0.50/0.58 ! [A,B,C] : % 0.50/0.58 ( ( A = B % 0.50/0.58 & rinvS(A,C) ) % 0.50/0.58 => rinvS(B,C) ) ). % 0.50/0.58 % 0.50/0.58 fof(rinvS_substitution_2,axiom, % 0.50/0.58 ! [A,B,C] : % 0.50/0.58 ( ( A = B % 0.50/0.58 & rinvS(C,A) ) % 0.50/0.58 => rinvS(C,B) ) ). % 0.50/0.58 % 0.50/0.58 fof(rs_substitution_1,axiom, % 0.50/0.58 ! [A,B,C] : % 0.50/0.58 ( ( A = B % 0.50/0.58 & rs(A,C) ) % 0.50/0.58 => rs(B,C) ) ). % 0.50/0.58 % 0.50/0.58 fof(rs_substitution_2,axiom, % 0.50/0.58 ! [A,B,C] : % 0.50/0.58 ( ( A = B % 0.50/0.58 & rs(C,A) ) % 0.50/0.58 => rs(C,B) ) ). % 0.50/0.58 % 0.50/0.58 fof(xsd_integer_substitution_1,axiom, % 0.50/0.58 ! [A,B] : % 0.50/0.58 ( ( A = B % 0.50/0.58 & xsd_integer(A) ) % 0.50/0.58 => xsd_integer(B) ) ). % 0.50/0.58 % 0.50/0.58 fof(xsd_string_substitution_1,axiom, % 0.50/0.58 ! [A,B] : % 0.50/0.58 ( ( A = B % 0.50/0.58 & xsd_string(A) ) % 0.50/0.58 => xsd_string(B) ) ). % 0.50/0.58 % 0.50/0.58 %----Thing and Nothing % 0.50/0.58 fof(axiom_0,axiom, % 0.50/0.58 ! [X] : % 0.50/0.58 ( cowlThing(X) % 0.50/0.58 & ~ cowlNothing(X) ) ). % 0.50/0.58 % 0.50/0.58 %----String and Integer disjoint % 0.50/0.58 fof(axiom_1,axiom, % 0.50/0.58 ! [X] : % 0.50/0.58 ( xsd_string(X) % 0.50/0.58 <=> ~ xsd_integer(X) ) ). % 0.50/0.58 % 0.50/0.58 %----Equality cUnsatisfiable % 0.50/0.58 fof(axiom_2,axiom, % 0.50/0.58 ! [X] : % 0.50/0.59 ( cUnsatisfiable(X) % 0.50/0.59 <=> ( ? [Y] : % 0.50/0.59 ( rs(X,Y) % 0.50/0.59 & cp(Y) % 0.50/0.59 & ? [Z] : % 0.50/0.59 ( rinvS(Y,Z) % 0.50/0.59 & cp(Z) ) ) % 0.50/0.59 & ! [Y] : % 0.50/0.59 ( rs(X,Y) % 0.50/0.59 => ~ cp(Y) ) ) ) ). % 0.50/0.59 % 0.50/0.59 %----Functional: rf % 0.50/0.59 fof(axiom_3,axiom, % 0.50/0.59 ! [X,Y,Z] : % 0.50/0.59 ( ( rf(X,Y) % 0.50/0.59 & rf(X,Z) ) % 0.50/0.59 => Y = Z ) ). % 0.50/0.59 % 0.50/0.59 %----Functional: rf1 % 0.50/0.59 fof(axiom_4,axiom, % 0.50/0.59 ! [X,Y,Z] : % 0.50/0.59 ( ( rf1(X,Y) % 0.50/0.59 & rf1(X,Z) ) % 0.50/0.59 => Y = Z ) ). % 0.50/0.59 % 0.50/0.59 %----Inverse: rinvF % 0.50/0.59 fof(axiom_5,axiom, % 0.50/0.59 ! [X,Y] : % 0.50/0.59 ( rinvF(X,Y) % 0.50/0.59 <=> rf(Y,X) ) ). % 0.50/0.59 % 0.50/0.59 %----Inverse: rinvF1 % 0.50/0.59 fof(axiom_6,axiom, % 0.50/0.59 ! [X,Y] : % 0.50/0.59 ( rinvF1(X,Y) % 0.50/0.59 <=> rf1(Y,X) ) ). % 0.50/0.59 % 0.50/0.59 %----Inverse: rinvS % 0.50/0.59 fof(axiom_7,axiom, % 0.50/0.59 ! [X,Y] : % 0.50/0.59 ( rinvS(X,Y) % 0.50/0.59 <=> rs(Y,X) ) ). % 0.50/0.59 % 0.50/0.59 %----Functional: rs % 0.50/0.59 fof(axiom_8,axiom, % 0.50/0.59 ! [X,Y,Z] : % 0.50/0.59 ( ( rs(X,Y) % 0.50/0.59 & rs(X,Z) ) % 0.50/0.59 => Y = Z ) ). % 0.50/0.59 % 0.50/0.59 %----i2003_11_14_17_18_59896 % 0.50/0.59 fof(axiom_9,axiom, % 0.50/0.59 cUnsatisfiable(i2003_11_14_17_18_59896) ). % 0.50/0.59 % 0.50/0.59 fof(axiom_10,axiom, % 0.50/0.59 ! [X,Y] : % 0.50/0.59 ( rs(X,Y) % 0.50/0.59 => rf1(X,Y) ) ). % 0.50/0.59 % 0.50/0.59 fof(axiom_11,axiom, % 0.50/0.59 ! [X,Y] : % 0.50/0.59 ( rs(X,Y) % 0.50/0.59 => rf(X,Y) ) ). % 0.50/0.59 % 0.50/0.59 %------------------------------------------------------------------------------ % 0.50/0.59 %------------------------------------------- % 0.50/0.59 % Proof found % 0.50/0.59 % SZS status Theorem for theBenchmark % 0.50/0.59 % SZS output start Proof % 0.50/0.59 %ClaNum:45(EqnAxiom:23) % 0.50/0.59 %VarNum:86(SingletonVarNum:40) % 0.50/0.59 %MaxLitNum:6 % 0.50/0.59 %MaxfuncDepth:1 % 0.50/0.59 %SharedTerms:2 % 0.50/0.59 [24]P1(a1) % 0.50/0.59 [25]~P2(x251) % 0.50/0.59 [26]P11(x261)+P3(x261) % 0.50/0.59 [27]~P11(x271)+~P3(x271) % 0.50/0.59 [28]~P1(x281)+P4(f2(x281)) % 0.50/0.59 [29]~P1(x291)+P4(f3(x291)) % 0.50/0.59 [30]~P1(x301)+P5(x301,f2(x301)) % 0.50/0.59 [31]~P1(x311)+P6(f2(x311),f3(x311)) % 0.50/0.59 [33]~P8(x332,x331)+P7(x331,x332) % 0.50/0.59 [34]~P5(x341,x342)+P7(x341,x342) % 0.50/0.59 [35]~P10(x352,x351)+P9(x351,x352) % 0.50/0.59 [36]~P5(x361,x362)+P9(x361,x362) % 0.50/0.59 [37]~P7(x372,x371)+P8(x371,x372) % 0.50/0.59 [38]~P9(x382,x381)+P10(x381,x382) % 0.50/0.59 [39]~P5(x392,x391)+P6(x391,x392) % 0.50/0.59 [40]~P6(x402,x401)+P5(x401,x402) % 0.50/0.59 [32]~P5(x321,x322)+~P1(x321)+~P4(x322) % 0.50/0.59 [41]~P7(x413,x411)+E(x411,x412)+~P7(x413,x412) % 0.50/0.59 [42]~P9(x423,x421)+E(x421,x422)+~P9(x423,x422) % 0.50/0.59 [43]~P5(x433,x431)+E(x431,x432)+~P5(x433,x432) % 0.50/0.59 [44]~P6(x443,x442)+~P5(x441,x443)+P1(x441)+~P4(x442)+~P4(x443)+P4(f4(x441)) % 0.50/0.59 [45]~P6(x453,x452)+~P5(x451,x453)+P1(x451)+~P4(x452)+~P4(x453)+P5(x451,f4(x451)) % 0.50/0.59 %EqnAxiom % 0.50/0.59 [1]E(x11,x11) % 0.50/0.59 [2]E(x22,x21)+~E(x21,x22) % 0.50/0.59 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33) % 0.50/0.59 [4]~E(x41,x42)+E(f2(x41),f2(x42)) % 0.50/0.59 [5]~E(x51,x52)+E(f3(x51),f3(x52)) % 0.50/0.59 [6]~E(x61,x62)+E(f4(x61),f4(x62)) % 0.50/0.59 [7]~P1(x71)+P1(x72)+~E(x71,x72) % 0.50/0.59 [8]~P2(x81)+P2(x82)+~E(x81,x82) % 0.50/0.59 [9]~P3(x91)+P3(x92)+~E(x91,x92) % 0.50/0.59 [10]~P11(x101)+P11(x102)+~E(x101,x102) % 0.50/0.59 [11]P6(x112,x113)+~E(x111,x112)+~P6(x111,x113) % 0.50/0.59 [12]P6(x123,x122)+~E(x121,x122)+~P6(x123,x121) % 0.50/0.59 [13]~P4(x131)+P4(x132)+~E(x131,x132) % 0.50/0.59 [14]P5(x142,x143)+~E(x141,x142)+~P5(x141,x143) % 0.50/0.59 [15]P5(x153,x152)+~E(x151,x152)+~P5(x153,x151) % 0.50/0.59 [16]P9(x162,x163)+~E(x161,x162)+~P9(x161,x163) % 0.50/0.59 [17]P9(x173,x172)+~E(x171,x172)+~P9(x173,x171) % 0.50/0.59 [18]P7(x182,x183)+~E(x181,x182)+~P7(x181,x183) % 0.50/0.59 [19]P7(x193,x192)+~E(x191,x192)+~P7(x193,x191) % 0.50/0.59 [20]P8(x202,x203)+~E(x201,x202)+~P8(x201,x203) % 0.50/0.59 [21]P8(x213,x212)+~E(x211,x212)+~P8(x213,x211) % 0.50/0.59 [22]P10(x222,x223)+~E(x221,x222)+~P10(x221,x223) % 0.50/0.59 [23]P10(x233,x232)+~E(x231,x232)+~P10(x233,x231) % 0.50/0.59 % 0.50/0.59 %------------------------------------------- % 0.50/0.59 cnf(46,plain, % 0.50/0.59 (~P4(x461)+~P5(a1,x461)), % 0.50/0.59 inference(scs_inference,[],[24,32])). % 0.50/0.59 cnf(56,plain, % 0.50/0.59 (~P5(a1,f2(a1))), % 0.50/0.59 inference(scs_inference,[],[24,46,28])). % 0.50/0.59 cnf(57,plain, % 0.50/0.59 ($false), % 0.50/0.59 inference(scs_inference,[],[24,56,30]), % 0.50/0.59 ['proof']). % 0.50/0.59 % SZS output end Proof % 0.50/0.59 % Total time :0.000000s %------------------------------------------------------------------------------