%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SET891+1 : TPTP v8.1.0. Released v3.2.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 : n012.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:22:41 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(f31,plain,
    $false,
    inference(subsumption_resolution,[],[f29,f28]) ).

fof(f28,plain,
    ! [X0,X1] : set_union2(X1,X0) = union(set_union2(singleton(X1),singleton(X0))),
    inference(definition_unfolding,[],[f21,f27]) ).

fof(f27,plain,
    ! [X0,X1] : unordered_pair(X0,X1) = set_union2(singleton(X0),singleton(X1)),
    inference(cnf_transformation,[],[f11]) ).

fof(f11,axiom,
    ! [X1,X0] : unordered_pair(X0,X1) = set_union2(singleton(X0),singleton(X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t41_enumset1) ).

fof(f21,plain,
    ! [X0,X1] : set_union2(X1,X0) = union(unordered_pair(X1,X0)),
    inference(cnf_transformation,[],[f12]) ).

fof(f12,plain,
    ! [X0,X1] : set_union2(X1,X0) = union(unordered_pair(X1,X0)),
    inference(rectify,[],[f6]) ).

fof(f6,axiom,
    ! [X1,X0] : set_union2(X0,X1) = union(unordered_pair(X0,X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l52_zfmisc_1) ).

fof(f29,plain,
    union(set_union2(singleton(singleton(sK2)),singleton(singleton(sK1)))) != set_union2(singleton(sK2),singleton(sK1)),
    inference(definition_unfolding,[],[f19,f27,f27]) ).

fof(f19,plain,
    union(unordered_pair(singleton(sK2),singleton(sK1))) != unordered_pair(sK2,sK1),
    inference(cnf_transformation,[],[f15]) ).

fof(f15,plain,
    ? [X1,X0] : unordered_pair(X0,X1) != union(unordered_pair(singleton(X0),singleton(X1))),
    inference(ennf_transformation,[],[f10]) ).

fof(f10,negated_conjecture,
    ~ ! [X0,X1] : unordered_pair(X0,X1) = union(unordered_pair(singleton(X0),singleton(X1))),
    inference(negated_conjecture,[],[f9]) ).

fof(f9,conjecture,
    ! [X0,X1] : unordered_pair(X0,X1) = union(unordered_pair(singleton(X0),singleton(X1))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t32_zfmisc_1) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SET891+1 : TPTP v8.1.0. Released v3.2.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.13/0.34  % Computer : n012.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:27:50 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.21/0.51  % (29723)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.21/0.51  % (29723)First to succeed.
% 0.21/0.52  % (29723)Refutation found. Thanks to Tanya!
% 0.21/0.52  % SZS status Theorem for theBenchmark
% 0.21/0.52  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.52  % (29723)------------------------------
% 0.21/0.52  % (29723)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.52  % (29723)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.52  % (29723)Termination reason: Refutation
% 0.21/0.52  
% 0.21/0.52  % (29723)Memory used [KB]: 5884
% 0.21/0.52  % (29723)Time elapsed: 0.003 s
% 0.21/0.52  % (29723)Instructions burned: 1 (million)
% 0.21/0.52  % (29723)------------------------------
% 0.21/0.52  % (29723)------------------------------
% 0.21/0.52  % (29714)Success in time 0.166 s
%------------------------------------------------------------------------------