%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SEU186+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:27:13 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(f153,plain,
    $false,
    inference(subsumption_resolution,[],[f144,f53]) ).

fof(f53,plain,
    ! [X0] : element(sK3(X0),X0),
    inference(cnf_transformation,[],[f11]) ).

fof(f11,axiom,
    ! [X0] :
    ? [X1] : element(X1,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_m1_subset_1) ).

fof(f144,plain,
    ~ element(sK3(sK5),sK5),
    inference(superposition,[],[f82,f103]) ).

fof(f103,plain,
    unordered_pair(singleton(sK1(sK3(sK5))),unordered_pair(sK0(sK3(sK5)),sK1(sK3(sK5)))) = sK3(sK5),
    inference(superposition,[],[f95,f66]) ).

fof(f66,plain,
    ! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
    inference(cnf_transformation,[],[f3]) ).

fof(f3,axiom,
    ! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).

fof(f95,plain,
    sK3(sK5) = unordered_pair(unordered_pair(sK0(sK3(sK5)),sK1(sK3(sK5))),singleton(sK1(sK3(sK5)))),
    inference(forward_demodulation,[],[f94,f66]) ).

fof(f94,plain,
    unordered_pair(unordered_pair(sK1(sK3(sK5)),sK0(sK3(sK5))),singleton(sK1(sK3(sK5)))) = sK3(sK5),
    inference(subsumption_resolution,[],[f92,f59]) ).

fof(f59,plain,
    relation(sK5),
    inference(cnf_transformation,[],[f44]) ).

fof(f44,plain,
    ? [X0] :
      ( relation(X0)
      & empty_set != X0
      & ! [X1,X2] : ~ in(ordered_pair(X1,X2),X0) ),
    inference(flattening,[],[f43]) ).

fof(f43,plain,
    ? [X0] :
      ( empty_set != X0
      & ! [X1,X2] : ~ in(ordered_pair(X1,X2),X0)
      & relation(X0) ),
    inference(ennf_transformation,[],[f24]) ).

fof(f24,negated_conjecture,
    ~ ! [X0] :
        ( relation(X0)
       => ( ! [X1,X2] : ~ in(ordered_pair(X1,X2),X0)
         => empty_set = X0 ) ),
    inference(negated_conjecture,[],[f23]) ).

fof(f23,conjecture,
    ! [X0] :
      ( relation(X0)
     => ( ! [X1,X2] : ~ in(ordered_pair(X1,X2),X0)
       => empty_set = X0 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t56_relat_1) ).

fof(f92,plain,
    ( ~ relation(sK5)
    | unordered_pair(unordered_pair(sK1(sK3(sK5)),sK0(sK3(sK5))),singleton(sK1(sK3(sK5)))) = sK3(sK5) ),
    inference(resolution,[],[f78,f71]) ).

fof(f71,plain,
    ! [X0,X1] :
      ( ~ in(X1,X0)
      | ~ relation(X0)
      | unordered_pair(unordered_pair(sK1(X1),sK0(X1)),singleton(sK1(X1))) = X1 ),
    inference(definition_unfolding,[],[f46,f64]) ).

fof(f64,plain,
    ! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
    inference(cnf_transformation,[],[f5]) ).

fof(f5,axiom,
    ! [X1,X0] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_tarski) ).

fof(f46,plain,
    ! [X0,X1] :
      ( ~ relation(X0)
      | ordered_pair(sK1(X1),sK0(X1)) = X1
      | ~ in(X1,X0) ),
    inference(cnf_transformation,[],[f36]) ).

fof(f36,plain,
    ! [X0] :
      ( ! [X1] :
          ( ~ in(X1,X0)
          | ? [X3,X2] : ordered_pair(X2,X3) = X1 )
      | ~ relation(X0) ),
    inference(ennf_transformation,[],[f33]) ).

fof(f33,plain,
    ! [X0] :
      ( relation(X0)
     => ! [X1] :
          ~ ( in(X1,X0)
            & ! [X2,X3] : ordered_pair(X2,X3) != X1 ) ),
    inference(unused_predicate_definition_removal,[],[f4]) ).

