%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SET944+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 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:42:23 PM UTC 2026
% Result : Theorem 4.99s 1.48s
% Output : Refutation 4.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 43 ( 15 unt; 0 def)
% Number of atoms : 183 ( 22 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 228 ( 88 ~; 90 |; 43 &)
% ( 6 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-3 aty)
% Number of variables : 113 ( 99 !; 14 ?)
% 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(f5,axiom,
! [X0,X1] :
( X1 = union(X0)
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] :
( in(X2,X3)
& in(X3,X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_tarski) ).
fof(f10,conjecture,
! [X0,X1] : subset(union(set_intersection2(X0,X1)),set_intersection2(union(X0),union(X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t97_zfmisc_1) ).
fof(f11,negated_conjecture,
~ ! [X0,X1] : subset(union(set_intersection2(X0,X1)),set_intersection2(union(X0),union(X1))),
inference(negated_conjecture,[status(cth)],[f10]) ).
fof(f14,plain,
? [X0,X1] : ~ subset(union(set_intersection2(X0,X1)),set_intersection2(union(X0),union(X1))),
inference(ennf_transformation,[],[f11]) ).
fof(f15,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f16,plain,
~ subset(union(set_intersection2(sK0,sK1)),set_intersection2(union(sK0),union(sK1))),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f14]) ).
fof(f17,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X0)
| ~ in(X3,X1) )
& ( ( in(X3,X0)
& in(X3,X1) )
| ~ in(X3,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f18,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X0)
| ~ in(X3,X1) )
& ( ( in(X3,X0)
& in(X3,X1) )
| ~ in(X3,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(flattening,[],[f17]) ).
fof(f19,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1) )
& ( ( in(X4,X0)
& in(X4,X1) )
| ~ in(X4,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(rectify,[],[f18]) ).
fof(f20,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ( ( ~ in(sK2(X0,X1,X2),X0)
| ~ in(sK2(X0,X1,X2),X1)
| ~ in(sK2(X0,X1,X2),X2) )
& ( ( in(sK2(X0,X1,X2),X0)
& in(sK2(X0,X1,X2),X1) )
| in(sK2(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1) )
& ( ( in(X4,X0)
& in(X4,X1) )
| ~ in(X4,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X3,sK2(X0,X1,X2))],[f19]) ).
fof(f21,plain,
! [X0,X1] :
( ( X1 = union(X0)
| ? [X2] :
( ( ! [X3] :
( ~ in(X2,X3)
| ~ in(X3,X0) )
| ~ in(X2,X1) )
& ( ? [X3] :
( in(X2,X3)
& in(X3,X0) )
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ! [X3] :
( ~ in(X2,X3)
| ~ in(X3,X0) ) )
& ( ? [X3] :
( in(X2,X3)
& in(X3,X0) )
| ~ in(X2,X1) ) )
| union(X0) != X1 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f22,plain,
! [X0,X1] :
( ( X1 = union(X0)
| ? [X2] :
( ( ! [X3] :
( ~ in(X2,X3)
| ~ in(X3,X0) )
| ~ in(X2,X1) )
& ( ? [X4] :
( in(X2,X4)
& in(X4,X0) )
| in(X2,X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] :
( ~ in(X5,X6)
| ~ in(X6,X0) ) )
& ( ? [X7] :
( in(X5,X7)
& in(X7,X0) )
| ~ in(X5,X1) ) )
| union(X0) != X1 ) ),
inference(rectify,[],[f21]) ).
fof(f23,plain,
! [X0,X1] :
( ( X1 = union(X0)
| ( ( ! [X3] :
( ~ in(sK3(X0,X1),X3)
| ~ in(X3,X0) )
| ~ in(sK3(X0,X1),X1) )
& ( ( in(sK3(X0,X1),sK4(X0,X1))
& in(sK4(X0,X1),X0) )
| in(sK3(X0,X1),X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] :
( ~ in(X5,X6)
| ~ in(X6,X0) ) )
& ( ( in(X5,sK5(X0,X5))
& in(sK5(X0,X5),X0) )
| ~ in(X5,X1) ) )
| union(X0) != X1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5]),skolemize(X2,sK3(X0,X1)),skolemize(X4,sK4(X0,X1)),skolemize(X7,sK5(X0,X5))],[f22]) ).
fof(f24,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f25,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f24]) ).
fof(f26,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK6(X0,X1),X1)
& in(sK6(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(X2,sK6(X0,X1))],[f25]) ).
fof(f27,plain,
~ subset(union(set_intersection2(sK0,sK1)),set_intersection2(union(sK0),union(sK1))),
inference(cnf_transformation,[],[f16]) ).
fof(f29,plain,
! [X2,X0,X1,X4] :
( in(X4,X1)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f20]) ).
fof(f30,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f20]) ).
fof(f31,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f20]) ).
fof(f36,plain,
! [X0,X1,X5] :
( in(sK5(X0,X5),X0)
| ~ in(X5,X1)
| union(X0) != X1 ),
inference(cnf_transformation,[],[f23]) ).
fof(f37,plain,
! [X0,X1,X5] :
( in(X5,sK5(X0,X5))
| ~ in(X5,X1)
| union(X0) != X1 ),
inference(cnf_transformation,[],[f23]) ).
fof(f38,plain,
! [X0,X1,X6,X5] :
( in(X5,X1)
| ~ in(X5,X6)
| ~ in(X6,X0)
| union(X0) != X1 ),
inference(cnf_transformation,[],[f23]) ).
fof(f44,plain,
! [X0,X1] :
( in(sK6(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f45,plain,
! [X0,X1] :
( ~ in(sK6(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f46,plain,
! [X0,X1,X4] :
( in(X4,set_intersection2(X0,X1))
| ~ in(X4,X0)
| ~ in(X4,X1) ),
inference(equality_resolution,[],[f31]) ).
fof(f47,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X0) ),
inference(equality_resolution,[],[f30]) ).
fof(f48,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X1) ),
inference(equality_resolution,[],[f29]) ).
fof(f49,plain,
! [X0,X6,X5] :
( ~ in(X6,X0)
| ~ in(X5,X6)
| in(X5,union(X0)) ),
inference(equality_resolution,[],[f38]) ).
fof(f50,plain,
! [X0,X5] :
( in(X5,sK5(X0,X5))
| ~ in(X5,union(X0)) ),
inference(equality_resolution,[],[f37]) ).
fof(f51,plain,
! [X0,X5] :
( in(sK5(X0,X5),X0)
| ~ in(X5,union(X0)) ),
inference(equality_resolution,[],[f36]) ).
fof(f52,plain,
in(sK6(union(set_intersection2(sK0,sK1)),set_intersection2(union(sK0),union(sK1))),union(set_intersection2(sK0,sK1))),
inference(unit_resulting_resolution,[],[f44,f27]) ).
fof(f53,plain,
~ in(sK6(union(set_intersection2(sK0,sK1)),set_intersection2(union(sK0),union(sK1))),set_intersection2(union(sK0),union(sK1))),
inference(unit_resulting_resolution,[],[f45,f27]) ).
fof(f77,plain,
in(sK6(union(set_intersection2(sK0,sK1)),set_intersection2(union(sK0),union(sK1))),sK5(set_intersection2(sK0,sK1),sK6(union(set_intersection2(sK0,sK1)),set_intersection2(union(sK0),union(sK1))))),
inference(unit_resulting_resolution,[],[f50,f52]) ).
fof(f83,plain,
in(sK5(set_intersection2(sK0,sK1),sK6(union(set_intersection2(sK0,sK1)),set_intersection2(union(sK0),union(sK1)))),set_intersection2(sK0,sK1)),
inference(unit_resulting_resolution,[],[f51,f52]) ).
fof(f119,plain,
in(sK5(set_intersection2(sK0,sK1),sK6(union(set_intersection2(sK0,sK1)),set_intersection2(union(sK0),union(sK1)))),sK1),
inference(unit_resulting_resolution,[],[f48,f83]) ).
fof(f120,plain,
in(sK5(set_intersection2(sK0,sK1),sK6(union(set_intersection2(sK0,sK1)),set_intersection2(union(sK0),union(sK1)))),sK0),
inference(unit_resulting_resolution,[],[f47,f83]) ).
fof(f198,plain,
in(sK6(union(set_intersection2(sK0,sK1)),set_intersection2(union(sK0),union(sK1))),union(sK1)),
inference(unit_resulting_resolution,[],[f49,f119,f77]) ).
fof(f199,plain,
in(sK6(union(set_intersection2(sK0,sK1)),set_intersection2(union(sK0),union(sK1))),union(sK0)),
inference(unit_resulting_resolution,[],[f49,f120,f77]) ).
fof(f213,plain,
~ in(sK6(union(set_intersection2(sK0,sK1)),set_intersection2(union(sK0),union(sK1))),union(sK0)),
inference(unit_resulting_resolution,[],[f46,f53,f198]) ).
fof(f228,plain,
$false,
inference(forward_subsumption_resolution,[],[f213,f199]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET944+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.39 % Computer : n003.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Mon Sep 28 03:17:27 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.40 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.43 Running first-order theorem proving
% 0.13/0.43 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.99/1.29 % (1151178)Detected formulas, will run a generic FOF schedule.
% 3.99/1.29 % (1151189)dis-21_1_sil=8000:lcm=predicate:random_seed=303743063:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 3.99/1.29 % (1151185)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=1210502406:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.99/1.29 % (1151186)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=363631215:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.99/1.29 % (1151183)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=3261862913:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.99/1.29 % (1151187)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3531081088:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.99/1.29 % (1151184)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=3891333139:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.99/1.29 % (1151188)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1260862207:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.99/1.29 % (1151186)Refutation not found, incomplete strategy
% 3.99/1.29 % (1151186)------------------------------
% 3.99/1.29 % (1151186)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.99/1.29 % (1151186)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.99/1.29 % (1151186)CaDiCaL version: 2.1.3
% 3.99/1.29 % (1151186)Termination reason: Refutation not found, incomplete strategy
% 3.99/1.29 % (1151186)Time elapsed: 0.002 s
% 3.99/1.29 % (1151186)Peak memory usage: 88 MB
% 3.99/1.29 % (1151186)Instructions burned: 1 (million)
% 3.99/1.29 % (1151187)Instruction limit reached!
% 3.99/1.29 % (1151187)------------------------------
% 3.99/1.29 % (1151187)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.99/1.29 % (1151187)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.99/1.29 % (1151187)CaDiCaL version: 2.1.3
% 3.99/1.29 % (1151187)Termination reason: Instruction limit
% 3.99/1.29 % (1151187)Termination phase: Saturation
% 3.99/1.29 % (1151187)Time elapsed: 0.073 s
% 3.99/1.29 % (1151187)Peak memory usage: 88 MB
% 3.99/1.29 % (1151187)Instructions burned: 119 (million)
% 3.99/1.29 % (1151189)Instruction limit reached!
% 3.99/1.29 % (1151189)------------------------------
% 3.99/1.29 % (1151189)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.99/1.29 % (1151189)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.99/1.29 % (1151189)CaDiCaL version: 2.1.3
% 3.99/1.29 % (1151189)Termination reason: Instruction limit
% 3.99/1.29 % (1151189)Termination phase: Saturation
% 3.99/1.29 % (1151189)Time elapsed: 0.073 s
% 3.99/1.29 % (1151189)Peak memory usage: 88 MB
% 3.99/1.29 % (1151189)Instructions burned: 129 (million)
% 3.99/1.29 % (1151188)Instruction limit reached!
% 3.99/1.29 % (1151188)------------------------------
% 3.99/1.29 % (1151188)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.99/1.29 % (1151188)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.99/1.29 % (1151188)CaDiCaL version: 2.1.3
% 3.99/1.29 % (1151188)Termination reason: Instruction limit
% 3.99/1.29 % (1151188)Termination phase: Saturation
% 3.99/1.29 % (1151188)Time elapsed: 0.091 s
% 3.99/1.29 % (1151188)Peak memory usage: 89 MB
% 3.99/1.29 % (1151188)Instructions burned: 139 (million)
% 3.99/1.29 % (1151198)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3166705234:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.99/1.29 % (1151197)lrs+10_1_sil=8000:sp=occurrence:random_seed=1964419903:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.99/1.29 % (1151198)First to succeed.
% 3.99/1.29 % (1151198)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1151178"
% 3.99/1.29 % (1151199)lrs+1011_1_sil=32000:sp=occurrence:random_seed=746024687:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 3.99/1.29 % (1151186)------------------------------
% 3.99/1.29 % (1151186)------------------------------
% 3.99/1.29 % (1151199)Instruction limit reached!
% 4.99/1.48 % (1151199)------------------------------
% 4.99/1.48 % (1151199)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.99/1.48 % (1151199)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.99/1.48 % (1151199)CaDiCaL version: 2.1.3
% 4.99/1.48 % (1151199)Termination reason: Instruction limit
% 4.99/1.48 % (1151199)Termination phase: Saturation
% 4.99/1.48 % (1151199)Time elapsed: 0.110 s
% 4.99/1.48 % (1151199)Peak memory usage: 91 MB
% 4.99/1.48 % (1151199)Instructions burned: 325 (million)
% 4.99/1.48 % (1151197)Instruction limit reached!
% 4.99/1.48 % (1151197)------------------------------
% 4.99/1.48 % (1151197)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.99/1.48 % (1151197)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.99/1.48 % (1151197)CaDiCaL version: 2.1.3
% 4.99/1.48 % (1151197)Termination reason: Instruction limit
% 4.99/1.48 % (1151197)Termination phase: Saturation
% 4.99/1.48 % (1151197)Time elapsed: 0.169 s
% 4.99/1.48 % (1151197)Peak memory usage: 91 MB
% 4.99/1.48 % (1151197)Instructions burned: 286 (million)
% 4.99/1.48 % (1151203)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=841613524:s2a=on:i=248:s2at=1.23:gtg=position_2995 on theBenchmark for (2995ds/248Mi)
% 4.99/1.48 % (1151204)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=2415840408:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2994 on theBenchmark for (2994ds/294Mi)
% 4.99/1.48 % (1151204)Refutation not found, incomplete strategy
% 4.99/1.48 % (1151204)------------------------------
% 4.99/1.48 % (1151204)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.99/1.48 % (1151204)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.99/1.48 % (1151204)CaDiCaL version: 2.1.3
% 4.99/1.48 % (1151204)Termination reason: Refutation not found, incomplete strategy
% 4.99/1.48 % (1151204)Time elapsed: 0.001 s
% 4.99/1.48 % (1151204)Peak memory usage: 88 MB
% 4.99/1.48 % (1151204)Instructions burned: 1 (million)
% 4.99/1.48 % (1151198)Refutation found. Thanks to Tanya!
% 4.99/1.48 % SZS status Theorem for theBenchmark
% 4.99/1.48 % SZS output start Proof for theBenchmark
% See solution above
% 4.99/1.48 % (1151198)------------------------------
% 4.99/1.48 % (1151198)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.99/1.48 % (1151198)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.99/1.48 % (1151198)CaDiCaL version: 2.1.3
% 4.99/1.48 % (1151198)Termination reason: Refutation
% 4.99/1.48 % (1151198)Time elapsed: 0.008 s
% 4.99/1.48 % (1151198)Peak memory usage: 89 MB
% 4.99/1.48 % (1151198)Instructions burned: 10 (million)
% 4.99/1.48 % (1151198)------------------------------
% 4.99/1.48 % (1151198)------------------------------
% 4.99/1.48 % (1151178)Success in time 0.651 s
% 4.99/1.48 % Vampire exiting
%------------------------------------------------------------------------------