TSTP Solution File: KRS134+1 by CSE---1.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE---1.6
% Problem  : KRS134+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d

% Computer : n011.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:23 EDT 2023

% Result   : Theorem 0.19s 0.62s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : KRS134+1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.13/0.34  % Computer : n011.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 01:42:55 EDT 2023
% 0.13/0.34  % CPUTime    : 
% 0.19/0.56  start to proof:theBenchmark
% 0.19/0.62  %-------------------------------------------
% 0.19/0.62  % File        :CSE---1.6
% 0.19/0.62  % Problem     :theBenchmark
% 0.19/0.62  % Transform   :cnf
% 0.19/0.62  % Format      :tptp:raw
% 0.19/0.62  % Command     :java -jar mcs_scs.jar %d %s
% 0.19/0.62  
% 0.19/0.62  % Result      :Theorem 0.000000s
% 0.19/0.62  % Output      :CNFRefutation 0.000000s
% 0.19/0.62  %-------------------------------------------
% 0.19/0.62  %------------------------------------------------------------------------------
% 0.19/0.62  % File     : KRS134+1 : TPTP v8.1.2. Released v3.1.0.
% 0.19/0.62  % Domain   : Knowledge Representation (Semantic Web)
% 0.19/0.62  % Problem  : This is a typical definition of range from description logic
% 0.19/0.62  % Version  : Especial.
% 0.19/0.62  % English  :
% 0.19/0.62  
% 0.19/0.62  % Refs     : [Bec03] Bechhofer (2003), Email to G. Sutcliffe
% 0.19/0.62  %          : [TR+04] Tsarkov et al. (2004), Using Vampire to Reason with OW
% 0.19/0.62  % Source   : [Bec03]
% 0.19/0.62  % Names    : positive_I5.24-Manifest003 [Bec03]
% 0.19/0.62  
% 0.19/0.62  % Status   : Theorem
% 0.19/0.62  % Rating   : 0.00 v5.3.0, 0.09 v5.2.0, 0.00 v3.1.0
% 0.19/0.62  % Syntax   : Number of formulae    :    4 (   0 unt;   0 def)
% 0.19/0.62  %            Number of atoms       :   13 (   0 equ)
% 0.19/0.62  %            Maximal formula atoms :    7 (   3 avg)
% 0.19/0.62  %            Number of connectives :   13 (   4   ~;   0   |;   4   &)
% 0.19/0.62  %                                         (   2 <=>;   3  =>;   0  <=;   0 <~>)
% 0.19/0.62  %            Maximal formula depth :    7 (   5 avg)
% 0.19/0.62  %            Maximal term depth    :    1 (   1 avg)
% 0.19/0.62  %            Number of predicates  :    6 (   6 usr;   0 prp; 1-2 aty)
% 0.19/0.62  %            Number of functors    :    0 (   0 usr;   0 con; --- aty)
% 0.19/0.62  %            Number of variables   :    8 (   8   !;   0   ?)
% 0.19/0.62  % SPC      : FOF_THM_EPR_NEQ
% 0.19/0.62  
% 0.19/0.62  % Comments : Sean Bechhofer says there are some errors in the encoding of
% 0.19/0.62  %            datatypes, so this problem may not be perfect. At least it's
% 0.19/0.62  %            still representative of the type of reasoning required for OWL.
% 0.19/0.62  %------------------------------------------------------------------------------
% 0.19/0.62  %----Thing and Nothing
% 0.19/0.62  fof(axiom_0,axiom,
% 0.19/0.62      ! [X] :
% 0.19/0.62        ( cowlThing(X)
% 0.19/0.62        & ~ cowlNothing(X) ) ).
% 0.19/0.62  
% 0.19/0.62  %----String and Integer disjoint
% 0.19/0.62  fof(axiom_1,axiom,
% 0.19/0.62      ! [X] :
% 0.19/0.62        ( xsd_string(X)
% 0.19/0.62      <=> ~ xsd_integer(X) ) ).
% 0.19/0.62  
% 0.19/0.62  %----Range: rprop
% 0.19/0.62  fof(axiom_2,axiom,
% 0.19/0.62      ! [X,Y] :
% 0.19/0.62        ( rprop(X,Y)
% 0.19/0.62       => cA(Y) ) ).
% 0.19/0.62  
% 0.19/0.62  %----Thing and Nothing
% 0.19/0.62  %----String and Integer disjoint
% 0.19/0.62  %----Super cowlThing
% 0.19/0.62  fof(the_axiom,conjecture,
% 0.19/0.62      ( ! [X] :
% 0.19/0.62          ( cowlThing(X)
% 0.19/0.62          & ~ cowlNothing(X) )
% 0.19/0.62      & ! [X] :
% 0.19/0.62          ( xsd_string(X)
% 0.19/0.62        <=> ~ xsd_integer(X) )
% 0.19/0.62      & ! [X] :
% 0.19/0.62          ( cowlThing(X)
% 0.19/0.62         => ! [Y] :
% 0.19/0.62              ( rprop(X,Y)
% 0.19/0.62             => cA(Y) ) ) ) ).
% 0.19/0.62  
% 0.19/0.62  %------------------------------------------------------------------------------
% 0.19/0.62  %-------------------------------------------
% 0.19/0.62  % Proof found
% 0.19/0.62  % SZS status Theorem for theBenchmark
% 0.19/0.62  % SZS output start Proof
% 0.19/0.62  %ClaNum:8(EqnAxiom:0)
% 0.19/0.62  %VarNum:8(SingletonVarNum:5)
% 0.19/0.62  %MaxLitNum:4
% 0.19/0.62  %MaxfuncDepth:0
% 0.19/0.62  %SharedTerms:11
% 0.19/0.62  %goalClause: 4 5 6 7
% 0.19/0.62  [1]~P1(x11)
% 0.19/0.62  [2]P4(x21)+P3(x21)
% 0.19/0.62  [3]~P4(x31)+~P3(x31)
% 0.19/0.62  [8]P2(x81)+~P5(x82,x81)
% 0.19/0.62  [4]P1(a1)+P3(a2)+~P4(a2)+~P2(a3)
% 0.19/0.62  [5]P1(a1)+P4(a2)+~P3(a2)+~P2(a3)
% 0.19/0.62  [6]P1(a1)+P3(a2)+P5(a4,a3)+~P4(a2)
% 0.19/0.62  [7]P5(a4,a3)+P1(a1)+P4(a2)+~P3(a2)
% 0.19/0.62  %EqnAxiom
% 0.19/0.62  
% 0.19/0.62  %-------------------------------------------
% 0.19/0.63  cnf(9,plain,
% 0.19/0.63     (~P4(a2)+~P2(a3)+P3(a2)),
% 0.19/0.63     inference(scs_inference,[],[1,4])).
% 0.19/0.63  cnf(10,plain,
% 0.19/0.63     (~P3(a2)+~P2(a3)+P4(a2)),
% 0.19/0.63     inference(scs_inference,[],[1,5])).
% 0.19/0.63  cnf(11,plain,
% 0.19/0.63     (P5(a4,a3)+~P4(a2)+P3(a2)),
% 0.19/0.63     inference(scs_inference,[],[1,6])).
% 0.19/0.63  cnf(12,plain,
% 0.19/0.63     (P5(a4,a3)+~P3(a2)+P4(a2)),
% 0.19/0.63     inference(scs_inference,[],[1,7])).
% 0.19/0.63  cnf(14,plain,
% 0.19/0.63     (~P5(x141,a3)+P3(a2)+~P4(a2)),
% 0.19/0.63     inference(scs_inference,[],[8,9])).
% 0.19/0.63  cnf(15,plain,
% 0.19/0.63     (P4(a2)+~P2(a3)),
% 0.19/0.63     inference(scs_inference,[],[10,2])).
% 0.19/0.63  cnf(16,plain,
% 0.19/0.63     (~P5(x161,a3)+P4(a2)),
% 0.19/0.63     inference(scs_inference,[],[15,8])).
% 0.19/0.63  cnf(17,plain,
% 0.19/0.63     (~P3(a2)+P4(a2)),
% 0.19/0.63     inference(scs_inference,[],[16,12])).
% 0.19/0.63  cnf(18,plain,
% 0.19/0.63     (~P3(a2)),
% 0.19/0.63     inference(scs_inference,[],[17,3])).
% 0.19/0.63  cnf(20,plain,
% 0.19/0.63     (P5(a4,a3)+~P4(a2)),
% 0.19/0.63     inference(scs_inference,[],[18,11])).
% 0.19/0.63  cnf(21,plain,
% 0.19/0.63     (~P5(x211,a3)+~P4(a2)),
% 0.19/0.63     inference(scs_inference,[],[18,14])).
% 0.19/0.63  cnf(25,plain,
% 0.19/0.63     ($false),
% 0.19/0.63     inference(scs_inference,[],[18,2,21,20]),
% 0.19/0.63     ['proof']).
% 0.19/0.63  % SZS output end Proof
% 0.19/0.63  % Total time :0.000000s
%------------------------------------------------------------------------------