%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU128+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/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:52:00 PM UTC 2026
% Result : Theorem 0.07s 0.38s
% Output : Refutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 43 ( 13 unt; 2 def)
% Number of atoms : 87 ( 9 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 73 ( 29 ~; 25 |; 7 &)
% ( 8 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 52 ( 0 sgn 46 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
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(f7,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f8,axiom,
! [X0,X1,X2] :
( X2 = set_intersection2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
& in(X3,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f22,axiom,
! [X0,X1] :
( subset(X0,X1)
=> set_union2(X0,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_xboole_1) ).
fof(f24,conjecture,
! [X0,X1,X2] :
( ( subset(X0,X1)
& subset(X0,X2) )
=> subset(X0,set_intersection2(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t19_xboole_1) ).
fof(f25,negated_conjecture,
~ ! [X0,X1,X2] :
( ( subset(X0,X1)
& subset(X0,X2) )
=> subset(X0,set_intersection2(X1,X2)) ),
inference(negated_conjecture,[status(cth)],[f24]) ).
fof(f44,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f48,plain,
! [X0,X1] :
( set_union2(X0,X1) = X1
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f22]) ).
fof(f49,plain,
? [X0,X1,X2] :
( ~ subset(X0,set_intersection2(X1,X2))
& subset(X0,X1)
& subset(X0,X2) ),
inference(ennf_transformation,[],[f25]) ).
fof(f50,plain,
? [X0,X1,X2] :
( ~ subset(X0,set_intersection2(X1,X2))
& subset(X0,X1)
& subset(X0,X2) ),
inference(flattening,[],[f49]) ).
fof(f74,plain,
! [X2,X3,X0,X1] :
( ~ in(X3,X0)
| in(X3,X2)
| set_union2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f6]) ).
fof(f76,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK2(X0,X1),X0) ),
inference(cnf_transformation,[],[f44]) ).
fof(f77,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(sK2(X0,X1),X1) ),
inference(cnf_transformation,[],[f44]) ).
fof(f83,plain,
! [X2,X3,X0,X1] :
( ~ in(X3,X1)
| ~ in(X3,X0)
| in(X3,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f8]) ).
fof(f95,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| set_union2(X0,X1) = X1 ),
inference(cnf_transformation,[],[f48]) ).
fof(f97,plain,
subset(sK6,sK8),
inference(cnf_transformation,[],[f50]) ).
fof(f98,plain,
subset(sK6,sK7),
inference(cnf_transformation,[],[f50]) ).
fof(f99,plain,
~ subset(sK6,set_intersection2(sK7,sK8)),
inference(cnf_transformation,[],[f50]) ).
fof(f118,plain,
! [X3,X0,X1] :
( in(X3,set_union2(X0,X1))
| ~ in(X3,X0) ),
inference(equality_resolution,[],[f74]) ).
fof(f121,plain,
! [X3,X0,X1] :
( in(X3,set_intersection2(X0,X1))
| ~ in(X3,X0)
| ~ in(X3,X1) ),
inference(equality_resolution,[],[f83]) ).
fof(f197,plain,
sK8 = set_union2(sK6,sK8),
inference(resolution,[],[f95,f97]) ).
fof(f198,plain,
sK7 = set_union2(sK6,sK7),
inference(resolution,[],[f95,f98]) ).
fof(f228,plain,
in(sK2(sK6,set_intersection2(sK7,sK8)),sK6),
inference(resolution,[],[f76,f99]) ).
fof(f233,plain,
~ in(sK2(sK6,set_intersection2(sK7,sK8)),set_intersection2(sK7,sK8)),
inference(resolution,[],[f77,f99]) ).
fof(f261,plain,
! [X0] :
( in(X0,sK8)
| ~ in(X0,sK6) ),
inference(superposition,[],[f118,f197]) ).
fof(f262,plain,
! [X0] :
( in(X0,sK7)
| ~ in(X0,sK6) ),
inference(superposition,[],[f118,f198]) ).
fof(f425,plain,
( ~ in(sK2(sK6,set_intersection2(sK7,sK8)),sK7)
| ~ in(sK2(sK6,set_intersection2(sK7,sK8)),sK8) ),
inference(resolution,[],[f121,f233]) ).
fof(f433,definition,
( spl11_9
<=> in(sK2(sK6,set_intersection2(sK7,sK8)),sK8) ),
introduced(definition,[new_symbols(definition,[spl11_9])],[avatar_definition]) ).
fof(f435,plain,
( ~ in(sK2(sK6,set_intersection2(sK7,sK8)),sK8)
| spl11_9 ),
inference(avatar_component_clause,[],[f433]) ).
fof(f437,definition,
( spl11_10
<=> in(sK2(sK6,set_intersection2(sK7,sK8)),sK7) ),
introduced(definition,[new_symbols(definition,[spl11_10])],[avatar_definition]) ).
fof(f439,plain,
( ~ in(sK2(sK6,set_intersection2(sK7,sK8)),sK7)
| spl11_10 ),
inference(avatar_component_clause,[],[f437]) ).
fof(f440,plain,
( ~ spl11_9
| ~ spl11_10 ),
inference(avatar_split_clause,[],[f425,f437,f433]) ).
fof(f441,plain,
( ~ in(sK2(sK6,set_intersection2(sK7,sK8)),sK6)
| spl11_9 ),
inference(resolution,[],[f435,f261]) ).
fof(f442,plain,
( $false
| spl11_9 ),
inference(forward_subsumption_resolution,[],[f441,f228]) ).
fof(f443,plain,
spl11_9,
inference(avatar_contradiction_clause,[],[f442]) ).
fof(f466,plain,
( ~ in(sK2(sK6,set_intersection2(sK7,sK8)),sK6)
| spl11_10 ),
inference(resolution,[],[f439,f262]) ).
fof(f467,plain,
( $false
| spl11_10 ),
inference(forward_subsumption_resolution,[],[f466,f228]) ).
fof(f468,plain,
spl11_10,
inference(avatar_contradiction_clause,[],[f467]) ).
cnf(s8,plain,
( ~ spl11_9
| ~ spl11_10 ),
inference(sat_conversion,[],[f440]) ).
cnf(s9,plain,
spl11_9,
inference(sat_conversion,[],[f443]) ).
cnf(s10,plain,
spl11_10,
inference(sat_conversion,[],[f468]) ).
cnf(s11,plain,
$false,
inference(rat,[],[s8,s10,s9]) ).
fof(f469,plain,
$false,
inference(avatar_sat_refutation,[],[s11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SEU128+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.05/0.31 % Computer : n012.cluster.edu
% 0.05/0.31 % Model : x86_64 x86_64
% 0.05/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.31 % Memory : 8046.5625MB
% 0.05/0.31 % OS : Linux 6.8.0-71-generic
% 0.05/0.31 % CPULimit : 300
% 0.05/0.31 % WCLimit : 300
% 0.05/0.31 % DateTime : Mon Sep 28 03:39:20 UTC 2026
% 0.05/0.32 % CPUTime :
% 0.05/0.32 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.33 Running first-order model finding
% 0.07/0.33 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.07/0.38 % (2994843)Will run a generic schedule for satisfiability detection.
% 0.07/0.38 % (2994849)% WARNING: option uhcvi not known.
% 0.07/0.38 % (2994848)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=712762024_2999 on theBenchmark for (2999ds/0Mi)
% 0.07/0.38 % (2994849)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2134001004:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.07/0.38 % (2994850)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1719511039:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.07/0.38 % (2994851)dis+10_1_sil=32000:sp=arity:random_seed=2303038879:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.07/0.38 % (2994852)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3695011202:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.07/0.38 % (2994853)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2132801021:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.07/0.38 % (2994854)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1508110182:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.07/0.38 % TRYING [1]
% 0.07/0.38 % TRYING [2]
% 0.07/0.38 % TRYING [3]
% 0.07/0.38 % TRYING [4]
% 0.07/0.38 % (2994852) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2994843-2994852"...
% 0.07/0.38 % (2994852)...printing done.
% 0.07/0.38 % (2994852)Refutation found. Thanks to Tanya!
% 0.07/0.38 % SZS status Theorem for theBenchmark
% 0.07/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.38 % (2994852)------------------------------
% 0.07/0.38 % (2994852)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.38 % (2994852)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.38 % (2994852)CaDiCaL version: 2.1.3
% 0.07/0.38 % (2994852)Termination reason: Refutation
% 0.07/0.38 % (2994852)Time elapsed: 0.006 s
% 0.07/0.38 % (2994852)Peak memory usage: 12 MB
% 0.07/0.38 % (2994852)Instructions burned: 15 (million)
% 0.07/0.38 % (2994843)Success in time 0.036 s
% 0.07/0.38 % Vampire exiting
%------------------------------------------------------------------------------