%------------------------------------------------------------------------------
% File     : SnakeForV---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_uns --cores 0 -t %d %s

% Computer : n023.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:45 EDT 2022

% Result   : Theorem 0.20s 0.57s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   17 (   6 unt;   0 def)
%            Number of atoms       :   41 (  16 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   39 (  15   ~;   9   |;  10   &)
%                                         (   2 <=>;   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   :   16 (  14   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f59,plain,
    $false,
    inference(subsumption_resolution,[],[f58,f41]) ).

fof(f41,plain,
    empty_set != sK1,
    inference(cnf_transformation,[],[f28]) ).

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

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

fof(f20,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/sandbox/benchmark/theBenchmark.p',t3_xboole_1) ).

fof(f58,plain,
    empty_set = sK1,
    inference(subsumption_resolution,[],[f51,f31]) ).

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

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

fof(f51,plain,
    ( ~ subset(empty_set,sK1)
    | empty_set = sK1 ),
    inference(resolution,[],[f37,f40]) ).

fof(f40,plain,
    subset(sK1,empty_set),
    inference(cnf_transformation,[],[f28]) ).

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

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

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

fof(f14,plain,
    ! [X0,X1] :
      ( ( subset(X1,X0)
        & subset(X0,X1) )
    <=> X0 = X1 ),
    inference(rectify,[],[f2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SEU123+1 : TPTP v8.1.0. Released v3.3.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 : n023.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 15:00:50 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.20/0.56  % (4977)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 0.20/0.56  % (4963)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.57  % (4977)First to succeed.
% 0.20/0.57  % (4951)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.57  % (4963)Also succeeded, but the first one will report.
% 0.20/0.57  % (4977)Refutation found. Thanks to Tanya!
% 0.20/0.57  % SZS status Theorem for theBenchmark
% 0.20/0.57  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.57  % (4977)------------------------------
% 0.20/0.57  % (4977)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.57  % (4977)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.57  % (4977)Termination reason: Refutation
% 0.20/0.57  
% 0.20/0.57  % (4977)Memory used [KB]: 5884
% 0.20/0.57  % (4977)Time elapsed: 0.077 s
% 0.20/0.57  % (4977)Instructions burned: 2 (million)
% 0.20/0.57  % (4977)------------------------------
% 0.20/0.57  % (4977)------------------------------
% 0.20/0.57  % (4947)Success in time 0.214 s
%------------------------------------------------------------------------------