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