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

% 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 : Fri May  3 03:30:27 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( ! [X0] :
        ( f(X0)
       => g(X0) )
   => ( ? [X1] : f(X1)
     => ? [X2] : g(X2) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',kalish202) ).

fof(f2,negated_conjecture,
    ~ ( ! [X0] :
          ( f(X0)
         => g(X0) )
     => ( ? [X1] : f(X1)
       => ? [X2] : g(X2) ) ),
    inference(negated_conjecture,[],[f1]) ).

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

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

fof(f5,plain,
    ( ! [X0] : ~ g(X0)
    & ? [X1] : f(X1)
    & ! [X2] :
        ( g(X2)
        | ~ f(X2) ) ),
    inference(rectify,[],[f4]) ).

fof(f6,plain,
    ( ? [X1] : f(X1)
   => f(sK0) ),
    introduced(choice_axiom,[]) ).

fof(f7,plain,
    ( ! [X0] : ~ g(X0)
    & f(sK0)
    & ! [X2] :
        ( g(X2)
        | ~ f(X2) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f5,f6]) ).

fof(f8,plain,
    ! [X2] :
      ( g(X2)
      | ~ f(X2) ),
    inference(cnf_transformation,[],[f7]) ).

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

fof(f10,plain,
    ! [X0] : ~ g(X0),
    inference(cnf_transformation,[],[f7]) ).

cnf(c_49,negated_conjecture,
    ~ g(X0),
    inference(cnf_transformation,[],[f10]) ).

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

cnf(c_51,negated_conjecture,
    ( ~ f(X0)
    | g(X0) ),
    inference(cnf_transformation,[],[f8]) ).

cnf(c_52,plain,
    ~ g(sK0),
    inference(instantiation,[status(thm)],[c_49]) ).

cnf(c_53,plain,
    ( ~ f(sK0)
    | g(sK0) ),
    inference(instantiation,[status(thm)],[c_51]) ).

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : SYN395+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.12  % Command  : run_iprover %s %d THM
% 0.12/0.32  % Computer : n011.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 300
% 0.12/0.32  % DateTime : Thu May  2 20:47:33 EDT 2024
% 0.12/0.33  % CPUTime  : 
% 0.17/0.45  Running first-order theorem proving
% 0.17/0.45  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.68/1.14  % SZS status Started for theBenchmark.p
% 0.68/1.14  % SZS status Theorem for theBenchmark.p
% 0.68/1.14  
% 0.68/1.14  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.68/1.14  
% 0.68/1.14  ------  iProver source info
% 0.68/1.14  
% 0.68/1.14  git: date: 2024-05-02 19:28:25 +0000
% 0.68/1.14  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.68/1.14  git: non_committed_changes: false
% 0.68/1.14  
% 0.68/1.14  ------ Parsing...
% 0.68/1.14  ------ Clausification by vclausify_rel  & Parsing by iProver...------  preprocesses with Option_epr_horn
% 0.68/1.14  
% 0.68/1.14  
% 0.68/1.14  ------ Preprocessing...
% 0.68/1.14  
% 0.68/1.14  % SZS status Theorem for theBenchmark.p
% 0.68/1.14  
% 0.68/1.14  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.68/1.14  
% 0.68/1.14  
%------------------------------------------------------------------------------