%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL487+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:35 AM UTC 2026
% Result : Theorem 6.31s 1.65s
% Output : Refutation 7.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 20
% Syntax : Number of formulae : 87 ( 39 unt; 0 def)
% Number of atoms : 149 ( 19 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 108 ( 46 ~; 42 |; 2 &)
% ( 6 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 13 ( 11 usr; 11 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 141 ( 139 !; 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(f7,axiom,
( and_1
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_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(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(f45,conjecture,
and_1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_and_1) ).
fof(f46,negated_conjecture,
~ and_1,
inference(negated_conjecture,[status(cth)],[f45]) ).
fof(f47,plain,
~ and_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(and(X0,X1),X0))
=> and_1 ),
inference(unused_predicate_definition_removal,[],[f7]) ).
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,
( and_1
| ? [X0,X1] : ~ is_a_theorem(implies(and(X0,X1),X0)) ),
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(f70,plain,
( and_1
| ~ is_a_theorem(implies(and(sK0,sK1),sK0)) ),
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,
( and_1
| ~ is_a_theorem(implies(and(sK0,sK1),sK0)) ),
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(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(f97,plain,
~ and_1,
inference(cnf_transformation,[],[f47]) ).
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(and(sK0,sK1),sK0)),
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(f126,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(f128,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,or(X1,X2)))
| is_a_theorem(or(X1,or(not(X0),X2))) ),
inference(superposition,[],[f126,f99]) ).
fof(f129,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,or(X1,X2)))
| is_a_theorem(or(X1,implies(X0,X2))) ),
inference(forward_demodulation,[],[f128,f99]) ).
fof(f177,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(or(X2,X0),or(X2,X1)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f103,f110]) ).
fof(f184,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(or(X2,X0))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(or(X2,X1)) ),
inference(resolution,[],[f177,f110]) ).
fof(f189,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,[],[f184,f99]) ).
fof(f190,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,[],[f189,f99]) ).
fof(f201,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,or(X1,X2)))
| is_a_theorem(implies(X0,or(X2,X1))) ),
inference(resolution,[],[f105,f190]) ).
fof(f202,plain,
! [X0,X1] :
( ~ is_a_theorem(or(X0,X1))
| is_a_theorem(or(X1,X0)) ),
inference(resolution,[],[f105,f110]) ).
fof(f209,plain,
! [X2,X0,X1] : or(implies(X0,not(X1)),X2) = implies(and(X0,X1),X2),
inference(superposition,[],[f112,f111]) ).
fof(f212,plain,
! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1))),
inference(resolution,[],[f201,f106]) ).
fof(f222,plain,
! [X0,X1] : is_a_theorem(or(X0,implies(X0,X1))),
inference(resolution,[],[f212,f129]) ).
fof(f230,plain,
! [X0,X1] : is_a_theorem(or(implies(X0,X1),X0)),
inference(resolution,[],[f222,f202]) ).
fof(f273,plain,
! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)),
inference(superposition,[],[f230,f209]) ).
fof(f314,plain,
$false,
inference(resolution,[],[f273,f108]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL487+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n018.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 27 15:52:54 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/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
% 6.31/1.65 % (2543483)Detected formulas, will run a generic FOF schedule.
% 6.31/1.65 % (2543493)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4192348094:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 6.31/1.65 % (2543490)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=2260301578:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 6.31/1.65 % (2543489)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=4246924910:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 6.31/1.65 % (2543492)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2008127385:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 6.31/1.65 % (2543491)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1554097246:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 6.31/1.65 % (2543494)dis-21_1_sil=8000:lcm=predicate:random_seed=2310085222: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)
% 6.31/1.65 % (2543488)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=3899902262:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 6.31/1.65 % (2543492)Refutation not found, incomplete strategy
% 6.31/1.65 % (2543492)------------------------------
% 6.31/1.65 % (2543492)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.31/1.65 % (2543492)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.31/1.65 % (2543491)Refutation not found, incomplete strategy
% 6.31/1.65 % (2543491)------------------------------
% 6.31/1.65 % (2543491)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.31/1.65 % (2543492)CaDiCaL version: 2.1.3
% 6.31/1.65 % (2543492)Termination reason: Refutation not found, incomplete strategy
% 6.31/1.65 % (2543492)Time elapsed: 0.001 s
% 6.31/1.65 % (2543491)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.31/1.65 % (2543492)Peak memory usage: 86 MB
% 6.31/1.65 % (2543491)CaDiCaL version: 2.1.3
% 6.31/1.65 % (2543491)Termination reason: Refutation not found, incomplete strategy
% 6.31/1.65 % (2543491)Time elapsed: 0.001 s
% 6.31/1.65 % (2543491)Peak memory usage: 87 MB
% 6.31/1.65 % (2543494)Refutation not found, incomplete strategy
% 6.31/1.65 % (2543494)------------------------------
% 6.31/1.65 % (2543494)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.31/1.65 % (2543494)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.31/1.65 % (2543494)CaDiCaL version: 2.1.3
% 6.31/1.65 % (2543494)Termination reason: Refutation not found, incomplete strategy
% 6.31/1.65 % (2543494)Time elapsed: 0.001 s
% 6.31/1.65 % (2543494)Peak memory usage: 88 MB
% 6.31/1.65 % (2543494)Instructions burned: 1 (million)
% 6.31/1.65 % (2543493)Instruction limit reached!
% 6.31/1.65 % (2543493)------------------------------
% 6.31/1.65 % (2543493)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.31/1.65 % (2543493)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.31/1.65 % (2543493)CaDiCaL version: 2.1.3
% 6.31/1.65 % (2543493)Termination reason: Instruction limit
% 6.31/1.65 % (2543493)Termination phase: Saturation
% 6.31/1.65 % (2543493)Time elapsed: 0.048 s
% 6.31/1.65 % (2543493)Peak memory usage: 90 MB
% 6.31/1.65 % (2543493)Instructions burned: 141 (million)
% 6.31/1.65 % (2543502)lrs+10_1_sil=8000:sp=occurrence:random_seed=3576019563:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 6.31/1.65 % (2543502)Refutation not found, incomplete strategy
% 6.31/1.65 % (2543502)------------------------------
% 6.31/1.65 % (2543502)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.31/1.65 % (2543502)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.31/1.65 % (2543502)CaDiCaL version: 2.1.3
% 6.31/1.65 % (2543502)Termination reason: Refutation not found, incomplete strategy
% 6.31/1.65 % (2543502)Time elapsed: 0.0000 s
% 6.31/1.65 % (2543502)Peak memory usage: 87 MB
% 6.31/1.65 % (2543494)------------------------------
% 6.31/1.65 % (2543494)------------------------------
% 6.31/1.65 % (2543491)------------------------------
% 6.31/1.65 % (2543491)------------------------------
% 6.31/1.65 % (2543492)------------------------------
% 6.31/1.65 % (2543492)------------------------------
% 6.31/1.65 % (2543502)------------------------------
% 6.31/1.65 % (2543502)------------------------------
% 6.31/1.65 % (2543507)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=1412306790:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 6.31/1.65 % (2543507)Refutation not found, incomplete strategy
% 6.31/1.65 % (2543507)------------------------------
% 6.31/1.65 % (2543507)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.31/1.65 % (2543507)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.31/1.65 % (2543507)CaDiCaL version: 2.1.3
% 6.31/1.65 % (2543507)Termination reason: Refutation not found, incomplete strategy
% 6.31/1.65 % (2543507)Time elapsed: 0.0000 s
% 6.31/1.65 % (2543507)Peak memory usage: 87 MB
% 6.31/1.65 % (2543505)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2584011518:i=325:sd=1:ss=axioms:sgt=32_2996 on theBenchmark for (2996ds/325Mi)
% 6.31/1.65 % (2543505)Refutation not found, incomplete strategy
% 6.31/1.65 % (2543505)------------------------------
% 6.31/1.65 % (2543505)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.31/1.65 % (2543505)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.31/1.65 % (2543505)CaDiCaL version: 2.1.3
% 6.31/1.65 % (2543505)Termination reason: Refutation not found, incomplete strategy
% 6.31/1.65 % (2543505)Time elapsed: 0.001 s
% 6.31/1.65 % (2543505)Peak memory usage: 87 MB
% 6.31/1.65 % (2543506)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=2420940959:s2a=on:i=248:s2at=1.23:gtg=position_2996 on theBenchmark for (2996ds/248Mi)
% 6.31/1.65 % (2543504)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1970468816:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/157Mi)
% 6.31/1.65 % (2543504)Refutation not found, incomplete strategy
% 6.31/1.65 % (2543504)------------------------------
% 6.31/1.65 % (2543504)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.31/1.65 % (2543504)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.31/1.65 % (2543504)CaDiCaL version: 2.1.3
% 6.31/1.65 % (2543504)Termination reason: Refutation not found, incomplete strategy
% 6.31/1.65 % (2543504)Time elapsed: 0.001 s
% 6.31/1.65 % (2543504)Peak memory usage: 87 MB
% 6.31/1.65 % (2543507)------------------------------
% 6.31/1.65 % (2543507)------------------------------
% 6.31/1.65 % (2543506)Instruction limit reached!
% 6.31/1.65 % (2543506)------------------------------
% 6.31/1.65 % (2543506)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.31/1.65 % (2543506)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.31/1.65 % (2543506)CaDiCaL version: 2.1.3
% 6.31/1.65 % (2543506)Termination reason: Instruction limit
% 6.31/1.65 % (2543506)Termination phase: Saturation
% 6.31/1.65 % (2543506)Time elapsed: 0.160 s
% 6.31/1.65 % (2543506)Peak memory usage: 93 MB
% 6.31/1.65 % (2543506)Instructions burned: 248 (million)
% 6.31/1.65 % (2543490)Refutation not found, incomplete strategy
% 6.31/1.65 % (2543490)------------------------------
% 6.31/1.65 % (2543490)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.31/1.65 % (2543490)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.31/1.65 % (2543490)CaDiCaL version: 2.1.3
% 6.31/1.65 % (2543490)Termination reason: Refutation not found, incomplete strategy
% 6.31/1.65 % (2543490)Time elapsed: 0.563 s
% 6.31/1.65 % (2543490)Peak memory usage: 126 MB
% 6.31/1.65 % (2543490)Instructions burned: 829 (million)
% 6.31/1.65 % (2543512)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=28987745:i=2350_2993 on theBenchmark for (2993ds/2350Mi)
% 6.31/1.65 % (2543505)------------------------------
% 6.31/1.65 % (2543505)------------------------------
% 6.31/1.65 % (2543504)------------------------------
% 6.31/1.65 % (2543504)------------------------------
% 6.31/1.65 % (2543488)First to succeed.
% 6.31/1.65 % (2543488)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2543483"
% 6.31/1.65 % (2543513)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=3162172095:cts=off:i=113:fsr=off:ss=included:sgt=4_2993 on theBenchmark for (2993ds/113Mi)
% 6.31/1.65 % (2543513)Refutation not found, incomplete strategy
% 6.31/1.65 % (2543513)------------------------------
% 6.31/1.65 % (2543513)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.31/1.65 % (2543513)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.31/1.65 % (2543513)CaDiCaL version: 2.1.3
% 6.31/1.65 % (2543513)Termination reason: Refutation not found, incomplete strategy
% 6.31/1.65 % (2543513)Time elapsed: 0.001 s
% 6.31/1.65 % (2543513)Peak memory usage: 88 MB
% 6.31/1.65 % (2543515)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=535418602:i=127:av=off:fsr=off:sup=off_2992 on theBenchmark for (2992ds/127Mi)
% 6.31/1.65 % (2543516)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=2005997071:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2992 on theBenchmark for (2992ds/114Mi)
% 6.31/1.65 % (2543516)Refutation not found, incomplete strategy
% 6.31/1.65 % (2543516)------------------------------
% 6.31/1.65 % (2543516)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.31/1.65 % (2543516)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.31/1.65 % (2543516)CaDiCaL version: 2.1.3
% 6.31/1.65 % (2543516)Termination reason: Refutation not found, incomplete strategy
% 6.31/1.65 % (2543516)Time elapsed: 0.001 s
% 6.31/1.65 % (2543516)Peak memory usage: 87 MB
% 6.31/1.65 % (2543490)------------------------------
% 6.31/1.65 % (2543490)------------------------------
% 6.31/1.65 % (2543515)Instruction limit reached!
% 6.31/1.65 % (2543515)------------------------------
% 6.31/1.65 % (2543515)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.31/1.65 % (2543515)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.31/1.65 % (2543515)CaDiCaL version: 2.1.3
% 6.31/1.65 % (2543515)Termination reason: Instruction limit
% 6.31/1.65 % (2543515)Termination phase: Saturation
% 6.31/1.65 % (2543515)Time elapsed: 0.069 s
% 6.31/1.65 % (2543515)Peak memory usage: 88 MB
% 6.31/1.65 % (2543515)Instructions burned: 127 (million)
% 6.31/1.65 % (2543488)Refutation found. Thanks to Tanya!
% 6.31/1.65 % SZS status Theorem for theBenchmark
% 6.31/1.65 % SZS output start Proof for theBenchmark
% See solution above
% 7.79/1.84 % (2543488)------------------------------
% 7.79/1.84 % (2543488)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.79/1.84 % (2543488)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.79/1.84 % (2543488)CaDiCaL version: 2.1.3
% 7.79/1.84 % (2543488)Termination reason: Refutation
% 7.79/1.84 % (2543488)Time elapsed: 0.652 s
% 7.79/1.84 % (2543488)Peak memory usage: 128 MB
% 7.79/1.84 % (2543488)Instructions burned: 960 (million)
% 7.79/1.84 % (2543488)------------------------------
% 7.79/1.84 % (2543488)------------------------------
% 7.79/1.84 % (2543483)Success in time 1.049 s
% 7.79/1.84 % Vampire exiting
%------------------------------------------------------------------------------