%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : NUM605+3 : TPTP v8.1.2. Released v4.0.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 : Thu Aug 31 11:31:48 EDT 2023

% Result   : Theorem 2.74s 1.15s
% Output   : CNFRefutation 2.74s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   34 (  12 unt;   0 def)
%            Number of atoms       :   89 (  41 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   93 (  38   ~;  25   |;  23   &)
%                                         (   4 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :   30 (   0 sgn;  22   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f5,axiom,
    ! [X0] :
      ( slcrc0 = X0
    <=> ( ~ ? [X1] : aElementOf0(X1,X0)
        & aSet0(X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefEmp) ).

fof(f42,axiom,
    ! [X0] :
      ( aSet0(X0)
     => ( sz00 = sbrdtbr0(X0)
      <=> slcrc0 = X0 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mCardEmpty) ).

fof(f78,axiom,
    sz00 != xK,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3462) ).

fof(f99,axiom,
    ( aElementOf0(xQ,slbdtsldtrb0(xO,xK))
    & xK = sbrdtbr0(xQ)
    & aSubsetOf0(xQ,xO)
    & ! [X0] :
        ( aElementOf0(X0,xQ)
       => aElementOf0(X0,xO) )
    & aSet0(xQ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5078) ).

fof(f100,conjecture,
    ~ ( slcrc0 = xQ
      & ~ ? [X0] : aElementOf0(X0,xQ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).

fof(f101,negated_conjecture,
    ~ ~ ( slcrc0 = xQ
        & ~ ? [X0] : aElementOf0(X0,xQ) ),
    inference(negated_conjecture,[],[f100]) ).

fof(f121,plain,
    ( slcrc0 = xQ
    & ~ ? [X0] : aElementOf0(X0,xQ) ),
    inference(flattening,[],[f101]) ).

fof(f123,plain,
    ! [X0] :
      ( slcrc0 = X0
    <=> ( ! [X1] : ~ aElementOf0(X1,X0)
        & aSet0(X0) ) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f172,plain,
    ! [X0] :
      ( ( sz00 = sbrdtbr0(X0)
      <=> slcrc0 = X0 )
      | ~ aSet0(X0) ),
    inference(ennf_transformation,[],[f42]) ).

fof(f250,plain,
    ( aElementOf0(xQ,slbdtsldtrb0(xO,xK))
    & xK = sbrdtbr0(xQ)
    & aSubsetOf0(xQ,xO)
    & ! [X0] :
        ( aElementOf0(X0,xO)
        | ~ aElementOf0(X0,xQ) )
    & aSet0(xQ) ),
    inference(ennf_transformation,[],[f99]) ).

fof(f251,plain,
    ( slcrc0 = xQ
    & ! [X0] : ~ aElementOf0(X0,xQ) ),
    inference(ennf_transformation,[],[f121]) ).

fof(f285,plain,
    ! [X0] :
      ( ( slcrc0 = X0
        | ? [X1] : aElementOf0(X1,X0)
        | ~ aSet0(X0) )
      & ( ( ! [X1] : ~ aElementOf0(X1,X0)
          & aSet0(X0) )
        | slcrc0 != X0 ) ),
    inference(nnf_transformation,[],[f123]) ).

fof(f286,plain,
    ! [X0] :
      ( ( slcrc0 = X0
        | ? [X1] : aElementOf0(X1,X0)
        | ~ aSet0(X0) )
      & ( ( ! [X1] : ~ aElementOf0(X1,X0)
          & aSet0(X0) )
        | slcrc0 != X0 ) ),
    inference(flattening,[],[f285]) ).

fof(f287,plain,
    ! [X0] :
      ( ( slcrc0 = X0
        | ? [X1] : aElementOf0(X1,X0)
        | ~ aSet0(X0) )
      & ( ( ! [X2] : ~ aElementOf0(X2,X0)
          & aSet0(X0) )
        | slcrc0 != X0 ) ),
    inference(rectify,[],[f286]) ).

fof(f288,plain,
    ! [X0] :
      ( ? [X1] : aElementOf0(X1,X0)
     => aElementOf0(sK25(X0),X0) ),
    introduced(choice_axiom,[]) ).

fof(f289,plain,
    ! [X0] :
      ( ( slcrc0 = X0
        | aElementOf0(sK25(X0),X0)
        | ~ aSet0(X0) )
      & ( ( ! [X2] : ~ aElementOf0(X2,X0)
          & aSet0(X0) )
        | slcrc0 != X0 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK25])],[f287,f288]) ).

fof(f311,plain,
    ! [X0] :
      ( ( ( sz00 = sbrdtbr0(X0)
          | slcrc0 != X0 )
        & ( slcrc0 = X0
          | sz00 != sbrdtbr0(X0) ) )
      | ~ aSet0(X0) ),
    inference(nnf_transformation,[],[f172]) ).

fof(f477,plain,
    ! [X0] :
      ( aSet0(X0)
      | slcrc0 != X0 ),
    inference(cnf_transformation,[],[f289]) ).

fof(f544,plain,
    ! [X0] :
      ( sz00 = sbrdtbr0(X0)
      | slcrc0 != X0
      | ~ aSet0(X0) ),
    inference(cnf_transformation,[],[f311]) ).

fof(f672,plain,
    sz00 != xK,
    inference(cnf_transformation,[],[f78]) ).

fof(f871,plain,
    xK = sbrdtbr0(xQ),
    inference(cnf_transformation,[],[f250]) ).

fof(f874,plain,
    slcrc0 = xQ,
    inference(cnf_transformation,[],[f251]) ).

fof(f877,plain,
    ! [X0] :
      ( aSet0(X0)
      | xQ != X0 ),
    inference(definition_unfolding,[],[f477,f874]) ).

fof(f880,plain,
    ! [X0] :
      ( sz00 = sbrdtbr0(X0)
      | xQ != X0
      | ~ aSet0(X0) ),
    inference(definition_unfolding,[],[f544,f874]) ).

fof(f895,plain,
    aSet0(xQ),
    inference(equality_resolution,[],[f877]) ).

fof(f901,plain,
    ( sz00 = sbrdtbr0(xQ)
    | ~ aSet0(xQ) ),
    inference(equality_resolution,[],[f880]) ).

cnf(c_52,negated_conjecture,
    aSet0(xQ),
    inference(cnf_transformation,[],[f895]) ).

cnf(c_116,negated_conjecture,
    ( ~ aSet0(xQ)
    | sbrdtbr0(xQ) = sz00 ),
    inference(cnf_transformation,[],[f901]) ).

cnf(c_245,plain,
    sz00 != xK,
    inference(cnf_transformation,[],[f672]) ).

cnf(c_442,plain,
    sbrdtbr0(xQ) = xK,
    inference(cnf_transformation,[],[f871]) ).

cnf(c_774,negated_conjecture,
    sbrdtbr0(xQ) = sz00,
    inference(global_subsumption_just,[status(thm)],[c_116,c_52,c_116]) ).

cnf(c_3249,plain,
    sz00 = xK,
    inference(light_normalisation,[status(thm)],[c_442,c_774]) ).

cnf(c_3255,plain,
    xK != xK,
    inference(demodulation,[status(thm)],[c_245,c_3249]) ).

cnf(c_3256,plain,
    $false,
    inference(equality_resolution_simp,[status(thm)],[c_3255]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : NUM605+3 : TPTP v8.1.2. Released v4.0.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 : Fri Aug 25 07:58:07 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.19/0.47  Running first-order theorem proving
% 0.19/0.47  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.74/1.15  % SZS status Started for theBenchmark.p
% 2.74/1.15  % SZS status Theorem for theBenchmark.p
% 2.74/1.15  
% 2.74/1.15  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.74/1.15  
% 2.74/1.15  ------  iProver source info
% 2.74/1.15  
% 2.74/1.15  git: date: 2023-05-31 18:12:56 +0000
% 2.74/1.15  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.74/1.15  git: non_committed_changes: false
% 2.74/1.15  git: last_make_outside_of_git: false
% 2.74/1.15  
% 2.74/1.15  ------ Parsing...
% 2.74/1.15  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 2.74/1.15  
% 2.74/1.15  ------ Preprocessing...
% 2.74/1.15  
% 2.74/1.15  % SZS status Theorem for theBenchmark.p
% 2.74/1.15  
% 2.74/1.15  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.74/1.15  
% 2.74/1.15  
%------------------------------------------------------------------------------