%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL497+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 : 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 11:52:37 AM UTC 2026
% Result : Theorem 4.96s 1.66s
% Output : Refutation 6.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 14
% Syntax : Number of formulae : 64 ( 26 unt; 0 def)
% Number of atoms : 116 ( 4 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 91 ( 39 ~; 35 |; 2 &)
% ( 6 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 10 ( 8 usr; 8 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 106 ( 104 !; 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(f20,axiom,
( cn2
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn2) ).
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(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(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(f45,conjecture,
cn2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',luka_cn2) ).
fof(f46,negated_conjecture,
~ cn2,
inference(negated_conjecture,[status(cth)],[f45]) ).
fof(f47,plain,
~ cn2,
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(X0,implies(not(X0),X1)))
=> cn2 ),
inference(unused_predicate_definition_removal,[],[f20]) ).
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(f58,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f55]) ).
fof(f59,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(flattening,[],[f58]) ).
fof(f61,plain,
( cn2
| ? [X0,X1] : ~ is_a_theorem(implies(X0,implies(not(X0),X1))) ),
inference(ennf_transformation,[],[f53]) ).
fof(f63,plain,
( ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1)))
| ~ r2 ),
inference(ennf_transformation,[],[f51]) ).
fof(f64,plain,
( ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0)))
| ~ r3 ),
inference(ennf_transformation,[],[f50]) ).
fof(f65,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2))))
| ~ r4 ),
inference(ennf_transformation,[],[f49]) ).
fof(f66,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2))))
| ~ r5 ),
inference(ennf_transformation,[],[f48]) ).
fof(f69,plain,
( ! [X0,X1] : implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(ennf_transformation,[],[f30]) ).
fof(f71,plain,
( cn2
| ~ is_a_theorem(implies(sK0,implies(not(sK0),sK1))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f61]) ).
fof(f72,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1))
| ~ modus_ponens ),
inference(cnf_transformation,[],[f59]) ).
fof(f74,plain,
( cn2
| ~ is_a_theorem(implies(sK0,implies(not(sK0),sK1))) ),
inference(cnf_transformation,[],[f71]) ).
fof(f76,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,or(X0,X1)))
| ~ r2 ),
inference(cnf_transformation,[],[f63]) ).
fof(f77,plain,
! [X0,X1] :
( is_a_theorem(implies(or(X0,X1),or(X1,X0)))
| ~ r3 ),
inference(cnf_transformation,[],[f64]) ).
fof(f78,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2))))
| ~ r4 ),
inference(cnf_transformation,[],[f65]) ).
fof(f79,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2))))
| ~ r5 ),
inference(cnf_transformation,[],[f66]) ).
fof(f82,plain,
! [X0,X1] :
( implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(cnf_transformation,[],[f69]) ).
fof(f84,plain,
op_implies_or,
inference(cnf_transformation,[],[f32]) ).
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(f96,plain,
~ cn2,
inference(cnf_transformation,[],[f47]) ).
fof(f98,plain,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
inference(forward_subsumption_resolution,[],[f82,f84]) ).
fof(f101,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))),
inference(forward_subsumption_resolution,[],[f79,f92]) ).
fof(f102,plain,
! [X2,X0,X1] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(forward_subsumption_resolution,[],[f78,f91]) ).
fof(f103,plain,
! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0))),
inference(forward_subsumption_resolution,[],[f77,f90]) ).
fof(f104,plain,
! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))),
inference(forward_subsumption_resolution,[],[f76,f89]) ).
fof(f106,plain,
~ is_a_theorem(implies(sK0,implies(not(sK0),sK1))),
inference(forward_subsumption_resolution,[],[f74,f96]) ).
fof(f108,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(forward_subsumption_resolution,[],[f72,f87]) ).
fof(f128,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(or(X2,X0),or(X2,X1)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f108,f101]) ).
fof(f129,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(or(X0,or(X1,X2)))
| is_a_theorem(or(X1,or(X0,X2))) ),
inference(resolution,[],[f108,f102]) ).
fof(f131,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,or(X1,X2)))
| is_a_theorem(or(X1,or(not(X0),X2))) ),
inference(superposition,[],[f129,f98]) ).
fof(f132,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,or(X1,X2)))
| is_a_theorem(or(X1,implies(X0,X2))) ),
inference(forward_demodulation,[],[f131,f98]) ).
fof(f150,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(or(X2,X0))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(or(X2,X1)) ),
inference(resolution,[],[f128,f108]) ).
fof(f167,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,[],[f150,f98]) ).
fof(f168,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,[],[f167,f98]) ).
fof(f175,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,or(X1,X2)))
| is_a_theorem(implies(X0,or(X2,X1))) ),
inference(resolution,[],[f168,f103]) ).
fof(f176,plain,
! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1))),
inference(resolution,[],[f175,f104]) ).
fof(f182,plain,
! [X0,X1] : is_a_theorem(or(X0,implies(X0,X1))),
inference(resolution,[],[f176,f132]) ).
fof(f188,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))),
inference(superposition,[],[f182,f98]) ).
fof(f189,plain,
$false,
inference(resolution,[],[f188,f106]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL497+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.12/0.39 % Computer : n009.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:51:16 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.43 Running first-order theorem proving
% 0.12/0.43 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
% 4.96/1.66 % (2208086)Detected formulas, will run a generic FOF schedule.
% 4.96/1.66 % (2208091)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=3401912585:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.96/1.66 % (2208097)dis-21_1_sil=8000:lcm=predicate:random_seed=2516280587: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)
% 4.96/1.66 % (2208095)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2166316282:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.96/1.66 % (2208094)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3141508240:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.96/1.66 % (2208093)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=1444236406:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.96/1.66 % (2208092)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=430291818:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.96/1.66 % (2208095)Refutation not found, incomplete strategy
% 4.96/1.66 % (2208095)------------------------------
% 4.96/1.66 % (2208095)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.96/1.66 % (2208095)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.96/1.66 % (2208094)Refutation not found, incomplete strategy
% 4.96/1.66 % (2208094)------------------------------
% 4.96/1.66 % (2208094)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.96/1.66 % (2208095)CaDiCaL version: 2.1.3
% 4.96/1.66 % (2208095)Termination reason: Refutation not found, incomplete strategy
% 4.96/1.66 % (2208095)Time elapsed: 0.001 s
% 4.96/1.66 % (2208094)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.96/1.66 % (2208094)CaDiCaL version: 2.1.3
% 4.96/1.66 % (2208094)Termination reason: Refutation not found, incomplete strategy
% 4.96/1.66 % (2208094)Time elapsed: 0.001 s
% 4.96/1.66 % (2208094)Peak memory usage: 86 MB
% 4.96/1.66 % (2208095)Peak memory usage: 86 MB
% 4.96/1.66 % (2208096)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3780524260:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.96/1.66 % (2208097)Refutation not found, incomplete strategy
% 4.96/1.66 % (2208097)------------------------------
% 4.96/1.66 % (2208097)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.96/1.66 % (2208097)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.96/1.66 % (2208097)CaDiCaL version: 2.1.3
% 4.96/1.66 % (2208097)Termination reason: Refutation not found, incomplete strategy
% 4.96/1.66 % (2208097)Time elapsed: 0.001 s
% 4.96/1.66 % (2208097)Peak memory usage: 88 MB
% 4.96/1.66 % (2208096)Instruction limit reached!
% 4.96/1.66 % (2208096)------------------------------
% 4.96/1.66 % (2208096)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.96/1.66 % (2208096)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.96/1.66 % (2208096)CaDiCaL version: 2.1.3
% 4.96/1.66 % (2208096)Termination reason: Instruction limit
% 4.96/1.66 % (2208096)Termination phase: Saturation
% 4.96/1.66 % (2208096)Time elapsed: 0.087 s
% 4.96/1.66 % (2208096)Peak memory usage: 90 MB
% 4.96/1.66 % (2208096)Instructions burned: 140 (million)
% 4.96/1.66 % (2208105)lrs+10_1_sil=8000:sp=occurrence:random_seed=3850338367:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 4.96/1.66 % (2208097)------------------------------
% 4.96/1.66 % (2208097)------------------------------
% 4.96/1.66 % (2208095)------------------------------
% 4.96/1.66 % (2208095)------------------------------
% 4.96/1.66 % (2208094)------------------------------
% 4.96/1.66 % (2208094)------------------------------
% 4.96/1.66 % (2208108)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3042220753:i=325:sd=1:ss=axioms:sgt=32_2996 on theBenchmark for (2996ds/325Mi)
% 4.96/1.66 % (2208108)Refutation not found, incomplete strategy
% 4.96/1.66 % (2208108)------------------------------
% 4.96/1.66 % (2208108)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.96/1.66 % (2208108)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.96/1.66 % (2208108)CaDiCaL version: 2.1.3
% 4.96/1.66 % (2208108)Termination reason: Refutation not found, incomplete strategy
% 4.96/1.66 % (2208108)Time elapsed: 0.0000 s
% 4.96/1.66 % (2208108)Peak memory usage: 87 MB
% 4.96/1.66 % (2208091)First to succeed.
% 4.96/1.66 % (2208091)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2208086"
% 4.96/1.66 % (2208107)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1266325043:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/157Mi)
% 4.96/1.66 % (2208109)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=2511974693:s2a=on:i=248:s2at=1.23:gtg=position_2996 on theBenchmark for (2996ds/248Mi)
% 4.96/1.66 % (2208107)Refutation not found, incomplete strategy
% 4.96/1.66 % (2208107)------------------------------
% 4.96/1.66 % (2208107)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.96/1.66 % (2208107)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.96/1.66 % (2208107)CaDiCaL version: 2.1.3
% 4.96/1.66 % (2208107)Termination reason: Refutation not found, incomplete strategy
% 4.96/1.66 % (2208107)Time elapsed: 0.001 s
% 4.96/1.66 % (2208107)Peak memory usage: 87 MB
% 4.96/1.66 % (2208105)Instruction limit reached!
% 4.96/1.66 % (2208105)------------------------------
% 4.96/1.66 % (2208105)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.96/1.66 % (2208105)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.96/1.66 % (2208105)CaDiCaL version: 2.1.3
% 4.96/1.66 % (2208105)Termination reason: Instruction limit
% 4.96/1.66 % (2208105)Termination phase: Saturation
% 4.96/1.66 % (2208105)Time elapsed: 0.164 s
% 4.96/1.66 % (2208105)Peak memory usage: 92 MB
% 4.96/1.66 % (2208105)Instructions burned: 286 (million)
% 4.96/1.66 % (2208108)------------------------------
% 4.96/1.66 % (2208108)------------------------------
% 4.96/1.66 % (2208109)Instruction limit reached!
% 4.96/1.66 % (2208109)------------------------------
% 4.96/1.66 % (2208109)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.96/1.66 % (2208109)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.96/1.66 % (2208109)CaDiCaL version: 2.1.3
% 4.96/1.66 % (2208109)Termination reason: Instruction limit
% 4.96/1.66 % (2208109)Termination phase: Saturation
% 4.96/1.66 % (2208109)Time elapsed: 0.145 s
% 4.96/1.66 % (2208109)Peak memory usage: 92 MB
% 4.96/1.66 % (2208109)Instructions burned: 248 (million)
% 4.96/1.66 % (2208113)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=806515161:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2994 on theBenchmark for (2994ds/294Mi)
% 4.96/1.66 % (2208113)Refutation not found, incomplete strategy
% 4.96/1.66 % (2208113)------------------------------
% 4.96/1.66 % (2208113)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.96/1.66 % (2208113)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.96/1.66 % (2208113)CaDiCaL version: 2.1.3
% 4.96/1.66 % (2208113)Termination reason: Refutation not found, incomplete strategy
% 4.96/1.66 % (2208113)Time elapsed: 0.001 s
% 4.96/1.66 % (2208113)Peak memory usage: 86 MB
% 4.96/1.66 % (2208093)Refutation not found, incomplete strategy
% 4.96/1.66 % (2208093)------------------------------
% 4.96/1.66 % (2208093)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.96/1.66 % (2208093)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.96/1.66 % (2208093)CaDiCaL version: 2.1.3
% 4.96/1.66 % (2208093)Termination reason: Refutation not found, incomplete strategy
% 4.96/1.66 % (2208093)Time elapsed: 0.562 s
% 4.96/1.66 % (2208093)Peak memory usage: 126 MB
% 4.96/1.66 % (2208093)Instructions burned: 829 (million)
% 4.96/1.66 % (2208114)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=3679645008:i=2350_2993 on theBenchmark for (2993ds/2350Mi)
% 4.96/1.66 % (2208107)------------------------------
% 4.96/1.66 % (2208107)------------------------------
% 4.96/1.66 % (2208091)Refutation found. Thanks to Tanya!
% 4.96/1.66 % SZS status Theorem for theBenchmark
% 4.96/1.66 % SZS output start Proof for theBenchmark
% See solution above
% 6.14/1.85 % (2208091)------------------------------
% 6.14/1.85 % (2208091)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.14/1.85 % (2208091)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.14/1.85 % (2208091)CaDiCaL version: 2.1.3
% 6.14/1.85 % (2208091)Termination reason: Refutation
% 6.14/1.85 % (2208091)Time elapsed: 0.399 s
% 6.14/1.85 % (2208091)Peak memory usage: 128 MB
% 6.14/1.85 % (2208091)Instructions burned: 933 (million)
% 6.14/1.85 % (2208091)------------------------------
% 6.14/1.85 % (2208091)------------------------------
% 6.14/1.85 % (2208086)Success in time 0.791 s
% 6.14/1.85 % Vampire exiting
%------------------------------------------------------------------------------