%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : SYN403+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n012.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 Sep  1 03:06:55 EDT 2023

% Result   : Theorem 0.66s 1.15s
% Output   : CNFRefutation 0.66s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   15 (   5 unt;   0 def)
%            Number of atoms       :   55 (   0 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :   62 (  22   ~;  14   |;  17   &)
%                                         (   0 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :    5 (   0 sgn;   2   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ! [X0] :
      ( ( ( g(X0)
         => h(X0) )
        & ( f(X0)
         => g(X0) ) )
     => ( f(X0)
       => h(X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kalish234) ).

fof(f2,negated_conjecture,
    ~ ! [X0] :
        ( ( ( g(X0)
           => h(X0) )
          & ( f(X0)
           => g(X0) ) )
       => ( f(X0)
         => h(X0) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f3,plain,
    ? [X0] :
      ( ~ h(X0)
      & f(X0)
      & ( h(X0)
        | ~ g(X0) )
      & ( g(X0)
        | ~ f(X0) ) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f4,plain,
    ? [X0] :
      ( ~ h(X0)
      & f(X0)
      & ( h(X0)
        | ~ g(X0) )
      & ( g(X0)
        | ~ f(X0) ) ),
    inference(flattening,[],[f3]) ).

fof(f5,plain,
    ( ? [X0] :
        ( ~ h(X0)
        & f(X0)
        & ( h(X0)
          | ~ g(X0) )
        & ( g(X0)
          | ~ f(X0) ) )
   => ( ~ h(sK0)
      & f(sK0)
      & ( h(sK0)
        | ~ g(sK0) )
      & ( g(sK0)
        | ~ f(sK0) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f6,plain,
    ( ~ h(sK0)
    & f(sK0)
    & ( h(sK0)
      | ~ g(sK0) )
    & ( g(sK0)
      | ~ f(sK0) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f4,f5]) ).

fof(f7,plain,
    ( g(sK0)
    | ~ f(sK0) ),
    inference(cnf_transformation,[],[f6]) ).

fof(f8,plain,
    ( h(sK0)
    | ~ g(sK0) ),
    inference(cnf_transformation,[],[f6]) ).

fof(f9,plain,
    f(sK0),
    inference(cnf_transformation,[],[f6]) ).

fof(f10,plain,
    ~ h(sK0),
    inference(cnf_transformation,[],[f6]) ).

cnf(c_49,negated_conjecture,
    ~ h(sK0),
    inference(cnf_transformation,[],[f10]) ).

cnf(c_50,negated_conjecture,
    f(sK0),
    inference(cnf_transformation,[],[f9]) ).

cnf(c_51,negated_conjecture,
    ( ~ g(sK0)
    | h(sK0) ),
    inference(cnf_transformation,[],[f8]) ).

cnf(c_52,negated_conjecture,
    ( ~ f(sK0)
    | g(sK0) ),
    inference(cnf_transformation,[],[f7]) ).

cnf(c_53,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_51,c_52,c_49,c_50]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN403+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.33  % Computer : n012.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 300
% 0.13/0.33  % DateTime : Sat Aug 26 20:47:40 EDT 2023
% 0.13/0.33  % CPUTime  : 
% 0.18/0.45  Running first-order theorem proving
% 0.18/0.45  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.66/1.15  % SZS status Started for theBenchmark.p
% 0.66/1.15  % SZS status Theorem for theBenchmark.p
% 0.66/1.15  
% 0.66/1.15  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.66/1.15  
% 0.66/1.15  ------  iProver source info
% 0.66/1.15  
% 0.66/1.15  git: date: 2023-05-31 18:12:56 +0000
% 0.66/1.15  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.66/1.15  git: non_committed_changes: false
% 0.66/1.15  git: last_make_outside_of_git: false
% 0.66/1.15  
% 0.66/1.15  ------ Parsing...
% 0.66/1.15  ------ Clausification by vclausify_rel  & Parsing by iProver...------  preprocesses with Option_epr_horn
% 0.66/1.15  
% 0.66/1.15  
% 0.66/1.15  ------ Preprocessing...
% 0.66/1.15  
% 0.66/1.15  % SZS status Theorem for theBenchmark.p
% 0.66/1.15  
% 0.66/1.15  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.66/1.15  
% 0.66/1.15  
%------------------------------------------------------------------------------