%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU129+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 : n006.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.17s 0.48s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 26 ( 9 unt; 0 def)
% Number of atoms : 53 ( 4 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 51 ( 24 ~; 18 |; 2 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 48 ( 45 !; 3 ?)
% 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(set_intersection2(X0,X2),set_intersection2(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t26_xboole_1) ).
fof(f13,negated_conjecture,
~ ! [X0,X1,X2] :
( subset(X0,X1)
=> subset(set_intersection2(X0,X2),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(set_intersection2(X0,X2),set_intersection2(X1,X2))
& subset(X0,X1) ),
inference(ennf_transformation,[],[f13]) ).
fof(f28,plain,
! [X2,X0,X1] :
( ~ subset(X0,X1)
| in(X2,X1)
| ~ in(X2,X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f29,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f30,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f34,plain,
! [X2,X3,X0,X1] :
( in(X3,X1)
| ~ in(X3,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f4]) ).
fof(f35,plain,
! [X2,X3,X0,X1] :
( in(X3,X0)
| ~ in(X3,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f4]) ).
fof(f36,plain,
! [X2,X3,X0,X1] :
( ~ in(X3,X1)
| ~ in(X3,X0)
| in(X3,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f4]) ).
fof(f42,plain,
subset(sK4,sK5),
inference(cnf_transformation,[],[f22]) ).
fof(f43,plain,
~ subset(set_intersection2(sK4,sK6),set_intersection2(sK5,sK6)),
inference(cnf_transformation,[],[f22]) ).
fof(f48,plain,
! [X3,X0,X1] :
( in(X3,set_intersection2(X0,X1))
| ~ in(X3,X0)
| ~ in(X3,X1) ),
inference(equality_resolution,[],[f36]) ).
fof(f49,plain,
! [X3,X0,X1] :
( ~ in(X3,set_intersection2(X0,X1))
| in(X3,X0) ),
inference(equality_resolution,[],[f35]) ).
fof(f50,plain,
! [X3,X0,X1] :
( ~ in(X3,set_intersection2(X0,X1))
| in(X3,X1) ),
inference(equality_resolution,[],[f34]) ).
fof(f71,plain,
in(sK0(set_intersection2(sK4,sK6),set_intersection2(sK5,sK6)),set_intersection2(sK4,sK6)),
inference(resolution,[],[f29,f43]) ).
fof(f72,plain,
~ in(sK0(set_intersection2(sK4,sK6),set_intersection2(sK5,sK6)),set_intersection2(sK5,sK6)),
inference(resolution,[],[f30,f43]) ).
fof(f75,plain,
in(sK0(set_intersection2(sK4,sK6),set_intersection2(sK5,sK6)),sK4),
inference(resolution,[],[f49,f71]) ).
fof(f83,plain,
in(sK0(set_intersection2(sK4,sK6),set_intersection2(sK5,sK6)),sK6),
inference(resolution,[],[f50,f71]) ).
fof(f91,plain,
! [X0] :
( in(X0,sK5)
| ~ in(X0,sK4) ),
inference(resolution,[],[f28,f42]) ).
fof(f160,plain,
( ~ in(sK0(set_intersection2(sK4,sK6),set_intersection2(sK5,sK6)),sK5)
| ~ in(sK0(set_intersection2(sK4,sK6),set_intersection2(sK5,sK6)),sK6) ),
inference(resolution,[],[f72,f48]) ).
fof(f161,plain,
~ in(sK0(set_intersection2(sK4,sK6),set_intersection2(sK5,sK6)),sK5),
inference(forward_subsumption_resolution,[],[f160,f83]) ).
fof(f162,plain,
~ in(sK0(set_intersection2(sK4,sK6),set_intersection2(sK5,sK6)),sK4),
inference(resolution,[],[f161,f91]) ).
fof(f163,plain,
$false,
inference(forward_subsumption_resolution,[],[f162,f75]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU129+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.38 % Computer : n006.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:39:25 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 Running first-order model finding
% 0.11/0.42 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.17/0.48 % (3554163)Will run a generic schedule for satisfiability detection.
% 0.17/0.48 % (3554173)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3800111894:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.48 % (3554169)% WARNING: option uhcvi not known.
% 0.17/0.48 % (3554168)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4059292701_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.48 % (3554169)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=942011294:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.48 % (3554170)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=667575574:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.48 % (3554171)dis+10_1_sil=32000:sp=arity:random_seed=3349404440:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.48 % (3554172)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2683143676:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.48 % (3554174)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=988400479:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.48 % TRYING [1]
% 0.17/0.48 % TRYING [2]
% 0.17/0.48 % TRYING [3]
% 0.17/0.48 % (3554172) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3554163-3554172"...
% 0.17/0.48 % TRYING [4]
% 0.17/0.48 % (3554172)...printing done.
% 0.17/0.48 % (3554172)Refutation found. Thanks to Tanya!
% 0.17/0.48 % SZS status Theorem for theBenchmark
% 0.17/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.48 % (3554172)------------------------------
% 0.17/0.48 % (3554172)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.48 % (3554172)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.48 % (3554172)CaDiCaL version: 2.1.3
% 0.17/0.48 % (3554172)Termination reason: Refutation
% 0.17/0.48 % (3554172)Time elapsed: 0.005 s
% 0.17/0.48 % (3554172)Peak memory usage: 12 MB
% 0.17/0.48 % (3554172)Instructions burned: 6 (million)
% 0.17/0.48 % (3554163)Success in time 0.05 s
% 0.17/0.48 % Vampire exiting
%------------------------------------------------------------------------------