%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET874+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 12:44:53 PM UTC 2026
% Result : Theorem 0.07s 0.35s
% Output : Refutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 7 unt; 0 def)
% Number of atoms : 22 ( 14 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 17 ( 8 ~; 6 |; 0 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 27 ( 25 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1,X2] :
( X2 = unordered_pair(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( X3 = X0
| X3 = X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_tarski) ).
fof(f8,axiom,
! [X0,X1] :
( in(X0,X1)
=> set_union2(singleton(X0),X1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l23_zfmisc_1) ).
fof(f11,conjecture,
! [X0,X1] : set_union2(singleton(X0),unordered_pair(X0,X1)) = unordered_pair(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t14_zfmisc_1) ).
fof(f12,negated_conjecture,
~ ! [X0,X1] : set_union2(singleton(X0),unordered_pair(X0,X1)) = unordered_pair(X0,X1),
inference(negated_conjecture,[status(cth)],[f11]) ).
fof(f17,plain,
! [X0,X1] :
( set_union2(singleton(X0),X1) = X1
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f18,plain,
? [X0,X1] : unordered_pair(X0,X1) != set_union2(singleton(X0),unordered_pair(X0,X1)),
inference(ennf_transformation,[],[f12]) ).
fof(f27,plain,
! [X2,X3,X0,X1] :
( X0 != X3
| in(X3,X2)
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f4]) ).
fof(f31,plain,
! [X0,X1] :
( ~ in(X0,X1)
| set_union2(singleton(X0),X1) = X1 ),
inference(cnf_transformation,[],[f17]) ).
fof(f34,plain,
unordered_pair(sK3,sK4) != set_union2(singleton(sK3),unordered_pair(sK3,sK4)),
inference(cnf_transformation,[],[f18]) ).
fof(f35,plain,
! [X2,X3,X1] :
( in(X3,X2)
| unordered_pair(X3,X1) != X2 ),
inference(equality_resolution,[],[f27]) ).
fof(f36,plain,
! [X3,X1] : in(X3,unordered_pair(X3,X1)),
inference(equality_resolution,[],[f35]) ).
fof(f60,plain,
! [X0,X1] : unordered_pair(X0,X1) = set_union2(singleton(X0),unordered_pair(X0,X1)),
inference(resolution,[],[f31,f36]) ).
fof(f62,plain,
$false,
inference(backward_subsumption_resolution,[],[f34,f60]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SET874+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.02 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Mon Sep 28 03:05:10 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.03/0.32 Running first-order model finding
% 0.03/0.32 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.35 % (2978161)Will run a generic schedule for satisfiability detection.
% 0.07/0.35 % (2978167)% WARNING: option uhcvi not known.
% 0.07/0.35 % (2978167)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=698577895:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.07/0.35 % (2978166)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3541070788_2999 on theBenchmark for (2999ds/0Mi)
% 0.07/0.35 % (2978169)dis+10_1_sil=32000:sp=arity:random_seed=2612472874:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.07/0.35 % (2978168)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=674425687:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.07/0.35 % (2978170)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2144402353:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.07/0.35 % (2978171)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3113891386:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.07/0.35 % (2978172)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3157174585:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.07/0.35 % TRYING [1]
% 0.07/0.35 % TRYING [2]
% 0.07/0.35 % (2978167) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2978161-2978167"...
% 0.07/0.35 % (2978170) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2978161-2978170"...
% 0.07/0.35 % TRYING [3]
% 0.07/0.35 % (2978169) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2978161-2978169"...
% 0.07/0.35 % (2978172) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2978161-2978172"...
% 0.07/0.35 % (2978168) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2978161-2978168"...
% 0.07/0.35 % TRYING [4]
% 0.07/0.35 % (2978167)...printing done.
% 0.07/0.35 % (2978170)...printing done.
% 0.07/0.35 % (2978171) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2978161-2978171"...
% 0.07/0.35 % (2978169)...printing done.
% 0.07/0.35 % (2978172)...printing done.
% 0.07/0.35 % (2978167)Refutation found. Thanks to Tanya!
% 0.07/0.35 % SZS status Theorem for theBenchmark
% 0.07/0.35 % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.35 % (2978167)------------------------------
% 0.07/0.35 % (2978167)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.35 % (2978167)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.35 % (2978167)CaDiCaL version: 2.1.3
% 0.07/0.35 % (2978167)Termination reason: Refutation
% 0.07/0.35 % (2978167)Time elapsed: 0.001 s
% 0.07/0.35 % (2978167)Peak memory usage: 12 MB
% 0.07/0.35 % (2978167)Instructions burned: 2 (million)
% 0.07/0.35 % (2978161)Success in time 0.025 s
% 0.07/0.35 % Vampire exiting
%------------------------------------------------------------------------------