%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU106+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 : n009.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:47:15 PM UTC 2026
% Result : Theorem 2.29s 1.17s
% Output : Refutation 2.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 9
% Syntax : Number of formulae : 61 ( 22 unt; 0 def)
% Number of atoms : 158 ( 19 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 177 ( 80 ~; 63 |; 21 &)
% ( 1 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-2 aty)
% Number of variables : 94 ( 88 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(f7,axiom,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f9,axiom,
! [X0,X1] : symmetric_difference(X0,X1) = set_union2(set_difference(X0,X1),set_difference(X1,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d6_xboole_0) ).
fof(f20,axiom,
! [X0,X1] : set_union2(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_k2_xboole_0) ).
fof(f32,axiom,
! [X0,X1] : set_difference(X0,X1) = symmetric_difference(X0,set_intersection2(X0,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t100_xboole_1) ).
fof(f33,axiom,
! [X0] :
( preboolean(X0)
<=> ! [X1,X2] :
( ( in(X1,X0)
& in(X2,X0) )
=> ( in(set_union2(X1,X2),X0)
& in(set_difference(X1,X2),X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_finsub_1) ).
fof(f34,conjecture,
! [X0] :
( ~ empty(X0)
=> ( ! [X1] :
( element(X1,X0)
=> ! [X2] :
( element(X2,X0)
=> ( in(symmetric_difference(X1,X2),X0)
& in(set_union2(X1,X2),X0) ) ) )
=> preboolean(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t17_finsub_1) ).
fof(f35,negated_conjecture,
~ ! [X0] :
( ~ empty(X0)
=> ( ! [X1] :
( element(X1,X0)
=> ! [X2] :
( element(X2,X0)
=> ( in(symmetric_difference(X1,X2),X0)
& in(set_union2(X1,X2),X0) ) ) )
=> preboolean(X0) ) ),
inference(negated_conjecture,[status(cth)],[f34]) ).
fof(f37,axiom,
! [X0,X1] :
( in(X0,X1)
=> element(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_subset) ).
fof(f49,axiom,
! [X0,X1] : set_intersection2(X0,X1) = symmetric_difference(symmetric_difference(X0,X1),set_union2(X0,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t95_xboole_1) ).
fof(f50,plain,
! [X0] : set_union2(X0,X0) = X0,
inference(rectify,[],[f20]) ).
fof(f52,plain,
! [X0] :
( ! [X1,X2] :
( ( in(X1,X0)
& in(X2,X0) )
=> ( in(set_union2(X1,X2),X0)
& in(set_difference(X1,X2),X0) ) )
=> preboolean(X0) ),
inference(unused_predicate_definition_removal,[],[f33]) ).
fof(f53,plain,
? [X0] :
( ~ preboolean(X0)
& ! [X1] :
( ! [X2] :
( ( in(symmetric_difference(X1,X2),X0)
& in(set_union2(X1,X2),X0) )
| ~ element(X2,X0) )
| ~ element(X1,X0) )
& ~ empty(X0) ),
inference(ennf_transformation,[],[f35]) ).
fof(f54,plain,
? [X0] :
( ~ preboolean(X0)
& ! [X1] :
( ! [X2] :
( ( in(symmetric_difference(X1,X2),X0)
& in(set_union2(X1,X2),X0) )
| ~ element(X2,X0) )
| ~ element(X1,X0) )
& ~ empty(X0) ),
inference(flattening,[],[f53]) ).
fof(f61,plain,
! [X0,X1] :
( element(X0,X1)
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f37]) ).
fof(f69,plain,
! [X0] :
( preboolean(X0)
| ? [X1,X2] :
( ( ~ in(set_union2(X1,X2),X0)
| ~ in(set_difference(X1,X2),X0) )
& in(X1,X0)
& in(X2,X0) ) ),
inference(ennf_transformation,[],[f52]) ).
fof(f70,plain,
! [X0] :
( preboolean(X0)
| ? [X1,X2] :
( ( ~ in(set_union2(X1,X2),X0)
| ~ in(set_difference(X1,X2),X0) )
& in(X1,X0)
& in(X2,X0) ) ),
inference(flattening,[],[f69]) ).
fof(f81,plain,
( ~ preboolean(sK0)
& ! [X1] :
( ! [X2] :
( ( in(symmetric_difference(X1,X2),sK0)
& in(set_union2(X1,X2),sK0) )
| ~ element(X2,sK0) )
| ~ element(X1,sK0) )
& ~ empty(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f54]) ).
fof(f84,plain,
! [X0] :
( preboolean(X0)
| ( ( ~ in(set_union2(sK3(X0),sK4(X0)),X0)
| ~ in(set_difference(sK3(X0),sK4(X0)),X0) )
& in(sK3(X0),X0)
& in(sK4(X0),X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4]),skolemize(X1,sK3(X0)),skolemize(X2,sK4(X0))],[f70]) ).
fof(f92,plain,
! [X2,X1] :
( in(set_union2(X1,X2),sK0)
| ~ element(X2,sK0)
| ~ element(X1,sK0) ),
inference(cnf_transformation,[],[f81]) ).
fof(f93,plain,
! [X2,X1] :
( in(symmetric_difference(X1,X2),sK0)
| ~ element(X2,sK0)
| ~ element(X1,sK0) ),
inference(cnf_transformation,[],[f81]) ).
fof(f94,plain,
~ preboolean(sK0),
inference(cnf_transformation,[],[f81]) ).
fof(f99,plain,
! [X0,X1] :
( element(X0,X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f61]) ).
fof(f101,plain,
! [X0] : set_union2(X0,X0) = X0,
inference(cnf_transformation,[],[f50]) ).
fof(f105,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f6]) ).
fof(f108,plain,
! [X0,X1] : set_intersection2(X0,X1) = symmetric_difference(symmetric_difference(X0,X1),set_union2(X0,X1)),
inference(cnf_transformation,[],[f49]) ).
fof(f112,plain,
! [X0] :
( in(sK4(X0),X0)
| preboolean(X0) ),
inference(cnf_transformation,[],[f84]) ).
fof(f113,plain,
! [X0] :
( in(sK3(X0),X0)
| preboolean(X0) ),
inference(cnf_transformation,[],[f84]) ).
fof(f114,plain,
! [X0] :
( ~ in(set_difference(sK3(X0),sK4(X0)),X0)
| ~ in(set_union2(sK3(X0),sK4(X0)),X0)
| preboolean(X0) ),
inference(cnf_transformation,[],[f84]) ).
fof(f136,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f7]) ).
fof(f142,plain,
! [X0,X1] : set_difference(X0,X1) = symmetric_difference(X0,set_intersection2(X0,X1)),
inference(cnf_transformation,[],[f32]) ).
fof(f144,plain,
! [X0,X1] : symmetric_difference(X0,X1) = set_union2(set_difference(X0,X1),set_difference(X1,X0)),
inference(cnf_transformation,[],[f9]) ).
fof(f145,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_union2(set_difference(set_union2(set_difference(X0,X1),set_difference(X1,X0)),set_union2(X0,X1)),set_difference(set_union2(X0,X1),set_union2(set_difference(X0,X1),set_difference(X1,X0)))),
inference(definition_unfolding,[],[f108,f144,f144]) ).
fof(f146,plain,
! [X0,X1] : set_difference(X0,X1) = set_union2(set_difference(X0,set_union2(set_difference(set_union2(set_difference(X0,X1),set_difference(X1,X0)),set_union2(X0,X1)),set_difference(set_union2(X0,X1),set_union2(set_difference(X0,X1),set_difference(X1,X0))))),set_difference(set_union2(set_difference(set_union2(set_difference(X0,X1),set_difference(X1,X0)),set_union2(X0,X1)),set_difference(set_union2(X0,X1),set_union2(set_difference(X0,X1),set_difference(X1,X0)))),X0)),
inference(definition_unfolding,[],[f142,f144,f145]) ).
fof(f147,plain,
! [X2,X1] :
( in(set_union2(set_difference(X1,X2),set_difference(X2,X1)),sK0)
| ~ element(X2,sK0)
| ~ element(X1,sK0) ),
inference(definition_unfolding,[],[f93,f144]) ).
fof(f155,plain,
! [X0,X1] : set_union2(set_difference(set_union2(set_difference(X0,X1),set_difference(X1,X0)),set_union2(X0,X1)),set_difference(set_union2(X0,X1),set_union2(set_difference(X0,X1),set_difference(X1,X0)))) = set_union2(set_difference(set_union2(set_difference(X1,X0),set_difference(X0,X1)),set_union2(X1,X0)),set_difference(set_union2(X1,X0),set_union2(set_difference(X1,X0),set_difference(X0,X1)))),
inference(definition_unfolding,[],[f136,f145,f145]) ).
fof(f158,plain,
! [X0] :
( in(X0,sK0)
| ~ element(X0,sK0)
| ~ element(X0,sK0) ),
inference(superposition,[],[f92,f101]) ).
fof(f161,plain,
! [X0] :
( in(X0,sK0)
| ~ element(X0,sK0) ),
inference(duplicate_literal_removal,[],[f158]) ).
fof(f334,plain,
( ~ in(set_union2(sK3(sK0),sK4(sK0)),sK0)
| preboolean(sK0)
| ~ element(set_difference(sK3(sK0),sK4(sK0)),sK0) ),
inference(resolution,[],[f114,f161]) ).
fof(f337,plain,
( ~ element(set_difference(sK3(sK0),sK4(sK0)),sK0)
| ~ in(set_union2(sK3(sK0),sK4(sK0)),sK0) ),
inference(forward_subsumption_resolution,[],[f334,f94]) ).
fof(f338,plain,
( ~ in(set_difference(sK3(sK0),sK4(sK0)),sK0)
| ~ in(set_union2(sK3(sK0),sK4(sK0)),sK0) ),
inference(resolution,[],[f337,f99]) ).
fof(f510,plain,
! [X0,X1] : set_union2(set_difference(set_union2(set_difference(X0,X1),set_difference(X1,X0)),set_union2(X0,X1)),set_difference(set_union2(X0,X1),set_union2(set_difference(X0,X1),set_difference(X1,X0)))) = set_union2(set_difference(set_union2(X1,X0),set_union2(set_difference(X1,X0),set_difference(X0,X1))),set_difference(set_union2(set_difference(X1,X0),set_difference(X0,X1)),set_union2(X1,X0))),
inference(forward_demodulation,[],[f155,f105]) ).
fof(f511,plain,
! [X0,X1] : set_union2(set_difference(set_union2(X0,X1),set_union2(set_difference(X0,X1),set_difference(X1,X0))),set_difference(set_union2(set_difference(X0,X1),set_difference(X1,X0)),set_union2(X0,X1))) = set_union2(set_difference(set_union2(X1,X0),set_union2(set_difference(X1,X0),set_difference(X0,X1))),set_difference(set_union2(set_difference(X1,X0),set_difference(X0,X1)),set_union2(X1,X0))),
inference(forward_demodulation,[],[f510,f105]) ).
fof(f530,plain,
! [X0,X1] :
( in(set_union2(set_difference(set_union2(X0,X1),set_union2(set_difference(X0,X1),set_difference(X1,X0))),set_difference(set_union2(set_difference(X0,X1),set_difference(X1,X0)),set_union2(X0,X1))),sK0)
| ~ element(set_union2(set_difference(X1,X0),set_difference(X0,X1)),sK0)
| ~ element(set_union2(X1,X0),sK0) ),
inference(superposition,[],[f147,f511]) ).
fof(f610,plain,
! [X0,X1] : set_difference(X0,X1) = set_union2(set_difference(X0,set_union2(set_difference(set_union2(X0,X1),set_union2(set_difference(X0,X1),set_difference(X1,X0))),set_difference(set_union2(set_difference(X0,X1),set_difference(X1,X0)),set_union2(X0,X1)))),set_difference(set_union2(set_difference(set_union2(X0,X1),set_union2(set_difference(X0,X1),set_difference(X1,X0))),set_difference(set_union2(set_difference(X0,X1),set_difference(X1,X0)),set_union2(X0,X1))),X0)),
inference(forward_demodulation,[],[f146,f105]) ).
fof(f640,plain,
! [X0,X1] :
( ~ element(set_union2(set_difference(set_union2(X0,X1),set_union2(set_difference(X0,X1),set_difference(X1,X0))),set_difference(set_union2(set_difference(X0,X1),set_difference(X1,X0)),set_union2(X0,X1))),sK0)
| in(set_difference(X0,X1),sK0)
| ~ element(X0,sK0) ),
inference(superposition,[],[f147,f610]) ).
fof(f747,plain,
! [X0,X1] :
( ~ in(set_union2(set_difference(set_union2(X0,X1),set_union2(set_difference(X0,X1),set_difference(X1,X0))),set_difference(set_union2(set_difference(X0,X1),set_difference(X1,X0)),set_union2(X0,X1))),sK0)
| ~ element(X0,sK0)
| in(set_difference(X0,X1),sK0) ),
inference(resolution,[],[f640,f99]) ).
fof(f928,plain,
! [X0,X1] :
( ~ element(set_union2(set_difference(X1,X0),set_difference(X0,X1)),sK0)
| in(set_difference(X0,X1),sK0)
| ~ element(X0,sK0)
| ~ element(set_union2(X1,X0),sK0) ),
inference(resolution,[],[f747,f530]) ).
fof(f1071,plain,
! [X0,X1] :
( ~ in(set_union2(set_difference(X1,X0),set_difference(X0,X1)),sK0)
| ~ element(X0,sK0)
| ~ element(set_union2(X1,X0),sK0)
| in(set_difference(X0,X1),sK0) ),
inference(resolution,[],[f928,f99]) ).
fof(f1107,plain,
! [X0,X1] :
( ~ element(X0,sK0)
| ~ element(set_union2(X1,X0),sK0)
| in(set_difference(X0,X1),sK0)
| ~ element(X0,sK0)
| ~ element(X1,sK0) ),
inference(resolution,[],[f1071,f147]) ).
fof(f1126,plain,
! [X0,X1] :
( in(set_difference(X0,X1),sK0)
| ~ element(set_union2(X1,X0),sK0)
| ~ element(X0,sK0)
| ~ element(X1,sK0) ),
inference(duplicate_literal_removal,[],[f1107]) ).
fof(f1230,plain,
( ~ element(set_union2(sK4(sK0),sK3(sK0)),sK0)
| ~ element(sK3(sK0),sK0)
| ~ element(sK4(sK0),sK0)
| ~ in(set_union2(sK3(sK0),sK4(sK0)),sK0) ),
inference(resolution,[],[f1126,f338]) ).
fof(f1239,plain,
( ~ element(set_union2(sK4(sK0),sK3(sK0)),sK0)
| ~ element(sK3(sK0),sK0)
| ~ element(sK4(sK0),sK0) ),
inference(forward_subsumption_resolution,[],[f1230,f92]) ).
fof(f1241,plain,
( ~ element(set_union2(sK3(sK0),sK4(sK0)),sK0)
| ~ element(sK3(sK0),sK0)
| ~ element(sK4(sK0),sK0) ),
inference(forward_demodulation,[],[f1239,f105]) ).
fof(f1243,plain,
( ~ element(sK3(sK0),sK0)
| ~ element(sK4(sK0),sK0)
| ~ in(set_union2(sK3(sK0),sK4(sK0)),sK0) ),
inference(resolution,[],[f1241,f99]) ).
fof(f1244,plain,
( ~ element(sK4(sK0),sK0)
| ~ element(sK3(sK0),sK0) ),
inference(forward_subsumption_resolution,[],[f1243,f92]) ).
fof(f1245,plain,
( ~ element(sK3(sK0),sK0)
| ~ in(sK4(sK0),sK0) ),
inference(resolution,[],[f1244,f99]) ).
fof(f1309,plain,
( ~ in(sK4(sK0),sK0)
| ~ in(sK3(sK0),sK0) ),
inference(resolution,[],[f1245,f99]) ).
fof(f1312,plain,
( ~ in(sK3(sK0),sK0)
| preboolean(sK0) ),
inference(resolution,[],[f1309,f112]) ).
fof(f1315,plain,
preboolean(sK0),
inference(forward_subsumption_resolution,[],[f1312,f113]) ).
fof(f1316,plain,
$false,
inference(forward_subsumption_resolution,[],[f1315,f94]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU106+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n009.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:35:09 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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
% 2.29/1.17 % (2638962)Detected formulas, will run a generic FOF schedule.
% 2.29/1.17 % (2638971)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4258111449:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.29/1.17 % (2638971)First to succeed.
% 2.29/1.17 % (2638971)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2638962"
% 2.29/1.17 % (2638969)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=837077609:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.29/1.17 % (2638968)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=816903537:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.29/1.17 % (2638970)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2411078524:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.29/1.17 % (2638967)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=3995406119:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.29/1.17 % (2638970)Refutation not found, incomplete strategy
% 2.29/1.17 % (2638970)------------------------------
% 2.29/1.17 % (2638970)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.29/1.17 % (2638970)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.29/1.17 % (2638970)CaDiCaL version: 2.1.3
% 2.29/1.17 % (2638970)Termination reason: Refutation not found, incomplete strategy
% 2.29/1.17 % (2638970)Time elapsed: 0.003 s
% 2.29/1.17 % (2638970)Peak memory usage: 88 MB
% 2.29/1.17 % (2638970)Instructions burned: 2 (million)
% 2.29/1.17 % (2638973)dis-21_1_sil=8000:lcm=predicate:random_seed=4064594159: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)
% 2.29/1.17 % (2638972)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4167537823:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.29/1.17 % (2638973)Instruction limit reached!
% 2.29/1.17 % (2638973)------------------------------
% 2.29/1.17 % (2638973)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.29/1.17 % (2638973)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.29/1.17 % (2638973)CaDiCaL version: 2.1.3
% 2.29/1.17 % (2638973)Termination reason: Instruction limit
% 2.29/1.17 % (2638973)Termination phase: Saturation
% 2.29/1.17 % (2638973)Time elapsed: 0.071 s
% 2.29/1.17 % (2638973)Peak memory usage: 90 MB
% 2.29/1.17 % (2638973)Instructions burned: 130 (million)
% 2.29/1.17 % (2638972)Instruction limit reached!
% 2.29/1.17 % (2638972)------------------------------
% 2.29/1.17 % (2638972)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.29/1.17 % (2638972)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.29/1.17 % (2638972)CaDiCaL version: 2.1.3
% 2.29/1.17 % (2638972)Termination reason: Instruction limit
% 2.29/1.17 % (2638972)Termination phase: Saturation
% 2.29/1.17 % (2638972)Time elapsed: 0.092 s
% 2.29/1.17 % (2638972)Peak memory usage: 89 MB
% 2.29/1.17 % (2638972)Instructions burned: 140 (million)
% 2.29/1.17 % (2638971)Refutation found. Thanks to Tanya!
% 2.29/1.17 % SZS status Theorem for theBenchmark
% 2.29/1.17 % SZS output start Proof for theBenchmark
% See solution above
% 2.74/1.37 % (2638971)------------------------------
% 2.74/1.37 % (2638971)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.74/1.37 % (2638971)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.74/1.37 % (2638971)CaDiCaL version: 2.1.3
% 2.74/1.37 % (2638971)Termination reason: Refutation
% 2.74/1.37 % (2638971)Time elapsed: 0.017 s
% 2.74/1.37 % (2638971)Peak memory usage: 89 MB
% 2.74/1.37 % (2638971)Instructions burned: 53 (million)
% 2.74/1.37 % (2638971)------------------------------
% 2.74/1.37 % (2638971)------------------------------
% 2.74/1.37 % (2638962)Success in time 0.3 s
% 2.74/1.37 % Vampire exiting
%------------------------------------------------------------------------------