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

% Computer : n029.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 02:59:30 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ~ ? [X0] :
      ! [X1] :
        ( element(X1,X0)
      <=> ~ element(X1,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel39) ).

fof(f2,negated_conjecture,
    ~ ~ ? [X0] :
        ! [X1] :
          ( element(X1,X0)
        <=> ~ element(X1,X1) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f3,plain,
    ? [X0] :
    ! [X1] :
      ( element(X1,X0)
    <=> ~ element(X1,X1) ),
    inference(flattening,[],[f2]) ).

fof(f4,plain,
    ? [X0] :
    ! [X1] :
      ( ( element(X1,X0)
        | element(X1,X1) )
      & ( ~ element(X1,X1)
        | ~ element(X1,X0) ) ),
    inference(nnf_transformation,[],[f3]) ).

fof(f5,plain,
    ( ? [X0] :
      ! [X1] :
        ( ( element(X1,X0)
          | element(X1,X1) )
        & ( ~ element(X1,X1)
          | ~ element(X1,X0) ) )
   => ! [X1] :
        ( ( element(X1,sK0)
          | element(X1,X1) )
        & ( ~ element(X1,X1)
          | ~ element(X1,sK0) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f6,plain,
    ! [X1] :
      ( ( element(X1,sK0)
        | element(X1,X1) )
      & ( ~ element(X1,X1)
        | ~ element(X1,sK0) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f4,f5]) ).

fof(f7,plain,
    ! [X1] :
      ( ~ element(X1,X1)
      | ~ element(X1,sK0) ),
    inference(cnf_transformation,[],[f6]) ).

fof(f8,plain,
    ! [X1] :
      ( element(X1,sK0)
      | element(X1,X1) ),
    inference(cnf_transformation,[],[f6]) ).

cnf(c_49,negated_conjecture,
    ( element(X0,X0)
    | element(X0,sK0) ),
    inference(cnf_transformation,[],[f8]) ).

cnf(c_50,negated_conjecture,
    ( ~ element(X0,X0)
    | ~ element(X0,sK0) ),
    inference(cnf_transformation,[],[f7]) ).

cnf(c_51,plain,
    element(sK0,sK0),
    inference(instantiation,[status(thm)],[c_49]) ).

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

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem  : SET043+1 : TPTP v8.1.2. Released v2.0.0.
% 0.10/0.11  % Command  : run_iprover %s %d THM
% 0.11/0.31  % Computer : n029.cluster.edu
% 0.11/0.31  % Model    : x86_64 x86_64
% 0.11/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31  % Memory   : 8042.1875MB
% 0.11/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31  % CPULimit : 300
% 0.11/0.31  % WCLimit  : 300
% 0.11/0.31  % DateTime : Thu May  2 20:35:22 EDT 2024
% 0.11/0.32  % CPUTime  : 
% 0.16/0.42  Running first-order theorem proving
% 0.16/0.42  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.42/1.11  % SZS status Started for theBenchmark.p
% 0.42/1.11  % SZS status Theorem for theBenchmark.p
% 0.42/1.11  
% 0.42/1.11  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.42/1.11  
% 0.42/1.11  ------  iProver source info
% 0.42/1.11  
% 0.42/1.11  git: date: 2024-05-02 19:28:25 +0000
% 0.42/1.11  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.42/1.11  git: non_committed_changes: false
% 0.42/1.11  
% 0.42/1.11  ------ Parsing...
% 0.42/1.11  ------ Clausification by vclausify_rel  & Parsing by iProver...------  preprocesses with Option_epr_non_horn_non_eq
% 0.42/1.11  
% 0.42/1.11  
% 0.42/1.11  ------ Preprocessing...
% 0.42/1.11  
% 0.42/1.11  % SZS status Theorem for theBenchmark.p
% 0.42/1.11  
% 0.42/1.11  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.42/1.11  
% 0.42/1.11  
%------------------------------------------------------------------------------