%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : GRA002+3 : TPTP v9.3.1. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/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 09:55:19 AM UTC 2026
% Result : Theorem 3.20s 1.34s
% Output : Refutation 4.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 7
% Syntax : Number of formulae : 57 ( 8 unt; 0 def)
% Number of atoms : 231 ( 21 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 304 ( 130 ~; 117 |; 43 &)
% ( 2 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 8 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 2 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-3 aty)
% Number of variables : 233 ( 218 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X0,X1,X2] :
( path(X1,X2,X0)
=> ! [X3,X4] :
( ( on_path(X3,X0)
& on_path(X4,X0)
& ( sequential(X3,X4)
| ? [X5] :
( sequential(X3,X5)
& precedes(X5,X4,X0) ) ) )
=> precedes(X3,X4,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',precedes_defn) ).
fof(f11,axiom,
! [X0,X1,X2] :
( shortest_path(X0,X1,X2)
<=> ( path(X0,X1,X2)
& X0 != X1
& ! [X3] :
( path(X0,X1,X3)
=> less_or_equal(length_of(X2),length_of(X3)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',shortest_path_defn) ).
fof(f15,axiom,
! [X0,X1,X2] :
( path(X0,X1,X2)
=> number_of_in(sequential_pairs,X2) = minus(length_of(X2),n1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',path_length_sequential_pairs) ).
fof(f16,axiom,
! [X0,X1,X2] :
( ( path(X1,X2,X0)
& ! [X3,X4] :
( ( on_path(X3,X0)
& on_path(X4,X0)
& sequential(X3,X4) )
=> ? [X5] : triangle(X3,X4,X5) ) )
=> number_of_in(sequential_pairs,X0) = number_of_in(triangles,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sequential_pairs_and_triangles) ).
fof(f17,axiom,
! [X0,X1] : less_or_equal(number_of_in(X0,X1),number_of_in(X0,graph)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',graph_has_them_all) ).
fof(f18,axiom,
( complete
=> ! [X0,X1,X2,X3,X4] :
( ( shortest_path(X0,X1,X4)
& precedes(X2,X3,X4)
& sequential(X2,X3) )
=> ? [X5] : triangle(X2,X3,X5) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sequential_is_triangle) ).
fof(f19,conjecture,
( complete
=> ! [X0,X1,X2] :
( shortest_path(X1,X2,X0)
=> less_or_equal(minus(length_of(X0),n1),number_of_in(triangles,graph)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',maximal_path_length) ).
fof(f20,negated_conjecture,
~ ( complete
=> ! [X0,X1,X2] :
( shortest_path(X1,X2,X0)
=> less_or_equal(minus(length_of(X0),n1),number_of_in(triangles,graph)) ) ),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f21,plain,
( ! [X0,X1,X2,X3,X4] :
( ? [X5] : triangle(X2,X3,X5)
| ~ shortest_path(X0,X1,X4)
| ~ precedes(X2,X3,X4)
| ~ sequential(X2,X3) )
| ~ complete ),
inference(ennf_transformation,[],[f18]) ).
fof(f22,plain,
( ! [X0,X1,X2,X3,X4] :
( ? [X5] : triangle(X2,X3,X5)
| ~ shortest_path(X0,X1,X4)
| ~ precedes(X2,X3,X4)
| ~ sequential(X2,X3) )
| ~ complete ),
inference(flattening,[],[f21]) ).
fof(f23,plain,
( ? [X0,X1,X2] :
( ~ less_or_equal(minus(length_of(X0),n1),number_of_in(triangles,graph))
& shortest_path(X1,X2,X0) )
& complete ),
inference(ennf_transformation,[],[f20]) ).
fof(f29,plain,
! [X0,X1,X2] :
( ! [X3,X4] :
( precedes(X3,X4,X0)
| ~ on_path(X3,X0)
| ~ on_path(X4,X0)
| ( ~ sequential(X3,X4)
& ! [X5] :
( ~ sequential(X3,X5)
| ~ precedes(X5,X4,X0) ) ) )
| ~ path(X1,X2,X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f30,plain,
! [X0,X1,X2] :
( ! [X3,X4] :
( precedes(X3,X4,X0)
| ~ on_path(X3,X0)
| ~ on_path(X4,X0)
| ( ~ sequential(X3,X4)
& ! [X5] :
( ~ sequential(X3,X5)
| ~ precedes(X5,X4,X0) ) ) )
| ~ path(X1,X2,X0) ),
inference(flattening,[],[f29]) ).
fof(f31,plain,
! [X0,X1,X2] :
( number_of_in(sequential_pairs,X2) = minus(length_of(X2),n1)
| ~ path(X0,X1,X2) ),
inference(ennf_transformation,[],[f15]) ).
fof(f32,plain,
! [X0,X1,X2] :
( shortest_path(X0,X1,X2)
<=> ( path(X0,X1,X2)
& X0 != X1
& ! [X3] :
( less_or_equal(length_of(X2),length_of(X3))
| ~ path(X0,X1,X3) ) ) ),
inference(ennf_transformation,[],[f11]) ).
fof(f33,plain,
! [X0,X1,X2] :
( number_of_in(sequential_pairs,X0) = number_of_in(triangles,X0)
| ~ path(X1,X2,X0)
| ? [X3,X4] :
( ! [X5] : ~ triangle(X3,X4,X5)
& on_path(X3,X0)
& on_path(X4,X0)
& sequential(X3,X4) ) ),
inference(ennf_transformation,[],[f16]) ).
fof(f34,plain,
! [X0,X1,X2] :
( number_of_in(sequential_pairs,X0) = number_of_in(triangles,X0)
| ~ path(X1,X2,X0)
| ? [X3,X4] :
( ! [X5] : ~ triangle(X3,X4,X5)
& on_path(X3,X0)
& on_path(X4,X0)
& sequential(X3,X4) ) ),
inference(flattening,[],[f33]) ).
fof(f37,plain,
( ! [X0,X1,X2,X3,X4] :
( triangle(X2,X3,sK0(X2,X3))
| ~ shortest_path(X0,X1,X4)
| ~ precedes(X2,X3,X4)
| ~ sequential(X2,X3) )
| ~ complete ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X5,sK0(X2,X3))],[f22]) ).
fof(f38,plain,
( ~ less_or_equal(minus(length_of(sK1),n1),number_of_in(triangles,graph))
& shortest_path(sK2,sK3,sK1)
& complete ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3]),skolemize(X0,sK1),skolemize(X1,sK2),skolemize(X2,sK3)],[f23]) ).
fof(f50,plain,
! [X0,X1,X2] :
( ( shortest_path(X0,X1,X2)
| ~ path(X0,X1,X2)
| X0 = X1
| ? [X3] :
( ~ less_or_equal(length_of(X2),length_of(X3))
& path(X0,X1,X3) ) )
& ( ( path(X0,X1,X2)
& X0 != X1
& ! [X3] :
( less_or_equal(length_of(X2),length_of(X3))
| ~ path(X0,X1,X3) ) )
| ~ shortest_path(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f32]) ).
fof(f51,plain,
! [X0,X1,X2] :
( ( shortest_path(X0,X1,X2)
| ~ path(X0,X1,X2)
| X0 = X1
| ? [X3] :
( ~ less_or_equal(length_of(X2),length_of(X3))
& path(X0,X1,X3) ) )
& ( ( path(X0,X1,X2)
& X0 != X1
& ! [X3] :
( less_or_equal(length_of(X2),length_of(X3))
| ~ path(X0,X1,X3) ) )
| ~ shortest_path(X0,X1,X2) ) ),
inference(flattening,[],[f50]) ).
fof(f52,plain,
! [X0,X1,X2] :
( ( shortest_path(X0,X1,X2)
| ~ path(X0,X1,X2)
| X0 = X1
| ? [X3] :
( ~ less_or_equal(length_of(X2),length_of(X3))
& path(X0,X1,X3) ) )
& ( ( path(X0,X1,X2)
& X0 != X1
& ! [X4] :
( less_or_equal(length_of(X2),length_of(X4))
| ~ path(X0,X1,X4) ) )
| ~ shortest_path(X0,X1,X2) ) ),
inference(rectify,[],[f51]) ).
fof(f53,plain,
! [X0,X1,X2] :
( ( shortest_path(X0,X1,X2)
| ~ path(X0,X1,X2)
| X0 = X1
| ( ~ less_or_equal(length_of(X2),length_of(sK6(X0,X1,X2)))
& path(X0,X1,sK6(X0,X1,X2)) ) )
& ( ( path(X0,X1,X2)
& X0 != X1
& ! [X4] :
( less_or_equal(length_of(X2),length_of(X4))
| ~ path(X0,X1,X4) ) )
| ~ shortest_path(X0,X1,X2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(X3,sK6(X0,X1,X2))],[f52]) ).
fof(f54,plain,
! [X0,X1,X2] :
( number_of_in(sequential_pairs,X0) = number_of_in(triangles,X0)
| ~ path(X1,X2,X0)
| ( ! [X5] : ~ triangle(sK7(X0),sK8(X0),X5)
& on_path(sK7(X0),X0)
& on_path(sK8(X0),X0)
& sequential(sK7(X0),sK8(X0)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7,sK8]),skolemize(X3,sK7(X0)),skolemize(X4,sK8(X0))],[f34]) ).
fof(f55,plain,
! [X2,X3,X0,X1,X4] :
( triangle(X2,X3,sK0(X2,X3))
| ~ shortest_path(X0,X1,X4)
| ~ precedes(X2,X3,X4)
| ~ sequential(X2,X3)
| ~ complete ),
inference(cnf_transformation,[],[f37]) ).
fof(f56,plain,
complete,
inference(cnf_transformation,[],[f38]) ).
fof(f57,plain,
shortest_path(sK2,sK3,sK1),
inference(cnf_transformation,[],[f38]) ).
fof(f58,plain,
~ less_or_equal(minus(length_of(sK1),n1),number_of_in(triangles,graph)),
inference(cnf_transformation,[],[f38]) ).
fof(f78,plain,
! [X2,X3,X0,X1,X4] :
( precedes(X3,X4,X0)
| ~ on_path(X3,X0)
| ~ on_path(X4,X0)
| ~ sequential(X3,X4)
| ~ path(X1,X2,X0) ),
inference(cnf_transformation,[],[f30]) ).
fof(f86,plain,
! [X2,X0,X1] :
( number_of_in(sequential_pairs,X2) = minus(length_of(X2),n1)
| ~ path(X0,X1,X2) ),
inference(cnf_transformation,[],[f31]) ).
fof(f89,plain,
! [X2,X0,X1] :
( path(X0,X1,X2)
| ~ shortest_path(X0,X1,X2) ),
inference(cnf_transformation,[],[f53]) ).
fof(f92,plain,
! [X2,X0,X1] :
( number_of_in(sequential_pairs,X0) = number_of_in(triangles,X0)
| ~ path(X1,X2,X0)
| sequential(sK7(X0),sK8(X0)) ),
inference(cnf_transformation,[],[f54]) ).
fof(f93,plain,
! [X2,X0,X1] :
( number_of_in(sequential_pairs,X0) = number_of_in(triangles,X0)
| ~ path(X1,X2,X0)
| on_path(sK8(X0),X0) ),
inference(cnf_transformation,[],[f54]) ).
fof(f94,plain,
! [X2,X0,X1] :
( number_of_in(sequential_pairs,X0) = number_of_in(triangles,X0)
| ~ path(X1,X2,X0)
| on_path(sK7(X0),X0) ),
inference(cnf_transformation,[],[f54]) ).
fof(f95,plain,
! [X2,X0,X1,X5] :
( number_of_in(sequential_pairs,X0) = number_of_in(triangles,X0)
| ~ path(X1,X2,X0)
| ~ triangle(sK7(X0),sK8(X0),X5) ),
inference(cnf_transformation,[],[f54]) ).
fof(f96,plain,
! [X0,X1] : less_or_equal(number_of_in(X0,X1),number_of_in(X0,graph)),
inference(cnf_transformation,[],[f17]) ).
fof(f134,plain,
! [X0,X1] :
( ~ less_or_equal(number_of_in(sequential_pairs,sK1),number_of_in(triangles,graph))
| ~ path(X0,X1,sK1) ),
inference(superposition,[],[f58,f86]) ).
fof(f177,plain,
! [X2,X0,X1] :
( less_or_equal(number_of_in(sequential_pairs,X0),number_of_in(triangles,graph))
| ~ path(X1,X2,X0)
| on_path(sK8(X0),X0) ),
inference(superposition,[],[f96,f93]) ).
fof(f183,plain,
! [X2,X0,X1] :
( less_or_equal(number_of_in(sequential_pairs,X0),number_of_in(triangles,graph))
| ~ path(X1,X2,X0)
| on_path(sK7(X0),X0) ),
inference(superposition,[],[f96,f94]) ).
fof(f188,plain,
! [X2,X0,X1] :
( less_or_equal(number_of_in(sequential_pairs,X0),number_of_in(triangles,graph))
| ~ path(X1,X2,X0)
| sequential(sK7(X0),sK8(X0)) ),
inference(superposition,[],[f96,f92]) ).
fof(f209,plain,
! [X2,X3,X0,X1] :
( less_or_equal(number_of_in(sequential_pairs,X0),number_of_in(triangles,graph))
| ~ path(X1,X2,X0)
| ~ triangle(sK7(X0),sK8(X0),X3) ),
inference(superposition,[],[f96,f95]) ).
fof(f213,plain,
! [X2,X3,X0,X1,X4] :
( triangle(X2,X3,sK0(X2,X3))
| ~ shortest_path(X0,X1,X4)
| ~ precedes(X2,X3,X4)
| ~ sequential(X2,X3) ),
inference(forward_subsumption_resolution,[],[f55,f56]) ).
fof(f1133,plain,
! [X2,X3,X0,X1] :
( on_path(sK8(sK1),sK1)
| ~ path(X0,X1,sK1)
| ~ path(X2,X3,sK1) ),
inference(resolution,[],[f177,f134]) ).
fof(f1187,plain,
! [X2,X3,X0,X1] :
( on_path(sK7(sK1),sK1)
| ~ path(X0,X1,sK1)
| ~ path(X2,X3,sK1) ),
inference(resolution,[],[f183,f134]) ).
fof(f1295,plain,
! [X2,X3,X0,X1] :
( sequential(sK7(sK1),sK8(sK1))
| ~ path(X0,X1,sK1)
| ~ path(X2,X3,sK1) ),
inference(resolution,[],[f188,f134]) ).
fof(f1313,plain,
! [X2,X3,X0,X1,X4] :
( ~ triangle(sK7(sK1),sK8(sK1),X2)
| ~ path(X0,X1,sK1)
| ~ path(X3,X4,sK1) ),
inference(resolution,[],[f209,f134]) ).
fof(f1375,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( ~ path(X0,X1,sK1)
| ~ path(X2,X3,sK1)
| ~ shortest_path(X4,X5,X6)
| ~ precedes(sK7(sK1),sK8(sK1),X6)
| ~ sequential(sK7(sK1),sK8(sK1)) ),
inference(resolution,[],[f1313,f213]) ).
fof(f1378,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( ~ precedes(sK7(sK1),sK8(sK1),X6)
| ~ path(X2,X3,sK1)
| ~ shortest_path(X4,X5,X6)
| ~ path(X0,X1,sK1) ),
inference(forward_subsumption_resolution,[],[f1375,f1295]) ).
fof(f1386,plain,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
( ~ path(X0,X1,sK1)
| ~ shortest_path(X2,X3,X4)
| ~ path(X5,X6,sK1)
| ~ on_path(sK7(sK1),X4)
| ~ on_path(sK8(sK1),X4)
| ~ sequential(sK7(sK1),sK8(sK1))
| ~ path(X7,X8,X4) ),
inference(resolution,[],[f1378,f78]) ).
fof(f1387,plain,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
( ~ shortest_path(X2,X3,X4)
| ~ path(X0,X1,sK1)
| ~ path(X5,X6,sK1)
| ~ on_path(sK7(sK1),X4)
| ~ on_path(sK8(sK1),X4)
| ~ path(X7,X8,X4) ),
inference(forward_subsumption_resolution,[],[f1386,f1295]) ).
fof(f1499,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ path(X0,X1,sK1)
| ~ path(X2,X3,sK1)
| ~ on_path(sK7(sK1),sK1)
| ~ on_path(sK8(sK1),sK1)
| ~ path(X4,X5,sK1) ),
inference(resolution,[],[f1387,f57]) ).
fof(f1500,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ path(X0,X1,sK1)
| ~ path(X2,X3,sK1)
| ~ on_path(sK8(sK1),sK1)
| ~ path(X4,X5,sK1) ),
inference(forward_subsumption_resolution,[],[f1499,f1187]) ).
fof(f1501,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ path(X4,X5,sK1)
| ~ path(X2,X3,sK1)
| ~ path(X0,X1,sK1) ),
inference(forward_subsumption_resolution,[],[f1500,f1133]) ).
fof(f1582,plain,
! [X2,X3,X0,X1] :
( ~ path(X2,X3,sK1)
| ~ path(X0,X1,sK1) ),
inference(factoring,[],[f1501]) ).
fof(f1585,plain,
! [X0,X1] : ~ path(X0,X1,sK1),
inference(factoring,[],[f1582]) ).
fof(f1586,plain,
! [X0,X1] : ~ shortest_path(X0,X1,sK1),
inference(resolution,[],[f1585,f89]) ).
fof(f1587,plain,
$false,
inference(resolution,[],[f1586,f57]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRA002+3 : TPTP v9.3.1. Bugfixed v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/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 : Sun Sep 27 08:45:45 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.20/1.34 % (1726677)Detected formulas, will run a generic FOF schedule.
% 3.20/1.34 % (1726684)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=583434482:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.20/1.34 % (1726685)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2213231306:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.20/1.34 % (1726686)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2694136655:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.20/1.34 % (1726688)dis-21_1_sil=8000:lcm=predicate:random_seed=1927981932: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.20/1.34 % (1726682)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=1375206020:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.20/1.34 % (1726683)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=3586687817:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.20/1.34 % (1726687)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1348432392:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.20/1.34 % (1726685)Refutation not found, incomplete strategy
% 3.20/1.34 % (1726685)------------------------------
% 3.20/1.34 % (1726685)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.20/1.34 % (1726685)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.20/1.34 % (1726685)CaDiCaL version: 2.1.3
% 3.20/1.34 % (1726685)Termination reason: Refutation not found, incomplete strategy
% 3.20/1.34 % (1726685)Time elapsed: 0.005 s
% 3.20/1.34 % (1726685)Peak memory usage: 88 MB
% 3.20/1.34 % (1726685)Instructions burned: 6 (million)
% 3.20/1.34 % (1726686)First to succeed.
% 3.20/1.34 % (1726686)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1726677"
% 3.20/1.34 % (1726688)Instruction limit reached!
% 3.20/1.34 % (1726688)------------------------------
% 3.20/1.34 % (1726688)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.20/1.34 % (1726688)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.20/1.34 % (1726688)CaDiCaL version: 2.1.3
% 3.20/1.34 % (1726688)Termination reason: Instruction limit
% 3.20/1.34 % (1726688)Termination phase: Saturation
% 3.20/1.34 % (1726688)Time elapsed: 0.064 s
% 3.20/1.34 % (1726688)Peak memory usage: 88 MB
% 3.20/1.34 % (1726688)Instructions burned: 132 (million)
% 3.20/1.34 % (1726687)Instruction limit reached!
% 3.20/1.34 % (1726687)------------------------------
% 3.20/1.34 % (1726687)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.20/1.34 % (1726687)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.20/1.34 % (1726687)CaDiCaL version: 2.1.3
% 3.20/1.34 % (1726687)Termination reason: Instruction limit
% 3.20/1.34 % (1726687)Termination phase: Saturation
% 3.20/1.34 % (1726687)Time elapsed: 0.094 s
% 3.20/1.34 % (1726687)Peak memory usage: 90 MB
% 3.20/1.34 % (1726687)Instructions burned: 140 (million)
% 3.20/1.34 % (1726696)lrs+10_1_sil=8000:sp=occurrence:random_seed=2226440775:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.20/1.34 % (1726685)------------------------------
% 3.20/1.34 % (1726685)------------------------------
% 3.20/1.34 % (1726697)lrs+10_1_sil=32000:urr=on:br=off:random_seed=967582856:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.20/1.34 % (1726697)Refutation not found, incomplete strategy
% 3.20/1.34 % (1726697)------------------------------
% 3.20/1.34 % (1726697)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.20/1.34 % (1726697)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.20/1.34 % (1726697)CaDiCaL version: 2.1.3
% 3.20/1.34 % (1726697)Termination reason: Refutation not found, incomplete strategy
% 3.20/1.34 % (1726697)Time elapsed: 0.002 s
% 3.20/1.34 % (1726697)Peak memory usage: 88 MB
% 3.20/1.34 % (1726697)Instructions burned: 1 (million)
% 3.20/1.34 % (1726686)Refutation found. Thanks to Tanya!
% 3.20/1.34 % SZS status Theorem for theBenchmark
% 3.20/1.34 % SZS output start Proof for theBenchmark
% See solution above
% 4.07/1.54 % (1726686)------------------------------
% 4.07/1.54 % (1726686)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.07/1.54 % (1726686)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.07/1.54 % (1726686)CaDiCaL version: 2.1.3
% 4.07/1.54 % (1726686)Termination reason: Refutation
% 4.07/1.54 % (1726686)Time elapsed: 0.058 s
% 4.07/1.54 % (1726686)Peak memory usage: 88 MB
% 4.07/1.54 % (1726686)Instructions burned: 99 (million)
% 4.07/1.54 % (1726686)------------------------------
% 4.07/1.54 % (1726686)------------------------------
% 4.07/1.54 % (1726677)Success in time 0.49 s
% 4.07/1.54 % Vampire exiting
%------------------------------------------------------------------------------