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

% Computer : n018.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:33:40 EDT 2024

% Result   : Theorem 0.65s 1.15s
% Output   : CNFRefutation 0.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   15 (   6 unt;   0 def)
%            Number of atoms       :   31 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   27 (  11   ~;   3   |;   7   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 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   :   28 (   4 sgn  15   !;  12   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( ( ? [X1] : q(X1)
      & ! [X0] : p(X0) )
   => ? [X2] :
      ! [X1] :
        ( r(X2)
        | p(X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(f2,negated_conjecture,
    ~ ( ( ? [X1] : q(X1)
        & ! [X0] : p(X0) )
     => ? [X2] :
        ! [X1] :
          ( r(X2)
          | p(X1) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f3,plain,
    ~ ( ( ? [X0] : q(X0)
        & ! [X1] : p(X1) )
     => ? [X2] :
        ! [X3] :
          ( r(X2)
          | p(X3) ) ),
    inference(rectify,[],[f2]) ).

fof(f4,plain,
    ~ ( ( ? [X0] : q(X0)
        & ! [X1] : p(X1) )
     => ? [X2] :
        ! [X3] : p(X3) ),
    inference(pure_predicate_removal,[],[f3]) ).

fof(f5,plain,
    ~ ( ! [X1] : p(X1)
     => ? [X2] :
        ! [X3] : p(X3) ),
    inference(pure_predicate_removal,[],[f4]) ).

fof(f6,plain,
    ( ! [X2] :
      ? [X3] : ~ p(X3)
    & ! [X1] : p(X1) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f7,plain,
    ( ? [X1] : ~ p(X1)
    & ! [X2] : p(X2) ),
    inference(rectify,[],[f6]) ).

fof(f8,plain,
    ( ? [X1] : ~ p(X1)
   => ~ p(sK0) ),
    introduced(choice_axiom,[]) ).

fof(f9,plain,
    ( ~ p(sK0)
    & ! [X2] : p(X2) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f7,f8]) ).

fof(f10,plain,
    ! [X2] : p(X2),
    inference(cnf_transformation,[],[f9]) ).

fof(f11,plain,
    ~ p(sK0),
    inference(cnf_transformation,[],[f9]) ).

cnf(c_49,negated_conjecture,
    ~ p(sK0),
    inference(cnf_transformation,[],[f11]) ).

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

cnf(c_51,plain,
    p(sK0),
    inference(instantiation,[status(thm)],[c_50]) ).

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


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