%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU102+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 : n001.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:51:56 PM UTC 2026
% Result : Theorem 0.36s 0.52s
% Output : Refutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of formulae : 72 ( 23 unt; 7 def)
% Number of atoms : 209 ( 12 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 247 ( 110 ~; 102 |; 22 &)
% ( 7 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 8 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 49 ( 0 sgn 43 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0,X1,X2] :
( ( ~ empty(X0)
& preboolean(X0)
& element(X1,X0)
& element(X2,X0) )
=> element(prebool_difference(X0,X1,X2),X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k2_finsub_1) ).
fof(f24,axiom,
! [X0,X1,X2] :
( ( ~ empty(X0)
& preboolean(X0)
& element(X1,X0)
& element(X2,X0) )
=> prebool_difference(X0,X1,X2) = set_difference(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k2_finsub_1) ).
fof(f26,conjecture,
! [X0,X1,X2] :
( ( ~ empty(X2)
& preboolean(X2) )
=> ( ( element(X0,X2)
& element(X1,X2) )
=> element(set_intersection2(X0,X1),X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_finsub_1) ).
fof(f27,negated_conjecture,
~ ! [X0,X1,X2] :
( ( ~ empty(X2)
& preboolean(X2) )
=> ( ( element(X0,X2)
& element(X1,X2) )
=> element(set_intersection2(X0,X1),X2) ) ),
inference(negated_conjecture,[status(cth)],[f26]) ).
fof(f33,axiom,
! [X0,X1] : set_difference(X0,set_difference(X0,X1)) = set_intersection2(X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t48_xboole_1) ).
fof(f57,plain,
! [X0,X1,X2] :
( element(prebool_difference(X0,X1,X2),X0)
| empty(X0)
| ~ preboolean(X0)
| ~ element(X1,X0)
| ~ element(X2,X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f58,plain,
! [X0,X1,X2] :
( element(prebool_difference(X0,X1,X2),X0)
| empty(X0)
| ~ preboolean(X0)
| ~ element(X1,X0)
| ~ element(X2,X0) ),
inference(flattening,[],[f57]) ).
fof(f65,plain,
! [X0,X1,X2] :
( prebool_difference(X0,X1,X2) = set_difference(X1,X2)
| empty(X0)
| ~ preboolean(X0)
| ~ element(X1,X0)
| ~ element(X2,X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f66,plain,
! [X0,X1,X2] :
( prebool_difference(X0,X1,X2) = set_difference(X1,X2)
| empty(X0)
| ~ preboolean(X0)
| ~ element(X1,X0)
| ~ element(X2,X0) ),
inference(flattening,[],[f65]) ).
fof(f67,plain,
? [X0,X1,X2] :
( ~ element(set_intersection2(X0,X1),X2)
& element(X0,X2)
& element(X1,X2)
& ~ empty(X2)
& preboolean(X2) ),
inference(ennf_transformation,[],[f27]) ).
fof(f68,plain,
? [X0,X1,X2] :
( ~ element(set_intersection2(X0,X1),X2)
& element(X0,X2)
& element(X1,X2)
& ~ empty(X2)
& preboolean(X2) ),
inference(flattening,[],[f67]) ).
fof(f89,plain,
( ~ element(set_intersection2(sK10,sK11),sK12)
& element(sK10,sK12)
& element(sK11,sK12)
& ~ empty(sK12)
& preboolean(sK12) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10,sK11,sK12]),skolemize(X0,sK10),skolemize(X1,sK11),skolemize(X2,sK12)],[f68]) ).
fof(f97,plain,
! [X2,X0,X1] :
( element(prebool_difference(X0,X1,X2),X0)
| empty(X0)
| ~ preboolean(X0)
| ~ element(X1,X0)
| ~ element(X2,X0) ),
inference(cnf_transformation,[],[f58]) ).
fof(f126,plain,
! [X2,X0,X1] :
( prebool_difference(X0,X1,X2) = set_difference(X1,X2)
| empty(X0)
| ~ preboolean(X0)
| ~ element(X1,X0)
| ~ element(X2,X0) ),
inference(cnf_transformation,[],[f66]) ).
fof(f128,plain,
preboolean(sK12),
inference(cnf_transformation,[],[f89]) ).
fof(f129,plain,
~ empty(sK12),
inference(cnf_transformation,[],[f89]) ).
fof(f130,plain,
element(sK11,sK12),
inference(cnf_transformation,[],[f89]) ).
fof(f131,plain,
element(sK10,sK12),
inference(cnf_transformation,[],[f89]) ).
fof(f132,plain,
~ element(set_intersection2(sK10,sK11),sK12),
inference(cnf_transformation,[],[f89]) ).
fof(f138,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_difference(X0,set_difference(X0,X1)),
inference(cnf_transformation,[],[f33]) ).
fof(f149,plain,
~ element(set_difference(sK10,set_difference(sK10,sK11)),sK12),
inference(definition_unfolding,[],[f132,f138]) ).
fof(f152,plain,
! [X2,X0,X1] :
( element(prebool_difference(X0,X1,X2),X0)
| ~ empty(X0)
| ~ preboolean(X0)
| ~ element(X1,X0)
| ~ element(X2,X0) ),
inference(consistent_polarity_flipping,[],[f97]) ).
fof(f169,plain,
! [X2,X0,X1] :
( ~ element(X2,X0)
| ~ element(X1,X0)
| ~ preboolean(X0)
| ~ empty(X0)
| prebool_difference(X0,X1,X2) = set_difference(X1,X2) ),
inference(consistent_polarity_flipping,[],[f126]) ).
fof(f170,plain,
empty(sK12),
inference(consistent_polarity_flipping,[],[f129]) ).
fof(f356,definition,
( spl13_5
<=> empty(sK12) ),
introduced(definition,[new_symbols(definition,[spl13_5])],[avatar_definition]) ).
fof(f358,plain,
( ~ empty(sK12)
| spl13_5 ),
inference(avatar_component_clause,[],[f356]) ).
fof(f369,plain,
( $false
| spl13_5 ),
inference(resolution,[],[f358,f170]) ).
fof(f376,plain,
spl13_5,
inference(avatar_contradiction_clause,[],[f369]) ).
fof(f762,plain,
! [X0] :
( ~ element(X0,sK12)
| ~ preboolean(sK12)
| ~ empty(sK12)
| prebool_difference(sK12,sK10,X0) = set_difference(sK10,X0) ),
inference(resolution,[],[f169,f131]) ).
fof(f767,definition,
( spl13_38
<=> preboolean(sK12) ),
introduced(definition,[new_symbols(definition,[spl13_38])],[avatar_definition]) ).
fof(f769,plain,
( ~ preboolean(sK12)
| spl13_38 ),
inference(avatar_component_clause,[],[f767]) ).
fof(f771,definition,
( spl13_39
<=> ! [X0] :
( ~ element(X0,sK12)
| prebool_difference(sK12,sK10,X0) = set_difference(sK10,X0) ) ),
introduced(definition,[new_symbols(definition,[spl13_39])],[avatar_definition]) ).
fof(f772,plain,
( ! [X0] :
( ~ element(X0,sK12)
| prebool_difference(sK12,sK10,X0) = set_difference(sK10,X0) )
| ~ spl13_39 ),
inference(avatar_component_clause,[],[f771]) ).
fof(f773,plain,
( ~ spl13_5
| ~ spl13_38
| spl13_39 ),
inference(avatar_split_clause,[],[f762,f771,f767,f356]) ).
fof(f786,plain,
( $false
| spl13_38 ),
inference(resolution,[],[f769,f128]) ).
fof(f787,plain,
spl13_38,
inference(avatar_contradiction_clause,[],[f786]) ).
fof(f788,plain,
( set_difference(sK10,sK11) = prebool_difference(sK12,sK10,sK11)
| ~ spl13_39 ),
inference(resolution,[],[f772,f130]) ).
fof(f798,plain,
( element(set_difference(sK10,sK11),sK12)
| ~ empty(sK12)
| ~ preboolean(sK12)
| ~ element(sK10,sK12)
| ~ element(sK11,sK12)
| ~ spl13_39 ),
inference(superposition,[],[f152,f788]) ).
fof(f800,definition,
( spl13_44
<=> element(sK11,sK12) ),
introduced(definition,[new_symbols(definition,[spl13_44])],[avatar_definition]) ).
fof(f802,plain,
( ~ element(sK11,sK12)
| spl13_44 ),
inference(avatar_component_clause,[],[f800]) ).
fof(f804,definition,
( spl13_45
<=> element(sK10,sK12) ),
introduced(definition,[new_symbols(definition,[spl13_45])],[avatar_definition]) ).
fof(f806,plain,
( ~ element(sK10,sK12)
| spl13_45 ),
inference(avatar_component_clause,[],[f804]) ).
fof(f808,definition,
( spl13_46
<=> element(set_difference(sK10,sK11),sK12) ),
introduced(definition,[new_symbols(definition,[spl13_46])],[avatar_definition]) ).
fof(f810,plain,
( element(set_difference(sK10,sK11),sK12)
| ~ spl13_46 ),
inference(avatar_component_clause,[],[f808]) ).
fof(f811,plain,
( ~ spl13_44
| ~ spl13_45
| ~ spl13_38
| ~ spl13_5
| spl13_46
| ~ spl13_39 ),
inference(avatar_split_clause,[],[f798,f771,f808,f356,f767,f804,f800]) ).
fof(f812,plain,
( $false
| spl13_44 ),
inference(resolution,[],[f802,f130]) ).
fof(f815,plain,
spl13_44,
inference(avatar_contradiction_clause,[],[f812]) ).
fof(f817,plain,
( $false
| spl13_45 ),
inference(resolution,[],[f806,f131]) ).
fof(f820,plain,
spl13_45,
inference(avatar_contradiction_clause,[],[f817]) ).
fof(f822,plain,
( set_difference(sK10,set_difference(sK10,sK11)) = prebool_difference(sK12,sK10,set_difference(sK10,sK11))
| ~ spl13_39
| ~ spl13_46 ),
inference(resolution,[],[f810,f772]) ).
fof(f3602,plain,
( element(set_difference(sK10,set_difference(sK10,sK11)),sK12)
| ~ empty(sK12)
| ~ preboolean(sK12)
| ~ element(sK10,sK12)
| ~ element(set_difference(sK10,sK11),sK12)
| ~ spl13_39
| ~ spl13_46 ),
inference(superposition,[],[f152,f822]) ).
fof(f3604,definition,
( spl13_201
<=> element(set_difference(sK10,set_difference(sK10,sK11)),sK12) ),
introduced(definition,[new_symbols(definition,[spl13_201])],[avatar_definition]) ).
fof(f3606,plain,
( element(set_difference(sK10,set_difference(sK10,sK11)),sK12)
| ~ spl13_201 ),
inference(avatar_component_clause,[],[f3604]) ).
fof(f3607,plain,
( ~ spl13_46
| ~ spl13_45
| ~ spl13_38
| ~ spl13_5
| spl13_201
| ~ spl13_39
| ~ spl13_46 ),
inference(avatar_split_clause,[],[f3602,f808,f771,f3604,f356,f767,f804,f808]) ).
fof(f3608,plain,
( $false
| ~ spl13_201 ),
inference(resolution,[],[f3606,f149]) ).
fof(f3619,plain,
~ spl13_201,
inference(avatar_contradiction_clause,[],[f3608]) ).
cnf(s6,plain,
spl13_5,
inference(sat_conversion,[],[f376]) ).
cnf(s30,plain,
( ~ spl13_5
| ~ spl13_38
| spl13_39 ),
inference(sat_conversion,[],[f773]) ).
cnf(s34,plain,
spl13_38,
inference(sat_conversion,[],[f787]) ).
cnf(s36,plain,
( ~ spl13_5
| ~ spl13_38
| ~ spl13_39
| ~ spl13_44
| ~ spl13_45
| spl13_46 ),
inference(sat_conversion,[],[f811]) ).
cnf(s37,plain,
spl13_44,
inference(sat_conversion,[],[f815]) ).
cnf(s39,plain,
spl13_45,
inference(sat_conversion,[],[f820]) ).
cnf(s202,plain,
( ~ spl13_46
| ~ spl13_38
| ~ spl13_39
| ~ spl13_45
| ~ spl13_5
| ~ spl13_46
| spl13_201 ),
inference(sat_conversion,[],[f3607]) ).
cnf(s203,plain,
( ~ spl13_5
| ~ spl13_38
| ~ spl13_39
| ~ spl13_45
| ~ spl13_46
| spl13_201 ),
inference(rat,[],[s202]) ).
cnf(s204,plain,
~ spl13_201,
inference(sat_conversion,[],[f3619]) ).
cnf(s209,plain,
( ~ spl13_5
| ~ spl13_38
| ~ spl13_39
| ~ spl13_45
| ~ spl13_46 ),
inference(rat,[],[s203,s204]) ).
cnf(s214,plain,
( ~ spl13_5
| ~ spl13_38
| ~ spl13_39
| spl13_46 ),
inference(rat,[],[s36,s39,s37]) ).
cnf(s218,plain,
( ~ spl13_5
| spl13_39 ),
inference(rat,[],[s30,s34]) ).
cnf(s238,plain,
spl13_39,
inference(rat,[],[s218,s6]) ).
cnf(s250,plain,
~ spl13_46,
inference(rat,[],[s209,s6,s39,s34,s238]) ).
cnf(s253,plain,
$false,
inference(rat,[],[s214,s6,s34,s250,s238]) ).
fof(f3638,plain,
$false,
inference(avatar_sat_refutation,[],[s253]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU102+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.10/0.37 % Computer : n001.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 28 03:40:56 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41 Running first-order model finding
% 0.10/0.41 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.36/0.52 % (4186097)Will run a generic schedule for satisfiability detection.
% 0.36/0.52 % (4186103)% WARNING: option uhcvi not known.
% 0.36/0.52 % (4186103)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3182140512:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.36/0.52 % (4186106)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=583918290:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.36/0.52 % (4186102)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2227056771_2999 on theBenchmark for (2999ds/0Mi)
% 0.36/0.52 % (4186105)dis+10_1_sil=32000:sp=arity:random_seed=852834410:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.36/0.52 % (4186104)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3306132254:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.36/0.52 % (4186107)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1184024867:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.36/0.52 % (4186108)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2909742689:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.36/0.52 % TRYING [1]
% 0.36/0.52 % TRYING [2]
% 0.36/0.52 % TRYING [3]
% 0.36/0.52 % TRYING [4]
% 0.36/0.52 % TRYING [5]
% 0.36/0.52 % TRYING [6]
% 0.36/0.52 % TRYING [7]
% 0.36/0.52 % (4186105)Instruction limit reached!
% 0.36/0.52 % (4186105)------------------------------
% 0.36/0.52 % (4186105)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.52 % (4186105)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.52 % (4186105)CaDiCaL version: 2.1.3
% 0.36/0.52 % (4186105)Termination reason: Instruction limit
% 0.36/0.52 % (4186105)Termination phase: Saturation
% 0.36/0.52 % (4186105)Time elapsed: 0.060 s
% 0.36/0.52 % (4186105)Peak memory usage: 12 MB
% 0.36/0.52 % (4186105)Instructions burned: 104 (million)
% 0.36/0.52 % (4186106)Instruction limit reached!
% 0.36/0.52 % (4186106)------------------------------
% 0.36/0.52 % (4186106)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.52 % (4186106)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.52 % (4186106)CaDiCaL version: 2.1.3
% 0.36/0.52 % (4186106)Termination reason: Instruction limit
% 0.36/0.52 % (4186106)Termination phase: Saturation
% 0.36/0.52 % (4186106)Time elapsed: 0.069 s
% 0.36/0.52 % (4186106)Peak memory usage: 12 MB
% 0.36/0.52 % (4186106)Instructions burned: 117 (million)
% 0.36/0.52 % (4186108) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4186097-4186108"...
% 0.36/0.52 % (4186108)...printing done.
% 0.36/0.52 % (4186108)Refutation found. Thanks to Tanya!
% 0.36/0.52 % SZS status Theorem for theBenchmark
% 0.36/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.36/0.52 % (4186108)------------------------------
% 0.36/0.52 % (4186108)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.52 % (4186108)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.52 % (4186108)CaDiCaL version: 2.1.3
% 0.36/0.52 % (4186108)Termination reason: Refutation
% 0.36/0.52 % (4186108)Time elapsed: 0.070 s
% 0.36/0.52 % (4186108)Peak memory usage: 14 MB
% 0.36/0.52 % (4186108)Instructions burned: 101 (million)
% 0.36/0.52 % (4186097)Success in time 0.108 s
% 0.36/0.52 % Vampire exiting
%------------------------------------------------------------------------------