%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SEU123+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 : n017.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:32:00 EDT 2022

% Result   : Theorem 0.19s 0.53s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   16 (   6 unt;   0 def)
%            Number of atoms       :   38 (  15 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   37 (  15   ~;   9   |;   9   &)
%                                         (   1 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   14 (  12   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f55,plain,
    $false,
    inference(subsumption_resolution,[],[f54,f39]) ).

fof(f39,plain,
    empty_set != sK2,
    inference(cnf_transformation,[],[f28]) ).

fof(f28,plain,
    ( empty_set != sK2
    & subset(sK2,empty_set) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f19,f27]) ).

fof(f27,plain,
    ( ? [X0] :
        ( empty_set != X0
        & subset(X0,empty_set) )
   => ( empty_set != sK2
      & subset(sK2,empty_set) ) ),
    introduced(choice_axiom,[]) ).

fof(f19,plain,
    ? [X0] :
      ( empty_set != X0
      & subset(X0,empty_set) ),
    inference(ennf_transformation,[],[f10]) ).

fof(f10,negated_conjecture,
    ~ ! [X0] :
        ( subset(X0,empty_set)
       => empty_set = X0 ),
    inference(negated_conjecture,[],[f9]) ).

fof(f9,conjecture,
    ! [X0] :
      ( subset(X0,empty_set)
     => empty_set = X0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_xboole_1) ).

fof(f54,plain,
    empty_set = sK2,
    inference(subsumption_resolution,[],[f48,f40]) ).

fof(f40,plain,
    ! [X0] : subset(empty_set,X0),
    inference(cnf_transformation,[],[f8]) ).

fof(f8,axiom,
    ! [X0] : subset(empty_set,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_xboole_1) ).

fof(f48,plain,
    ( ~ subset(empty_set,sK2)
    | empty_set = sK2 ),
    inference(resolution,[],[f32,f38]) ).

fof(f38,plain,
    subset(sK2,empty_set),
    inference(cnf_transformation,[],[f28]) ).

fof(f32,plain,
    ! [X0,X1] :
      ( ~ subset(X1,X0)
      | ~ subset(X0,X1)
      | X0 = X1 ),
    inference(cnf_transformation,[],[f26]) ).

fof(f26,plain,
    ! [X0,X1] :
      ( ( ( subset(X0,X1)
          & subset(X1,X0) )
        | X0 != X1 )
      & ( X0 = X1
        | ~ subset(X0,X1)
        | ~ subset(X1,X0) ) ),
    inference(flattening,[],[f25]) ).

fof(f25,plain,
    ! [X0,X1] :
      ( ( ( subset(X0,X1)
          & subset(X1,X0) )
        | X0 != X1 )
      & ( X0 = X1
        | ~ subset(X0,X1)
        | ~ subset(X1,X0) ) ),
    inference(nnf_transformation,[],[f2]) ).

fof(f2,axiom,
    ! [X0,X1] :
      ( ( subset(X0,X1)
        & subset(X1,X0) )
    <=> X0 = X1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d10_xboole_0) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem    : SEU123+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/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.35  % Computer : n017.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:04:20 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.19/0.52  % (18335)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.53  % (18334)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.53  % (18336)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.53  % (18344)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.53  % (18350)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.53  % (18344)First to succeed.
% 0.19/0.53  % (18344)Refutation found. Thanks to Tanya!
% 0.19/0.53  % SZS status Theorem for theBenchmark
% 0.19/0.53  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.53  % (18344)------------------------------
% 0.19/0.53  % (18344)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53  % (18344)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53  % (18344)Termination reason: Refutation
% 0.19/0.53  
% 0.19/0.53  % (18344)Memory used [KB]: 5373
% 0.19/0.53  % (18344)Time elapsed: 0.121 s
% 0.19/0.53  % (18344)Instructions burned: 2 (million)
% 0.19/0.53  % (18344)------------------------------
% 0.19/0.53  % (18344)------------------------------
% 0.19/0.53  % (18327)Success in time 0.174 s
%------------------------------------------------------------------------------