%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SEU140+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 : n001.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:51 EDT 2022

% Result   : Theorem 0.20s 0.50s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   28 (   9 unt;   0 def)
%            Number of atoms       :   60 (  10 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   51 (  19   ~;   8   |;  16   &)
%                                         (   1 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   45 (  33   !;  12   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f61,plain,
    $false,
    inference(subsumption_resolution,[],[f60,f57]) ).

fof(f57,plain,
    ~ subset(set_intersection2(sK1,sK0),empty_set),
    inference(unit_resulting_resolution,[],[f46,f41]) ).

fof(f41,plain,
    ! [X0] :
      ( ~ subset(X0,empty_set)
      | empty_set = X0 ),
    inference(cnf_transformation,[],[f24]) ).

fof(f24,plain,
    ! [X0] :
      ( ~ subset(X0,empty_set)
      | empty_set = X0 ),
    inference(ennf_transformation,[],[f14]) ).

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

fof(f46,plain,
    empty_set != set_intersection2(sK1,sK0),
    inference(unit_resulting_resolution,[],[f36,f38]) ).

fof(f38,plain,
    ! [X0,X1] :
      ( set_intersection2(X0,X1) != empty_set
      | disjoint(X0,X1) ),
    inference(cnf_transformation,[],[f32]) ).

fof(f32,plain,
    ! [X0,X1] :
      ( ( set_intersection2(X0,X1) = empty_set
        | ~ disjoint(X0,X1) )
      & ( disjoint(X0,X1)
        | set_intersection2(X0,X1) != empty_set ) ),
    inference(nnf_transformation,[],[f3]) ).

fof(f3,axiom,
    ! [X0,X1] :
      ( set_intersection2(X0,X1) = empty_set
    <=> disjoint(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d7_xboole_0) ).

fof(f36,plain,
    ~ disjoint(sK1,sK0),
    inference(cnf_transformation,[],[f31]) ).

fof(f31,plain,
    ( subset(sK1,sK2)
    & ~ disjoint(sK1,sK0)
    & disjoint(sK2,sK0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f29,f30]) ).

fof(f30,plain,
    ( ? [X0,X1,X2] :
        ( subset(X1,X2)
        & ~ disjoint(X1,X0)
        & disjoint(X2,X0) )
   => ( subset(sK1,sK2)
      & ~ disjoint(sK1,sK0)
      & disjoint(sK2,sK0) ) ),
    introduced(choice_axiom,[]) ).

fof(f29,plain,
    ? [X0,X1,X2] :
      ( subset(X1,X2)
      & ~ disjoint(X1,X0)
      & disjoint(X2,X0) ),
    inference(rectify,[],[f27]) ).

fof(f27,plain,
    ? [X1,X0,X2] :
      ( subset(X0,X2)
      & ~ disjoint(X0,X1)
      & disjoint(X2,X1) ),
    inference(flattening,[],[f26]) ).

fof(f26,plain,
    ? [X2,X1,X0] :
      ( ~ disjoint(X0,X1)
      & disjoint(X2,X1)
      & subset(X0,X2) ),
    inference(ennf_transformation,[],[f20]) ).

fof(f20,plain,
    ~ ! [X2,X1,X0] :
        ( ( disjoint(X2,X1)
          & subset(X0,X2) )
       => disjoint(X0,X1) ),
    inference(rectify,[],[f16]) ).

fof(f16,negated_conjecture,
    ~ ! [X0,X2,X1] :
        ( ( disjoint(X1,X2)
          & subset(X0,X1) )
       => disjoint(X0,X2) ),
    inference(negated_conjecture,[],[f15]) ).

fof(f15,conjecture,
    ! [X0,X2,X1] :
      ( ( disjoint(X1,X2)
        & subset(X0,X1) )
     => disjoint(X0,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t63_xboole_1) ).

fof(f60,plain,
    subset(set_intersection2(sK1,sK0),empty_set),
    inference(superposition,[],[f47,f44]) ).

fof(f44,plain,
    empty_set = set_intersection2(sK2,sK0),
    inference(unit_resulting_resolution,[],[f35,f39]) ).

fof(f39,plain,
    ! [X0,X1] :
      ( ~ disjoint(X0,X1)
      | set_intersection2(X0,X1) = empty_set ),
    inference(cnf_transformation,[],[f32]) ).

fof(f35,plain,
    disjoint(sK2,sK0),
    inference(cnf_transformation,[],[f31]) ).

fof(f47,plain,
    ! [X0] : subset(set_intersection2(sK1,X0),set_intersection2(sK2,X0)),
    inference(unit_resulting_resolution,[],[f37,f40]) ).

fof(f40,plain,
    ! [X2,X0,X1] :
      ( subset(set_intersection2(X1,X2),set_intersection2(X0,X2))
      | ~ subset(X1,X0) ),
    inference(cnf_transformation,[],[f28]) ).

fof(f28,plain,
    ! [X0,X1,X2] :
      ( subset(set_intersection2(X1,X2),set_intersection2(X0,X2))
      | ~ subset(X1,X0) ),
    inference(ennf_transformation,[],[f23]) ).

fof(f23,plain,
    ! [X0,X1,X2] :
      ( subset(X1,X0)
     => subset(set_intersection2(X1,X2),set_intersection2(X0,X2)) ),
    inference(rectify,[],[f12]) ).

fof(f12,axiom,
    ! [X1,X0,X2] :
      ( subset(X0,X1)
     => subset(set_intersection2(X0,X2),set_intersection2(X1,X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t26_xboole_1) ).

fof(f37,plain,
    subset(sK1,sK2),
    inference(cnf_transformation,[],[f31]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SEU140+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.14  % 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 : n001.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:05:02 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.20/0.48  % (32729)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.49  % (32727)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.49  % (32729)Instruction limit reached!
% 0.20/0.49  % (32729)------------------------------
% 0.20/0.49  % (32729)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.49  % (32717)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.50  % (32717)First to succeed.
% 0.20/0.50  % (32717)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  % (32717)------------------------------
% 0.20/0.50  % (32717)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50  % (32717)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50  % (32717)Termination reason: Refutation
% 0.20/0.50  
% 0.20/0.50  % (32717)Memory used [KB]: 5884
% 0.20/0.50  % (32717)Time elapsed: 0.090 s
% 0.20/0.50  % (32717)Instructions burned: 2 (million)
% 0.20/0.50  % (32717)------------------------------
% 0.20/0.50  % (32717)------------------------------
% 0.20/0.50  % (32711)Success in time 0.145 s
%------------------------------------------------------------------------------