%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU128+1 : 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 : n015.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.14s 0.45s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 36 ( 11 unt; 2 def)
% Number of atoms : 73 ( 2 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 63 ( 26 ~; 21 |; 7 &)
% ( 6 <=>; 3 =>; 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn 32 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f4,axiom,
! [X0,X1,X2] :
( X2 = set_intersection2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
& in(X3,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f12,conjecture,
! [X0,X1,X2] :
( ( subset(X0,X1)
& subset(X0,X2) )
=> subset(X0,set_intersection2(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t19_xboole_1) ).
fof(f13,negated_conjecture,
~ ! [X0,X1,X2] :
( ( subset(X0,X1)
& subset(X0,X2) )
=> subset(X0,set_intersection2(X1,X2)) ),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f21,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f22,plain,
? [X0,X1,X2] :
( ~ subset(X0,set_intersection2(X1,X2))
& subset(X0,X1)
& subset(X0,X2) ),
inference(ennf_transformation,[],[f13]) ).
fof(f23,plain,
? [X0,X1,X2] :
( ~ subset(X0,set_intersection2(X1,X2))
& subset(X0,X1)
& subset(X0,X2) ),
inference(flattening,[],[f22]) ).
fof(f29,plain,
! [X2,X0,X1] :
( ~ subset(X0,X1)
| in(X2,X1)
| ~ in(X2,X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f30,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f31,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f37,plain,
! [X2,X3,X0,X1] :
( ~ in(X3,X1)
| ~ in(X3,X0)
| in(X3,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f4]) ).
fof(f43,plain,
subset(sK4,sK6),
inference(cnf_transformation,[],[f23]) ).
fof(f44,plain,
subset(sK4,sK5),
inference(cnf_transformation,[],[f23]) ).
fof(f45,plain,
~ subset(sK4,set_intersection2(sK5,sK6)),
inference(cnf_transformation,[],[f23]) ).
fof(f50,plain,
! [X3,X0,X1] :
( in(X3,set_intersection2(X0,X1))
| ~ in(X3,X0)
| ~ in(X3,X1) ),
inference(equality_resolution,[],[f37]) ).
fof(f73,plain,
in(sK0(sK4,set_intersection2(sK5,sK6)),sK4),
inference(resolution,[],[f30,f45]) ).
fof(f76,plain,
~ in(sK0(sK4,set_intersection2(sK5,sK6)),set_intersection2(sK5,sK6)),
inference(resolution,[],[f31,f45]) ).
fof(f87,plain,
! [X0] :
( in(X0,sK6)
| ~ in(X0,sK4) ),
inference(resolution,[],[f29,f43]) ).
fof(f88,plain,
! [X0] :
( in(X0,sK5)
| ~ in(X0,sK4) ),
inference(resolution,[],[f29,f44]) ).
fof(f96,plain,
( ~ in(sK0(sK4,set_intersection2(sK5,sK6)),sK5)
| ~ in(sK0(sK4,set_intersection2(sK5,sK6)),sK6) ),
inference(resolution,[],[f50,f76]) ).
fof(f104,definition,
( spl7_1
<=> in(sK0(sK4,set_intersection2(sK5,sK6)),sK6) ),
introduced(definition,[new_symbols(definition,[spl7_1])],[avatar_definition]) ).
fof(f106,plain,
( ~ in(sK0(sK4,set_intersection2(sK5,sK6)),sK6)
| spl7_1 ),
inference(avatar_component_clause,[],[f104]) ).
fof(f108,definition,
( spl7_2
<=> in(sK0(sK4,set_intersection2(sK5,sK6)),sK5) ),
introduced(definition,[new_symbols(definition,[spl7_2])],[avatar_definition]) ).
fof(f110,plain,
( ~ in(sK0(sK4,set_intersection2(sK5,sK6)),sK5)
| spl7_2 ),
inference(avatar_component_clause,[],[f108]) ).
fof(f111,plain,
( ~ spl7_1
| ~ spl7_2 ),
inference(avatar_split_clause,[],[f96,f108,f104]) ).
fof(f264,plain,
( ~ in(sK0(sK4,set_intersection2(sK5,sK6)),sK4)
| spl7_1 ),
inference(resolution,[],[f106,f87]) ).
fof(f267,plain,
( $false
| spl7_1 ),
inference(forward_subsumption_resolution,[],[f264,f73]) ).
fof(f268,plain,
spl7_1,
inference(avatar_contradiction_clause,[],[f267]) ).
fof(f307,plain,
( ~ in(sK0(sK4,set_intersection2(sK5,sK6)),sK4)
| spl7_2 ),
inference(resolution,[],[f110,f88]) ).
fof(f310,plain,
( $false
| spl7_2 ),
inference(forward_subsumption_resolution,[],[f307,f73]) ).
fof(f311,plain,
spl7_2,
inference(avatar_contradiction_clause,[],[f310]) ).
cnf(s1,plain,
( ~ spl7_1
| ~ spl7_2 ),
inference(sat_conversion,[],[f111]) ).
cnf(s5,plain,
spl7_1,
inference(sat_conversion,[],[f268]) ).
cnf(s6,plain,
spl7_2,
inference(sat_conversion,[],[f311]) ).
cnf(s7,plain,
$false,
inference(rat,[],[s1,s6,s5]) ).
fof(f312,plain,
$false,
inference(avatar_sat_refutation,[],[s7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU128+1 : 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.35 % Computer : n015.cluster.edu
% 0.11/0.35 % Model : x86_64 x86_64
% 0.11/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.35 % Memory : 8046.5625MB
% 0.11/0.35 % OS : Linux 6.8.0-71-generic
% 0.11/0.35 % CPULimit : 300
% 0.11/0.35 % WCLimit : 300
% 0.11/0.35 % DateTime : Mon Sep 28 03:42:49 UTC 2026
% 0.14/0.36 % CPUTime :
% 0.14/0.36 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.14/0.39 Running first-order model finding
% 0.14/0.39 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.14/0.45 % (2235294)Will run a generic schedule for satisfiability detection.
% 0.14/0.45 % (2235305)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1298051952:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.14/0.45 % (2235300)% WARNING: option uhcvi not known.
% 0.14/0.45 % (2235299)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=936577992_2999 on theBenchmark for (2999ds/0Mi)
% 0.14/0.45 % (2235302)dis+10_1_sil=32000:sp=arity:random_seed=2957359258:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.14/0.45 % (2235301)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2929823430:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.14/0.45 % (2235303)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=259289579:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.14/0.45 % (2235300)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3612599494:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.14/0.45 % (2235304)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2314021212:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.14/0.45 % TRYING [1]
% 0.14/0.45 % TRYING [2]
% 0.14/0.45 % TRYING [3]
% 0.14/0.45 % TRYING [4]
% 0.14/0.45 % (2235303) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2235294-2235303"...
% 0.14/0.45 % (2235303)...printing done.
% 0.14/0.45 % (2235303)Refutation found. Thanks to Tanya!
% 0.14/0.45 % SZS status Theorem for theBenchmark
% 0.14/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.45 % (2235303)------------------------------
% 0.14/0.45 % (2235303)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.14/0.45 % (2235303)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.14/0.45 % (2235303)CaDiCaL version: 2.1.3
% 0.14/0.45 % (2235303)Termination reason: Refutation
% 0.14/0.45 % (2235303)Time elapsed: 0.010 s
% 0.14/0.45 % (2235303)Peak memory usage: 12 MB
% 0.14/0.45 % (2235303)Instructions burned: 13 (million)
% 0.14/0.45 % (2235294)Success in time 0.049 s
% 0.14/0.45 % Vampire exiting
%------------------------------------------------------------------------------