%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : KRS063+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 : n015.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:21 EDT 2024 % Result : Unsatisfiable 0.48s 0.59s % Output : CNFRefutation 0.48s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.10 % Problem : KRS063+1 : TPTP v8.2.0. Released v3.1.0. % 0.06/0.10 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.09/0.30 % Computer : n015.cluster.edu % 0.09/0.30 % Model : x86_64 x86_64 % 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.30 % Memory : 8042.1875MB % 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64 % 0.09/0.30 % CPULimit : 300 % 0.09/0.30 % WCLimit : 300 % 0.09/0.30 % DateTime : Wed Jun 19 13:49:08 EDT 2024 % 0.09/0.30 % CPUTime : % 0.16/0.53 start to proof:theBenchmark % 0.48/0.57 %------------------------------------------- % 0.48/0.57 % File :CSE---1.7 % 0.48/0.57 % Problem :theBenchmark % 0.48/0.57 % Transform :cnf % 0.48/0.57 % Format :tptp:raw % 0.48/0.57 % Command :java -jar mcs_scs.jar %d %s % 0.48/0.57 % 0.48/0.57 % Result :Theorem 0.000000s % 0.48/0.57 % Output :CNFRefutation 0.000000s % 0.48/0.57 %------------------------------------------- % 0.48/0.57 %------------------------------------------------------------------------------ % 0.48/0.57 % File : KRS063+1 : TPTP v8.2.0. Released v3.1.0. % 0.48/0.57 % Domain : Knowledge Representation (Semantic Web) % 0.48/0.57 % Problem : An example combining owl:oneOf and owl:inverseOf % 0.48/0.57 % Version : Especial. % 0.48/0.57 % English : % 0.48/0.57 % 0.48/0.57 % Refs : [Bec03] Bechhofer (2003), Email to G. Sutcliffe % 0.48/0.57 % : [TR+04] Tsarkov et al. (2004), Using Vampire to Reason with OW % 0.48/0.57 % Source : [Bec03] % 0.48/0.57 % Names : inconsistent_I4.5-Manifest002 [Bec03] % 0.48/0.57 % 0.48/0.58 % Status : Unsatisfiable % 0.48/0.58 % Rating : 0.14 v8.2.0, 0.00 v3.1.0 % 0.48/0.58 % Syntax : Number of formulae : 27 ( 9 unt; 0 def) % 0.48/0.58 % Number of atoms : 63 ( 18 equ) % 0.48/0.58 % Maximal formula atoms : 7 ( 2 avg) % 0.48/0.58 % Number of connectives : 39 ( 3 ~; 5 |; 14 &) % 0.48/0.58 % ( 4 <=>; 13 =>; 0 <=; 0 <~>) % 0.48/0.58 % Maximal formula depth : 8 ( 4 avg) % 0.48/0.58 % Maximal term depth : 1 ( 1 avg) % 0.48/0.58 % Number of predicates : 11 ( 10 usr; 0 prp; 1-2 aty) % 0.48/0.58 % Number of functors : 7 ( 7 usr; 7 con; 0-0 aty) % 0.48/0.58 % Number of variables : 37 ( 36 !; 1 ?) % 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(cEUCountry_substitution_1,axiom, % 0.48/0.58 ! [A,B] : % 0.48/0.58 ( ( A = B % 0.48/0.58 & cEUCountry(A) ) % 0.48/0.58 => cEUCountry(B) ) ). % 0.48/0.58 % 0.48/0.58 fof(cEuroMP_substitution_1,axiom, % 0.48/0.58 ! [A,B] : % 0.48/0.58 ( ( A = B % 0.48/0.58 & cEuroMP(A) ) % 0.48/0.58 => cEuroMP(B) ) ). % 0.48/0.58 % 0.48/0.58 fof(cEuropeanCountry_substitution_1,axiom, % 0.48/0.58 ! [A,B] : % 0.48/0.58 ( ( A = B % 0.48/0.58 & cEuropeanCountry(A) ) % 0.48/0.58 => cEuropeanCountry(B) ) ). % 0.48/0.58 % 0.48/0.58 fof(cPerson_substitution_1,axiom, % 0.48/0.58 ! [A,B] : % 0.48/0.58 ( ( A = B % 0.48/0.58 & cPerson(A) ) % 0.48/0.58 => cPerson(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(rhasEuroMP_substitution_1,axiom, % 0.48/0.58 ! [A,B,C] : % 0.48/0.58 ( ( A = B % 0.48/0.58 & rhasEuroMP(A,C) ) % 0.48/0.58 => rhasEuroMP(B,C) ) ). % 0.48/0.58 % 0.48/0.58 fof(rhasEuroMP_substitution_2,axiom, % 0.48/0.58 ! [A,B,C] : % 0.48/0.58 ( ( A = B % 0.48/0.58 & rhasEuroMP(C,A) ) % 0.48/0.58 => rhasEuroMP(C,B) ) ). % 0.48/0.58 % 0.48/0.58 fof(risEuroMPFrom_substitution_1,axiom, % 0.48/0.58 ! [A,B,C] : % 0.48/0.58 ( ( A = B % 0.48/0.58 & risEuroMPFrom(A,C) ) % 0.48/0.58 => risEuroMPFrom(B,C) ) ). % 0.48/0.58 % 0.48/0.58 fof(risEuroMPFrom_substitution_2,axiom, % 0.48/0.58 ! [A,B,C] : % 0.48/0.58 ( ( A = B % 0.48/0.58 & risEuroMPFrom(C,A) ) % 0.48/0.58 => risEuroMPFrom(C,B) ) ). % 0.48/0.58 % 0.48/0.58 fof(xsd_integer_substitution_1,axiom, % 0.48/0.58 ! [A,B] : % 0.48/0.58 ( ( A = B % 0.48/0.58 & xsd_integer(A) ) % 0.48/0.58 => xsd_integer(B) ) ). % 0.48/0.58 % 0.48/0.58 fof(xsd_string_substitution_1,axiom, % 0.48/0.58 ! [A,B] : % 0.48/0.58 ( ( A = B % 0.48/0.58 & xsd_string(A) ) % 0.48/0.58 => xsd_string(B) ) ). % 0.48/0.58 % 0.48/0.58 %----Thing and Nothing % 0.48/0.58 fof(axiom_0,axiom, % 0.48/0.58 ! [X] : % 0.48/0.58 ( cowlThing(X) % 0.48/0.58 & ~ cowlNothing(X) ) ). % 0.48/0.58 % 0.48/0.58 %----String and Integer disjoint % 0.48/0.58 fof(axiom_1,axiom, % 0.48/0.58 ! [X] : % 0.48/0.58 ( xsd_string(X) % 0.48/0.58 <=> ~ xsd_integer(X) ) ). % 0.48/0.58 % 0.48/0.58 %----Enumeration cEUCountry % 0.48/0.59 fof(axiom_2,axiom, % 0.48/0.59 ! [X] : % 0.48/0.59 ( cEUCountry(X) % 0.48/0.59 <=> ( X = iPT % 0.48/0.59 | X = iBE % 0.48/0.59 | X = iNL % 0.48/0.59 | X = iES % 0.48/0.59 | X = iFR % 0.48/0.59 | X = iUK ) ) ). % 0.48/0.59 % 0.48/0.59 %----Equality cEuroMP % 0.48/0.59 fof(axiom_3,axiom, % 0.48/0.59 ! [X] : % 0.48/0.59 ( cEuroMP(X) % 0.48/0.59 <=> ? [Y] : % 0.48/0.59 ( risEuroMPFrom(X,Y) % 0.48/0.59 & cowlThing(Y) ) ) ). % 0.48/0.59 % 0.48/0.59 %----Domain: rhasEuroMP % 0.48/0.59 fof(axiom_4,axiom, % 0.48/0.59 ! [X,Y] : % 0.48/0.59 ( rhasEuroMP(X,Y) % 0.48/0.59 => cEUCountry(X) ) ). % 0.48/0.59 % 0.48/0.59 %----Inverse: risEuroMPFrom % 0.48/0.59 fof(axiom_5,axiom, % 0.48/0.59 ! [X,Y] : % 0.48/0.59 ( risEuroMPFrom(X,Y) % 0.48/0.59 <=> rhasEuroMP(Y,X) ) ). % 0.48/0.59 % 0.48/0.59 %----iBE % 0.48/0.59 fof(axiom_6,axiom, % 0.48/0.59 cEuropeanCountry(iBE) ). % 0.48/0.59 % 0.48/0.59 %----iES % 0.48/0.59 fof(axiom_7,axiom, % 0.48/0.59 cEuropeanCountry(iES) ). % 0.48/0.59 % 0.48/0.59 %----iFR % 0.48/0.59 fof(axiom_8,axiom, % 0.48/0.59 cEuropeanCountry(iFR) ). % 0.48/0.59 % 0.48/0.59 %----iKinnock % 0.48/0.59 fof(axiom_9,axiom, % 0.48/0.59 cPerson(iKinnock) ). % 0.48/0.59 % 0.48/0.59 %----iKinnock % 0.48/0.59 fof(axiom_10,axiom, % 0.48/0.59 ~ cEuroMP(iKinnock) ). % 0.48/0.59 % 0.48/0.59 %----iNL % 0.48/0.59 fof(axiom_11,axiom, % 0.48/0.59 cEuropeanCountry(iNL) ). % 0.48/0.59 % 0.48/0.59 %----iPT % 0.48/0.59 fof(axiom_12,axiom, % 0.48/0.59 cEuropeanCountry(iPT) ). % 0.48/0.59 % 0.48/0.59 %----iUK % 0.48/0.59 fof(axiom_13,axiom, % 0.48/0.59 cEuropeanCountry(iUK) ). % 0.48/0.59 % 0.48/0.59 fof(axiom_14,axiom, % 0.48/0.59 rhasEuroMP(iUK,iKinnock) ). % 0.48/0.59 % 0.48/0.59 %------------------------------------------------------------------------------ % 0.48/0.59 %------------------------------------------- % 0.48/0.59 % Proof found % 0.48/0.59 % SZS status Theorem for theBenchmark % 0.48/0.59 % SZS output start Proof % 0.48/0.59 %ClaNum:39(EqnAxiom:15) % 0.48/0.59 %VarNum:41(SingletonVarNum:19) % 0.48/0.59 %MaxLitNum:7 % 0.48/0.59 %MaxfuncDepth:1 % 0.48/0.59 %SharedTerms:16 % 0.48/0.59 [16]P1(a1) % 0.48/0.59 [17]P1(a2) % 0.48/0.59 [18]P1(a4) % 0.48/0.59 [19]P1(a5) % 0.48/0.59 [20]P1(a6) % 0.48/0.59 [21]P1(a8) % 0.48/0.59 [22]P4(a7) % 0.48/0.59 [23]P5(a8,a7) % 0.48/0.59 [24]~P2(a7) % 0.48/0.59 [25]~P6(x251) % 0.48/0.59 [26]P3(x261)+~E(x261,a1) % 0.48/0.59 [27]P3(x271)+~E(x271,a2) % 0.48/0.59 [28]P3(x281)+~E(x281,a4) % 0.48/0.59 [29]P3(x291)+~E(x291,a5) % 0.48/0.59 [30]P3(x301)+~E(x301,a6) % 0.48/0.59 [31]P3(x311)+~E(x311,a8) % 0.48/0.59 [32]P9(x321)+P7(x321) % 0.48/0.59 [33]~P9(x331)+~P7(x331) % 0.48/0.59 [37]~P2(x371)+P8(x371,f3(x371)) % 0.48/0.59 [35]P3(x351)+~P5(x351,x352) % 0.48/0.59 [36]P2(x361)+~P8(x361,x362) % 0.48/0.59 [38]~P8(x382,x381)+P5(x381,x382) % 0.48/0.59 [39]~P5(x392,x391)+P8(x391,x392) % 0.48/0.59 [34]~P3(x341)+E(x341,a2)+E(x341,a4)+E(x341,a5)+E(x341,a6)+E(x341,a8)+E(x341,a1) % 0.48/0.59 %EqnAxiom % 0.48/0.59 [1]E(x11,x11) % 0.48/0.59 [2]E(x22,x21)+~E(x21,x22) % 0.48/0.59 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33) % 0.48/0.59 [4]~E(x41,x42)+E(f3(x41),f3(x42)) % 0.48/0.59 [5]~P1(x51)+P1(x52)+~E(x51,x52) % 0.48/0.59 [6]P5(x62,x63)+~E(x61,x62)+~P5(x61,x63) % 0.48/0.59 [7]P5(x73,x72)+~E(x71,x72)+~P5(x73,x71) % 0.48/0.59 [8]P8(x82,x83)+~E(x81,x82)+~P8(x81,x83) % 0.48/0.59 [9]P8(x93,x92)+~E(x91,x92)+~P8(x93,x91) % 0.48/0.59 [10]~P2(x101)+P2(x102)+~E(x101,x102) % 0.48/0.59 [11]~P3(x111)+P3(x112)+~E(x111,x112) % 0.48/0.59 [12]~P9(x121)+P9(x122)+~E(x121,x122) % 0.48/0.59 [13]~P4(x131)+P4(x132)+~E(x131,x132) % 0.48/0.59 [14]~P7(x141)+P7(x142)+~E(x141,x142) % 0.48/0.59 [15]~P6(x151)+P6(x152)+~E(x151,x152) % 0.48/0.59 % 0.48/0.59 %------------------------------------------- % 0.48/0.59 cnf(48,plain, % 0.48/0.59 ($false), % 0.48/0.59 inference(scs_inference,[],[23,24,36,39]), % 0.48/0.59 ['proof']). % 0.48/0.59 % SZS output end Proof % 0.48/0.59 % Total time :0.000000s %------------------------------------------------------------------------------