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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE---1.6
% Problem  : KRS137+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 : n017.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:24 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : KRS137+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.12/0.33  % Computer : n017.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Mon Aug 28 01:30:27 EDT 2023
% 0.12/0.34  % CPUTime    : 
% 0.19/0.58  start to proof:theBenchmark
% 0.19/0.64  %-------------------------------------------
% 0.19/0.64  % File        :CSE---1.6
% 0.19/0.64  % Problem     :theBenchmark
% 0.19/0.64  % Transform   :cnf
% 0.19/0.64  % Format      :tptp:raw
% 0.19/0.64  % Command     :java -jar mcs_scs.jar %d %s
% 0.19/0.64  
% 0.19/0.64  % Result      :Theorem 0.010000s
% 0.19/0.64  % Output      :CNFRefutation 0.010000s
% 0.19/0.64  %-------------------------------------------
% 0.19/0.65  %------------------------------------------------------------------------------
% 0.19/0.65  % File     : KRS137+1 : TPTP v8.1.2. Released v3.1.0.
% 0.19/0.65  % Domain   : Knowledge Representation (Semantic Web)
% 0.19/0.65  % Problem  : A variation of equivalentClass-001
% 0.19/0.65  % Version  : Especial.
% 0.19/0.65  % English  : This is a variation of equivalentClass-001, showing the use of
% 0.19/0.65  %            owl:Ontology triples in the premises and conclusions.
% 0.19/0.65  
% 0.19/0.65  % Refs     : [Bec03] Bechhofer (2003), Email to G. Sutcliffe
% 0.19/0.65  %          : [TR+04] Tsarkov et al. (2004), Using Vampire to Reason with OW
% 0.19/0.65  % Source   : [Bec03]
% 0.19/0.65  % Names    : positive_Ontology-Manifest001 [Bec03]
% 0.19/0.65  
% 0.19/0.65  % Status   : Theorem
% 0.19/0.65  % Rating   : 0.00 v5.3.0, 0.09 v5.2.0, 0.00 v3.1.0
% 0.19/0.65  % Syntax   : Number of formulae    :    8 (   4 unt;   0 def)
% 0.19/0.65  %            Number of atoms       :   18 (   0 equ)
% 0.19/0.65  %            Maximal formula atoms :    8 (   2 avg)
% 0.19/0.65  %            Number of connectives :   14 (   4   ~;   0   |;   7   &)
% 0.19/0.65  %                                         (   3 <=>;   0  =>;   0  <=;   0 <~>)
% 0.19/0.65  %            Maximal formula depth :    6 (   3 avg)
% 0.19/0.65  %            Maximal term depth    :    1 (   1 avg)
% 0.19/0.65  %            Number of predicates  :    6 (   6 usr;   0 prp; 1-1 aty)
% 0.19/0.65  %            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
% 0.19/0.65  %            Number of variables   :    5 (   5   !;   0   ?)
% 0.19/0.65  % SPC      : FOF_THM_EPR_NEQ
% 0.19/0.65  
% 0.19/0.65  % Comments : Sean Bechhofer says there are some errors in the encoding of
% 0.19/0.65  %            datatypes, so this problem may not be perfect. At least it's
% 0.19/0.65  %            still representative of the type of reasoning required for OWL.
% 0.19/0.65  %------------------------------------------------------------------------------
% 0.19/0.65  %----Thing and Nothing
% 0.19/0.65  fof(axiom_0,axiom,
% 0.19/0.65      ! [X] :
% 0.19/0.65        ( cowlThing(X)
% 0.19/0.65        & ~ cowlNothing(X) ) ).
% 0.19/0.65  
% 0.19/0.65  %----String and Integer disjoint
% 0.19/0.65  fof(axiom_1,axiom,
% 0.19/0.65      ! [X] :
% 0.19/0.65        ( xsd_string(X)
% 0.19/0.65      <=> ~ xsd_integer(X) ) ).
% 0.19/0.65  
% 0.19/0.65  %----Equality cCar
% 0.19/0.65  fof(axiom_2,axiom,
% 0.19/0.65      ! [X] :
% 0.19/0.65        ( cCar(X)
% 0.19/0.65      <=> cAutomobile(X) ) ).
% 0.19/0.65  
% 0.19/0.65  %----iauto
% 0.19/0.65  fof(axiom_3,axiom,
% 0.19/0.65      cowlThing(iauto) ).
% 0.19/0.65  
% 0.19/0.65  %----iauto
% 0.19/0.65  fof(axiom_4,axiom,
% 0.19/0.65      cAutomobile(iauto) ).
% 0.19/0.65  
% 0.19/0.65  %----icar
% 0.19/0.65  fof(axiom_5,axiom,
% 0.19/0.65      cowlThing(icar) ).
% 0.19/0.65  
% 0.19/0.65  %----icar
% 0.19/0.65  fof(axiom_6,axiom,
% 0.19/0.65      cCar(icar) ).
% 0.19/0.65  
% 0.19/0.65  %----Thing and Nothing
% 0.19/0.65  %----String and Integer disjoint
% 0.19/0.65  %----iauto
% 0.19/0.65  %----iauto
% 0.19/0.65  %----icar
% 0.19/0.65  %----icar
% 0.19/0.65  fof(the_axiom,conjecture,
% 0.19/0.65      ( ! [X] :
% 0.19/0.65          ( cowlThing(X)
% 0.19/0.65          & ~ cowlNothing(X) )
% 0.19/0.65      & ! [X] :
% 0.19/0.65          ( xsd_string(X)
% 0.19/0.65        <=> ~ xsd_integer(X) )
% 0.19/0.65      & cCar(iauto)
% 0.19/0.65      & cowlThing(iauto)
% 0.19/0.65      & cowlThing(icar)
% 0.19/0.65      & cAutomobile(icar) ) ).
% 0.19/0.65  
% 0.19/0.65  %------------------------------------------------------------------------------
% 0.19/0.65  %-------------------------------------------
% 0.19/0.65  % Proof found
% 0.19/0.65  % SZS status Theorem for theBenchmark
% 0.19/0.65  % SZS output start Proof
% 0.19/0.65  %ClaNum:9(EqnAxiom:0)
% 0.19/0.65  %VarNum:9(SingletonVarNum:5)
% 0.19/0.65  %MaxLitNum:5
% 0.19/0.65  %MaxfuncDepth:0
% 0.19/0.65  %SharedTerms:13
% 0.19/0.65  %goalClause: 8 9
% 0.19/0.65  [1]P1(a1)
% 0.19/0.65  [2]P2(a2)
% 0.19/0.65  [3]~P3(x31)
% 0.19/0.65  [4]P5(x41)+P4(x41)
% 0.19/0.65  [5]~P2(x51)+P1(x51)
% 0.19/0.65  [6]~P1(x61)+P2(x61)
% 0.19/0.65  [7]~P5(x71)+~P4(x71)
% 0.19/0.65  [8]P3(a3)+P4(a4)+~P5(a4)+~P1(a2)+~P2(a1)
% 0.19/0.65  [9]P3(a3)+P5(a4)+~P4(a4)+~P1(a2)+~P2(a1)
% 0.19/0.65  %EqnAxiom
% 0.19/0.65  
% 0.19/0.65  %-------------------------------------------
% 0.19/0.65  cnf(10,plain,
% 0.19/0.65     (P2(a1)),
% 0.19/0.65     inference(scs_inference,[],[1,6])).
% 0.19/0.65  cnf(11,plain,
% 0.19/0.65     (P1(a2)),
% 0.19/0.65     inference(scs_inference,[],[1,2,6,5])).
% 0.19/0.65  cnf(12,plain,
% 0.19/0.65     (~P5(a4)+P4(a4)),
% 0.19/0.65     inference(scs_inference,[],[11,10,3,8])).
% 0.19/0.65  cnf(13,plain,
% 0.19/0.65     (~P4(a4)+P5(a4)),
% 0.19/0.65     inference(scs_inference,[],[11,10,3,9])).
% 0.19/0.65  cnf(17,plain,
% 0.19/0.65     (P5(a4)),
% 0.19/0.65     inference(scs_inference,[],[4,13])).
% 0.19/0.65  cnf(18,plain,
% 0.19/0.65     (P4(a4)),
% 0.19/0.65     inference(scs_inference,[],[17,12])).
% 0.19/0.65  cnf(19,plain,
% 0.19/0.65     (~P4(a4)),
% 0.19/0.65     inference(scs_inference,[],[17,7])).
% 0.19/0.65  cnf(21,plain,
% 0.19/0.65     ($false),
% 0.19/0.65     inference(scs_inference,[],[18,19]),
% 0.19/0.65     ['proof']).
% 0.19/0.65  % SZS output end Proof
% 0.19/0.65  % Total time :0.010000s
%------------------------------------------------------------------------------