%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : KRS093+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 : n020.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:28 EDT 2024 % Result : Unsatisfiable 0.49s 0.59s % Output : CNFRefutation 0.49s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.10 % Problem : KRS093+1 : TPTP v8.2.0. Released v3.1.0. % 0.04/0.10 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.10/0.31 % Computer : n020.cluster.edu % 0.10/0.31 % Model : x86_64 x86_64 % 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.31 % Memory : 8042.1875MB % 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64 % 0.10/0.31 % CPULimit : 300 % 0.10/0.31 % WCLimit : 300 % 0.10/0.31 % DateTime : Wed Jun 19 14:22:54 EDT 2024 % 0.10/0.31 % CPUTime : % 0.16/0.55 start to proof:theBenchmark % 0.49/0.59 %------------------------------------------- % 0.49/0.59 % File :CSE---1.7 % 0.49/0.59 % Problem :theBenchmark % 0.49/0.59 % Transform :cnf % 0.49/0.59 % Format :tptp:raw % 0.49/0.59 % Command :java -jar mcs_scs.jar %d %s % 0.49/0.59 % 0.49/0.59 % Result :Theorem 0.000000s % 0.49/0.59 % Output :CNFRefutation 0.000000s % 0.49/0.59 %------------------------------------------- % 0.49/0.59 %------------------------------------------------------------------------------ % 0.49/0.59 % File : KRS093+1 : TPTP v8.2.0. Released v3.1.0. % 0.49/0.59 % Domain : Knowledge Representation (Semantic Web) % 0.49/0.59 % Problem : DL Test: heinsohn1.3 % 0.49/0.59 % Version : Especial. % 0.49/0.59 % English : Tbox tests from [HK+94] % 0.49/0.59 % 0.49/0.59 % Refs : [HK+94] Heinsohn et al. (1994), An Empirical Analysis of Termi % 0.49/0.59 % : [Bec03] Bechhofer (2003), Email to G. Sutcliffe % 0.49/0.59 % : [TR+04] Tsarkov et al. (2004), Using Vampire to Reason with OW % 0.49/0.59 % Source : [Bec03] % 0.49/0.59 % Names : inconsistent_description-logic-Manifest103 [Bec03] % 0.49/0.59 % 0.49/0.59 % Status : Unsatisfiable % 0.49/0.59 % Rating : 0.00 v3.1.0 % 0.49/0.59 % Syntax : Number of formulae : 9 ( 1 unt; 0 def) % 0.49/0.59 % Number of atoms : 18 ( 0 equ) % 0.49/0.59 % Maximal formula atoms : 3 ( 2 avg) % 0.49/0.59 % Number of connectives : 13 ( 4 ~; 0 |; 2 &) % 0.49/0.59 % ( 2 <=>; 5 =>; 0 <=; 0 <~>) % 0.49/0.59 % Maximal formula depth : 4 ( 3 avg) % 0.49/0.59 % Maximal term depth : 1 ( 1 avg) % 0.49/0.59 % Number of predicates : 11 ( 11 usr; 0 prp; 1-1 aty) % 0.49/0.59 % Number of functors : 1 ( 1 usr; 1 con; 0-0 aty) % 0.49/0.59 % Number of variables : 8 ( 8 !; 0 ?) % 0.49/0.59 % SPC : FOF_UNS_EPR_NEQ % 0.49/0.59 % 0.49/0.59 % Comments : Sean Bechhofer says there are some errors in the encoding of % 0.49/0.59 % datatypes, so this problem may not be perfect. At least it's % 0.49/0.59 % still representative of the type of reasoning required for OWL. % 0.49/0.59 % : Tests incoherency caused by disjoint concept % 0.49/0.59 %------------------------------------------------------------------------------ % 0.49/0.59 %----Thing and Nothing % 0.49/0.59 fof(axiom_0,axiom, % 0.49/0.59 ! [X] : % 0.49/0.59 ( cowlThing(X) % 0.49/0.59 & ~ cowlNothing(X) ) ). % 0.49/0.59 % 0.49/0.59 %----String and Integer disjoint % 0.49/0.59 fof(axiom_1,axiom, % 0.49/0.59 ! [X] : % 0.49/0.59 ( xsd_string(X) % 0.49/0.59 <=> ~ xsd_integer(X) ) ). % 0.49/0.59 % 0.49/0.59 %----Equality cUnsatisfiable % 0.49/0.59 fof(axiom_2,axiom, % 0.49/0.59 ! [X] : % 0.49/0.59 ( cUnsatisfiable(X) % 0.49/0.59 <=> ( cf(X) % 0.49/0.59 & ce3(X) ) ) ). % 0.49/0.59 % 0.49/0.59 %----Super cc % 0.49/0.59 fof(axiom_3,axiom, % 0.49/0.59 ! [X] : % 0.49/0.59 ( cc(X) % 0.49/0.59 => ~ cd(X) ) ). % 0.49/0.59 % 0.49/0.59 %----Super cc1 % 0.49/0.59 fof(axiom_4,axiom, % 0.49/0.59 ! [X] : % 0.49/0.59 ( cc1(X) % 0.49/0.59 => ~ cd1(X) ) ). % 0.49/0.59 % 0.49/0.59 %----Super cc1 % 0.49/0.59 fof(axiom_5,axiom, % 0.49/0.59 ! [X] : % 0.49/0.59 ( cc1(X) % 0.49/0.59 => cd1(X) ) ). % 0.49/0.59 % 0.49/0.59 %----Super ce3 % 0.49/0.59 fof(axiom_6,axiom, % 0.49/0.59 ! [X] : % 0.49/0.59 ( ce3(X) % 0.49/0.59 => cc(X) ) ). % 0.49/0.59 % 0.49/0.59 %----Super cf % 0.49/0.59 fof(axiom_7,axiom, % 0.49/0.59 ! [X] : % 0.49/0.59 ( cf(X) % 0.49/0.59 => cd(X) ) ). % 0.49/0.59 % 0.49/0.59 %----i2003_11_14_17_20_07201 % 0.49/0.59 fof(axiom_8,axiom, % 0.49/0.59 cUnsatisfiable(i2003_11_14_17_20_07201) ). % 0.49/0.59 % 0.49/0.59 %------------------------------------------------------------------------------ % 0.49/0.59 %------------------------------------------- % 0.49/0.59 % Proof found % 0.49/0.59 % SZS status Theorem for theBenchmark % 0.49/0.59 % SZS output start Proof % 0.49/0.59 %ClaNum:12(EqnAxiom:0) % 0.49/0.59 %VarNum:22(SingletonVarNum:11) % 0.49/0.59 %MaxLitNum:3 % 0.49/0.59 %MaxfuncDepth:0 % 0.49/0.59 %SharedTerms:2 % 0.49/0.59 [1]P1(a1) % 0.49/0.59 [2]~P2(x21) % 0.49/0.59 [3]P10(x31)+P9(x31) % 0.49/0.59 [4]~P1(x41)+P3(x41) % 0.49/0.59 [5]~P1(x51)+P4(x51) % 0.49/0.59 [6]~P4(x61)+P5(x61) % 0.49/0.59 [7]~P3(x71)+P6(x71) % 0.49/0.59 [8]~P7(x81)+P8(x81) % 0.49/0.59 [9]~P10(x91)+~P9(x91) % 0.49/0.59 [10]~P6(x101)+~P5(x101) % 0.49/0.59 [11]~P8(x111)+~P7(x111) % 0.49/0.59 [12]~P3(x121)+~P4(x121)+P1(x121) % 0.49/0.59 %EqnAxiom % 0.49/0.59 % 0.49/0.59 %------------------------------------------- % 0.49/0.60 cnf(14,plain, % 0.49/0.60 (P6(a1)), % 0.49/0.60 inference(scs_inference,[],[1,4,7])). % 0.49/0.60 cnf(15,plain, % 0.49/0.60 (P5(a1)), % 0.49/0.60 inference(scs_inference,[],[1,5,6])). % 0.49/0.60 cnf(16,plain, % 0.49/0.60 ($false), % 0.49/0.60 inference(scs_inference,[],[14,15,10]), % 0.49/0.60 ['proof']). % 0.49/0.60 % SZS output end Proof % 0.49/0.60 % Total time :0.000000s %------------------------------------------------------------------------------