%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET909+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n018.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:58 PM UTC 2026
% Result : Theorem 0.18s 0.49s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 8 unt; 0 def)
% Number of atoms : 32 ( 14 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 30 ( 15 ~; 10 |; 0 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 40 ( 37 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0] :
( X0 = empty_set
<=> ! [X1] : ~ in(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(f5,axiom,
! [X0,X1,X2] :
( X2 = unordered_pair(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( X3 = X0
| X3 = X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).
fof(f6,axiom,
! [X0,X1,X2] :
( X2 = set_union2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
| in(X3,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_xboole_0) ).
fof(f13,conjecture,
! [X0,X1,X2] : set_union2(unordered_pair(X0,X1),X2) != empty_set,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t50_zfmisc_1) ).
fof(f14,negated_conjecture,
~ ! [X0,X1,X2] : set_union2(unordered_pair(X0,X1),X2) != empty_set,
inference(negated_conjecture,[status(cth)],[f13]) ).
fof(f19,plain,
? [X0,X1,X2] : empty_set = set_union2(unordered_pair(X0,X1),X2),
inference(ennf_transformation,[],[f14]) ).
fof(f24,plain,
! [X0,X1] :
( ~ in(X1,X0)
| empty_set != X0 ),
inference(cnf_transformation,[],[f4]) ).
fof(f29,plain,
! [X2,X3,X0,X1] :
( X1 != X3
| in(X3,X2)
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f5]) ).
fof(f36,plain,
! [X2,X3,X0,X1] :
( ~ in(X3,X0)
| in(X3,X2)
| set_union2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f6]) ).
fof(f43,plain,
empty_set = set_union2(unordered_pair(sK5,sK6),sK7),
inference(cnf_transformation,[],[f19]) ).
fof(f44,plain,
! [X1] : ~ in(X1,empty_set),
inference(equality_resolution,[],[f24]) ).
fof(f47,plain,
! [X2,X3,X0] :
( in(X3,X2)
| unordered_pair(X0,X3) != X2 ),
inference(equality_resolution,[],[f29]) ).
fof(f48,plain,
! [X3,X0] : in(X3,unordered_pair(X0,X3)),
inference(equality_resolution,[],[f47]) ).
fof(f50,plain,
! [X3,X0,X1] :
( in(X3,set_union2(X0,X1))
| ~ in(X3,X0) ),
inference(equality_resolution,[],[f36]) ).
fof(f82,plain,
! [X0] :
( in(X0,empty_set)
| ~ in(X0,unordered_pair(sK5,sK6)) ),
inference(superposition,[],[f50,f43]) ).
fof(f86,plain,
! [X0] : ~ in(X0,unordered_pair(sK5,sK6)),
inference(forward_subsumption_resolution,[],[f82,f44]) ).
fof(f105,plain,
$false,
inference(resolution,[],[f86,f48]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET909+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.39 % Computer : n018.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Mon Sep 28 03:11:39 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.43 Running first-order model finding
% 0.11/0.43 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.48 % (2957631)Will run a generic schedule for satisfiability detection.
% 0.18/0.48 % (2957636)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2347751644_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.48 % TRYING [1]
% 0.18/0.48 % TRYING [2]
% 0.18/0.48 % TRYING [3]
% 0.18/0.48 % TRYING [4]
% 0.18/0.48 % (2957637)% WARNING: option uhcvi not known.
% 0.18/0.48 % TRYING [5]
% 0.18/0.48 % (2957637)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=462037104:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.48 % (2957638)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2438326614:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.48 % (2957639)dis+10_1_sil=32000:sp=arity:random_seed=350792940:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.48 % (2957640)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=463457478:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.48 % (2957641)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1947776024:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.48 % (2957642)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=307280995:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.49 % (2957639) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2957631-2957639"...
% 0.18/0.49 % (2957640) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2957631-2957640"...
% 0.18/0.49 % (2957637) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2957631-2957637"...
% 0.18/0.49 % (2957642) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2957631-2957642"...
% 0.18/0.49 % (2957638) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2957631-2957638"...
% 0.18/0.49 % (2957637)...printing done.
% 0.18/0.49 % (2957640)...printing done.
% 0.18/0.49 % (2957639)...printing done.
% 0.18/0.49 % (2957642)...printing done.
% 0.18/0.49 % (2957638)...printing done.
% 0.18/0.49 % (2957637)Refutation found. Thanks to Tanya!
% 0.18/0.49 % SZS status Theorem for theBenchmark
% 0.18/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.49 % (2957637)------------------------------
% 0.18/0.49 % (2957637)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.49 % (2957637)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.49 % (2957637)CaDiCaL version: 2.1.3
% 0.18/0.49 % (2957637)Termination reason: Refutation
% 0.18/0.49 % (2957637)Time elapsed: 0.004 s
% 0.18/0.49 % (2957637)Peak memory usage: 12 MB
% 0.18/0.49 % (2957637)Instructions burned: 4 (million)
% 0.18/0.49 % (2957631)Success in time 0.048 s
% 0.18/0.49 % Vampire exiting
%------------------------------------------------------------------------------