%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : KRS128+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 : n027.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:36 EDT 2024 % Result : Unsatisfiable 0.50s 0.62s % Output : CNFRefutation 0.50s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : KRS128+1 : TPTP v8.2.0. Released v3.1.0. % 0.03/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n027.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 300 % 0.12/0.33 % DateTime : Wed Jun 19 13:43:08 EDT 2024 % 0.12/0.33 % CPUTime : % 0.48/0.56 start to proof:theBenchmark % 0.50/0.62 %------------------------------------------- % 0.50/0.62 % File :CSE---1.7 % 0.50/0.62 % Problem :theBenchmark % 0.50/0.62 % Transform :cnf % 0.50/0.62 % Format :tptp:raw % 0.50/0.62 % Command :java -jar mcs_scs.jar %d %s % 0.50/0.62 % 0.50/0.62 % Result :Theorem 0.020000s % 0.50/0.62 % Output :CNFRefutation 0.020000s % 0.50/0.62 %------------------------------------------- % 0.50/0.62 %------------------------------------------------------------------------------ % 0.50/0.62 % File : KRS128+1 : TPTP v8.2.0. Released v3.1.0. % 0.50/0.62 % Domain : Knowledge Representation (Semantic Web) % 0.50/0.62 % Problem : DL Test: heinsohn4.1 % 0.50/0.62 % Version : Especial. % 0.50/0.62 % English : Tbox tests from [HK+94] % 0.50/0.62 % 0.50/0.62 % Refs : [HK+94] Heinsohn et al. (1994), An Empirical Analysis of Termi % 0.50/0.62 % : [Bec03] Bechhofer (2003), Email to G. Sutcliffe % 0.50/0.62 % : [TR+04] Tsarkov et al. (2004), Using Vampire to Reason with OW % 0.50/0.62 % Source : [Bec03] % 0.50/0.62 % Names : inconsistent_description-logic-Manifest650 [Bec03] % 0.50/0.62 % 0.50/0.62 % Status : Unsatisfiable % 0.50/0.62 % Rating : 0.00 v6.4.0, 0.25 v6.3.0, 0.00 v6.2.0, 0.25 v6.1.0, 0.00 v3.1.0 % 0.50/0.62 % Syntax : Number of formulae : 12 ( 1 unt; 0 def) % 0.50/0.62 % Number of atoms : 29 ( 0 equ) % 0.50/0.62 % Maximal formula atoms : 7 ( 2 avg) % 0.50/0.62 % Number of connectives : 22 ( 5 ~; 0 |; 5 &) % 0.50/0.62 % ( 9 <=>; 3 =>; 0 <=; 0 <~>) % 0.50/0.62 % Maximal formula depth : 7 ( 4 avg) % 0.50/0.62 % Maximal term depth : 1 ( 1 avg) % 0.50/0.62 % Number of predicates : 16 ( 16 usr; 0 prp; 1-2 aty) % 0.50/0.62 % Number of functors : 1 ( 1 usr; 1 con; 0-0 aty) % 0.50/0.62 % Number of variables : 20 ( 13 !; 7 ?) % 0.50/0.62 % SPC : FOF_UNS_RFO_NEQ % 0.50/0.62 % 0.50/0.62 % Comments : Sean Bechhofer says there are some errors in the encoding of % 0.50/0.62 % datatypes, so this problem may not be perfect. At least it's % 0.50/0.62 % still representative of the type of reasoning required for OWL. % 0.50/0.62 % : Tests role restrictions % 0.50/0.62 %------------------------------------------------------------------------------ % 0.50/0.62 %----Thing and Nothing % 0.50/0.62 fof(axiom_0,axiom, % 0.50/0.62 ! [X] : % 0.50/0.62 ( cowlThing(X) % 0.50/0.62 & ~ cowlNothing(X) ) ). % 0.50/0.62 % 0.50/0.62 %----String and Integer disjoint % 0.50/0.62 fof(axiom_1,axiom, % 0.50/0.62 ! [X] : % 0.50/0.62 ( xsd_string(X) % 0.50/0.62 <=> ~ xsd_integer(X) ) ). % 0.50/0.62 % 0.50/0.62 %----Equality cUnsatisfiable % 0.50/0.62 fof(axiom_2,axiom, % 0.50/0.62 ! [X] : % 0.50/0.62 ( cUnsatisfiable(X) % 0.50/0.62 <=> ( ? [Y] : % 0.50/0.62 ( rr(X,Y) % 0.50/0.62 & cexcomp(Y) ) % 0.50/0.62 & ! [Y] : % 0.50/0.62 ( rr(X,Y) % 0.50/0.62 => cd(Y) ) % 0.50/0.62 & ! [Y] : % 0.50/0.62 ( rr(X,Y) % 0.50/0.62 => ca_Cx4(Y) ) ) ) ). % 0.50/0.62 % 0.50/0.62 %----Super cc % 0.50/0.62 fof(axiom_3,axiom, % 0.50/0.62 ! [X] : % 0.50/0.62 ( cc(X) % 0.50/0.62 => cdxcomp(X) ) ). % 0.50/0.62 % 0.50/0.62 %----Equality cd % 0.50/0.62 fof(axiom_4,axiom, % 0.50/0.62 ! [X] : % 0.50/0.62 ( cd(X) % 0.50/0.62 <=> ? [Y0] : ra_Px2(X,Y0) ) ). % 0.50/0.62 % 0.50/0.62 %----Equality cdxcomp % 0.50/0.62 fof(axiom_5,axiom, % 0.50/0.62 ! [X] : % 0.50/0.62 ( cdxcomp(X) % 0.50/0.62 <=> ~ ? [Y] : ra_Px2(X,Y) ) ). % 0.50/0.62 % 0.50/0.62 %----Equality ce % 0.50/0.62 fof(axiom_6,axiom, % 0.50/0.62 ! [X] : % 0.50/0.62 ( ce(X) % 0.50/0.62 <=> ~ ? [Y] : ra_Px1(X,Y) ) ). % 0.50/0.62 % 0.50/0.62 %----Equality cexcomp % 0.50/0.62 fof(axiom_7,axiom, % 0.50/0.62 ! [X] : % 0.50/0.62 ( cexcomp(X) % 0.50/0.62 <=> ? [Y0] : ra_Px1(X,Y0) ) ). % 0.50/0.62 % 0.50/0.62 %----Equality ca_Cx4 % 0.50/0.62 fof(axiom_8,axiom, % 0.50/0.62 ! [X] : % 0.50/0.62 ( ca_Cx4(X) % 0.50/0.62 <=> ? [Y0] : ra_Px4(X,Y0) ) ). % 0.50/0.62 % 0.50/0.62 %----Equality ca_Cx4xcomp % 0.50/0.62 fof(axiom_9,axiom, % 0.50/0.62 ! [X] : % 0.50/0.62 ( ca_Cx4xcomp(X) % 0.50/0.62 <=> ~ ? [Y] : ra_Px4(X,Y) ) ). % 0.50/0.62 % 0.50/0.62 %----Equality ca_Cx4xcomp % 0.50/0.62 fof(axiom_10,axiom, % 0.50/0.62 ! [X] : % 0.50/0.62 ( ca_Cx4xcomp(X) % 0.50/0.62 <=> ( cd(X) % 0.50/0.62 & cexcomp(X) ) ) ). % 0.50/0.62 % 0.50/0.62 %----i2003_11_14_17_22_31584 % 0.50/0.62 fof(axiom_11,axiom, % 0.50/0.62 cUnsatisfiable(i2003_11_14_17_22_31584) ). % 0.50/0.62 % 0.50/0.62 %------------------------------------------------------------------------------ % 0.50/0.62 %------------------------------------------- % 0.50/0.62 % Proof found % 0.50/0.62 % SZS status Theorem for theBenchmark % 0.50/0.62 % SZS output start Proof % 0.50/0.62 %ClaNum:28(EqnAxiom:0) % 0.50/0.62 %VarNum:91(SingletonVarNum:39) % 0.50/0.62 %MaxLitNum:5 % 0.50/0.62 %MaxfuncDepth:1 % 0.50/0.62 %SharedTerms:2 % 0.50/0.62 [1]P1(a1) % 0.50/0.62 [2]~P2(x21) % 0.50/0.62 [3]P11(x31)+P10(x31) % 0.50/0.62 [4]~P4(x41)+P3(x41) % 0.50/0.62 [5]~P4(x51)+P6(x51) % 0.50/0.62 [6]~P7(x61)+P8(x61) % 0.50/0.62 [7]~P11(x71)+~P10(x71) % 0.50/0.62 [8]~P1(x81)+P3(f2(x81)) % 0.50/0.62 [10]P8(x101)+P12(x101,f3(x101)) % 0.50/0.62 [11]P9(x111)+P13(x111,f7(x111)) % 0.50/0.62 [12]P4(x121)+P14(x121,f8(x121)) % 0.50/0.62 [16]~P1(x161)+P15(x161,f2(x161)) % 0.50/0.62 [17]~P6(x171)+P12(x171,f4(x171)) % 0.50/0.62 [18]~P3(x181)+P13(x181,f9(x181)) % 0.50/0.62 [19]~P5(x191)+P14(x191,f10(x191)) % 0.50/0.62 [13]P3(x131)+~P13(x131,x132) % 0.50/0.62 [14]P6(x141)+~P12(x141,x142) % 0.50/0.62 [15]P5(x151)+~P14(x151,x152) % 0.50/0.62 [20]~P8(x201)+~P12(x201,x202) % 0.50/0.62 [21]~P9(x211)+~P13(x211,x212) % 0.50/0.62 [22]~P4(x221)+~P14(x221,x222) % 0.50/0.62 [9]~P3(x91)+~P6(x91)+P4(x91) % 0.50/0.62 [23]~P15(x232,x231)+P6(x231)+~P1(x232) % 0.50/0.62 [24]~P15(x242,x241)+P5(x241)+~P1(x242) % 0.50/0.62 [25]~P15(x251,x252)+P1(x251)+~P3(x252)+~P6(f5(x251))+~P5(f6(x251)) % 0.50/0.62 [26]~P15(x261,x262)+P1(x261)+~P3(x262)+P15(x261,f5(x261))+~P5(f6(x261)) % 0.50/0.62 [27]~P15(x271,x272)+P1(x271)+~P3(x272)+P15(x271,f6(x271))+~P6(f5(x271)) % 0.50/0.62 [28]~P15(x281,x282)+P1(x281)+~P3(x282)+P15(x281,f5(x281))+P15(x281,f6(x281)) % 0.50/0.62 %EqnAxiom % 0.50/0.62 % 0.50/0.62 %------------------------------------------- % 0.50/0.63 cnf(32,plain, % 0.50/0.63 (P13(f2(a1),f9(f2(a1)))), % 0.50/0.63 inference(scs_inference,[],[1,8,18])). % 0.50/0.63 cnf(33,plain, % 0.50/0.63 (~P6(f2(a1))+P4(f2(a1))), % 0.50/0.63 inference(scs_inference,[],[32,13,9])). % 0.50/0.63 cnf(39,plain, % 0.50/0.63 (P6(f2(a1))), % 0.50/0.63 inference(scs_inference,[],[1,16,23])). % 0.50/0.63 cnf(40,plain, % 0.50/0.63 (P4(f2(a1))), % 0.50/0.63 inference(scs_inference,[],[39,33])). % 0.50/0.63 cnf(48,plain, % 0.50/0.63 ($false), % 0.50/0.63 inference(scs_inference,[],[40,1,22,19,24,16]), % 0.50/0.63 ['proof']). % 0.50/0.63 % SZS output end Proof % 0.50/0.63 % Total time :0.020000s %------------------------------------------------------------------------------