%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU140+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 : n026.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:04 PM UTC 2026
% Result : Theorem 0.11s 0.46s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 27 ( 9 unt; 0 def)
% Number of atoms : 65 ( 6 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 66 ( 28 ~; 15 |; 18 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 50 ( 41 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0,X1,X2] :
( X2 = set_union2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
| in(X3,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_xboole_0) ).
fof(f28,axiom,
! [X0,X1] :
( subset(X0,X1)
=> set_union2(X0,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_xboole_1) ).
fof(f43,axiom,
! [X0,X1] :
( ~ ( ~ disjoint(X0,X1)
& ! [X2] :
~ ( in(X2,X0)
& in(X2,X1) ) )
& ~ ( ? [X2] :
( in(X2,X0)
& in(X2,X1) )
& disjoint(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_xboole_0) ).
fof(f51,conjecture,
! [X0,X1,X2] :
( ( subset(X0,X1)
& disjoint(X1,X2) )
=> disjoint(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t63_xboole_1) ).
fof(f52,negated_conjecture,
~ ! [X0,X1,X2] :
( ( subset(X0,X1)
& disjoint(X1,X2) )
=> disjoint(X0,X2) ),
inference(negated_conjecture,[status(cth)],[f51]) ).
fof(f62,plain,
! [X0,X1] :
( ~ ( ~ disjoint(X0,X1)
& ! [X2] :
~ ( in(X2,X0)
& in(X2,X1) ) )
& ~ ( ? [X3] :
( in(X3,X0)
& in(X3,X1) )
& disjoint(X0,X1) ) ),
inference(rectify,[],[f43]) ).
fof(f73,plain,
! [X0,X1] :
( set_union2(X0,X1) = X1
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f28]) ).
fof(f82,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| ? [X2] :
( in(X2,X0)
& in(X2,X1) ) )
& ( ! [X3] :
( ~ in(X3,X0)
| ~ in(X3,X1) )
| ~ disjoint(X0,X1) ) ),
inference(ennf_transformation,[],[f62]) ).
fof(f87,plain,
? [X0,X1,X2] :
( ~ disjoint(X0,X2)
& subset(X0,X1)
& disjoint(X1,X2) ),
inference(ennf_transformation,[],[f52]) ).
fof(f88,plain,
? [X0,X1,X2] :
( ~ disjoint(X0,X2)
& subset(X0,X1)
& disjoint(X1,X2) ),
inference(flattening,[],[f87]) ).
fof(f108,plain,
! [X2,X3,X0,X1] :
( ~ in(X3,X0)
| in(X3,X2)
| set_union2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f7]) ).
fof(f139,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| set_union2(X0,X1) = X1 ),
inference(cnf_transformation,[],[f73]) ).
fof(f156,plain,
! [X0,X1] :
( disjoint(X0,X1)
| in(sK8(X0,X1),X1) ),
inference(cnf_transformation,[],[f82]) ).
fof(f157,plain,
! [X0,X1] :
( disjoint(X0,X1)
| in(sK8(X0,X1),X0) ),
inference(cnf_transformation,[],[f82]) ).
fof(f158,plain,
! [X3,X0,X1] :
( ~ disjoint(X0,X1)
| ~ in(X3,X1)
| ~ in(X3,X0) ),
inference(cnf_transformation,[],[f82]) ).
fof(f167,plain,
disjoint(sK11,sK12),
inference(cnf_transformation,[],[f88]) ).
fof(f168,plain,
subset(sK10,sK11),
inference(cnf_transformation,[],[f88]) ).
fof(f169,plain,
~ disjoint(sK10,sK12),
inference(cnf_transformation,[],[f88]) ).
fof(f195,plain,
! [X3,X0,X1] :
( in(X3,set_union2(X0,X1))
| ~ in(X3,X0) ),
inference(equality_resolution,[],[f108]) ).
fof(f265,plain,
sK11 = set_union2(sK10,sK11),
inference(resolution,[],[f139,f168]) ).
fof(f291,plain,
in(sK8(sK10,sK12),sK12),
inference(resolution,[],[f156,f169]) ).
fof(f295,plain,
in(sK8(sK10,sK12),sK10),
inference(resolution,[],[f157,f169]) ).
fof(f312,plain,
! [X0] :
( in(X0,sK11)
| ~ in(X0,sK10) ),
inference(superposition,[],[f195,f265]) ).
fof(f391,plain,
! [X0] :
( ~ in(X0,sK12)
| ~ in(X0,sK11) ),
inference(resolution,[],[f158,f167]) ).
fof(f396,plain,
~ in(sK8(sK10,sK12),sK11),
inference(resolution,[],[f391,f291]) ).
fof(f450,plain,
~ in(sK8(sK10,sK12),sK10),
inference(resolution,[],[f396,f312]) ).
fof(f451,plain,
$false,
inference(forward_subsumption_resolution,[],[f450,f295]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU140+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n026.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 28 03:45:41 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/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.11/0.46 % (3440122)Will run a generic schedule for satisfiability detection.
% 0.11/0.46 % (3440129)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2348590182:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.46 % (3440127)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3804828966_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.46 % (3440130)dis+10_1_sil=32000:sp=arity:random_seed=827600150:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.46 % (3440131)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=815017381:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.46 % (3440132)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1716499392:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.46 % (3440133)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2175471643:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.46 % (3440128)% WARNING: option uhcvi not known.
% 0.11/0.46 % TRYING [1]
% 0.11/0.46 % TRYING [2]
% 0.11/0.46 % TRYING [3]
% 0.11/0.46 % (3440128)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1125089429:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.46 % (3440131) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3440122-3440131"...
% 0.11/0.46 % (3440131)...printing done.
% 0.11/0.46 % (3440131)Refutation found. Thanks to Tanya!
% 0.11/0.46 % SZS status Theorem for theBenchmark
% 0.11/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.46 % (3440131)------------------------------
% 0.11/0.46 % (3440131)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.46 % (3440131)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.46 % (3440131)CaDiCaL version: 2.1.3
% 0.11/0.46 % (3440131)Termination reason: Refutation
% 0.11/0.46 % (3440131)Time elapsed: 0.010 s
% 0.11/0.46 % (3440131)Peak memory usage: 12 MB
% 0.11/0.46 % (3440131)Instructions burned: 13 (million)
% 0.11/0.46 % (3440122)Success in time 0.044 s
% 0.11/0.46 % Vampire exiting
%------------------------------------------------------------------------------