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

% Computer : n007.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:33:03 EDT 2022

% Result   : Theorem 0.19s 0.52s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   22 (   5 unt;   0 def)
%            Number of atoms       :   52 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   46 (  16   ~;   8   |;  14   &)
%                                         (   2 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :   30 (  22   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f261,plain,
    $false,
    inference(subsumption_resolution,[],[f259,f197]) ).

fof(f197,plain,
    ~ finite(sK12),
    inference(cnf_transformation,[],[f127]) ).

fof(f127,plain,
    ( subset(sK12,sK11)
    & finite(sK11)
    & ~ finite(sK12) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK11,sK12])],[f125,f126]) ).

fof(f126,plain,
    ( ? [X0,X1] :
        ( subset(X1,X0)
        & finite(X0)
        & ~ finite(X1) )
   => ( subset(sK12,sK11)
      & finite(sK11)
      & ~ finite(sK12) ) ),
    introduced(choice_axiom,[]) ).

fof(f125,plain,
    ? [X0,X1] :
      ( subset(X1,X0)
      & finite(X0)
      & ~ finite(X1) ),
    inference(rectify,[],[f87]) ).

fof(f87,plain,
    ? [X1,X0] :
      ( subset(X0,X1)
      & finite(X1)
      & ~ finite(X0) ),
    inference(flattening,[],[f86]) ).

fof(f86,plain,
    ? [X1,X0] :
      ( ~ finite(X0)
      & finite(X1)
      & subset(X0,X1) ),
    inference(ennf_transformation,[],[f41]) ).

fof(f41,negated_conjecture,
    ~ ! [X1,X0] :
        ( ( finite(X1)
          & subset(X0,X1) )
       => finite(X0) ),
    inference(negated_conjecture,[],[f40]) ).

fof(f40,conjecture,
    ! [X1,X0] :
      ( ( finite(X1)
        & subset(X0,X1) )
     => finite(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t13_finset_1) ).

fof(f259,plain,
    finite(sK12),
    inference(resolution,[],[f258,f199]) ).

fof(f199,plain,
    subset(sK12,sK11),
    inference(cnf_transformation,[],[f127]) ).

fof(f258,plain,
    ! [X0] :
      ( ~ subset(X0,sK11)
      | finite(X0) ),
    inference(resolution,[],[f253,f236]) ).

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

fof(f70,plain,
    ! [X0,X1] :
      ( element(X1,powerset(X0))
      | ~ subset(X1,X0) ),
    inference(ennf_transformation,[],[f57]) ).

fof(f57,plain,
    ! [X1,X0] :
      ( subset(X1,X0)
     => element(X1,powerset(X0)) ),
    inference(unused_predicate_definition_removal,[],[f52]) ).

fof(f52,plain,
    ! [X1,X0] :
      ( element(X1,powerset(X0))
    <=> subset(X1,X0) ),
    inference(rectify,[],[f44]) ).

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

fof(f253,plain,
    ! [X5] :
      ( ~ element(X5,powerset(sK11))
      | finite(X5) ),
    inference(resolution,[],[f173,f198]) ).

fof(f198,plain,
    finite(sK11),
    inference(cnf_transformation,[],[f127]) ).

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SEU294+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.34  % Computer : n007.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Tue Aug 30 14:50:46 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.19/0.50  % (1081)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.19/0.50  % (1087)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.51  % (1094)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.19/0.51  % (1081)First to succeed.
% 0.19/0.52  % (1106)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.19/0.52  % (1080)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.52  % (1101)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.19/0.52  % (1081)Refutation found. Thanks to Tanya!
% 0.19/0.52  % SZS status Theorem for theBenchmark
% 0.19/0.52  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.52  % (1081)------------------------------
% 0.19/0.52  % (1081)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52  % (1081)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52  % (1081)Termination reason: Refutation
% 0.19/0.52  
% 0.19/0.52  % (1081)Memory used [KB]: 1023
% 0.19/0.52  % (1081)Time elapsed: 0.111 s
% 0.19/0.52  % (1081)Instructions burned: 4 (million)
% 0.19/0.52  % (1081)------------------------------
% 0.19/0.52  % (1081)------------------------------
% 0.19/0.52  % (1076)Success in time 0.174 s
%------------------------------------------------------------------------------