TSTP Solution File: SET891+1 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SET891+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n007.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 : Sun May  5 09:19:37 EDT 2024

% Result   : Theorem 0.13s 0.37s
% Output   : Refutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   13 (  12 unt;   0 def)
%            Number of atoms       :   14 (  13 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    9 (   8   ~;   0   |;   0   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    4 (   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   :   16 (  12   !;   4   ?)

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

fof(f51,plain,
    unordered_pair(sK0,sK1) != unordered_pair(sK0,sK1),
    inference(superposition,[],[f40,f27]) ).

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

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

fof(f40,plain,
    unordered_pair(sK0,sK1) != set_union2(singleton(sK0),singleton(sK1)),
    inference(superposition,[],[f22,f26]) ).

fof(f26,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(f22,plain,
    unordered_pair(sK0,sK1) != union(unordered_pair(singleton(sK0),singleton(sK1))),
    inference(cnf_transformation,[],[f17]) ).

fof(f17,plain,
    unordered_pair(sK0,sK1) != union(unordered_pair(singleton(sK0),singleton(sK1))),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f13,f16]) ).

fof(f16,plain,
    ( ? [X0,X1] : unordered_pair(X0,X1) != union(unordered_pair(singleton(X0),singleton(X1)))
   => unordered_pair(sK0,sK1) != union(unordered_pair(singleton(sK0),singleton(sK1))) ),
    introduced(choice_axiom,[]) ).

fof(f13,plain,
    ? [X0,X1] : 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.04/0.12  % Problem    : SET891+1 : TPTP v8.1.2. Released v3.2.0.
% 0.12/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.35  % Computer : n007.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   : Fri May  3 16:45:08 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.13/0.35  % (19545)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.36  % (19548)WARNING: value z3 for option sas not known
% 0.13/0.37  % (19548)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.13/0.37  % (19548)First to succeed.
% 0.13/0.37  % (19546)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.13/0.37  % (19547)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.13/0.37  % (19549)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.13/0.37  % (19548)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-19545"
% 0.13/0.37  % (19550)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.13/0.37  % (19551)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.13/0.37  % (19552)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.13/0.37  % (19548)Refutation found. Thanks to Tanya!
% 0.13/0.37  % SZS status Theorem for theBenchmark
% 0.13/0.37  % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.37  % (19548)------------------------------
% 0.13/0.37  % (19548)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.13/0.37  % (19548)Termination reason: Refutation
% 0.13/0.37  
% 0.13/0.37  % (19548)Memory used [KB]: 761
% 0.13/0.37  % (19548)Time elapsed: 0.005 s
% 0.13/0.37  % (19548)Instructions burned: 4 (million)
% 0.13/0.37  % (19545)Success in time 0.018 s
%------------------------------------------------------------------------------