%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : KRS086+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 : n008.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:26 EDT 2024 % Result : Unsatisfiable 0.50s 0.73s % Output : CNFRefutation 0.66s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.14 % Problem : KRS086+1 : TPTP v8.2.0. Released v3.1.0. % 0.04/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.13/0.36 % Computer : n008.cluster.edu % 0.13/0.36 % Model : x86_64 x86_64 % 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.36 % Memory : 8042.1875MB % 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.36 % CPULimit : 300 % 0.13/0.36 % WCLimit : 300 % 0.13/0.36 % DateTime : Wed Jun 19 14:24:09 EDT 2024 % 0.13/0.36 % CPUTime : % 0.49/0.58 start to proof:theBenchmark % 0.50/0.72 %------------------------------------------- % 0.50/0.72 % File :CSE---1.7 % 0.50/0.72 % Problem :theBenchmark % 0.50/0.72 % Transform :cnf % 0.50/0.72 % Format :tptp:raw % 0.50/0.72 % Command :java -jar mcs_scs.jar %d %s % 0.50/0.72 % 0.50/0.72 % Result :Theorem 0.090000s % 0.50/0.72 % Output :CNFRefutation 0.090000s % 0.50/0.72 %------------------------------------------- % 0.50/0.72 %------------------------------------------------------------------------------ % 0.50/0.72 % File : KRS086+1 : TPTP v8.2.0. Released v3.1.0. % 0.50/0.72 % Domain : Knowledge Representation (Semantic Web) % 0.50/0.72 % Problem : DL Test: t7.3 % 0.50/0.72 % Version : Especial. % 0.50/0.72 % English : % 0.50/0.72 % 0.50/0.72 % Refs : [Bec03] Bechhofer (2003), Email to G. Sutcliffe % 0.50/0.72 % : [TR+04] Tsarkov et al. (2004), Using Vampire to Reason with OW % 0.50/0.72 % Source : [Bec03] % 0.50/0.72 % Names : inconsistent_description-logic-Manifest030 [Bec03] % 0.50/0.72 % 0.50/0.72 % Status : Unsatisfiable % 0.50/0.72 % Rating : 0.00 v3.1.0 % 0.50/0.72 % Syntax : Number of formulae : 22 ( 1 unt; 0 def) % 0.50/0.72 % Number of atoms : 64 ( 15 equ) % 0.50/0.72 % Maximal formula atoms : 6 ( 2 avg) % 0.50/0.72 % Number of connectives : 45 ( 3 ~; 0 |; 21 &) % 0.50/0.72 % ( 4 <=>; 17 =>; 0 <=; 0 <~>) % 0.50/0.72 % Maximal formula depth : 11 ( 5 avg) % 0.50/0.72 % Maximal term depth : 1 ( 1 avg) % 0.50/0.72 % Number of predicates : 11 ( 10 usr; 0 prp; 1-2 aty) % 0.50/0.72 % Number of functors : 1 ( 1 usr; 1 con; 0-0 aty) % 0.50/0.72 % Number of variables : 52 ( 49 !; 3 ?) % 0.50/0.72 % SPC : FOF_UNS_RFO_SEQ % 0.50/0.72 % 0.50/0.72 % Comments : Sean Bechhofer says there are some errors in the encoding of % 0.50/0.72 % datatypes, so this problem may not be perfect. At least it's % 0.50/0.72 % still representative of the type of reasoning required for OWL. % 0.50/0.72 %------------------------------------------------------------------------------ % 0.50/0.72 fof(cUnsatisfiable_substitution_1,axiom, % 0.50/0.72 ! [A,B] : % 0.50/0.72 ( ( A = B % 0.50/0.72 & cUnsatisfiable(A) ) % 0.50/0.72 => cUnsatisfiable(B) ) ). % 0.50/0.72 % 0.50/0.72 fof(cowlNothing_substitution_1,axiom, % 0.50/0.72 ! [A,B] : % 0.50/0.72 ( ( A = B % 0.50/0.72 & cowlNothing(A) ) % 0.50/0.72 => cowlNothing(B) ) ). % 0.50/0.72 % 0.50/0.72 fof(cowlThing_substitution_1,axiom, % 0.50/0.72 ! [A,B] : % 0.50/0.72 ( ( A = B % 0.50/0.72 & cowlThing(A) ) % 0.50/0.72 => cowlThing(B) ) ). % 0.50/0.72 % 0.50/0.72 fof(cp1_substitution_1,axiom, % 0.50/0.72 ! [A,B] : % 0.50/0.72 ( ( A = B % 0.50/0.72 & cp1(A) ) % 0.50/0.72 => cp1(B) ) ). % 0.50/0.72 % 0.50/0.72 fof(rf_substitution_1,axiom, % 0.50/0.72 ! [A,B,C] : % 0.50/0.72 ( ( A = B % 0.50/0.72 & rf(A,C) ) % 0.50/0.72 => rf(B,C) ) ). % 0.50/0.72 % 0.50/0.72 fof(rf_substitution_2,axiom, % 0.50/0.72 ! [A,B,C] : % 0.50/0.72 ( ( A = B % 0.50/0.72 & rf(C,A) ) % 0.50/0.72 => rf(C,B) ) ). % 0.50/0.72 % 0.50/0.72 fof(rinvF_substitution_1,axiom, % 0.50/0.72 ! [A,B,C] : % 0.50/0.72 ( ( A = B % 0.50/0.72 & rinvF(A,C) ) % 0.50/0.72 => rinvF(B,C) ) ). % 0.50/0.72 % 0.50/0.72 fof(rinvF_substitution_2,axiom, % 0.50/0.72 ! [A,B,C] : % 0.50/0.72 ( ( A = B % 0.50/0.72 & rinvF(C,A) ) % 0.50/0.72 => rinvF(C,B) ) ). % 0.50/0.72 % 0.50/0.72 fof(rinvR_substitution_1,axiom, % 0.50/0.72 ! [A,B,C] : % 0.50/0.72 ( ( A = B % 0.50/0.72 & rinvR(A,C) ) % 0.50/0.72 => rinvR(B,C) ) ). % 0.50/0.72 % 0.50/0.72 fof(rinvR_substitution_2,axiom, % 0.50/0.72 ! [A,B,C] : % 0.50/0.72 ( ( A = B % 0.50/0.72 & rinvR(C,A) ) % 0.50/0.72 => rinvR(C,B) ) ). % 0.50/0.72 % 0.50/0.72 fof(rr_substitution_1,axiom, % 0.50/0.72 ! [A,B,C] : % 0.50/0.72 ( ( A = B % 0.50/0.72 & rr(A,C) ) % 0.50/0.72 => rr(B,C) ) ). % 0.50/0.72 % 0.50/0.72 fof(rr_substitution_2,axiom, % 0.50/0.72 ! [A,B,C] : % 0.50/0.72 ( ( A = B % 0.50/0.72 & rr(C,A) ) % 0.50/0.72 => rr(C,B) ) ). % 0.50/0.72 % 0.50/0.72 fof(xsd_integer_substitution_1,axiom, % 0.50/0.72 ! [A,B] : % 0.50/0.72 ( ( A = B % 0.50/0.72 & xsd_integer(A) ) % 0.50/0.72 => xsd_integer(B) ) ). % 0.50/0.72 % 0.50/0.72 fof(xsd_string_substitution_1,axiom, % 0.50/0.72 ! [A,B] : % 0.50/0.72 ( ( A = B % 0.50/0.72 & xsd_string(A) ) % 0.50/0.72 => xsd_string(B) ) ). % 0.50/0.72 % 0.50/0.72 %----Thing and Nothing % 0.50/0.72 fof(axiom_0,axiom, % 0.50/0.72 ! [X] : % 0.50/0.72 ( cowlThing(X) % 0.50/0.72 & ~ cowlNothing(X) ) ). % 0.50/0.72 % 0.50/0.72 %----String and Integer disjoint % 0.50/0.72 fof(axiom_1,axiom, % 0.50/0.72 ! [X] : % 0.50/0.72 ( xsd_string(X) % 0.50/0.72 <=> ~ xsd_integer(X) ) ). % 0.50/0.72 % 0.50/0.72 %----Equality cUnsatisfiable % 0.50/0.72 fof(axiom_2,axiom, % 0.50/0.72 ! [X] : % 0.50/0.72 ( cUnsatisfiable(X) % 0.50/0.72 <=> ? [Y] : % 0.50/0.72 ( rf(X,Y) % 0.50/0.72 & ? [Z] : % 0.50/0.72 ( rinvF(Y,Z) % 0.50/0.72 & ? [W] : % 0.50/0.72 ( rf(Z,W) % 0.50/0.72 & ~ cp1(W) ) ) % 0.50/0.72 & cp1(Y) ) ) ). % 0.50/0.72 % 0.50/0.72 %----Super cowlThing % 0.50/0.72 fof(axiom_3,axiom, % 0.50/0.72 ! [X] : % 0.50/0.72 ( cowlThing(X) % 0.50/0.72 => ! [Y0,Y1] : % 0.50/0.72 ( ( rf(X,Y0) % 0.50/0.72 & rf(X,Y1) ) % 0.50/0.72 => Y0 = Y1 ) ) ). % 0.50/0.72 % 0.50/0.72 %----Inverse: rinvF % 0.50/0.72 fof(axiom_4,axiom, % 0.50/0.72 ! [X,Y] : % 0.50/0.72 ( rinvF(X,Y) % 0.50/0.72 <=> rf(Y,X) ) ). % 0.50/0.72 % 0.50/0.72 %----Inverse: rinvR % 0.50/0.72 fof(axiom_5,axiom, % 0.50/0.72 ! [X,Y] : % 0.50/0.72 ( rinvR(X,Y) % 0.50/0.72 <=> rr(Y,X) ) ). % 0.50/0.72 % 0.50/0.72 %----Transitive: rr % 0.50/0.72 fof(axiom_6,axiom, % 0.50/0.72 ! [X,Y,Z] : % 0.50/0.72 ( ( rr(X,Y) % 0.50/0.72 & rr(Y,Z) ) % 0.50/0.72 => rr(X,Z) ) ). % 0.50/0.72 % 0.50/0.72 %----i2003_11_14_17_19_42328 % 0.50/0.72 fof(axiom_7,axiom, % 0.50/0.72 cUnsatisfiable(i2003_11_14_17_19_42328) ). % 0.50/0.72 % 0.50/0.72 %------------------------------------------------------------------------------ % 0.50/0.73 %------------------------------------------- % 0.50/0.73 % Proof found % 0.50/0.73 % SZS status Theorem for theBenchmark % 0.50/0.73 % SZS output start Proof % 0.50/0.73 %ClaNum:35(EqnAxiom:19) % 0.50/0.73 %VarNum:55(SingletonVarNum:26) % 0.50/0.73 %MaxLitNum:6 % 0.50/0.73 %MaxfuncDepth:1 % 0.50/0.73 %SharedTerms:2 % 0.50/0.73 [20]P1(a1) % 0.50/0.73 [21]~P2(x211) % 0.50/0.73 [22]P9(x221)+P3(x221) % 0.50/0.73 [23]~P9(x231)+~P3(x231) % 0.50/0.73 [24]~P1(x241)+P4(f2(x241)) % 0.50/0.73 [25]~P1(x251)+~P4(f3(x251)) % 0.50/0.73 [26]~P1(x261)+P5(x261,f2(x261)) % 0.50/0.73 [27]~P1(x271)+P5(f4(x271),f3(x271)) % 0.50/0.73 [28]~P1(x281)+P6(f2(x281),f4(x281)) % 0.50/0.73 [29]~P6(x292,x291)+P5(x291,x292) % 0.50/0.73 [30]~P5(x302,x301)+P6(x301,x302) % 0.50/0.73 [31]~P8(x312,x311)+P7(x311,x312) % 0.50/0.73 [32]~P7(x322,x321)+P8(x321,x322) % 0.50/0.73 [33]~P5(x333,x331)+E(x331,x332)+~P5(x333,x332) % 0.50/0.73 [34]~P8(x341,x343)+P8(x341,x342)+~P8(x343,x342) % 0.50/0.73 [35]~P5(x351,x353)+~P6(x353,x354)+P1(x351)+P4(x352)+~P5(x354,x352)+~P4(x353) % 0.50/0.73 %EqnAxiom % 0.50/0.73 [1]E(x11,x11) % 0.50/0.73 [2]E(x22,x21)+~E(x21,x22) % 0.50/0.73 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33) % 0.50/0.73 [4]~E(x41,x42)+E(f2(x41),f2(x42)) % 0.50/0.73 [5]~E(x51,x52)+E(f3(x51),f3(x52)) % 0.50/0.73 [6]~E(x61,x62)+E(f4(x61),f4(x62)) % 0.50/0.73 [7]~P1(x71)+P1(x72)+~E(x71,x72) % 0.50/0.73 [8]~P2(x81)+P2(x82)+~E(x81,x82) % 0.50/0.73 [9]~P3(x91)+P3(x92)+~E(x91,x92) % 0.50/0.73 [10]~P9(x101)+P9(x102)+~E(x101,x102) % 0.50/0.73 [11]P8(x112,x113)+~E(x111,x112)+~P8(x111,x113) % 0.50/0.73 [12]P8(x123,x122)+~E(x121,x122)+~P8(x123,x121) % 0.50/0.73 [13]P5(x132,x133)+~E(x131,x132)+~P5(x131,x133) % 0.50/0.73 [14]P5(x143,x142)+~E(x141,x142)+~P5(x143,x141) % 0.50/0.73 [15]~P4(x151)+P4(x152)+~E(x151,x152) % 0.50/0.73 [16]P6(x162,x163)+~E(x161,x162)+~P6(x161,x163) % 0.50/0.73 [17]P6(x173,x172)+~E(x171,x172)+~P6(x173,x171) % 0.50/0.73 [18]P7(x182,x183)+~E(x181,x182)+~P7(x181,x183) % 0.66/0.73 [19]P7(x193,x192)+~E(x191,x192)+~P7(x193,x191) % 0.66/0.73 % 0.66/0.73 %------------------------------------------- % 0.66/0.73 cnf(39,plain, % 0.66/0.73 (~E(a1,x391)+~P4(f3(x391))), % 0.66/0.73 inference(scs_inference,[],[20,25,7])). % 0.66/0.73 cnf(40,plain, % 0.66/0.73 (~P4(f3(a1))), % 0.66/0.73 inference(equality_inference,[],[39])). % 0.66/0.73 cnf(43,plain, % 0.66/0.73 (~E(a1,x431)+P5(x431,f2(x431))), % 0.66/0.73 inference(scs_inference,[],[20,26,7])). % 0.66/0.73 cnf(44,plain, % 0.66/0.73 (P5(a1,f2(a1))), % 0.66/0.73 inference(equality_inference,[],[43])). % 0.66/0.73 cnf(51,plain, % 0.66/0.73 (~E(a1,x511)+P5(f4(x511),f3(x511))), % 0.66/0.73 inference(scs_inference,[],[20,27,7])). % 0.66/0.73 cnf(52,plain, % 0.66/0.73 (P5(f4(a1),f3(a1))), % 0.66/0.73 inference(equality_inference,[],[51])). % 0.66/0.73 cnf(58,plain, % 0.66/0.73 (~E(a1,x581)+P6(f2(x581),f4(x581))), % 0.66/0.73 inference(scs_inference,[],[20,28,7])). % 0.66/0.73 cnf(59,plain, % 0.66/0.73 (P6(f2(a1),f4(a1))), % 0.66/0.73 inference(equality_inference,[],[58])). % 0.66/0.73 cnf(95,plain, % 0.66/0.73 (~E(f2(a1),f3(a1))), % 0.66/0.73 inference(scs_inference,[],[20,40,24,15])). % 0.66/0.73 cnf(100,plain, % 0.66/0.73 ($false), % 0.66/0.73 inference(scs_inference,[],[59,44,52,95,33,14,13,29]), % 0.66/0.73 ['proof']). % 0.66/0.73 % SZS output end Proof % 0.66/0.73 % Total time :0.090000s %------------------------------------------------------------------------------