%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU126+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n003.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.12s 0.46s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 13 unt; 0 def)
% Number of atoms : 55 ( 14 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 49 ( 21 ~; 16 |; 8 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 41 ( 39 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(f4,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(f20,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f22,conjecture,
! [X0,X1] :
( subset(X0,X1)
=> set_union2(X0,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_xboole_1) ).
fof(f23,negated_conjecture,
~ ! [X0,X1] :
( subset(X0,X1)
=> set_union2(X0,X1) = X1 ),
inference(negated_conjecture,[status(cth)],[f22]) ).
fof(f32,axiom,
! [X0,X1] : subset(X0,set_union2(X0,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_xboole_1) ).
fof(f34,axiom,
! [X0,X1,X2] :
( ( subset(X0,X1)
& subset(X2,X1) )
=> subset(set_union2(X0,X2),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_xboole_1) ).
fof(f37,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f20]) ).
fof(f45,plain,
? [X0,X1] :
( set_union2(X0,X1) != X1
& subset(X0,X1) ),
inference(ennf_transformation,[],[f23]) ).
fof(f54,plain,
! [X0,X1,X2] :
( subset(set_union2(X0,X2),X1)
| ~ subset(X0,X1)
| ~ subset(X2,X1) ),
inference(ennf_transformation,[],[f34]) ).
fof(f55,plain,
! [X0,X1,X2] :
( subset(set_union2(X0,X2),X1)
| ~ subset(X0,X1)
| ~ subset(X2,X1) ),
inference(flattening,[],[f54]) ).
fof(f56,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f57,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) )
& ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 ) ),
inference(flattening,[],[f56]) ).
fof(f75,plain,
( sK7 != set_union2(sK6,sK7)
& subset(sK6,sK7) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7]),skolemize(X0,sK6),skolemize(X1,sK7)],[f45]) ).
fof(f79,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f83,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| X0 = X1
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f57]) ).
fof(f110,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f37]) ).
fof(f112,plain,
subset(sK6,sK7),
inference(cnf_transformation,[],[f75]) ).
fof(f113,plain,
sK7 != set_union2(sK6,sK7),
inference(cnf_transformation,[],[f75]) ).
fof(f125,plain,
! [X0,X1] : subset(X0,set_union2(X0,X1)),
inference(cnf_transformation,[],[f32]) ).
fof(f127,plain,
! [X2,X0,X1] :
( ~ subset(X0,X1)
| subset(set_union2(X0,X2),X1)
| ~ subset(X2,X1) ),
inference(cnf_transformation,[],[f55]) ).
fof(f151,plain,
! [X0,X1] : subset(X1,set_union2(X0,X1)),
inference(superposition,[],[f125,f79]) ).
fof(f236,plain,
! [X0] :
( ~ subset(X0,sK7)
| subset(set_union2(sK6,X0),sK7) ),
inference(resolution,[],[f127,f112]) ).
fof(f288,plain,
subset(set_union2(sK6,sK7),sK7),
inference(resolution,[],[f236,f110]) ).
fof(f295,plain,
( sK7 = set_union2(sK6,sK7)
| ~ subset(sK7,set_union2(sK6,sK7)) ),
inference(resolution,[],[f288,f83]) ).
fof(f297,plain,
~ subset(sK7,set_union2(sK6,sK7)),
inference(forward_subsumption_resolution,[],[f295,f113]) ).
fof(f298,plain,
$false,
inference(forward_subsumption_resolution,[],[f297,f151]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU126+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.37 % Computer : n003.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 28 03:41:14 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41 Running first-order model finding
% 0.12/0.41 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.12/0.46 % (1161441)Will run a generic schedule for satisfiability detection.
% 0.12/0.46 % (1161457)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2721589760:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.12/0.46 % (1161452)% WARNING: option uhcvi not known.
% 0.12/0.46 % (1161456)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1884911033:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.12/0.46 % (1161455)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2208240099:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.12/0.46 % (1161453)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3702816922:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.12/0.46 % (1161454)dis+10_1_sil=32000:sp=arity:random_seed=3573746945:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.12/0.46 % (1161452)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=414630518:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.12/0.46 % (1161451)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2639307357_2999 on theBenchmark for (2999ds/0Mi)
% 0.12/0.46 % TRYING [1]
% 0.12/0.46 % TRYING [2]
% 0.12/0.46 % TRYING [3]
% 0.12/0.46 % (1161456) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1161441-1161456"...
% 0.12/0.46 % (1161456)...printing done.
% 0.12/0.46 % (1161456)Refutation found. Thanks to Tanya!
% 0.12/0.46 % SZS status Theorem for theBenchmark
% 0.12/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.46 % (1161456)------------------------------
% 0.12/0.46 % (1161456)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.46 % (1161456)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.46 % (1161456)CaDiCaL version: 2.1.3
% 0.12/0.46 % (1161456)Termination reason: Refutation
% 0.12/0.46 % (1161456)Time elapsed: 0.007 s
% 0.12/0.46 % (1161456)Peak memory usage: 12 MB
% 0.12/0.46 % (1161456)Instructions burned: 8 (million)
% 0.12/0.46 % (1161441)Success in time 0.042 s
% 0.12/0.46 % Vampire exiting
%------------------------------------------------------------------------------