TSTP Solution File: SET891+1 by SnakeForV-SAT---1.0

View Problem - Process Solution

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

% Computer : n018.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:01 EDT 2022

% Result   : Theorem 0.22s 0.50s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   26 (  26 unt;   0 def)
%            Number of atoms       :   26 (  25 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    6 (   6   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;   9 con; 0-2 aty)
%            Number of variables   :   19 (  17   !;   2   ?)

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

fof(f140,plain,
    sF6 != sF6,
    inference(superposition,[],[f40,f138]) ).

fof(f138,plain,
    sF10 = sF6,
    inference(superposition,[],[f135,f39]) ).

fof(f39,plain,
    sF10 = union(sF9),
    introduced(function_definition,[]) ).

fof(f135,plain,
    union(sF9) = sF6,
    inference(forward_demodulation,[],[f134,f38]) ).

fof(f38,plain,
    set_union2(sF7,sF8) = sF9,
    introduced(function_definition,[]) ).

fof(f134,plain,
    union(set_union2(sF7,sF8)) = sF6,
    inference(forward_demodulation,[],[f129,f35]) ).

fof(f35,plain,
    sF6 = set_union2(sF4,sF5),
    introduced(function_definition,[]) ).

fof(f129,plain,
    union(set_union2(sF7,sF8)) = set_union2(sF4,sF5),
    inference(superposition,[],[f71,f37]) ).

fof(f37,plain,
    sF8 = singleton(sF5),
    introduced(function_definition,[]) ).

fof(f71,plain,
    ! [X2] : set_union2(sF4,X2) = union(set_union2(sF7,singleton(X2))),
    inference(superposition,[],[f30,f36]) ).

fof(f36,plain,
    singleton(sF4) = sF7,
    introduced(function_definition,[]) ).

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

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

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

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

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

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

fof(f40,plain,
    sF10 != sF6,
    inference(definition_folding,[],[f32,f39,f38,f37,f34,f36,f33,f35,f34,f33]) ).

fof(f33,plain,
    singleton(sK1) = sF4,
    introduced(function_definition,[]) ).

fof(f34,plain,
    sF5 = singleton(sK0),
    introduced(function_definition,[]) ).

fof(f32,plain,
    set_union2(singleton(sK1),singleton(sK0)) != union(set_union2(singleton(singleton(sK1)),singleton(singleton(sK0)))),
    inference(definition_unfolding,[],[f21,f27,f27]) ).

fof(f21,plain,
    union(unordered_pair(singleton(sK1),singleton(sK0))) != unordered_pair(sK1,sK0),
    inference(cnf_transformation,[],[f18]) ).

fof(f18,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/sandbox2/benchmark/theBenchmark.p',t32_zfmisc_1) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem    : SET891+1 : TPTP v8.1.0. Released v3.2.0.
% 0.08/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.14/0.35  % Computer : n018.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Tue Aug 30 14:32:40 EDT 2022
% 0.14/0.35  % CPUTime    : 
% 0.22/0.50  % (21900)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.22/0.50  % (21900)First to succeed.
% 0.22/0.50  % (21900)Refutation found. Thanks to Tanya!
% 0.22/0.50  % SZS status Theorem for theBenchmark
% 0.22/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.50  % (21900)------------------------------
% 0.22/0.50  % (21900)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.22/0.50  % (21900)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.22/0.50  % (21900)Termination reason: Refutation
% 0.22/0.50  
% 0.22/0.50  % (21900)Memory used [KB]: 5500
% 0.22/0.50  % (21900)Time elapsed: 0.084 s
% 0.22/0.50  % (21900)Instructions burned: 3 (million)
% 0.22/0.50  % (21900)------------------------------
% 0.22/0.50  % (21900)------------------------------
% 0.22/0.50  % (21896)Success in time 0.142 s
%------------------------------------------------------------------------------