%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL500+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:37 AM UTC 2026
% Result : Theorem 8.43s 2.62s
% Output : Refutation 12.09s
% 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/sandbox/benchmark/theBenchmark.p',modus_ponens) ).
fof(f17,axiom,
( kn2
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kn2) ).
fof(f23,axiom,
( r2
<=> ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',r2) ).
fof(f24,axiom,
( r3
<=> ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p',r5) ).
fof(f27,axiom,
( op_or
=> ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_or) ).
fof(f28,axiom,
( op_and
=> ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_and) ).
fof(f29,axiom,
( op_implies_and
=> ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_implies_and) ).
fof(f30,axiom,
( op_implies_or
=> ! [X0,X1] : implies(X0,X1) = or(not(X0),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_implies_or) ).
fof(f32,axiom,
op_implies_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_op_implies_or) ).
fof(f33,axiom,
op_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_op_and) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_modus_ponens) ).
fof(f37,axiom,
r2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_r2) ).
fof(f38,axiom,
r3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_r3) ).
fof(f39,axiom,
r4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_r4) ).
fof(f40,axiom,
r5,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_r5) ).
fof(f42,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_op_or) ).
fof(f43,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_op_implies_and) ).
fof(f45,conjecture,
kn2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_kn2) ).
fof(f46,negated_conjecture,
~ kn2,
inference(negated_conjecture,[status(cth)],[f45]) ).
fof(f47,plain,
~ kn2,
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))
=> kn2 ),
inference(unused_predicate_definition_removal,[],[f17]) ).
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,
( kn2
| ? [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,
( kn2
| ~ 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,
( kn2
| ~ 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,
~ kn2,
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 : LCL500+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 % Computer : n008.cluster.edu
% 0.13/0.41 % Model : x86_64 x86_64
% 0.13/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.41 % Memory : 8046.5625MB
% 0.13/0.41 % OS : Linux 6.8.0-71-generic
% 0.13/0.41 % CPULimit : 300
% 0.13/0.41 % WCLimit : 300
% 0.13/0.41 % DateTime : Sun Sep 27 15:54:29 UTC 2026
% 0.13/0.41 % CPUTime :
% 0.13/0.41 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.47 Running first-order theorem proving
% 0.13/0.47 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
% 8.43/2.62 % (1413819)Detected formulas, will run a generic FOF schedule.
% 8.43/2.62 % (1413835)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2103159160:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 8.43/2.62 % (1413837)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1763842725:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 8.43/2.62 % (1413835)Refutation not found, incomplete strategy
% 8.43/2.62 % (1413835)------------------------------
% 8.43/2.62 % (1413835)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.43/2.62 % (1413835)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.43/2.62 % (1413835)CaDiCaL version: 2.1.3
% 8.43/2.62 % (1413835)Termination reason: Refutation not found, incomplete strategy
% 8.43/2.62 % (1413835)Time elapsed: 0.001 s
% 8.43/2.62 % (1413835)Peak memory usage: 86 MB
% 8.43/2.62 % (1413833)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=451759525:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 8.43/2.62 % (1413832)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=939821824:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 8.43/2.62 % (1413834)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=1474589343:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 8.43/2.62 % (1413837)Instruction limit reached!
% 8.43/2.62 % (1413837)------------------------------
% 8.43/2.62 % (1413837)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.43/2.62 % (1413837)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.43/2.62 % (1413837)CaDiCaL version: 2.1.3
% 8.43/2.62 % (1413837)Termination reason: Instruction limit
% 8.43/2.62 % (1413837)Termination phase: Saturation
% 8.43/2.62 % (1413837)Time elapsed: 0.076 s
% 8.43/2.62 % (1413837)Peak memory usage: 90 MB
% 8.43/2.62 % (1413837)Instructions burned: 141 (million)
% 8.43/2.62 % (1413836)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1545875306:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 8.43/2.62 % (1413836)Refutation not found, incomplete strategy
% 8.43/2.62 % (1413836)------------------------------
% 8.43/2.62 % (1413836)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.43/2.62 % (1413836)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.43/2.62 % (1413836)CaDiCaL version: 2.1.3
% 8.43/2.62 % (1413836)Termination reason: Refutation not found, incomplete strategy
% 8.43/2.62 % (1413836)Time elapsed: 0.001 s
% 8.43/2.62 % (1413836)Peak memory usage: 86 MB
% 8.43/2.62 % (1413838)dis-21_1_sil=8000:lcm=predicate:random_seed=1450337268: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.43/2.62 % (1413838)Refutation not found, incomplete strategy
% 8.43/2.62 % (1413838)------------------------------
% 8.43/2.62 % (1413838)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.43/2.62 % (1413838)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.43/2.62 % (1413838)CaDiCaL version: 2.1.3
% 8.43/2.62 % (1413838)Termination reason: Refutation not found, incomplete strategy
% 8.43/2.62 % (1413838)Time elapsed: 0.002 s
% 8.43/2.62 % (1413838)Peak memory usage: 88 MB
% 8.43/2.62 % (1413838)Instructions burned: 1 (million)
% 8.43/2.62 % (1413848)lrs+10_1_sil=8000:sp=occurrence:random_seed=1201744761:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 8.43/2.62 % (1413848)Refutation not found, incomplete strategy
% 8.43/2.62 % (1413848)------------------------------
% 8.43/2.62 % (1413848)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.43/2.62 % (1413848)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.43/2.62 % (1413848)CaDiCaL version: 2.1.3
% 8.43/2.62 % (1413848)Termination reason: Refutation not found, incomplete strategy
% 8.43/2.62 % (1413848)Time elapsed: 0.001 s
% 8.43/2.62 % (1413848)Peak memory usage: 87 MB
% 8.43/2.62 % (1413835)------------------------------
% 8.43/2.62 % (1413835)------------------------------
% 8.43/2.62 % (1413836)------------------------------
% 8.43/2.62 % (1413836)------------------------------
% 8.43/2.62 % (1413848)------------------------------
% 8.43/2.62 % (1413848)------------------------------
% 8.43/2.62 % (1413838)------------------------------
% 8.43/2.62 % (1413838)------------------------------
% 8.43/2.62 % (1413852)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3932589959:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2994 on theBenchmark for (2994ds/157Mi)
% 8.43/2.62 % (1413852)Refutation not found, incomplete strategy
% 8.43/2.62 % (1413852)------------------------------
% 8.43/2.62 % (1413852)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.43/2.62 % (1413852)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.43/2.62 % (1413852)CaDiCaL version: 2.1.3
% 8.43/2.62 % (1413852)Termination reason: Refutation not found, incomplete strategy
% 8.43/2.62 % (1413852)Time elapsed: 0.002 s
% 8.43/2.62 % (1413852)Peak memory usage: 87 MB
% 8.43/2.62 % (1413855)lrs+1011_1_sil=32000:sp=occurrence:random_seed=1476051456:i=325:sd=1:ss=axioms:sgt=32_2993 on theBenchmark for (2993ds/325Mi)
% 8.43/2.62 % (1413855)Refutation not found, incomplete strategy
% 8.43/2.62 % (1413855)------------------------------
% 8.43/2.62 % (1413855)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.43/2.62 % (1413855)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.43/2.62 % (1413855)CaDiCaL version: 2.1.3
% 8.43/2.62 % (1413855)Termination reason: Refutation not found, incomplete strategy
% 8.43/2.62 % (1413855)Time elapsed: 0.0000 s
% 8.43/2.62 % (1413855)Peak memory usage: 87 MB
% 8.43/2.62 % (1413857)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=3470745712:s2a=on:i=248:s2at=1.23:gtg=position_2993 on theBenchmark for (2993ds/248Mi)
% 8.43/2.62 % (1413858)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=232175102:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2993 on theBenchmark for (2993ds/294Mi)
% 8.43/2.62 % (1413858)Refutation not found, incomplete strategy
% 8.43/2.62 % (1413858)------------------------------
% 8.43/2.62 % (1413858)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.43/2.62 % (1413858)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.43/2.62 % (1413858)CaDiCaL version: 2.1.3
% 8.43/2.62 % (1413858)Termination reason: Refutation not found, incomplete strategy
% 8.43/2.62 % (1413858)Time elapsed: 0.001 s
% 8.43/2.62 % (1413858)Peak memory usage: 86 MB
% 8.43/2.62 % (1413852)------------------------------
% 8.43/2.62 % (1413852)------------------------------
% 8.43/2.62 % (1413855)------------------------------
% 8.43/2.62 % (1413855)------------------------------
% 8.43/2.62 % (1413834)Refutation not found, incomplete strategy
% 8.43/2.62 % (1413834)------------------------------
% 8.43/2.62 % (1413834)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.43/2.62 % (1413834)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.43/2.62 % (1413834)CaDiCaL version: 2.1.3
% 8.43/2.62 % (1413834)Termination reason: Refutation not found, incomplete strategy
% 8.43/2.62 % (1413834)Time elapsed: 0.880 s
% 8.43/2.62 % (1413834)Peak memory usage: 127 MB
% 8.43/2.62 % (1413834)Instructions burned: 829 (million)
% 8.43/2.62 % (1413857)Instruction limit reached!
% 8.43/2.62 % (1413857)------------------------------
% 8.43/2.62 % (1413857)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.43/2.62 % (1413857)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.43/2.62 % (1413857)CaDiCaL version: 2.1.3
% 8.43/2.62 % (1413857)Termination reason: Instruction limit
% 8.43/2.62 % (1413857)Termination phase: Saturation
% 8.43/2.62 % (1413857)Time elapsed: 0.252 s
% 8.43/2.62 % (1413857)Peak memory usage: 93 MB
% 8.43/2.62 % (1413857)Instructions burned: 249 (million)
% 8.43/2.62 % (1413832)First to succeed.
% 8.43/2.62 % (1413832)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1413819"
% 8.43/2.62 % (1413864)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=2697650362:i=2350_2990 on theBenchmark for (2990ds/2350Mi)
% 8.43/2.62 % (1413865)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=547781761:cts=off:i=113:fsr=off:ss=included:sgt=4_2989 on theBenchmark for (2989ds/113Mi)
% 8.43/2.62 % (1413865)Refutation not found, incomplete strategy
% 8.43/2.62 % (1413865)------------------------------
% 8.43/2.62 % (1413865)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.43/2.62 % (1413865)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.43/2.62 % (1413865)CaDiCaL version: 2.1.3
% 8.43/2.62 % (1413865)Termination reason: Refutation not found, incomplete strategy
% 8.43/2.62 % (1413865)Time elapsed: 0.002 s
% 8.43/2.62 % (1413865)Peak memory usage: 88 MB
% 8.43/2.62 % (1413858)------------------------------
% 8.43/2.62 % (1413858)------------------------------
% 8.43/2.62 % (1413866)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=981278190:i=127:av=off:fsr=off:sup=off_2988 on theBenchmark for (2988ds/127Mi)
% 8.43/2.62 % (1413866)Instruction limit reached!
% 8.43/2.62 % (1413866)------------------------------
% 8.43/2.62 % (1413866)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.43/2.62 % (1413866)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.43/2.62 % (1413866)CaDiCaL version: 2.1.3
% 8.43/2.62 % (1413866)Termination reason: Instruction limit
% 8.43/2.62 % (1413866)Termination phase: Saturation
% 8.43/2.62 % (1413866)Time elapsed: 0.120 s
% 8.43/2.62 % (1413866)Peak memory usage: 88 MB
% 8.43/2.62 % (1413866)Instructions burned: 127 (million)
% 8.43/2.62 % (1413834)------------------------------
% 8.43/2.62 % (1413834)------------------------------
% 8.43/2.62 % (1413869)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=1167897407:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2987 on theBenchmark for (2987ds/114Mi)
% 8.43/2.62 % (1413869)Refutation not found, incomplete strategy
% 8.43/2.62 % (1413869)------------------------------
% 8.43/2.62 % (1413869)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.43/2.62 % (1413869)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.43/2.62 % (1413869)CaDiCaL version: 2.1.3
% 8.43/2.62 % (1413869)Termination reason: Refutation not found, incomplete strategy
% 8.43/2.62 % (1413869)Time elapsed: 0.001 s
% 8.43/2.62 % (1413869)Peak memory usage: 87 MB
% 8.43/2.62 % (1413832)Refutation found. Thanks to Tanya!
% 8.43/2.62 % SZS status Theorem for theBenchmark
% 8.43/2.62 % SZS output start Proof for theBenchmark
% See solution above
% 12.09/2.93 % (1413832)------------------------------
% 12.09/2.93 % (1413832)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.09/2.93 % (1413832)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.09/2.93 % (1413832)CaDiCaL version: 2.1.3
% 12.09/2.93 % (1413832)Termination reason: Refutation
% 12.09/2.93 % (1413832)Time elapsed: 0.957 s
% 12.09/2.93 % (1413832)Peak memory usage: 129 MB
% 12.09/2.93 % (1413832)Instructions burned: 960 (million)
% 12.09/2.93 % (1413832)------------------------------
% 12.09/2.93 % (1413832)------------------------------
% 12.09/2.93 % (1413819)Success in time 1.603 s
% 12.09/2.93 % Vampire exiting
%------------------------------------------------------------------------------