TSTP Solution File: KRS166+1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : KRS166+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 : n006.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:31 EDT 2023
% Result : Theorem 0.21s 0.66s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : KRS166+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.14 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.14/0.35 % Computer : n006.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Aug 28 02:18:36 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.57 start to proof:theBenchmark
% 0.21/0.65 %-------------------------------------------
% 0.21/0.65 % File :CSE---1.6
% 0.21/0.65 % Problem :theBenchmark
% 0.21/0.65 % Transform :cnf
% 0.21/0.65 % Format :tptp:raw
% 0.21/0.65 % Command :java -jar mcs_scs.jar %d %s
% 0.21/0.65
% 0.21/0.65 % Result :Theorem 0.030000s
% 0.21/0.65 % Output :CNFRefutation 0.030000s
% 0.21/0.65 %-------------------------------------------
% 0.21/0.66 %------------------------------------------------------------------------------
% 0.21/0.66 % File : KRS166+1 : TPTP v8.1.2. Released v3.1.0.
% 0.21/0.66 % Domain : Knowledge Representation (Semantic Web)
% 0.21/0.66 % Problem : Two classes may be different names for the same set of individuals
% 0.21/0.66 % Version : Especial.
% 0.21/0.66 % English :
% 0.21/0.66
% 0.21/0.66 % Refs : [Bec03] Bechhofer (2003), Email to G. Sutcliffe
% 0.21/0.66 % : [TR+04] Tsarkov et al. (2004), Using Vampire to Reason with OW
% 0.21/0.66 % Source : [Bec03]
% 0.21/0.66 % Names : positive_equivalentClass-Manifest003 [Bec03]
% 0.21/0.66
% 0.21/0.66 % Status : Theorem
% 0.21/0.66 % Rating : 0.00 v5.3.0, 0.09 v5.2.0, 0.00 v3.1.0
% 0.21/0.66 % Syntax : Number of formulae : 5 ( 0 unt; 0 def)
% 0.21/0.66 % Number of atoms : 14 ( 0 equ)
% 0.21/0.66 % Maximal formula atoms : 6 ( 2 avg)
% 0.21/0.66 % Number of connectives : 13 ( 4 ~; 0 |; 4 &)
% 0.21/0.66 % ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% 0.21/0.66 % Maximal formula depth : 6 ( 4 avg)
% 0.21/0.66 % Maximal term depth : 1 ( 1 avg)
% 0.21/0.66 % Number of predicates : 6 ( 6 usr; 0 prp; 1-1 aty)
% 0.21/0.66 % Number of functors : 0 ( 0 usr; 0 con; --- aty)
% 0.21/0.66 % Number of variables : 7 ( 7 !; 0 ?)
% 0.21/0.66 % SPC : FOF_THM_EPR_NEQ
% 0.21/0.66
% 0.21/0.66 % Comments : Sean Bechhofer says there are some errors in the encoding of
% 0.21/0.66 % datatypes, so this problem may not be perfect. At least it's
% 0.21/0.66 % still representative of the type of reasoning required for OWL.
% 0.21/0.66 %------------------------------------------------------------------------------
% 0.21/0.66 %----Thing and Nothing
% 0.21/0.66 fof(axiom_0,axiom,
% 0.21/0.66 ! [X] :
% 0.21/0.66 ( cowlThing(X)
% 0.21/0.66 & ~ cowlNothing(X) ) ).
% 0.21/0.66
% 0.21/0.66 %----String and Integer disjoint
% 0.21/0.66 fof(axiom_1,axiom,
% 0.21/0.66 ! [X] :
% 0.21/0.66 ( xsd_string(X)
% 0.21/0.66 <=> ~ xsd_integer(X) ) ).
% 0.21/0.66
% 0.21/0.66 %----Super cAutomobile
% 0.21/0.66 fof(axiom_2,axiom,
% 0.21/0.66 ! [X] :
% 0.21/0.66 ( cAutomobile(X)
% 0.21/0.66 => cCar(X) ) ).
% 0.21/0.66
% 0.21/0.66 %----Super cCar
% 0.21/0.66 fof(axiom_3,axiom,
% 0.21/0.66 ! [X] :
% 0.21/0.66 ( cCar(X)
% 0.21/0.66 => cAutomobile(X) ) ).
% 0.21/0.66
% 0.21/0.66 %----Thing and Nothing
% 0.21/0.66 %----String and Integer disjoint
% 0.21/0.66 %----Equality cCar
% 0.21/0.66 fof(the_axiom,conjecture,
% 0.21/0.66 ( ! [X] :
% 0.21/0.66 ( cowlThing(X)
% 0.21/0.66 & ~ cowlNothing(X) )
% 0.21/0.66 & ! [X] :
% 0.21/0.66 ( xsd_string(X)
% 0.21/0.66 <=> ~ xsd_integer(X) )
% 0.21/0.66 & ! [X] :
% 0.21/0.66 ( cCar(X)
% 0.21/0.66 <=> cAutomobile(X) ) ) ).
% 0.21/0.66
% 0.21/0.66 %------------------------------------------------------------------------------
% 0.21/0.66 %-------------------------------------------
% 0.21/0.66 % Proof found
% 0.21/0.66 % SZS status Theorem for theBenchmark
% 0.21/0.66 % SZS output start Proof
% 0.21/0.66 %ClaNum:9(EqnAxiom:0)
% 0.21/0.66 %VarNum:9(SingletonVarNum:5)
% 0.21/0.66 %MaxLitNum:5
% 0.21/0.66 %MaxfuncDepth:0
% 0.21/0.66 %SharedTerms:12
% 0.21/0.66 %goalClause: 6 7 8 9
% 0.21/0.66 [1]~P1(x11)
% 0.21/0.66 [2]P5(x21)+P4(x21)
% 0.21/0.66 [3]~P3(x31)+P2(x31)
% 0.21/0.66 [4]~P2(x41)+P3(x41)
% 0.21/0.66 [5]~P5(x51)+~P4(x51)
% 0.21/0.66 [6]P1(a1)+P4(a2)+P2(a3)+P3(a3)+~P5(a2)
% 0.21/0.66 [7]P1(a1)+P5(a2)+P2(a3)+P3(a3)+~P4(a2)
% 0.21/0.66 [8]P1(a1)+P4(a2)+~P5(a2)+~P2(a3)+~P3(a3)
% 0.21/0.66 [9]P1(a1)+P5(a2)+~P4(a2)+~P2(a3)+~P3(a3)
% 0.21/0.66 %EqnAxiom
% 0.21/0.66
% 0.21/0.66 %-------------------------------------------
% 0.21/0.66 cnf(10,plain,
% 0.21/0.66 (P2(a3)+P3(a3)+~P5(a2)+P4(a2)),
% 0.21/0.66 inference(scs_inference,[],[1,6])).
% 0.21/0.66 cnf(11,plain,
% 0.21/0.66 (P2(a3)+P3(a3)+~P4(a2)+P5(a2)),
% 0.21/0.66 inference(scs_inference,[],[1,7])).
% 0.21/0.66 cnf(12,plain,
% 0.21/0.66 (~P5(a2)+~P2(a3)+~P3(a3)+P4(a2)),
% 0.21/0.66 inference(scs_inference,[],[1,8])).
% 0.21/0.66 cnf(13,plain,
% 0.21/0.66 (~P4(a2)+~P2(a3)+~P3(a3)+P5(a2)),
% 0.21/0.66 inference(scs_inference,[],[1,9])).
% 0.21/0.66 cnf(17,plain,
% 0.21/0.66 (P3(a3)+P2(a3)+P5(a2)),
% 0.21/0.66 inference(scs_inference,[],[2,11])).
% 0.21/0.66 cnf(18,plain,
% 0.21/0.66 (~P4(a2)+P2(a3)+P3(a3)),
% 0.21/0.66 inference(scs_inference,[],[17,5])).
% 0.21/0.66 cnf(19,plain,
% 0.21/0.66 (P2(a3)+~P4(a2)),
% 0.21/0.66 inference(scs_inference,[],[18,3])).
% 0.21/0.66 cnf(20,plain,
% 0.21/0.66 (P5(a2)+P2(a3)),
% 0.21/0.66 inference(scs_inference,[],[19,2])).
% 0.21/0.66 cnf(21,plain,
% 0.21/0.66 (P3(a3)+P5(a2)),
% 0.21/0.66 inference(scs_inference,[],[20,4])).
% 0.21/0.66 cnf(22,plain,
% 0.21/0.66 (~P4(a2)+P3(a3)),
% 0.21/0.66 inference(scs_inference,[],[21,5])).
% 0.21/0.66 cnf(23,plain,
% 0.21/0.66 (~P4(a2)+~P2(a3)+P5(a2)),
% 0.21/0.66 inference(scs_inference,[],[22,13])).
% 0.21/0.66 cnf(24,plain,
% 0.21/0.66 (~P4(a2)+~P2(a3)),
% 0.21/0.66 inference(scs_inference,[],[23,5])).
% 0.21/0.66 cnf(25,plain,
% 0.21/0.66 (~P3(a3)+~P4(a2)),
% 0.21/0.66 inference(scs_inference,[],[24,3])).
% 0.21/0.66 cnf(26,plain,
% 0.21/0.66 (P5(a2)+~P3(a3)),
% 0.21/0.66 inference(scs_inference,[],[25,2])).
% 0.21/0.66 cnf(27,plain,
% 0.21/0.66 (~P2(a3)+P5(a2)),
% 0.21/0.66 inference(scs_inference,[],[26,4])).
% 0.21/0.67 cnf(28,plain,
% 0.21/0.67 (~P2(a3)+~P3(a3)+P4(a2)),
% 0.21/0.67 inference(scs_inference,[],[27,12])).
% 0.21/0.67 cnf(29,plain,
% 0.21/0.67 (~P3(a3)+~P2(a3)),
% 0.21/0.67 inference(scs_inference,[],[28,24])).
% 0.21/0.67 cnf(30,plain,
% 0.21/0.67 (~P3(a3)),
% 0.21/0.67 inference(scs_inference,[],[29,3])).
% 0.21/0.67 cnf(31,plain,
% 0.21/0.67 (P4(a2)+~P5(a2)+P2(a3)),
% 0.21/0.67 inference(scs_inference,[],[30,10])).
% 0.21/0.67 cnf(33,plain,
% 0.21/0.67 (~P4(a2)),
% 0.21/0.67 inference(scs_inference,[],[30,22])).
% 0.21/0.67 cnf(36,plain,
% 0.21/0.67 (~P5(a2)+P4(a2)),
% 0.21/0.67 inference(scs_inference,[],[30,4,31])).
% 0.21/0.67 cnf(40,plain,
% 0.21/0.67 ($false),
% 0.21/0.67 inference(scs_inference,[],[33,36,2]),
% 0.21/0.67 ['proof']).
% 0.21/0.67 % SZS output end Proof
% 0.21/0.67 % Total time :0.030000s
%------------------------------------------------------------------------------