fof(f4,axiom,
    ! [X0] :
      ( relation(X0)
    <=> ! [X1] :
          ~ ( in(X1,X0)
            & ! [X2,X3] : ordered_pair(X2,X3) != X1 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_relat_1) ).

fof(f78,plain,
    in(sK3(sK5),sK5),
    inference(unit_resulting_resolution,[],[f53,f75,f55]) ).

fof(f55,plain,
    ! [X0,X1] :
      ( ~ element(X0,X1)
      | in(X0,X1)
      | empty(X1) ),
    inference(cnf_transformation,[],[f38]) ).

fof(f38,plain,
    ! [X1,X0] :
      ( in(X0,X1)
      | ~ element(X0,X1)
      | empty(X1) ),
    inference(flattening,[],[f37]) ).

fof(f37,plain,
    ! [X1,X0] :
      ( empty(X1)
      | in(X0,X1)
      | ~ element(X0,X1) ),
    inference(ennf_transformation,[],[f22]) ).

fof(f22,axiom,
    ! [X1,X0] :
      ( element(X0,X1)
     => ( empty(X1)
        | in(X0,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_subset) ).

fof(f75,plain,
    ~ empty(sK5),
    inference(unit_resulting_resolution,[],[f58,f65]) ).

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

fof(f41,plain,
    ! [X0] :
      ( ~ empty(X0)
      | empty_set = X0 ),
    inference(ennf_transformation,[],[f25]) ).

fof(f25,axiom,
    ! [X0] :
      ( empty(X0)
     => empty_set = X0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_boole) ).

fof(f58,plain,
    empty_set != sK5,
    inference(cnf_transformation,[],[f44]) ).

fof(f82,plain,
    ! [X0,X1] : ~ element(unordered_pair(singleton(X0),unordered_pair(X1,X0)),sK5),
    inference(unit_resulting_resolution,[],[f75,f80,f55]) ).

fof(f80,plain,
    ! [X0,X1] : ~ in(unordered_pair(singleton(X0),unordered_pair(X1,X0)),sK5),
    inference(superposition,[],[f74,f66]) ).

fof(f74,plain,
    ! [X2,X1] : ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),sK5),
    inference(forward_demodulation,[],[f72,f66]) ).

fof(f72,plain,
    ! [X2,X1] : ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),sK5),
    inference(definition_unfolding,[],[f57,f64]) ).

fof(f57,plain,
    ! [X2,X1] : ~ in(ordered_pair(X1,X2),sK5),
    inference(cnf_transformation,[],[f44]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SEU186+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_uns --cores 0 -t %d %s
% 0.12/0.34  % Computer : n001.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Tue Aug 30 15:09:01 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 0.19/0.46  % (12133)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.19/0.46  % (12125)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.19/0.46  % (12118)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.19/0.47  % (12133)Refutation not found, incomplete strategy% (12133)------------------------------
% 0.19/0.47  % (12133)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.47  % (12133)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.47  % (12133)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.47  
% 0.19/0.47  % (12133)Memory used [KB]: 1407
% 0.19/0.47  % (12133)Time elapsed: 0.060 s
% 0.19/0.47  % (12133)Instructions burned: 2 (million)
% 0.19/0.47  % (12133)------------------------------
% 0.19/0.47  % (12133)------------------------------
% 0.19/0.47  % (12118)First to succeed.
% 0.19/0.47  % (12118)Refutation found. Thanks to Tanya!
% 0.19/0.47  % SZS status Theorem for theBenchmark
% 0.19/0.47  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.47  % (12118)------------------------------
% 0.19/0.47  % (12118)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.47  % (12118)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.47  % (12118)Termination reason: Refutation
% 0.19/0.47  
% 0.19/0.47  % (12118)Memory used [KB]: 6012
% 0.19/0.47  % (12118)Time elapsed: 0.063 s
% 0.19/0.47  % (12118)Instructions burned: 5 (million)
% 0.19/0.47  % (12118)------------------------------
% 0.19/0.47  % (12118)------------------------------
% 0.19/0.47  % (12109)Success in time 0.128 s
%------------------------------------------------------------------------------