TSTP Solution File: KRS141+1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : KRS141+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 : n007.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:25 EDT 2023
% Result : Theorem 0.20s 0.69s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : KRS141+1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.13/0.35 % Computer : n007.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Aug 28 01:38:42 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.61 start to proof:theBenchmark
% 0.20/0.68 %-------------------------------------------
% 0.20/0.68 % File :CSE---1.6
% 0.20/0.68 % Problem :theBenchmark
% 0.20/0.68 % Transform :cnf
% 0.20/0.68 % Format :tptp:raw
% 0.20/0.68 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.68
% 0.20/0.68 % Result :Theorem 0.010000s
% 0.20/0.68 % Output :CNFRefutation 0.010000s
% 0.20/0.68 %-------------------------------------------
% 0.20/0.68 %------------------------------------------------------------------------------
% 0.20/0.68 % File : KRS141+1 : TPTP v8.1.2. Released v3.1.0.
% 0.20/0.68 % Domain : Knowledge Representation (Semantic Web)
% 0.20/0.68 % Problem : A simple example
% 0.20/0.68 % Version : Especial.
% 0.20/0.68 % English :
% 0.20/0.68
% 0.20/0.68 % Refs : [Bec03] Bechhofer (2003), Email to G. Sutcliffe
% 0.20/0.68 % : [TR+04] Tsarkov et al. (2004), Using Vampire to Reason with OW
% 0.20/0.68 % Source : [Bec03]
% 0.20/0.68 % Names : positive_allValuesFrom-Manifest001 [Bec03]
% 0.20/0.68
% 0.20/0.68 % Status : Theorem
% 0.20/0.68 % Rating : 0.00 v3.1.0
% 0.20/0.68 % Syntax : Number of formulae : 8 ( 4 unt; 0 def)
% 0.20/0.68 % Number of atoms : 17 ( 0 equ)
% 0.20/0.68 % Maximal formula atoms : 6 ( 2 avg)
% 0.20/0.68 % Number of connectives : 13 ( 4 ~; 0 |; 5 &)
% 0.20/0.68 % ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% 0.20/0.68 % Maximal formula depth : 6 ( 3 avg)
% 0.20/0.68 % Maximal term depth : 1 ( 1 avg)
% 0.20/0.68 % Number of predicates : 7 ( 7 usr; 0 prp; 1-2 aty)
% 0.20/0.68 % Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% 0.20/0.68 % Number of variables : 6 ( 6 !; 0 ?)
% 0.20/0.68 % SPC : FOF_THM_EPR_NEQ
% 0.20/0.68
% 0.20/0.68 % Comments : Sean Bechhofer says there are some errors in the encoding of
% 0.20/0.68 % datatypes, so this problem may not be perfect. At least it's
% 0.20/0.68 % still representative of the type of reasoning required for OWL.
% 0.20/0.68 %------------------------------------------------------------------------------
% 0.20/0.68 %----Thing and Nothing
% 0.20/0.68 fof(axiom_0,axiom,
% 0.20/0.68 ! [X] :
% 0.20/0.68 ( cowlThing(X)
% 0.20/0.68 & ~ cowlNothing(X) ) ).
% 0.20/0.68
% 0.20/0.68 %----String and Integer disjoint
% 0.20/0.68 fof(axiom_1,axiom,
% 0.20/0.68 ! [X] :
% 0.20/0.68 ( xsd_string(X)
% 0.20/0.68 <=> ~ xsd_integer(X) ) ).
% 0.20/0.68
% 0.20/0.68 %----Super cr
% 0.20/0.68 fof(axiom_2,axiom,
% 0.20/0.68 ! [X] :
% 0.20/0.68 ( cr(X)
% 0.20/0.68 => ! [Y] :
% 0.20/0.68 ( rp(X,Y)
% 0.20/0.68 => cc(Y) ) ) ).
% 0.20/0.68
% 0.20/0.68 %----ii
% 0.20/0.68 fof(axiom_3,axiom,
% 0.20/0.68 cr(ii) ).
% 0.20/0.68
% 0.20/0.68 %----ii
% 0.20/0.68 fof(axiom_4,axiom,
% 0.20/0.68 cowlThing(ii) ).
% 0.20/0.68
% 0.20/0.68 fof(axiom_5,axiom,
% 0.20/0.69 rp(ii,io) ).
% 0.20/0.69
% 0.20/0.69 %----io
% 0.20/0.69 fof(axiom_6,axiom,
% 0.20/0.69 cowlThing(io) ).
% 0.20/0.69
% 0.20/0.69 %----Thing and Nothing
% 0.20/0.69 %----String and Integer disjoint
% 0.20/0.69 %----io
% 0.20/0.69 %----io
% 0.20/0.69 fof(the_axiom,conjecture,
% 0.20/0.69 ( ! [X] :
% 0.20/0.69 ( cowlThing(X)
% 0.20/0.69 & ~ cowlNothing(X) )
% 0.20/0.69 & ! [X] :
% 0.20/0.69 ( xsd_string(X)
% 0.20/0.69 <=> ~ xsd_integer(X) )
% 0.20/0.69 & cc(io)
% 0.20/0.69 & cowlThing(io) ) ).
% 0.20/0.69
% 0.20/0.69 %------------------------------------------------------------------------------
% 0.20/0.69 %-------------------------------------------
% 0.20/0.69 % Proof found
% 0.20/0.69 % SZS status Theorem for theBenchmark
% 0.20/0.69 % SZS output start Proof
% 0.20/0.69 %ClaNum:8(EqnAxiom:0)
% 0.20/0.69 %VarNum:9(SingletonVarNum:5)
% 0.20/0.69 %MaxLitNum:4
% 0.20/0.69 %MaxfuncDepth:0
% 0.20/0.69 %SharedTerms:12
% 0.20/0.69 %goalClause: 6 7
% 0.20/0.69 [1]P1(a1)
% 0.20/0.69 [2]P4(a1,a4)
% 0.20/0.69 [3]~P2(x31)
% 0.20/0.69 [4]P6(x41)+P5(x41)
% 0.20/0.69 [5]~P6(x51)+~P5(x51)
% 0.20/0.69 [8]~P4(x82,x81)+P3(x81)+~P1(x82)
% 0.20/0.69 [6]P2(a2)+P5(a3)+~P6(a3)+~P3(a4)
% 0.20/0.69 [7]P2(a2)+P6(a3)+~P5(a3)+~P3(a4)
% 0.20/0.69 %EqnAxiom
% 0.20/0.69
% 0.20/0.69 %-------------------------------------------
% 0.20/0.69 cnf(9,plain,
% 0.20/0.69 (P3(a4)),
% 0.20/0.69 inference(scs_inference,[],[1,2,8])).
% 0.20/0.69 cnf(10,plain,
% 0.20/0.69 (~P6(a3)+P5(a3)),
% 0.20/0.69 inference(scs_inference,[],[9,3,6])).
% 0.20/0.69 cnf(11,plain,
% 0.20/0.69 (~P5(a3)+P6(a3)),
% 0.20/0.69 inference(scs_inference,[],[9,3,7])).
% 0.20/0.69 cnf(15,plain,
% 0.20/0.69 (P6(a3)),
% 0.20/0.69 inference(scs_inference,[],[4,11])).
% 0.20/0.69 cnf(16,plain,
% 0.20/0.69 (P5(a3)),
% 0.20/0.69 inference(scs_inference,[],[15,10])).
% 0.20/0.69 cnf(17,plain,
% 0.20/0.69 (~P5(a3)),
% 0.20/0.69 inference(scs_inference,[],[15,5])).
% 0.20/0.69 cnf(19,plain,
% 0.20/0.69 ($false),
% 0.20/0.69 inference(scs_inference,[],[16,17]),
% 0.20/0.69 ['proof']).
% 0.20/0.69 % SZS output end Proof
% 0.20/0.69 % Total time :0.010000s
%------------------------------------------------------------------------------