%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL493+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n018.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 11:52:36 AM UTC 2026
% Result : Theorem 8.90s 2.32s
% Output : Refutation 10.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 22
% Syntax : Number of formulae : 94 ( 43 unt; 0 def)
% Number of atoms : 159 ( 23 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 113 ( 48 ~; 44 |; 2 &)
% ( 6 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 14 ( 12 usr; 12 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 151 ( 149 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
( modus_ponens
<=> ! [X0,X1] :
( ( is_a_theorem(X0)
& is_a_theorem(implies(X0,X1)) )
=> is_a_theorem(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',modus_ponens) ).
fof(f13,axiom,
( equivalence_1
<=> ! [X0,X1] : is_a_theorem(implies(equiv(X0,X1),implies(X0,X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equivalence_1) ).
fof(f23,axiom,
( r2
<=> ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',r2) ).
fof(f24,axiom,
( r3
<=> ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',r3) ).
fof(f25,axiom,
( r4
<=> ! [X0,X1,X2] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',r4) ).
fof(f26,axiom,
( r5
<=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',r5) ).
fof(f27,axiom,
( op_or
=> ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_or) ).
fof(f28,axiom,
( op_and
=> ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_and) ).
fof(f29,axiom,
( op_implies_and
=> ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_implies_and) ).
fof(f30,axiom,
( op_implies_or
=> ! [X0,X1] : implies(X0,X1) = or(not(X0),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_implies_or) ).
fof(f31,axiom,
( op_equiv
=> ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_equiv) ).
fof(f32,axiom,
op_implies_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_op_implies_or) ).
fof(f33,axiom,
op_and,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_op_and) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_modus_ponens) ).
fof(f37,axiom,
r2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r2) ).
fof(f38,axiom,
r3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r3) ).
fof(f39,axiom,
r4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r4) ).
fof(f40,axiom,
r5,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r5) ).
fof(f42,axiom,
op_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_op_or) ).
fof(f43,axiom,
op_implies_and,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_op_implies_and) ).
fof(f44,axiom,
op_equiv,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_op_equiv) ).
fof(f45,conjecture,
equivalence_1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_equivalence_1) ).
fof(f46,negated_conjecture,
~ equivalence_1,
inference(negated_conjecture,[status(cth)],[f45]) ).
fof(f47,plain,
~ equivalence_1,
inference(flattening,[],[f46]) ).
fof(f48,plain,
( r5
=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))) ),
inference(unused_predicate_definition_removal,[],[f26]) ).
fof(f49,plain,
( r4
=> ! [X0,X1,X2] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) ),
inference(unused_predicate_definition_removal,[],[f25]) ).
fof(f50,plain,
( r3
=> ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
inference(unused_predicate_definition_removal,[],[f24]) ).
fof(f51,plain,
( r2
=> ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))) ),
inference(unused_predicate_definition_removal,[],[f23]) ).
fof(f53,plain,
( ! [X0,X1] : is_a_theorem(implies(equiv(X0,X1),implies(X0,X1)))
=> equivalence_1 ),
inference(unused_predicate_definition_removal,[],[f13]) ).
fof(f55,plain,
( modus_ponens
=> ! [X0,X1] :
( ( is_a_theorem(X0)
& is_a_theorem(implies(X0,X1)) )
=> is_a_theorem(X1) ) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f56,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f55]) ).
fof(f57,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(flattening,[],[f56]) ).
fof(f59,plain,
( equivalence_1
| ? [X0,X1] : ~ is_a_theorem(implies(equiv(X0,X1),implies(X0,X1))) ),
inference(ennf_transformation,[],[f53]) ).
fof(f61,plain,
( ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1)))
| ~ r2 ),
inference(ennf_transformation,[],[f51]) ).
fof(f62,plain,
( ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0)))
| ~ r3 ),
inference(ennf_transformation,[],[f50]) ).
fof(f63,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2))))
| ~ r4 ),
inference(ennf_transformation,[],[f49]) ).
fof(f64,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2))))
| ~ r5 ),
inference(ennf_transformation,[],[f48]) ).
fof(f65,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(ennf_transformation,[],[f27]) ).
fof(f66,plain,
( ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1)))
| ~ op_and ),
inference(ennf_transformation,[],[f28]) ).
fof(f67,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(ennf_transformation,[],[f29]) ).
fof(f68,plain,
( ! [X0,X1] : implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(ennf_transformation,[],[f30]) ).
fof(f69,plain,
( ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(ennf_transformation,[],[f31]) ).
fof(f70,plain,
( equivalence_1
| ~ is_a_theorem(implies(equiv(sK0,sK1),implies(sK0,sK1))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f59]) ).
fof(f71,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1))
| ~ modus_ponens ),
inference(cnf_transformation,[],[f57]) ).
fof(f73,plain,
( equivalence_1
| ~ is_a_theorem(implies(equiv(sK0,sK1),implies(sK0,sK1))) ),
inference(cnf_transformation,[],[f70]) ).
fof(f75,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,or(X0,X1)))
| ~ r2 ),
inference(cnf_transformation,[],[f61]) ).
fof(f76,plain,
! [X0,X1] :
( is_a_theorem(implies(or(X0,X1),or(X1,X0)))
| ~ r3 ),
inference(cnf_transformation,[],[f62]) ).
fof(f77,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2))))
| ~ r4 ),
inference(cnf_transformation,[],[f63]) ).
fof(f78,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2))))
| ~ r5 ),
inference(cnf_transformation,[],[f64]) ).
fof(f79,plain,
! [X0,X1] :
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[],[f65]) ).
fof(f80,plain,
! [X0,X1] :
( and(X0,X1) = not(or(not(X0),not(X1)))
| ~ op_and ),
inference(cnf_transformation,[],[f66]) ).
fof(f81,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[],[f67]) ).
fof(f82,plain,
! [X0,X1] :
( implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(cnf_transformation,[],[f68]) ).
fof(f83,plain,
! [X0,X1] :
( equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(cnf_transformation,[],[f69]) ).
fof(f84,plain,
op_implies_or,
inference(cnf_transformation,[],[f32]) ).
fof(f85,plain,
op_and,
inference(cnf_transformation,[],[f33]) ).
fof(f87,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f89,plain,
r2,
inference(cnf_transformation,[],[f37]) ).
fof(f90,plain,
r3,
inference(cnf_transformation,[],[f38]) ).
fof(f91,plain,
r4,
inference(cnf_transformation,[],[f39]) ).
fof(f92,plain,
r5,
inference(cnf_transformation,[],[f40]) ).
fof(f94,plain,
op_or,
inference(cnf_transformation,[],[f42]) ).
fof(f95,plain,
op_implies_and,
inference(cnf_transformation,[],[f43]) ).
fof(f96,plain,
op_equiv,
inference(cnf_transformation,[],[f44]) ).
fof(f97,plain,
~ equivalence_1,
inference(cnf_transformation,[],[f47]) ).
fof(f98,plain,
! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
inference(forward_subsumption_resolution,[],[f83,f96]) ).
fof(f99,plain,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
inference(forward_subsumption_resolution,[],[f82,f84]) ).
fof(f100,plain,
! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))),
inference(forward_subsumption_resolution,[],[f81,f95]) ).
fof(f101,plain,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
inference(forward_subsumption_resolution,[],[f80,f85]) ).
fof(f102,plain,
! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))),
inference(forward_subsumption_resolution,[],[f79,f94]) ).
fof(f103,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))),
inference(forward_subsumption_resolution,[],[f78,f92]) ).
fof(f104,plain,
! [X2,X0,X1] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(forward_subsumption_resolution,[],[f77,f91]) ).
fof(f105,plain,
! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0))),
inference(forward_subsumption_resolution,[],[f76,f90]) ).
fof(f106,plain,
! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))),
inference(forward_subsumption_resolution,[],[f75,f89]) ).
fof(f108,plain,
~ is_a_theorem(implies(equiv(sK0,sK1),implies(sK0,sK1))),
inference(forward_subsumption_resolution,[],[f73,f97]) ).
fof(f110,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(forward_subsumption_resolution,[],[f71,f87]) ).
fof(f111,plain,
! [X0,X1] : and(X0,X1) = not(implies(X0,not(X1))),
inference(forward_demodulation,[],[f101,f99]) ).
fof(f112,plain,
! [X0,X1] : or(X0,X1) = implies(not(X0),X1),
inference(forward_demodulation,[],[f102,f100]) ).
fof(f136,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(or(X0,or(X1,X2)))
| is_a_theorem(or(X1,or(X0,X2))) ),
inference(resolution,[],[f110,f104]) ).
fof(f137,plain,
! [X0,X1] :
( ~ is_a_theorem(or(X0,X1))
| is_a_theorem(or(X1,X0)) ),
inference(resolution,[],[f110,f105]) ).
fof(f138,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(or(X2,X0),or(X2,X1)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f110,f103]) ).
fof(f141,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,or(X1,X2)))
| is_a_theorem(or(X1,or(not(X0),X2))) ),
inference(superposition,[],[f136,f99]) ).
fof(f142,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,or(X1,X2)))
| is_a_theorem(or(X1,implies(X0,X2))) ),
inference(forward_demodulation,[],[f141,f99]) ).
fof(f171,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(or(X2,X0))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(or(X2,X1)) ),
inference(resolution,[],[f138,f110]) ).
fof(f191,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(or(not(X0),X2)) ),
inference(superposition,[],[f171,f99]) ).
fof(f192,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(X0,X2)) ),
inference(forward_demodulation,[],[f191,f99]) ).
fof(f197,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,or(X1,X2)))
| is_a_theorem(implies(X0,or(X2,X1))) ),
inference(resolution,[],[f192,f105]) ).
fof(f202,plain,
! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1))),
inference(resolution,[],[f197,f106]) ).
fof(f211,plain,
! [X0,X1] : is_a_theorem(or(X0,implies(X0,X1))),
inference(resolution,[],[f202,f142]) ).
fof(f377,plain,
! [X0,X1] : is_a_theorem(or(implies(X0,X1),X0)),
inference(resolution,[],[f137,f211]) ).
fof(f1405,plain,
! [X2,X0,X1] : or(implies(X0,not(X1)),X2) = implies(and(X0,X1),X2),
inference(superposition,[],[f112,f111]) ).
fof(f2619,plain,
! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)),
inference(superposition,[],[f377,f1405]) ).
fof(f2805,plain,
! [X0,X1] : is_a_theorem(implies(equiv(X0,X1),implies(X0,X1))),
inference(superposition,[],[f2619,f98]) ).
fof(f2806,plain,
$false,
inference(resolution,[],[f2805,f108]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL493+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.39 % Computer : n018.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Sun Sep 27 15:52:24 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.43 Running first-order theorem proving
% 0.12/0.43 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
% 8.90/2.31 % (2542587)Detected formulas, will run a generic FOF schedule.
% 8.90/2.31 % (2542593)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=3270672125:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 8.90/2.31 % (2542597)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1279134507:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 8.90/2.31 % (2542594)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=932360333:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 8.90/2.31 % (2542596)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1573637999:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 8.90/2.31 % (2542592)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=3183653754:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 8.90/2.31 % (2542595)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3011817264:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 8.90/2.31 % (2542598)dis-21_1_sil=8000:lcm=predicate:random_seed=3611511593: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)
% 8.90/2.31 % (2542596)Refutation not found, incomplete strategy
% 8.90/2.31 % (2542596)------------------------------
% 8.90/2.31 % (2542596)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.90/2.31 % (2542596)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.90/2.31 % (2542595)Refutation not found, incomplete strategy
% 8.90/2.31 % (2542595)------------------------------
% 8.90/2.31 % (2542595)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.90/2.31 % (2542596)CaDiCaL version: 2.1.3
% 8.90/2.31 % (2542596)Termination reason: Refutation not found, incomplete strategy
% 8.90/2.31 % (2542596)Time elapsed: 0.001 s
% 8.90/2.31 % (2542595)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.90/2.31 % (2542596)Peak memory usage: 86 MB
% 8.90/2.31 % (2542595)CaDiCaL version: 2.1.3
% 8.90/2.31 % (2542595)Termination reason: Refutation not found, incomplete strategy
% 8.90/2.31 % (2542595)Time elapsed: 0.001 s
% 8.90/2.31 % (2542595)Peak memory usage: 86 MB
% 8.90/2.31 % (2542598)Refutation not found, incomplete strategy
% 8.90/2.31 % (2542598)------------------------------
% 8.90/2.31 % (2542598)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.90/2.31 % (2542598)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.90/2.31 % (2542598)CaDiCaL version: 2.1.3
% 8.90/2.31 % (2542598)Termination reason: Refutation not found, incomplete strategy
% 8.90/2.31 % (2542598)Time elapsed: 0.001 s
% 8.90/2.31 % (2542598)Peak memory usage: 88 MB
% 8.90/2.31 % (2542598)Instructions burned: 1 (million)
% 8.90/2.31 % (2542597)Instruction limit reached!
% 8.90/2.31 % (2542597)------------------------------
% 8.90/2.31 % (2542597)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.90/2.31 % (2542597)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.90/2.31 % (2542597)CaDiCaL version: 2.1.3
% 8.90/2.31 % (2542597)Termination reason: Instruction limit
% 8.90/2.31 % (2542597)Termination phase: Saturation
% 8.90/2.31 % (2542597)Time elapsed: 0.091 s
% 8.90/2.31 % (2542597)Peak memory usage: 90 MB
% 8.90/2.31 % (2542597)Instructions burned: 139 (million)
% 8.90/2.31 % (2542596)------------------------------
% 8.90/2.31 % (2542596)------------------------------
% 8.90/2.31 % (2542598)------------------------------
% 8.90/2.31 % (2542598)------------------------------
% 8.90/2.31 % (2542595)------------------------------
% 8.90/2.31 % (2542595)------------------------------
% 8.90/2.31 % (2542606)lrs+10_1_sil=8000:sp=occurrence:random_seed=702252354:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 8.90/2.31 % (2542606)Refutation not found, incomplete strategy
% 8.90/2.31 % (2542606)------------------------------
% 8.90/2.31 % (2542606)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.90/2.31 % (2542606)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.90/2.31 % (2542606)CaDiCaL version: 2.1.3
% 8.90/2.31 % (2542606)Termination reason: Refutation not found, incomplete strategy
% 8.90/2.31 % (2542606)Time elapsed: 0.001 s
% 8.90/2.31 % (2542606)Peak memory usage: 88 MB
% 8.90/2.31 % (2542610)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=2222714498:s2a=on:i=248:s2at=1.23:gtg=position_2995 on theBenchmark for (2995ds/248Mi)
% 8.90/2.31 % (2542608)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3765357434:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2995 on theBenchmark for (2995ds/157Mi)
% 8.90/2.31 % (2542609)lrs+1011_1_sil=32000:sp=occurrence:random_seed=758871863:i=325:sd=1:ss=axioms:sgt=32_2995 on theBenchmark for (2995ds/325Mi)
% 8.90/2.31 % (2542609)Refutation not found, incomplete strategy
% 8.90/2.31 % (2542609)------------------------------
% 8.90/2.31 % (2542609)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.90/2.31 % (2542609)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.90/2.31 % (2542609)CaDiCaL version: 2.1.3
% 8.90/2.31 % (2542608)Refutation not found, incomplete strategy
% 8.90/2.31 % (2542608)------------------------------
% 8.90/2.31 % (2542608)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.90/2.31 % (2542609)Termination reason: Refutation not found, incomplete strategy
% 8.90/2.31 % (2542609)Time elapsed: 0.001 s
% 8.90/2.31 % (2542609)Peak memory usage: 86 MB
% 8.90/2.31 % (2542608)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.90/2.31 % (2542608)CaDiCaL version: 2.1.3
% 8.90/2.31 % (2542608)Termination reason: Refutation not found, incomplete strategy
% 8.90/2.31 % (2542608)Time elapsed: 0.001 s
% 8.90/2.31 % (2542608)Peak memory usage: 87 MB
% 8.90/2.31 % (2542606)------------------------------
% 8.90/2.31 % (2542606)------------------------------
% 8.90/2.31 % (2542594)Refutation not found, incomplete strategy
% 8.90/2.31 % (2542594)------------------------------
% 8.90/2.31 % (2542594)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.90/2.31 % (2542594)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.90/2.31 % (2542594)CaDiCaL version: 2.1.3
% 8.90/2.31 % (2542594)Termination reason: Refutation not found, incomplete strategy
% 8.90/2.31 % (2542594)Time elapsed: 0.559 s
% 8.90/2.31 % (2542594)Peak memory usage: 126 MB
% 8.90/2.31 % (2542594)Instructions burned: 828 (million)
% 8.90/2.31 % (2542610)Instruction limit reached!
% 8.90/2.31 % (2542610)------------------------------
% 8.90/2.31 % (2542610)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.90/2.31 % (2542610)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.90/2.31 % (2542610)CaDiCaL version: 2.1.3
% 8.90/2.31 % (2542610)Termination reason: Instruction limit
% 8.90/2.31 % (2542610)Termination phase: Saturation
% 8.90/2.31 % (2542610)Time elapsed: 0.148 s
% 8.90/2.31 % (2542610)Peak memory usage: 92 MB
% 8.90/2.31 % (2542610)Instructions burned: 249 (million)
% 8.90/2.31 % (2542614)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=803870207:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2993 on theBenchmark for (2993ds/294Mi)
% 8.90/2.31 % (2542614)Refutation not found, incomplete strategy
% 8.90/2.31 % (2542614)------------------------------
% 8.90/2.31 % (2542614)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.90/2.31 % (2542614)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.90/2.31 % (2542614)CaDiCaL version: 2.1.3
% 8.90/2.31 % (2542614)Termination reason: Refutation not found, incomplete strategy
% 8.90/2.31 % (2542614)Time elapsed: 0.001 s
% 8.90/2.31 % (2542614)Peak memory usage: 86 MB
% 8.90/2.31 % (2542608)------------------------------
% 8.90/2.31 % (2542608)------------------------------
% 8.90/2.31 % (2542609)------------------------------
% 8.90/2.31 % (2542609)------------------------------
% 8.90/2.31 % (2542615)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=699806516:i=2350_2992 on theBenchmark for (2992ds/2350Mi)
% 8.90/2.31 % (2542594)------------------------------
% 8.90/2.31 % (2542594)------------------------------
% 8.90/2.31 % (2542617)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=960231848:cts=off:i=113:fsr=off:ss=included:sgt=4_2991 on theBenchmark for (2991ds/113Mi)
% 8.90/2.31 % (2542618)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=146155087:i=127:av=off:fsr=off:sup=off_2991 on theBenchmark for (2991ds/127Mi)
% 8.90/2.31 % (2542617)Refutation not found, incomplete strategy
% 8.90/2.31 % (2542617)------------------------------
% 8.90/2.31 % (2542617)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.90/2.31 % (2542617)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.90/2.31 % (2542617)CaDiCaL version: 2.1.3
% 8.90/2.31 % (2542617)Termination reason: Refutation not found, incomplete strategy
% 8.90/2.31 % (2542617)Time elapsed: 0.001 s
% 8.90/2.31 % (2542617)Peak memory usage: 88 MB
% 8.90/2.31 % (2542614)------------------------------
% 8.90/2.31 % (2542614)------------------------------
% 8.90/2.31 % (2542618)Instruction limit reached!
% 8.90/2.31 % (2542618)------------------------------
% 8.90/2.31 % (2542618)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.90/2.31 % (2542618)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.90/2.31 % (2542618)CaDiCaL version: 2.1.3
% 8.90/2.31 % (2542618)Termination reason: Instruction limit
% 8.90/2.31 % (2542618)Termination phase: Saturation
% 8.90/2.31 % (2542618)Time elapsed: 0.068 s
% 8.90/2.31 % (2542618)Peak memory usage: 88 MB
% 8.90/2.31 % (2542618)Instructions burned: 128 (million)
% 8.90/2.31 % (2542620)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=460297822:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2990 on theBenchmark for (2990ds/114Mi)
% 8.90/2.32 % (2542620)Refutation not found, incomplete strategy
% 8.90/2.32 % (2542620)------------------------------
% 8.90/2.32 % (2542620)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.90/2.32 % (2542620)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.90/2.32 % (2542620)CaDiCaL version: 2.1.3
% 8.90/2.32 % (2542620)Termination reason: Refutation not found, incomplete strategy
% 8.90/2.32 % (2542620)Time elapsed: 0.001 s
% 8.90/2.32 % (2542620)Peak memory usage: 87 MB
% 8.90/2.32 % (2542592)First to succeed.
% 8.90/2.32 % (2542592)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2542587"
% 8.90/2.32 % (2542623)lrs+10_1_sil=8000:sp=occurrence:random_seed=2280436956:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2989 on theBenchmark for (2989ds/907Mi)
% 8.90/2.32 % (2542624)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=2616953755:i=437:sd=1:aac=none:ss=included_2989 on theBenchmark for (2989ds/437Mi)
% 8.90/2.32 % (2542617)------------------------------
% 8.90/2.32 % (2542617)------------------------------
% 8.90/2.32 % (2542624)Refutation not found, incomplete strategy
% 8.90/2.32 % (2542624)------------------------------
% 8.90/2.32 % (2542624)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.90/2.32 % (2542624)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.90/2.32 % (2542624)CaDiCaL version: 2.1.3
% 8.90/2.32 % (2542624)Termination reason: Refutation not found, incomplete strategy
% 8.90/2.32 % (2542624)Time elapsed: 0.001 s
% 8.90/2.32 % (2542624)Peak memory usage: 87 MB
% 8.90/2.32 % (2542620)------------------------------
% 8.90/2.32 % (2542620)------------------------------
% 8.90/2.32 % (2542628)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=2357192603:i=5202:ss=axioms:sgt=16_2987 on theBenchmark for (2987ds/5202Mi)
% 8.90/2.32 % (2542592)Refutation found. Thanks to Tanya!
% 8.90/2.32 % SZS status Theorem for theBenchmark
% 8.90/2.32 % SZS output start Proof for theBenchmark
% See solution above
% 10.72/2.45 % (2542592)------------------------------
% 10.72/2.45 % (2542592)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.72/2.45 % (2542592)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.72/2.45 % (2542592)CaDiCaL version: 2.1.3
% 10.72/2.45 % (2542592)Termination reason: Refutation
% 10.72/2.45 % (2542592)Time elapsed: 1.006 s
% 10.72/2.45 % (2542592)Peak memory usage: 133 MB
% 10.72/2.45 % (2542592)Instructions burned: 1532 (million)
% 10.72/2.45 % (2542592)------------------------------
% 10.72/2.45 % (2542592)------------------------------
% 10.72/2.45 % (2542587)Success in time 1.441 s
% 10.72/2.45 % Vampire exiting
%------------------------------------------------------------------------------