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

% Computer : n025.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:14:56 EDT 2023

% Result   : Theorem 0.64s 1.13s
% Output   : CNFRefutation 0.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   17 (   6 unt;   0 def)
%            Number of atoms       :   42 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   41 (  16   ~;   7   |;  14   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 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   :   25 (   1 sgn;  13   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( ( ! [X0] : b(X0)
      & ? [X0] : a(X0) )
   => ? [X0] :
        ( b(X0)
        & a(X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f2,negated_conjecture,
    ~ ( ( ! [X0] : b(X0)
        & ? [X0] : a(X0) )
     => ? [X0] :
          ( b(X0)
          & a(X0) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f3,plain,
    ~ ( ( ! [X0] : b(X0)
        & ? [X1] : a(X1) )
     => ? [X2] :
          ( b(X2)
          & a(X2) ) ),
    inference(rectify,[],[f2]) ).

fof(f4,plain,
    ( ! [X2] :
        ( ~ b(X2)
        | ~ a(X2) )
    & ! [X0] : b(X0)
    & ? [X1] : a(X1) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f5,plain,
    ( ! [X2] :
        ( ~ b(X2)
        | ~ a(X2) )
    & ! [X0] : b(X0)
    & ? [X1] : a(X1) ),
    inference(flattening,[],[f4]) ).

fof(f6,plain,
    ( ! [X0] :
        ( ~ b(X0)
        | ~ a(X0) )
    & ! [X1] : b(X1)
    & ? [X2] : a(X2) ),
    inference(rectify,[],[f5]) ).

fof(f7,plain,
    ( ? [X2] : a(X2)
   => a(sK0) ),
    introduced(choice_axiom,[]) ).

fof(f8,plain,
    ( ! [X0] :
        ( ~ b(X0)
        | ~ a(X0) )
    & ! [X1] : b(X1)
    & a(sK0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7]) ).

fof(f9,plain,
    a(sK0),
    inference(cnf_transformation,[],[f8]) ).

fof(f10,plain,
    ! [X1] : b(X1),
    inference(cnf_transformation,[],[f8]) ).

fof(f11,plain,
    ! [X0] :
      ( ~ b(X0)
      | ~ a(X0) ),
    inference(cnf_transformation,[],[f8]) ).

cnf(c_49,negated_conjecture,
    ( ~ b(X0)
    | ~ a(X0) ),
    inference(cnf_transformation,[],[f11]) ).

cnf(c_50,negated_conjecture,
    b(X0),
    inference(cnf_transformation,[],[f10]) ).

cnf(c_51,negated_conjecture,
    a(sK0),
    inference(cnf_transformation,[],[f9]) ).

cnf(c_52,plain,
    b(sK0),
    inference(instantiation,[status(thm)],[c_50]) ).

cnf(c_53,plain,
    ( ~ b(sK0)
    | ~ a(sK0) ),
    inference(instantiation,[status(thm)],[c_49]) ).

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


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