TSTP Solution File: KRS106+1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : KRS106+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 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 : Thu Aug 31 05:39:16 EDT 2023
% Result : Unsatisfiable 0.20s 0.64s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : KRS106+1 : TPTP v8.1.2. Released v3.1.0.
% 0.08/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.12/0.34 % Computer : n017.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Aug 28 01:20:27 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.20/0.57 start to proof:theBenchmark
% 0.20/0.63 %-------------------------------------------
% 0.20/0.63 % File :CSE---1.6
% 0.20/0.63 % Problem :theBenchmark
% 0.20/0.63 % Transform :cnf
% 0.20/0.63 % Format :tptp:raw
% 0.20/0.63 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.63
% 0.20/0.63 % Result :Theorem 0.010000s
% 0.20/0.63 % Output :CNFRefutation 0.010000s
% 0.20/0.63 %-------------------------------------------
% 0.20/0.63 %------------------------------------------------------------------------------
% 0.20/0.63 % File : KRS106+1 : TPTP v8.1.2. Released v3.1.0.
% 0.20/0.63 % Domain : Knowledge Representation (Semantic Web)
% 0.20/0.63 % Problem : DL Test: fact3.1
% 0.20/0.63 % Version : Especial.
% 0.20/0.63 % English :
% 0.20/0.63
% 0.20/0.63 % Refs : [Bec03] Bechhofer (2003), Email to G. Sutcliffe
% 0.20/0.64 % : [TR+04] Tsarkov et al. (2004), Using Vampire to Reason with OW
% 0.20/0.64 % Source : [Bec03]
% 0.20/0.64 % Names : inconsistent_description-logic-Manifest603 [Bec03]
% 0.20/0.64
% 0.20/0.64 % Status : Unsatisfiable
% 0.20/0.64 % Rating : 0.00 v3.1.0
% 0.20/0.64 % Syntax : Number of formulae : 27 ( 1 unt; 0 def)
% 0.20/0.64 % Number of atoms : 77 ( 19 equ)
% 0.20/0.64 % Maximal formula atoms : 7 ( 2 avg)
% 0.20/0.64 % Number of connectives : 53 ( 3 ~; 0 |; 25 &)
% 0.20/0.64 % ( 4 <=>; 21 =>; 0 <=; 0 <~>)
% 0.20/0.64 % Maximal formula depth : 7 ( 5 avg)
% 0.20/0.64 % Maximal term depth : 1 ( 1 avg)
% 0.20/0.64 % Number of predicates : 13 ( 12 usr; 0 prp; 1-2 aty)
% 0.20/0.64 % Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% 0.20/0.64 % Number of variables : 63 ( 58 !; 5 ?)
% 0.20/0.64 % SPC : FOF_UNS_RFO_SEQ
% 0.20/0.64
% 0.20/0.64 % Comments : Sean Bechhofer says there are some errors in the encoding of
% 0.20/0.64 % datatypes, so this problem may not be perfect. At least it's
% 0.20/0.64 % still representative of the type of reasoning required for OWL.
% 0.20/0.64 %------------------------------------------------------------------------------
% 0.20/0.64 fof(cUnsatisfiable_substitution_1,axiom,
% 0.20/0.64 ! [A,B] :
% 0.20/0.64 ( ( A = B
% 0.20/0.64 & cUnsatisfiable(A) )
% 0.20/0.64 => cUnsatisfiable(B) ) ).
% 0.20/0.64
% 0.20/0.64 fof(cowlNothing_substitution_1,axiom,
% 0.20/0.64 ! [A,B] :
% 0.20/0.64 ( ( A = B
% 0.20/0.64 & cowlNothing(A) )
% 0.20/0.64 => cowlNothing(B) ) ).
% 0.20/0.64
% 0.20/0.64 fof(cowlThing_substitution_1,axiom,
% 0.20/0.64 ! [A,B] :
% 0.20/0.64 ( ( A = B
% 0.20/0.64 & cowlThing(A) )
% 0.20/0.64 => cowlThing(B) ) ).
% 0.20/0.64
% 0.20/0.64 fof(cp1_substitution_1,axiom,
% 0.20/0.64 ! [A,B] :
% 0.20/0.64 ( ( A = B
% 0.20/0.64 & cp1(A) )
% 0.20/0.64 => cp1(B) ) ).
% 0.20/0.64
% 0.20/0.64 fof(cp1xcomp_substitution_1,axiom,
% 0.20/0.64 ! [A,B] :
% 0.20/0.64 ( ( A = B
% 0.20/0.64 & cp1xcomp(A) )
% 0.20/0.64 => cp1xcomp(B) ) ).
% 0.20/0.64
% 0.20/0.64 fof(cp2_substitution_1,axiom,
% 0.20/0.64 ! [A,B] :
% 0.20/0.64 ( ( A = B
% 0.20/0.64 & cp2(A) )
% 0.20/0.64 => cp2(B) ) ).
% 0.20/0.64
% 0.20/0.64 fof(ra_Px1_substitution_1,axiom,
% 0.20/0.64 ! [A,B,C] :
% 0.20/0.64 ( ( A = B
% 0.20/0.64 & ra_Px1(A,C) )
% 0.20/0.64 => ra_Px1(B,C) ) ).
% 0.20/0.64
% 0.20/0.64 fof(ra_Px1_substitution_2,axiom,
% 0.20/0.64 ! [A,B,C] :
% 0.20/0.64 ( ( A = B
% 0.20/0.64 & ra_Px1(C,A) )
% 0.20/0.64 => ra_Px1(C,B) ) ).
% 0.20/0.64
% 0.20/0.64 fof(rf1_substitution_1,axiom,
% 0.20/0.64 ! [A,B,C] :
% 0.20/0.64 ( ( A = B
% 0.20/0.64 & rf1(A,C) )
% 0.20/0.64 => rf1(B,C) ) ).
% 0.20/0.64
% 0.20/0.64 fof(rf1_substitution_2,axiom,
% 0.20/0.64 ! [A,B,C] :
% 0.20/0.64 ( ( A = B
% 0.20/0.64 & rf1(C,A) )
% 0.20/0.64 => rf1(C,B) ) ).
% 0.20/0.64
% 0.20/0.64 fof(rf2_substitution_1,axiom,
% 0.20/0.64 ! [A,B,C] :
% 0.20/0.64 ( ( A = B
% 0.20/0.64 & rf2(A,C) )
% 0.20/0.64 => rf2(B,C) ) ).
% 0.20/0.64
% 0.20/0.64 fof(rf2_substitution_2,axiom,
% 0.20/0.64 ! [A,B,C] :
% 0.20/0.64 ( ( A = B
% 0.20/0.64 & rf2(C,A) )
% 0.20/0.64 => rf2(C,B) ) ).
% 0.20/0.64
% 0.20/0.64 fof(rf3_substitution_1,axiom,
% 0.20/0.64 ! [A,B,C] :
% 0.20/0.64 ( ( A = B
% 0.20/0.64 & rf3(A,C) )
% 0.20/0.64 => rf3(B,C) ) ).
% 0.20/0.64
% 0.20/0.64 fof(rf3_substitution_2,axiom,
% 0.20/0.64 ! [A,B,C] :
% 0.20/0.64 ( ( A = B
% 0.20/0.64 & rf3(C,A) )
% 0.20/0.64 => rf3(C,B) ) ).
% 0.20/0.64
% 0.20/0.64 fof(xsd_integer_substitution_1,axiom,
% 0.20/0.64 ! [A,B] :
% 0.20/0.64 ( ( A = B
% 0.20/0.64 & xsd_integer(A) )
% 0.20/0.64 => xsd_integer(B) ) ).
% 0.20/0.64
% 0.20/0.64 fof(xsd_string_substitution_1,axiom,
% 0.20/0.64 ! [A,B] :
% 0.20/0.64 ( ( A = B
% 0.20/0.64 & xsd_string(A) )
% 0.20/0.64 => xsd_string(B) ) ).
% 0.20/0.64
% 0.20/0.64 %----Thing and Nothing
% 0.20/0.64 fof(axiom_0,axiom,
% 0.20/0.64 ! [X] :
% 0.20/0.64 ( cowlThing(X)
% 0.20/0.64 & ~ cowlNothing(X) ) ).
% 0.20/0.64
% 0.20/0.64 %----String and Integer disjoint
% 0.20/0.64 fof(axiom_1,axiom,
% 0.20/0.64 ! [X] :
% 0.20/0.64 ( xsd_string(X)
% 0.20/0.64 <=> ~ xsd_integer(X) ) ).
% 0.20/0.64
% 0.20/0.64 %----Equality cUnsatisfiable
% 0.20/0.64 fof(axiom_2,axiom,
% 0.20/0.64 ! [X] :
% 0.20/0.64 ( cUnsatisfiable(X)
% 0.20/0.64 <=> ( ? [Y] :
% 0.20/0.64 ( rf3(X,Y)
% 0.20/0.64 & cp2(Y) )
% 0.20/0.64 & ? [Y] :
% 0.20/0.64 ( rf1(X,Y)
% 0.20/0.64 & cp1(Y) )
% 0.20/0.64 & ? [Y] :
% 0.20/0.64 ( rf2(X,Y)
% 0.20/0.64 & cp1xcomp(Y) ) ) ) ).
% 0.20/0.64
% 0.20/0.64 %----Equality cp1
% 0.20/0.64 fof(axiom_3,axiom,
% 0.20/0.64 ! [X] :
% 0.20/0.64 ( cp1(X)
% 0.20/0.64 <=> ~ ? [Y] : ra_Px1(X,Y) ) ).
% 0.20/0.64
% 0.20/0.64 %----Equality cp1xcomp
% 0.20/0.64 fof(axiom_4,axiom,
% 0.20/0.64 ! [X] :
% 0.20/0.64 ( cp1xcomp(X)
% 0.20/0.64 <=> ? [Y0] : ra_Px1(X,Y0) ) ).
% 0.20/0.64
% 0.20/0.64 %----Functional: rf1
% 0.20/0.64 fof(axiom_5,axiom,
% 0.20/0.64 ! [X,Y,Z] :
% 0.20/0.64 ( ( rf1(X,Y)
% 0.20/0.64 & rf1(X,Z) )
% 0.20/0.64 => Y = Z ) ).
% 0.20/0.64
% 0.20/0.64 %----Functional: rf2
% 0.20/0.64 fof(axiom_6,axiom,
% 0.20/0.64 ! [X,Y,Z] :
% 0.20/0.64 ( ( rf2(X,Y)
% 0.20/0.64 & rf2(X,Z) )
% 0.20/0.64 => Y = Z ) ).
% 0.20/0.64
% 0.20/0.64 %----Functional: rf3
% 0.20/0.64 fof(axiom_7,axiom,
% 0.20/0.64 ! [X,Y,Z] :
% 0.20/0.64 ( ( rf3(X,Y)
% 0.20/0.64 & rf3(X,Z) )
% 0.20/0.64 => Y = Z ) ).
% 0.20/0.64
% 0.20/0.64 %----i2003_11_14_17_20_57644
% 0.20/0.64 fof(axiom_8,axiom,
% 0.20/0.64 cUnsatisfiable(i2003_11_14_17_20_57644) ).
% 0.20/0.64
% 0.20/0.64 fof(axiom_9,axiom,
% 0.20/0.64 ! [X,Y] :
% 0.20/0.64 ( rf3(X,Y)
% 0.20/0.64 => rf1(X,Y) ) ).
% 0.20/0.64
% 0.20/0.64 fof(axiom_10,axiom,
% 0.20/0.64 ! [X,Y] :
% 0.20/0.64 ( rf3(X,Y)
% 0.20/0.64 => rf2(X,Y) ) ).
% 0.20/0.64
% 0.20/0.64 %------------------------------------------------------------------------------
% 0.20/0.64 %-------------------------------------------
% 0.20/0.64 % Proof found
% 0.20/0.64 % SZS status Theorem for theBenchmark
% 0.20/0.64 % SZS output start Proof
% 0.20/0.64 %ClaNum:43(EqnAxiom:23)
% 0.20/0.64 %VarNum:68(SingletonVarNum:32)
% 0.20/0.64 %MaxLitNum:7
% 0.20/0.64 %MaxfuncDepth:1
% 0.20/0.64 %SharedTerms:2
% 0.20/0.64 [24]P1(a1)
% 0.20/0.64 [25]~P2(x251)
% 0.20/0.64 [26]P11(x261)+P3(x261)
% 0.20/0.64 [27]~P11(x271)+~P3(x271)
% 0.20/0.64 [28]~P1(x281)+P4(f2(x281))
% 0.20/0.64 [29]~P1(x291)+P5(f4(x291))
% 0.20/0.64 [30]~P1(x301)+P6(f3(x301))
% 0.20/0.64 [31]P4(x311)+P7(x311,f5(x311))
% 0.20/0.64 [33]~P5(x331)+P7(x331,f6(x331))
% 0.20/0.64 [34]~P1(x341)+P8(x341,f2(x341))
% 0.20/0.64 [35]~P1(x351)+P9(x351,f4(x351))
% 0.20/0.64 [36]~P1(x361)+P10(x361,f3(x361))
% 0.20/0.64 [32]P5(x321)+~P7(x321,x322)
% 0.20/0.64 [37]~P4(x371)+~P7(x371,x372)
% 0.20/0.64 [38]~P10(x381,x382)+P8(x381,x382)
% 0.20/0.64 [39]~P10(x391,x392)+P9(x391,x392)
% 0.20/0.64 [40]~P8(x403,x401)+E(x401,x402)+~P8(x403,x402)
% 0.20/0.64 [41]~P9(x413,x411)+E(x411,x412)+~P9(x413,x412)
% 0.20/0.64 [42]~P10(x423,x421)+E(x421,x422)+~P10(x423,x422)
% 0.20/0.64 [43]~P8(x431,x432)+~P9(x431,x433)+~P10(x431,x434)+P1(x431)+~P4(x432)+~P5(x433)+~P6(x434)
% 0.20/0.64 %EqnAxiom
% 0.20/0.64 [1]E(x11,x11)
% 0.20/0.64 [2]E(x22,x21)+~E(x21,x22)
% 0.20/0.64 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33)
% 0.20/0.64 [4]~E(x41,x42)+E(f2(x41),f2(x42))
% 0.20/0.64 [5]~E(x51,x52)+E(f4(x51),f4(x52))
% 0.20/0.64 [6]~E(x61,x62)+E(f3(x61),f3(x62))
% 0.20/0.64 [7]~E(x71,x72)+E(f5(x71),f5(x72))
% 0.20/0.64 [8]~E(x81,x82)+E(f6(x81),f6(x82))
% 0.20/0.64 [9]~P1(x91)+P1(x92)+~E(x91,x92)
% 0.20/0.64 [10]~P2(x101)+P2(x102)+~E(x101,x102)
% 0.20/0.64 [11]~P3(x111)+P3(x112)+~E(x111,x112)
% 0.20/0.64 [12]~P11(x121)+P11(x122)+~E(x121,x122)
% 0.20/0.64 [13]P10(x132,x133)+~E(x131,x132)+~P10(x131,x133)
% 0.20/0.64 [14]P10(x143,x142)+~E(x141,x142)+~P10(x143,x141)
% 0.20/0.64 [15]P9(x152,x153)+~E(x151,x152)+~P9(x151,x153)
% 0.20/0.64 [16]P9(x163,x162)+~E(x161,x162)+~P9(x163,x161)
% 0.20/0.64 [17]~P4(x171)+P4(x172)+~E(x171,x172)
% 0.20/0.64 [18]P8(x182,x183)+~E(x181,x182)+~P8(x181,x183)
% 0.20/0.64 [19]P8(x193,x192)+~E(x191,x192)+~P8(x193,x191)
% 0.20/0.64 [20]~P5(x201)+P5(x202)+~E(x201,x202)
% 0.20/0.64 [21]P7(x212,x213)+~E(x211,x212)+~P7(x211,x213)
% 0.20/0.64 [22]P7(x223,x222)+~E(x221,x222)+~P7(x223,x221)
% 0.20/0.64 [23]~P6(x231)+P6(x232)+~E(x231,x232)
% 0.20/0.64
% 0.20/0.64 %-------------------------------------------
% 0.20/0.64 cnf(44,plain,
% 0.20/0.64 (P10(a1,f3(a1))),
% 0.20/0.64 inference(scs_inference,[],[24,36])).
% 0.20/0.64 cnf(45,plain,
% 0.20/0.64 (P9(a1,f4(a1))),
% 0.20/0.64 inference(scs_inference,[],[24,36,35])).
% 0.20/0.64 cnf(46,plain,
% 0.20/0.64 (P8(a1,f2(a1))),
% 0.20/0.64 inference(scs_inference,[],[24,36,35,34])).
% 0.20/0.64 cnf(50,plain,
% 0.20/0.64 (P5(f4(a1))),
% 0.20/0.64 inference(scs_inference,[],[24,36,35,34,30,29])).
% 0.20/0.64 cnf(52,plain,
% 0.20/0.64 (P4(f2(a1))),
% 0.20/0.64 inference(scs_inference,[],[24,36,35,34,30,29,28])).
% 0.20/0.64 cnf(56,plain,
% 0.20/0.64 (P9(a1,f3(a1))),
% 0.20/0.64 inference(scs_inference,[],[44,39])).
% 0.20/0.64 cnf(58,plain,
% 0.20/0.64 (P8(a1,f3(a1))),
% 0.20/0.64 inference(scs_inference,[],[44,39,38])).
% 0.20/0.64 cnf(62,plain,
% 0.20/0.64 (P7(f4(a1),f6(f4(a1)))),
% 0.20/0.64 inference(scs_inference,[],[50,52,44,39,38,37,33])).
% 0.20/0.64 cnf(66,plain,
% 0.20/0.64 (~P9(a1,f2(a1))),
% 0.20/0.64 inference(scs_inference,[],[50,52,44,45,39,38,37,33,21,20,41])).
% 0.20/0.64 cnf(71,plain,
% 0.20/0.64 (~P8(a1,f4(a1))),
% 0.20/0.64 inference(scs_inference,[],[46,50,52,44,45,39,38,37,33,21,20,41,2,42,40])).
% 0.20/0.64 cnf(80,plain,
% 0.20/0.64 ($false),
% 0.20/0.64 inference(scs_inference,[],[62,71,56,58,66,45,19,16,37,38,41]),
% 0.20/0.64 ['proof']).
% 0.20/0.64 % SZS output end Proof
% 0.20/0.64 % Total time :0.010000s
%------------------------------------------------------------------------------