TSTP Solution File: KRS179+1 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : KRS179+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n029.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 : Fri May  3 02:33:52 EDT 2024

% Result   : Theorem 0.50s 1.18s
% Output   : CNFRefutation 0.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   34 (   9 unt;   0 def)
%            Number of atoms       :   91 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   94 (  37   ~;  28   |;  21   &)
%                                         (   2 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   68 (   0 sgn  39   !;  15   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,axiom,
    ! [X0,X1] :
      ( ! [X2,X3] :
          ( status(X2,X3,X0)
         => status(X2,X3,X1) )
    <=> isa(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',isa) ).

fof(f14,conjecture,
    ! [X0,X1,X10] :
      ( ( isa(X1,X10)
        & isa(X0,X1) )
     => isa(X0,X10) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',isa_transitive) ).

fof(f15,negated_conjecture,
    ~ ! [X0,X1,X10] :
        ( ( isa(X1,X10)
          & isa(X0,X1) )
       => isa(X0,X10) ),
    inference(negated_conjecture,[],[f14]) ).

fof(f24,plain,
    ~ ! [X0,X1,X2] :
        ( ( isa(X1,X2)
          & isa(X0,X1) )
       => isa(X0,X2) ),
    inference(rectify,[],[f15]) ).

fof(f25,plain,
    ! [X0,X1] :
      ( ! [X2,X3] :
          ( status(X2,X3,X1)
          | ~ status(X2,X3,X0) )
    <=> isa(X0,X1) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f27,plain,
    ? [X0,X1,X2] :
      ( ~ isa(X0,X2)
      & isa(X1,X2)
      & isa(X0,X1) ),
    inference(ennf_transformation,[],[f24]) ).

fof(f28,plain,
    ? [X0,X1,X2] :
      ( ~ isa(X0,X2)
      & isa(X1,X2)
      & isa(X0,X1) ),
    inference(flattening,[],[f27]) ).

fof(f29,plain,
    ! [X0,X1] :
      ( ( ! [X2,X3] :
            ( status(X2,X3,X1)
            | ~ status(X2,X3,X0) )
        | ~ isa(X0,X1) )
      & ( isa(X0,X1)
        | ? [X2,X3] :
            ( ~ status(X2,X3,X1)
            & status(X2,X3,X0) ) ) ),
    inference(nnf_transformation,[],[f25]) ).

fof(f30,plain,
    ! [X0,X1] :
      ( ( ! [X2,X3] :
            ( status(X2,X3,X1)
            | ~ status(X2,X3,X0) )
        | ~ isa(X0,X1) )
      & ( isa(X0,X1)
        | ? [X4,X5] :
            ( ~ status(X4,X5,X1)
            & status(X4,X5,X0) ) ) ),
    inference(rectify,[],[f29]) ).

fof(f31,plain,
    ! [X0,X1] :
      ( ? [X4,X5] :
          ( ~ status(X4,X5,X1)
          & status(X4,X5,X0) )
     => ( ~ status(sK0(X0,X1),sK1(X0,X1),X1)
        & status(sK0(X0,X1),sK1(X0,X1),X0) ) ),
    introduced(choice_axiom,[]) ).

fof(f32,plain,
    ! [X0,X1] :
      ( ( ! [X2,X3] :
            ( status(X2,X3,X1)
            | ~ status(X2,X3,X0) )
        | ~ isa(X0,X1) )
      & ( isa(X0,X1)
        | ( ~ status(sK0(X0,X1),sK1(X0,X1),X1)
          & status(sK0(X0,X1),sK1(X0,X1),X0) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f30,f31]) ).

fof(f55,plain,
    ( ? [X0,X1,X2] :
        ( ~ isa(X0,X2)
        & isa(X1,X2)
        & isa(X0,X1) )
   => ( ~ isa(sK20,sK22)
      & isa(sK21,sK22)
      & isa(sK20,sK21) ) ),
    introduced(choice_axiom,[]) ).

fof(f56,plain,
    ( ~ isa(sK20,sK22)
    & isa(sK21,sK22)
    & isa(sK20,sK21) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK20,sK21,sK22])],[f28,f55]) ).

fof(f57,plain,
    ! [X0,X1] :
      ( isa(X0,X1)
      | status(sK0(X0,X1),sK1(X0,X1),X0) ),
    inference(cnf_transformation,[],[f32]) ).

fof(f58,plain,
    ! [X0,X1] :
      ( isa(X0,X1)
      | ~ status(sK0(X0,X1),sK1(X0,X1),X1) ),
    inference(cnf_transformation,[],[f32]) ).

fof(f59,plain,
    ! [X2,X3,X0,X1] :
      ( status(X2,X3,X1)
      | ~ status(X2,X3,X0)
      | ~ isa(X0,X1) ),
    inference(cnf_transformation,[],[f32]) ).

fof(f79,plain,
    isa(sK20,sK21),
    inference(cnf_transformation,[],[f56]) ).

fof(f80,plain,
    isa(sK21,sK22),
    inference(cnf_transformation,[],[f56]) ).

fof(f81,plain,
    ~ isa(sK20,sK22),
    inference(cnf_transformation,[],[f56]) ).

cnf(c_49,plain,
    ( ~ status(X0,X1,X2)
    | ~ isa(X2,X3)
    | status(X0,X1,X3) ),
    inference(cnf_transformation,[],[f59]) ).

cnf(c_50,plain,
    ( ~ status(sK0(X0,X1),sK1(X0,X1),X1)
    | isa(X0,X1) ),
    inference(cnf_transformation,[],[f58]) ).

cnf(c_51,plain,
    ( status(sK0(X0,X1),sK1(X0,X1),X0)
    | isa(X0,X1) ),
    inference(cnf_transformation,[],[f57]) ).

cnf(c_71,negated_conjecture,
    ~ isa(sK20,sK22),
    inference(cnf_transformation,[],[f81]) ).

cnf(c_72,negated_conjecture,
    isa(sK21,sK22),
    inference(cnf_transformation,[],[f80]) ).

cnf(c_73,negated_conjecture,
    isa(sK20,sK21),
    inference(cnf_transformation,[],[f79]) ).

cnf(c_85,plain,
    ( ~ status(sK0(X0,X1),sK1(X0,X1),X1)
    | isa(X0,X1) ),
    inference(prop_impl_just,[status(thm)],[c_50]) ).

cnf(c_95,plain,
    ( status(sK0(X0,X1),sK1(X0,X1),X0)
    | isa(X0,X1) ),
    inference(prop_impl_just,[status(thm)],[c_51]) ).

cnf(c_231,plain,
    status(sK0(sK20,sK22),sK1(sK20,sK22),sK20),
    inference(resolution,[status(thm)],[c_95,c_71]) ).

cnf(c_235,plain,
    ~ status(sK0(sK20,sK22),sK1(sK20,sK22),sK22),
    inference(resolution,[status(thm)],[c_85,c_71]) ).

cnf(c_434,plain,
    ( ~ status(sK0(sK20,sK22),sK1(sK20,sK22),sK20)
    | ~ isa(sK20,X0)
    | status(sK0(sK20,sK22),sK1(sK20,sK22),X0) ),
    inference(instantiation,[status(thm)],[c_49]) ).

cnf(c_460,plain,
    ( ~ status(sK0(sK20,sK22),sK1(sK20,sK22),sK20)
    | ~ isa(sK20,sK21)
    | status(sK0(sK20,sK22),sK1(sK20,sK22),sK21) ),
    inference(instantiation,[status(thm)],[c_434]) ).

cnf(c_488,plain,
    ( ~ status(sK0(sK20,sK22),sK1(sK20,sK22),sK21)
    | ~ isa(sK21,X0)
    | status(sK0(sK20,sK22),sK1(sK20,sK22),X0) ),
    inference(instantiation,[status(thm)],[c_49]) ).

cnf(c_522,plain,
    ( ~ status(sK0(sK20,sK22),sK1(sK20,sK22),sK21)
    | ~ isa(sK21,sK22)
    | status(sK0(sK20,sK22),sK1(sK20,sK22),sK22) ),
    inference(instantiation,[status(thm)],[c_488]) ).

cnf(c_523,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_522,c_460,c_235,c_231,c_72,c_73]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : KRS179+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.07/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.34  % Computer : n029.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 : Thu May  2 22:56:37 EDT 2024
% 0.13/0.34  % CPUTime  : 
% 0.20/0.47  Running first-order theorem proving
% 0.20/0.47  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.50/1.18  % SZS status Started for theBenchmark.p
% 0.50/1.18  % SZS status Theorem for theBenchmark.p
% 0.50/1.18  
% 0.50/1.18  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.50/1.18  
% 0.50/1.18  ------  iProver source info
% 0.50/1.18  
% 0.50/1.18  git: date: 2024-05-02 19:28:25 +0000
% 0.50/1.18  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.50/1.18  git: non_committed_changes: false
% 0.50/1.18  
% 0.50/1.18  ------ Parsing...
% 0.50/1.18  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 0.50/1.18  
% 0.50/1.18  ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 0.50/1.18  
% 0.50/1.18  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 0.50/1.18  ------ Proving...
% 0.50/1.18  ------ Problem Properties 
% 0.50/1.18  
% 0.50/1.18  
% 0.50/1.18  clauses                                 23
% 0.50/1.18  conjectures                             3
% 0.50/1.18  EPR                                     19
% 0.50/1.18  Horn                                    21
% 0.50/1.18  unary                                   16
% 0.50/1.18  binary                                  6
% 0.50/1.18  lits                                    31
% 0.50/1.18  lits eq                                 0
% 0.50/1.18  fd_pure                                 0
% 0.50/1.18  fd_pseudo                               0
% 0.50/1.18  fd_cond                                 0
% 0.50/1.18  fd_pseudo_cond                          0
% 0.50/1.18  AC symbols                              0
% 0.50/1.18  
% 0.50/1.18  ------ Schedule dynamic 5 is on 
% 0.50/1.18  
% 0.50/1.18  ------ no equalities: superposition off 
% 0.50/1.18  
% 0.50/1.18  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.50/1.18  
% 0.50/1.18  
% 0.50/1.18  ------ 
% 0.50/1.18  Current options:
% 0.50/1.18  ------ 
% 0.50/1.18  
% 0.50/1.18  
% 0.50/1.18  
% 0.50/1.18  
% 0.50/1.18  ------ Proving...
% 0.50/1.18  
% 0.50/1.18  
% 0.50/1.18  % SZS status Theorem for theBenchmark.p
% 0.50/1.18  
% 0.50/1.18  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.50/1.18  
% 0.50/1.18  
%------------------------------------------------------------------------------