%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SET940+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 : n027.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:48 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(f43,plain,
    $false,
    inference(trivial_inequality_removal,[],[f42]) ).

fof(f42,plain,
    union(unordered_pair(sK2,sK3)) != union(unordered_pair(sK2,sK3)),
    inference(definition_unfolding,[],[f37,f29]) ).

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

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

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

fof(f37,plain,
    union(unordered_pair(sK2,sK3)) != set_union2(sK2,sK3),
    inference(cnf_transformation,[],[f28]) ).

fof(f28,plain,
    union(unordered_pair(sK2,sK3)) != set_union2(sK2,sK3),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f18,f27]) ).

fof(f27,plain,
    ( ? [X0,X1] : set_union2(X0,X1) != union(unordered_pair(X0,X1))
   => union(unordered_pair(sK2,sK3)) != set_union2(sK2,sK3) ),
    introduced(choice_axiom,[]) ).

fof(f18,plain,
    ? [X0,X1] : set_union2(X0,X1) != union(unordered_pair(X0,X1)),
    inference(ennf_transformation,[],[f9]) ).

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

fof(f8,conjecture,
    ! [X0,X1] : set_union2(X0,X1) = union(unordered_pair(X0,X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t93_zfmisc_1) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SET940+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.12/0.34  % Computer : n027.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 14:46:46 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 0.20/0.47  % (21963)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.48  % (21947)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.48  % (21947)First to succeed.
% 0.20/0.48  % (21947)Refutation found. Thanks to Tanya!
% 0.20/0.48  % SZS status Theorem for theBenchmark
% 0.20/0.48  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.48  % (21947)------------------------------
% 0.20/0.48  % (21947)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.48  % (21947)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.48  % (21947)Termination reason: Refutation
% 0.20/0.48  
% 0.20/0.48  % (21947)Memory used [KB]: 5884
% 0.20/0.48  % (21947)Time elapsed: 0.003 s
% 0.20/0.48  % (21947)------------------------------
% 0.20/0.48  % (21947)------------------------------
% 0.20/0.48  % (21933)Success in time 0.13 s
%------------------------------------------------------------------------------