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

% Computer : n024.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:05:12 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] :
      ( big_f(X0)
    <=> ~ big_f(f(X0)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel59_1) ).

fof(f2,conjecture,
    ? [X0] :
      ( ~ big_f(f(X0))
      & big_f(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel59) ).

fof(f3,negated_conjecture,
    ~ ? [X0] :
        ( ~ big_f(f(X0))
        & big_f(X0) ),
    inference(negated_conjecture,[],[f2]) ).

fof(f4,plain,
    ! [X0] :
      ( big_f(f(X0))
      | ~ big_f(X0) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f5,plain,
    ! [X0] :
      ( ( big_f(X0)
        | big_f(f(X0)) )
      & ( ~ big_f(f(X0))
        | ~ big_f(X0) ) ),
    inference(nnf_transformation,[],[f1]) ).

fof(f6,plain,
    ! [X0] :
      ( ~ big_f(f(X0))
      | ~ big_f(X0) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f7,plain,
    ! [X0] :
      ( big_f(X0)
      | big_f(f(X0)) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f8,plain,
    ! [X0] :
      ( big_f(f(X0))
      | ~ big_f(X0) ),
    inference(cnf_transformation,[],[f4]) ).

cnf(c_49,plain,
    ( big_f(f(X0))
    | big_f(X0) ),
    inference(cnf_transformation,[],[f7]) ).

cnf(c_50,plain,
    ( ~ big_f(f(X0))
    | ~ big_f(X0) ),
    inference(cnf_transformation,[],[f6]) ).

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

cnf(c_55,plain,
    big_f(f(X0)),
    inference(global_subsumption_just,[status(thm)],[c_49,c_49,c_51]) ).

cnf(c_58,negated_conjecture,
    big_f(f(X0)),
    inference(global_subsumption_just,[status(thm)],[c_51,c_55]) ).

cnf(c_60,plain,
    ~ big_f(X0),
    inference(global_subsumption_just,[status(thm)],[c_50,c_49,c_51,c_50]) ).

cnf(c_64,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_58,c_60]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SYN081+1 : TPTP v8.1.2. Released v2.0.0.
% 0.06/0.12  % Command  : run_iprover %s %d THM
% 0.12/0.33  % Computer : n024.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 : Sat Aug 26 17:59:54 EDT 2023
% 0.12/0.33  % CPUTime  : 
% 0.19/0.48  Running first-order theorem proving
% 0.19/0.48  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.50/1.17  % SZS status Started for theBenchmark.p
% 0.50/1.17  % SZS status Theorem for theBenchmark.p
% 0.50/1.17  
% 0.50/1.17  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.50/1.17  
% 0.50/1.17  ------  iProver source info
% 0.50/1.17  
% 0.50/1.17  git: date: 2023-05-31 18:12:56 +0000
% 0.50/1.17  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.50/1.17  git: non_committed_changes: false
% 0.50/1.17  git: last_make_outside_of_git: false
% 0.50/1.17  
% 0.50/1.17  ------ Parsing...
% 0.50/1.17  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 0.50/1.17  
% 0.50/1.17  ------ Preprocessing...
% 0.50/1.17  
% 0.50/1.17  % SZS status Theorem for theBenchmark.p
% 0.50/1.17  
% 0.50/1.17  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.50/1.17  
% 0.50/1.17  
%------------------------------------------------------------------------------