%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SEU118+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s

% Computer : n015.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 : Wed Aug 31 18:26:43 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(f214,plain,
    $false,
    inference(unit_resulting_resolution,[],[f137,f80,f136,f135,f123]) ).

fof(f123,plain,
    ! [X2,X0] :
      ( ~ subset(X2,X0)
      | in(X2,finite_subsets(X0))
      | ~ preboolean(finite_subsets(X0))
      | ~ finite(X2) ),
    inference(equality_resolution,[],[f104]) ).

fof(f104,plain,
    ! [X2,X0,X1] :
      ( finite_subsets(X0) != X1
      | in(X2,X1)
      | ~ subset(X2,X0)
      | ~ finite(X2)
      | ~ preboolean(X1) ),
    inference(cnf_transformation,[],[f50]) ).

fof(f50,plain,
    ! [X1,X0] :
      ( ~ preboolean(X1)
      | ( ! [X2] :
            ( ( finite(X2)
              & subset(X2,X0) )
          <=> in(X2,X1) )
      <=> finite_subsets(X0) = X1 ) ),
    inference(ennf_transformation,[],[f7]) ).

fof(f7,axiom,
    ! [X0,X1] :
      ( preboolean(X1)
     => ( ! [X2] :
            ( ( finite(X2)
              & subset(X2,X0) )
          <=> in(X2,X1) )
      <=> finite_subsets(X0) = X1 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_finsub_1) ).

fof(f135,plain,
    ~ in(sK4,finite_subsets(sK5)),
    inference(unit_resulting_resolution,[],[f84,f120]) ).

fof(f120,plain,
    ! [X0,X1] :
      ( ~ in(X0,X1)
      | element(X0,X1) ),
    inference(cnf_transformation,[],[f49]) ).

fof(f49,plain,
    ! [X0,X1] :
      ( ~ in(X0,X1)
      | element(X0,X1) ),
    inference(ennf_transformation,[],[f25]) ).

fof(f25,axiom,
    ! [X1,X0] :
      ( in(X0,X1)
     => element(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_subset) ).

fof(f84,plain,
    ~ element(sK4,finite_subsets(sK5)),
    inference(cnf_transformation,[],[f59]) ).

fof(f59,plain,
    ? [X1,X0] :
      ( element(X1,powerset(X0))
      & finite(X0)
      & ~ element(X1,finite_subsets(X0)) ),
    inference(flattening,[],[f58]) ).

fof(f58,plain,
    ? [X0,X1] :
      ( ~ element(X1,finite_subsets(X0))
      & finite(X0)
      & element(X1,powerset(X0)) ),
    inference(ennf_transformation,[],[f28]) ).

fof(f28,negated_conjecture,
    ~ ! [X0,X1] :
        ( element(X1,powerset(X0))
       => ( finite(X0)
         => element(X1,finite_subsets(X0)) ) ),
    inference(negated_conjecture,[],[f27]) ).

fof(f27,conjecture,
    ! [X0,X1] :
      ( element(X1,powerset(X0))
     => ( finite(X0)
       => element(X1,finite_subsets(X0)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t34_finsub_1) ).

fof(f136,plain,
    subset(sK4,sK5),
    inference(unit_resulting_resolution,[],[f86,f75]) ).

fof(f75,plain,
    ! [X0,X1] :
      ( ~ element(X0,powerset(X1))
      | subset(X0,X1) ),
    inference(cnf_transformation,[],[f29]) ).

fof(f29,axiom,
    ! [X1,X0] :
      ( subset(X0,X1)
    <=> element(X0,powerset(X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_subset) ).

fof(f86,plain,
    element(sK4,powerset(sK5)),
    inference(cnf_transformation,[],[f59]) ).

fof(f80,plain,
    ! [X0] : preboolean(finite_subsets(X0)),
    inference(cnf_transformation,[],[f8]) ).

fof(f8,axiom,
    ! [X0] : preboolean(finite_subsets(X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k5_finsub_1) ).

fof(f137,plain,
    finite(sK4),
    inference(unit_resulting_resolution,[],[f85,f86,f82]) ).

fof(f82,plain,
    ! [X0,X1] :
      ( ~ element(X1,powerset(X0))
      | finite(X1)
      | ~ finite(X0) ),
    inference(cnf_transformation,[],[f55]) ).

fof(f55,plain,
    ! [X0] :
      ( ! [X1] :
          ( finite(X1)
          | ~ element(X1,powerset(X0)) )
      | ~ finite(X0) ),
    inference(ennf_transformation,[],[f4]) ).

fof(f4,axiom,
    ! [X0] :
      ( finite(X0)
     => ! [X1] :
          ( element(X1,powerset(X0))
         => finite(X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cc2_finset_1) ).

fof(f85,plain,
    finite(sK5),
    inference(cnf_transformation,[],[f59]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SEU118+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.35  % Computer : n015.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Tue Aug 30 14:51:06 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.20/0.49  % (19658)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.20/0.49  % (19647)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.20/0.50  % (19647)First to succeed.
% 0.20/0.50  % (19647)Refutation found. Thanks to Tanya!
% 0.20/0.50  % SZS status Theorem for theBenchmark
% 0.20/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.50  % (19647)------------------------------
% 0.20/0.50  % (19647)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50  % (19647)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50  % (19647)Termination reason: Refutation
% 0.20/0.50  
% 0.20/0.50  % (19647)Memory used [KB]: 6012
% 0.20/0.50  % (19647)Time elapsed: 0.073 s
% 0.20/0.50  % (19647)Instructions burned: 5 (million)
% 0.20/0.50  % (19647)------------------------------
% 0.20/0.50  % (19647)------------------------------
% 0.20/0.50  % (19638)Success in time 0.145 s
%------------------------------------------------------------------------------