%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL485+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 : n010.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.68s 1.97s
% Output : Refutation 8.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 18
% Syntax : Number of formulae : 81 ( 34 unt; 0 def)
% Number of atoms : 141 ( 13 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 106 ( 46 ~; 41 |; 2 &)
% ( 6 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 12 ( 10 usr; 10 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 120 ( 118 !; 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(f5,axiom,
( implies_2
<=> ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',implies_2) ).
fof(f22,axiom,
( r1
<=> ! [X0] : is_a_theorem(implies(or(X0,X0),X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',r1) ).
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(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(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(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_modus_ponens) ).
fof(f36,axiom,
r1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_r1) ).
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(f40,axiom,
r5,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_r5) ).
fof(f42,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_or) ).
fof(f43,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_implies_and) ).
fof(f45,conjecture,
implies_2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_implies_2) ).
fof(f46,negated_conjecture,
~ implies_2,
inference(negated_conjecture,[status(cth)],[f45]) ).
fof(f47,plain,
~ implies_2,
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(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(f52,plain,
( r1
=> ! [X0] : is_a_theorem(implies(or(X0,X0),X0)) ),
inference(unused_predicate_definition_removal,[],[f22]) ).
fof(f53,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))
=> implies_2 ),
inference(unused_predicate_definition_removal,[],[f5]) ).
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,
( implies_2
| ? [X0,X1] : ~ is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ),
inference(ennf_transformation,[],[f53]) ).
fof(f60,plain,
( ! [X0] : is_a_theorem(implies(or(X0,X0),X0))
| ~ r1 ),
inference(ennf_transformation,[],[f52]) ).
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(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(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,
( implies_2
| ~ is_a_theorem(implies(implies(sK0,implies(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,
( implies_2
| ~ is_a_theorem(implies(implies(sK0,implies(sK0,sK1)),implies(sK0,sK1))) ),
inference(cnf_transformation,[],[f70]) ).
fof(f74,plain,
! [X0] :
( is_a_theorem(implies(or(X0,X0),X0))
| ~ r1 ),
inference(cnf_transformation,[],[f60]) ).
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(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(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(f87,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f88,plain,
r1,
inference(cnf_transformation,[],[f36]) ).
fof(f89,plain,
r2,
inference(cnf_transformation,[],[f37]) ).
fof(f90,plain,
r3,
inference(cnf_transformation,[],[f38]) ).
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,
~ implies_2,
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(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(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(f107,plain,
! [X0] : is_a_theorem(implies(or(X0,X0),X0)),
inference(forward_subsumption_resolution,[],[f74,f88]) ).
fof(f108,plain,
~ is_a_theorem(implies(implies(sK0,implies(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(f112,plain,
! [X0,X1] : or(X0,X1) = implies(not(X0),X1),
inference(forward_demodulation,[],[f102,f100]) ).
fof(f130,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(f165,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(or(not(X0),X2),implies(X0,X1)))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(superposition,[],[f130,f99]) ).
fof(f178,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X2),implies(X0,X1)))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(forward_demodulation,[],[f165,f99]) ).
fof(f184,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X2,X0))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(X2,X1)) ),
inference(resolution,[],[f178,f110]) ).
fof(f191,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(or(X0,X1),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(resolution,[],[f184,f106]) ).
fof(f195,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(or(X0,X1),X2))
| is_a_theorem(implies(or(X0,X3),X2))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(resolution,[],[f184,f130]) ).
fof(f200,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(or(X0,X1),X2))
| is_a_theorem(implies(or(X1,X0),X2)) ),
inference(resolution,[],[f105,f184]) ).
fof(f203,plain,
! [X0,X1] : is_a_theorem(implies(or(X1,not(X0)),implies(X0,X1))),
inference(superposition,[],[f105,f99]) ).
fof(f289,plain,
! [X0,X1] : is_a_theorem(implies(not(X0),implies(X0,X1))),
inference(resolution,[],[f191,f203]) ).
fof(f299,plain,
! [X0,X1] : is_a_theorem(or(X0,implies(X0,X1))),
inference(forward_demodulation,[],[f289,f112]) ).
fof(f488,plain,
! [X0,X1] :
( is_a_theorem(implies(or(X0,X1),X0))
| ~ is_a_theorem(implies(X1,X0)) ),
inference(resolution,[],[f195,f107]) ).
fof(f508,plain,
! [X0,X1] :
( is_a_theorem(implies(or(X0,X1),X1))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f488,f200]) ).
fof(f525,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),X1))
| ~ is_a_theorem(implies(not(X0),X1)) ),
inference(superposition,[],[f508,f99]) ).
fof(f528,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),X1))
| ~ is_a_theorem(or(X0,X1)) ),
inference(forward_demodulation,[],[f525,f112]) ).
fof(f532,plain,
~ is_a_theorem(or(sK0,implies(sK0,sK1))),
inference(resolution,[],[f528,f108]) ).
fof(f541,plain,
$false,
inference(forward_subsumption_resolution,[],[f532,f299]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL485+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.09/0.37 % Computer : n010.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sun Sep 27 15:50:31 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/0.40 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
% 6.68/1.97 % (1124492)Detected formulas, will run a generic FOF schedule.
% 6.68/1.97 % (1124498)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=582451211:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 6.68/1.97 % (1124500)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=193224754:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 6.68/1.97 % (1124502)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2724472044:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 6.68/1.97 % (1124497)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=3442127127:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 6.68/1.97 % (1124501)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=333484761:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 6.68/1.97 % (1124499)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=4041162313:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 6.68/1.97 % (1124503)dis-21_1_sil=8000:lcm=predicate:random_seed=1239575377: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.68/1.97 % (1124501)Refutation not found, incomplete strategy
% 6.68/1.97 % (1124501)------------------------------
% 6.68/1.97 % (1124501)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.68/1.97 % (1124501)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.68/1.97 % (1124500)Refutation not found, incomplete strategy
% 6.68/1.97 % (1124500)------------------------------
% 6.68/1.97 % (1124500)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.68/1.97 % (1124501)CaDiCaL version: 2.1.3
% 6.68/1.97 % (1124500)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.68/1.97 % (1124501)Termination reason: Refutation not found, incomplete strategy
% 6.68/1.97 % (1124501)Time elapsed: 0.001 s
% 6.68/1.97 % (1124501)Peak memory usage: 86 MB
% 6.68/1.97 % (1124500)CaDiCaL version: 2.1.3
% 6.68/1.97 % (1124500)Termination reason: Refutation not found, incomplete strategy
% 6.68/1.97 % (1124500)Time elapsed: 0.001 s
% 6.68/1.97 % (1124500)Peak memory usage: 87 MB
% 6.68/1.97 % (1124503)Refutation not found, incomplete strategy
% 6.68/1.97 % (1124503)------------------------------
% 6.68/1.97 % (1124503)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.68/1.97 % (1124503)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.68/1.97 % (1124503)CaDiCaL version: 2.1.3
% 6.68/1.97 % (1124503)Termination reason: Refutation not found, incomplete strategy
% 6.68/1.97 % (1124503)Time elapsed: 0.001 s
% 6.68/1.97 % (1124503)Peak memory usage: 88 MB
% 6.68/1.97 % (1124503)Instructions burned: 1 (million)
% 6.68/1.97 % (1124502)Instruction limit reached!
% 6.68/1.97 % (1124502)------------------------------
% 6.68/1.97 % (1124502)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.68/1.97 % (1124502)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.68/1.97 % (1124502)CaDiCaL version: 2.1.3
% 6.68/1.97 % (1124502)Termination reason: Instruction limit
% 6.68/1.97 % (1124502)Termination phase: Saturation
% 6.68/1.97 % (1124502)Time elapsed: 0.091 s
% 6.68/1.97 % (1124502)Peak memory usage: 90 MB
% 6.68/1.97 % (1124502)Instructions burned: 140 (million)
% 6.68/1.97 % (1124503)------------------------------
% 6.68/1.97 % (1124503)------------------------------
% 6.68/1.97 % (1124501)------------------------------
% 6.68/1.97 % (1124501)------------------------------
% 6.68/1.97 % (1124500)------------------------------
% 6.68/1.97 % (1124500)------------------------------
% 6.68/1.97 % (1124511)lrs+10_1_sil=8000:sp=occurrence:random_seed=2055691266:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 6.68/1.97 % (1124511)Refutation not found, incomplete strategy
% 6.68/1.97 % (1124511)------------------------------
% 6.68/1.97 % (1124511)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.68/1.97 % (1124511)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.68/1.97 % (1124511)CaDiCaL version: 2.1.3
% 6.68/1.97 % (1124511)Termination reason: Refutation not found, incomplete strategy
% 6.68/1.97 % (1124511)Time elapsed: 0.001 s
% 6.68/1.97 % (1124511)Peak memory usage: 87 MB
% 6.68/1.97 % (1124514)lrs+1011_1_sil=32000:sp=occurrence:random_seed=4024752894:i=325:sd=1:ss=axioms:sgt=32_2995 on theBenchmark for (2995ds/325Mi)
% 6.68/1.97 % (1124515)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=2201872409:s2a=on:i=248:s2at=1.23:gtg=position_2995 on theBenchmark for (2995ds/248Mi)
% 6.68/1.97 % (1124513)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2477057517:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2995 on theBenchmark for (2995ds/157Mi)
% 6.68/1.97 % (1124514)Refutation not found, incomplete strategy
% 6.68/1.97 % (1124514)------------------------------
% 6.68/1.97 % (1124514)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.68/1.97 % (1124514)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.68/1.97 % (1124514)CaDiCaL version: 2.1.3
% 6.68/1.97 % (1124514)Termination reason: Refutation not found, incomplete strategy
% 6.68/1.97 % (1124514)Time elapsed: 0.001 s
% 6.68/1.97 % (1124514)Peak memory usage: 87 MB
% 6.68/1.97 % (1124513)Refutation not found, incomplete strategy
% 6.68/1.97 % (1124513)------------------------------
% 6.68/1.97 % (1124513)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.68/1.97 % (1124513)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.68/1.97 % (1124513)CaDiCaL version: 2.1.3
% 6.68/1.97 % (1124513)Termination reason: Refutation not found, incomplete strategy
% 6.68/1.97 % (1124513)Time elapsed: 0.001 s
% 6.68/1.97 % (1124513)Peak memory usage: 87 MB
% 6.68/1.97 % (1124511)------------------------------
% 6.68/1.97 % (1124511)------------------------------
% 6.68/1.97 % (1124499)Refutation not found, incomplete strategy
% 6.68/1.97 % (1124499)------------------------------
% 6.68/1.97 % (1124499)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.68/1.97 % (1124499)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.68/1.97 % (1124499)CaDiCaL version: 2.1.3
% 6.68/1.97 % (1124499)Termination reason: Refutation not found, incomplete strategy
% 6.68/1.97 % (1124499)Time elapsed: 0.554 s
% 6.68/1.97 % (1124499)Peak memory usage: 126 MB
% 6.68/1.97 % (1124499)Instructions burned: 825 (million)
% 6.68/1.97 % (1124515)Instruction limit reached!
% 6.68/1.97 % (1124515)------------------------------
% 6.68/1.97 % (1124515)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.68/1.97 % (1124515)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.68/1.97 % (1124515)CaDiCaL version: 2.1.3
% 6.68/1.97 % (1124515)Termination reason: Instruction limit
% 6.68/1.97 % (1124515)Termination phase: Saturation
% 6.68/1.97 % (1124515)Time elapsed: 0.155 s
% 6.68/1.97 % (1124515)Peak memory usage: 93 MB
% 6.68/1.97 % (1124515)Instructions burned: 248 (million)
% 6.68/1.97 % (1124514)------------------------------
% 6.68/1.97 % (1124514)------------------------------
% 6.68/1.97 % (1124513)------------------------------
% 6.68/1.97 % (1124513)------------------------------
% 6.68/1.97 % (1124519)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=2638960819:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2993 on theBenchmark for (2993ds/294Mi)
% 6.68/1.97 % (1124519)Refutation not found, incomplete strategy
% 6.68/1.97 % (1124519)------------------------------
% 6.68/1.97 % (1124519)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.68/1.97 % (1124519)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.68/1.97 % (1124519)CaDiCaL version: 2.1.3
% 6.68/1.97 % (1124519)Termination reason: Refutation not found, incomplete strategy
% 6.68/1.97 % (1124519)Time elapsed: 0.001 s
% 6.68/1.97 % (1124519)Peak memory usage: 87 MB
% 6.68/1.97 % (1124497)First to succeed.
% 6.68/1.97 % (1124497)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1124492"
% 6.68/1.97 % (1124520)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=1760471329:i=2350_2992 on theBenchmark for (2992ds/2350Mi)
% 6.68/1.97 % (1124499)------------------------------
% 6.68/1.97 % (1124499)------------------------------
% 6.68/1.97 % (1124522)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=3400464695:cts=off:i=113:fsr=off:ss=included:sgt=4_2991 on theBenchmark for (2991ds/113Mi)
% 6.68/1.97 % (1124523)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=2467374525:i=127:av=off:fsr=off:sup=off_2991 on theBenchmark for (2991ds/127Mi)
% 6.68/1.97 % (1124522)Refutation not found, incomplete strategy
% 6.68/1.97 % (1124522)------------------------------
% 6.68/1.97 % (1124522)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.68/1.97 % (1124522)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.68/1.97 % (1124522)CaDiCaL version: 2.1.3
% 6.68/1.97 % (1124522)Termination reason: Refutation not found, incomplete strategy
% 6.68/1.97 % (1124522)Time elapsed: 0.001 s
% 6.68/1.97 % (1124522)Peak memory usage: 87 MB
% 6.68/1.97 % (1124523)Instruction limit reached!
% 6.68/1.97 % (1124523)------------------------------
% 6.68/1.97 % (1124523)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.68/1.97 % (1124523)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.68/1.97 % (1124523)CaDiCaL version: 2.1.3
% 6.68/1.97 % (1124523)Termination reason: Instruction limit
% 6.68/1.97 % (1124523)Termination phase: Saturation
% 6.68/1.97 % (1124523)Time elapsed: 0.067 s
% 6.68/1.97 % (1124523)Peak memory usage: 88 MB
% 6.68/1.97 % (1124523)Instructions burned: 127 (million)
% 6.68/1.97 % (1124519)------------------------------
% 6.68/1.97 % (1124519)------------------------------
% 6.68/1.97 % (1124497)Refutation found. Thanks to Tanya!
% 6.68/1.97 % SZS status Theorem for theBenchmark
% 6.68/1.97 % SZS output start Proof for theBenchmark
% See solution above
% 8.52/2.17 % (1124497)------------------------------
% 8.52/2.17 % (1124497)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.52/2.17 % (1124497)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.52/2.17 % (1124497)CaDiCaL version: 2.1.3
% 8.52/2.17 % (1124497)Termination reason: Refutation
% 8.52/2.17 % (1124497)Time elapsed: 0.683 s
% 8.52/2.17 % (1124497)Peak memory usage: 128 MB
% 8.52/2.17 % (1124497)Instructions burned: 1015 (million)
% 8.52/2.17 % (1124497)------------------------------
% 8.52/2.17 % (1124497)------------------------------
% 8.52/2.17 % (1124492)Success in time 1.123 s
% 8.52/2.17 % Vampire exiting
%------------------------------------------------------------------------------