%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL228-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n015.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:51:40 AM UTC 2026
% Result : Unsatisfiable 10.39s 2.54s
% Output : Refutation 11.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 19
% Syntax : Number of formulae : 123 ( 81 unt; 10 def)
% Number of atoms : 176 ( 21 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 112 ( 59 ~; 53 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 14 con; 0-2 aty)
% Number of variables : 142 ( 142 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_2) ).
fof(f2,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_3) ).
fof(f3,axiom,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_4) ).
fof(f4,axiom,
! [X2,X0,X1] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_5) ).
fof(f5,axiom,
! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_6) ).
fof(f6,axiom,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',implies_definition) ).
fof(f7,axiom,
! [X0] :
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).
fof(f8,axiom,
! [X0,X1] :
( theorem(X0)
| ~ theorem(implies(X1,X0))
| ~ theorem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_2) ).
fof(f9,negated_conjecture,
~ theorem(implies(or(or(p,q),r),implies(or(or(p,not(r)),s),or(or(p,q),s)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f10,plain,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f1,f6]) ).
fof(f11,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f2,f6]) ).
fof(f12,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f3,f6]) ).
fof(f13,plain,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f4,f6]) ).
fof(f14,plain,
! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(definition_unfolding,[],[f5,f6,f6,f6]) ).
fof(f15,plain,
! [X0,X1] :
( ~ theorem(or(not(X1),X0))
| theorem(X0)
| ~ theorem(X1) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f16,plain,
~ theorem(or(not(or(or(p,q),r)),or(not(or(or(p,not(r)),s)),or(or(p,q),s)))),
inference(definition_unfolding,[],[f9,f6,f6]) ).
fof(f17,definition,
sF0 = or(p,q),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f18,plain,
or(p,q) = sF0,
inference(reorient_equations,[],[f17]) ).
fof(f19,definition,
sF1 = or(sF0,r),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f20,plain,
or(sF0,r) = sF1,
inference(reorient_equations,[],[f19]) ).
fof(f21,definition,
sF2 = not(sF1),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f22,plain,
not(sF1) = sF2,
inference(reorient_equations,[],[f21]) ).
fof(f23,definition,
sF3 = not(r),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f24,plain,
not(r) = sF3,
inference(reorient_equations,[],[f23]) ).
fof(f25,definition,
sF4 = or(p,sF3),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f26,plain,
or(p,sF3) = sF4,
inference(reorient_equations,[],[f25]) ).
fof(f27,definition,
sF5 = or(sF4,s),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f28,plain,
or(sF4,s) = sF5,
inference(reorient_equations,[],[f27]) ).
fof(f29,definition,
sF6 = not(sF5),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f30,plain,
not(sF5) = sF6,
inference(reorient_equations,[],[f29]) ).
fof(f31,definition,
sF7 = or(sF0,s),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
fof(f32,plain,
or(sF0,s) = sF7,
inference(reorient_equations,[],[f31]) ).
fof(f33,definition,
sF8 = or(sF6,sF7),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
fof(f34,plain,
or(sF6,sF7) = sF8,
inference(reorient_equations,[],[f33]) ).
fof(f35,definition,
sF9 = or(sF2,sF8),
introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).
fof(f36,plain,
or(sF2,sF8) = sF9,
inference(reorient_equations,[],[f35]) ).
fof(f37,plain,
~ theorem(sF9),
inference(definition_folding,[],[f16,f36,f34,f32,f18,f30,f28,f26,f24,f22,f20,f18]) ).
fof(f40,plain,
! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(resolution,[],[f7,f14]) ).
fof(f53,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(or(not(X1),X2)) ),
inference(resolution,[],[f15,f40]) ).
fof(f93,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[],[f13,f7]) ).
fof(f104,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f93,f15]) ).
fof(f113,plain,
! [X0] : theorem(or(not(or(sF2,or(X0,sF8))),or(X0,sF9))),
inference(superposition,[],[f93,f36]) ).
fof(f114,plain,
! [X0] : theorem(or(not(or(sF6,or(X0,sF7))),or(X0,sF8))),
inference(superposition,[],[f93,f34]) ).
fof(f115,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,X1)),or(not(or(not(X1),X2)),or(X0,X2)))),
inference(resolution,[],[f104,f40]) ).
fof(f146,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f11,f7]) ).
fof(f165,plain,
theorem(or(not(s),sF7)),
inference(superposition,[],[f146,f32]) ).
fof(f171,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[],[f12,f7]) ).
fof(f188,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f171,f15]) ).
fof(f189,plain,
! [X0,X1] : theorem(or(X0,or(not(or(X1,X0)),X1))),
inference(resolution,[],[f171,f104]) ).
fof(f191,plain,
theorem(or(not(sF4),or(sF3,p))),
inference(superposition,[],[f171,f26]) ).
fof(f193,plain,
theorem(or(not(sF1),or(r,sF0))),
inference(superposition,[],[f171,f20]) ).
fof(f195,plain,
theorem(or(not(sF5),or(s,sF4))),
inference(superposition,[],[f171,f28]) ).
fof(f204,plain,
theorem(or(sF6,or(s,sF4))),
inference(forward_demodulation,[],[f195,f30]) ).
fof(f205,plain,
theorem(or(sF2,or(r,sF0))),
inference(forward_demodulation,[],[f193,f22]) ).
fof(f253,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f53,f15]) ).
fof(f274,plain,
! [X2,X3,X0,X1] :
( ~ theorem(or(X0,or(X2,or(X1,X3))))
| theorem(or(X0,or(X1,or(X2,X3)))) ),
inference(resolution,[],[f253,f93]) ).
fof(f275,plain,
! [X2,X0,X1] :
( ~ theorem(or(X0,or(X2,X1)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f253,f171]) ).
fof(f276,plain,
! [X2,X3,X0,X1] :
( ~ theorem(or(X0,or(X1,X3)))
| theorem(or(X0,or(X1,X2)))
| ~ theorem(or(not(X3),X2)) ),
inference(resolution,[],[f253,f53]) ).
fof(f277,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X0,X2)) ),
inference(resolution,[],[f253,f146]) ).
fof(f285,plain,
! [X0,X1] : theorem(or(not(X0),or(X0,X1))),
inference(resolution,[],[f275,f146]) ).
fof(f293,plain,
! [X0] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[],[f10,f7]) ).
fof(f294,plain,
! [X0,X1] :
( ~ theorem(or(X0,or(X1,X1)))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f293,f253]) ).
fof(f302,plain,
! [X0] : theorem(or(not(X0),X0)),
inference(resolution,[],[f294,f146]) ).
fof(f305,plain,
! [X0] :
( ~ theorem(or(sF2,or(X0,sF8)))
| theorem(or(X0,sF9)) ),
inference(resolution,[],[f113,f15]) ).
fof(f311,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X1,X2)))
| ~ theorem(or(not(X0),X2)) ),
inference(resolution,[],[f276,f171]) ).
fof(f314,plain,
! [X2,X3,X0,X1] :
( theorem(or(not(or(X0,or(X1,X2))),or(X1,X3)))
| ~ theorem(or(not(or(X0,X2)),X3)) ),
inference(resolution,[],[f276,f93]) ).
fof(f339,plain,
! [X2,X0,X1] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f277,f275]) ).
fof(f349,plain,
! [X0] :
( ~ theorem(or(X0,sF7))
| theorem(or(X0,sF8)) ),
inference(superposition,[],[f277,f34]) ).
fof(f351,plain,
! [X2,X0,X1] :
( theorem(or(not(or(not(X0),X1)),or(X2,X1)))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f115,f15]) ).
fof(f382,plain,
! [X0] : theorem(or(X0,not(X0))),
inference(resolution,[],[f302,f188]) ).
fof(f387,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X0,X2)) ),
inference(resolution,[],[f311,f15]) ).
fof(f389,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X2)),or(X1,X2)))
| ~ theorem(or(not(X0),X1)) ),
inference(resolution,[],[f311,f275]) ).
fof(f391,plain,
! [X0,X1] :
( theorem(or(not(or(X0,X1)),X1))
| ~ theorem(or(not(X0),X1)) ),
inference(resolution,[],[f311,f294]) ).
fof(f412,plain,
! [X2,X0,X1] : theorem(or(not(or(or(X0,X1),X2)),or(X0,or(X2,X1)))),
inference(resolution,[],[f274,f171]) ).
fof(f426,plain,
! [X2,X3,X0,X1] :
( ~ theorem(or(X2,or(not(X1),X3)))
| theorem(or(X2,or(X0,X3)))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f351,f253]) ).
fof(f455,plain,
theorem(or(not(p),sF0)),
inference(superposition,[],[f285,f18]) ).
fof(f457,plain,
theorem(or(not(sF0),sF7)),
inference(superposition,[],[f285,f32]) ).
fof(f473,plain,
! [X0] :
( ~ theorem(or(sF2,X0))
| theorem(or(X0,sF9)) ),
inference(resolution,[],[f339,f305]) ).
fof(f476,plain,
! [X0] :
( ~ theorem(or(X0,sF0))
| theorem(or(X0,sF7)) ),
inference(superposition,[],[f339,f32]) ).
fof(f528,plain,
! [X2,X3,X0,X1] :
( ~ theorem(or(not(or(X0,X1)),X2))
| theorem(or(X3,X2))
| ~ theorem(or(X0,or(X3,X1))) ),
inference(resolution,[],[f314,f15]) ).
fof(f560,plain,
! [X2,X0,X1] :
( ~ theorem(or(X2,or(X0,X1)))
| theorem(or(X2,X1))
| ~ theorem(or(not(X0),X1)) ),
inference(resolution,[],[f391,f253]) ).
fof(f650,plain,
theorem(or(not(or(sF6,or(sF2,sF7))),sF9)),
inference(superposition,[],[f114,f36]) ).
fof(f681,plain,
! [X2,X0,X1] :
( ~ theorem(or(X2,or(X0,X1)))
| theorem(or(X0,X1))
| ~ theorem(or(not(X2),X1)) ),
inference(resolution,[],[f528,f391]) ).
fof(f818,plain,
! [X0] :
( ~ theorem(or(X0,sF9))
| theorem(sF9)
| ~ theorem(or(not(X0),sF8)) ),
inference(superposition,[],[f681,f36]) ).
fof(f823,plain,
! [X0] :
( ~ theorem(or(not(X0),sF8))
| ~ theorem(or(X0,sF9)) ),
inference(forward_subsumption_resolution,[],[f818,f37]) ).
fof(f909,plain,
theorem(or(or(r,sF0),sF9)),
inference(resolution,[],[f473,f205]) ).
fof(f930,plain,
theorem(or(not(p),sF7)),
inference(resolution,[],[f455,f476]) ).
fof(f947,plain,
! [X0] :
( ~ theorem(or(X0,or(sF6,or(sF2,sF7))))
| theorem(or(X0,sF9)) ),
inference(resolution,[],[f650,f253]) ).
fof(f953,plain,
! [X0] :
( ~ theorem(or(X0,or(sF2,sF7)))
| theorem(or(X0,sF9)) ),
inference(resolution,[],[f947,f277]) ).
fof(f961,plain,
theorem(or(not(sF6),sF9)),
inference(resolution,[],[f947,f285]) ).
fof(f970,plain,
! [X0] :
( ~ theorem(or(sF6,X0))
| theorem(or(X0,sF9)) ),
inference(resolution,[],[f961,f387]) ).
fof(f975,plain,
theorem(or(or(s,sF4),sF9)),
inference(resolution,[],[f970,f204]) ).
fof(f982,plain,
! [X0] :
( ~ theorem(or(X0,sF7))
| theorem(or(X0,sF9)) ),
inference(resolution,[],[f953,f277]) ).
fof(f1044,plain,
theorem(or(not(sF0),sF9)),
inference(resolution,[],[f457,f982]) ).
fof(f1046,plain,
! [X0] :
( ~ theorem(or(sF0,X0))
| theorem(or(X0,sF9)) ),
inference(resolution,[],[f1044,f387]) ).
fof(f1118,plain,
theorem(or(not(s),sF9)),
inference(resolution,[],[f165,f982]) ).
fof(f1121,plain,
! [X0] :
( ~ theorem(or(s,X0))
| theorem(or(X0,sF9)) ),
inference(resolution,[],[f1118,f387]) ).
fof(f1431,plain,
! [X2,X0,X1] :
( ~ theorem(or(or(X0,X2),X1))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f412,f15]) ).
fof(f1456,plain,
theorem(or(not(p),sF8)),
inference(resolution,[],[f349,f930]) ).
fof(f1470,plain,
~ theorem(or(p,sF9)),
inference(resolution,[],[f1456,f823]) ).
fof(f2234,plain,
theorem(or(s,or(sF9,sF4))),
inference(resolution,[],[f1431,f975]) ).
fof(f2235,plain,
theorem(or(r,or(sF9,sF0))),
inference(resolution,[],[f1431,f909]) ).
fof(f2256,plain,
theorem(or(s,or(sF4,sF9))),
inference(resolution,[],[f2234,f275]) ).
fof(f2260,plain,
theorem(or(or(sF4,sF9),sF9)),
inference(resolution,[],[f2256,f1121]) ).
fof(f2267,plain,
theorem(or(sF4,or(sF9,sF9))),
inference(resolution,[],[f2260,f1431]) ).
fof(f2293,plain,
theorem(or(r,or(sF0,sF9))),
inference(resolution,[],[f2235,f275]) ).
fof(f2304,plain,
theorem(or(sF0,or(r,sF9))),
inference(resolution,[],[f2293,f104]) ).
fof(f2308,plain,
theorem(or(or(r,sF9),sF9)),
inference(resolution,[],[f2304,f1046]) ).
fof(f2317,plain,
theorem(or(r,or(sF9,sF9))),
inference(resolution,[],[f2308,f1431]) ).
fof(f4413,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X2,X0)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f426,f189]) ).
fof(f4586,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X1,X2))
| ~ theorem(or(X0,X2)) ),
inference(resolution,[],[f389,f15]) ).
fof(f4735,plain,
! [X0,X1] :
( theorem(or(not(not(X0)),X1))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f4586,f382]) ).
fof(f4765,plain,
! [X0,X1] :
( ~ theorem(or(X0,or(X1,X1)))
| theorem(or(not(not(X0)),X1)) ),
inference(resolution,[],[f4735,f294]) ).
fof(f4855,plain,
theorem(or(not(not(r)),sF9)),
inference(resolution,[],[f4765,f2317]) ).
fof(f4859,plain,
theorem(or(not(not(sF4)),sF9)),
inference(resolution,[],[f4765,f2267]) ).
fof(f4861,plain,
theorem(or(not(sF3),sF9)),
inference(forward_demodulation,[],[f4855,f24]) ).
fof(f4908,plain,
! [X0] :
( ~ theorem(or(not(sF4),X0))
| theorem(or(X0,sF9)) ),
inference(resolution,[],[f4859,f387]) ).
fof(f4925,plain,
theorem(or(or(sF3,p),sF9)),
inference(resolution,[],[f4908,f191]) ).
fof(f4941,plain,
theorem(or(sF3,or(sF9,p))),
inference(resolution,[],[f4925,f1431]) ).
fof(f4952,plain,
theorem(or(p,or(sF3,sF9))),
inference(resolution,[],[f4941,f4413]) ).
fof(f4961,plain,
( theorem(or(p,sF9))
| ~ theorem(or(not(sF3),sF9)) ),
inference(resolution,[],[f4952,f560]) ).
fof(f4968,plain,
~ theorem(or(not(sF3),sF9)),
inference(forward_subsumption_resolution,[],[f4961,f1470]) ).
fof(f4971,plain,
$false,
inference(forward_subsumption_resolution,[],[f4968,f4861]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL228-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.39 % Computer : n015.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Sun Sep 27 15:31:00 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.42 Running first-order theorem proving
% 0.13/0.42 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
% 10.39/2.54 % (1788573)Input is clausal, will run a generic CNF schedule.
% 10.39/2.54 % (1788619)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=2997128541:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 10.39/2.54 % (1788622)lrs+10_1_sil=8000:sp=occurrence:random_seed=2162591918:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 10.39/2.54 % (1788620)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2989288569:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 10.39/2.54 % (1788624)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3637185637:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 10.39/2.54 % (1788623)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2542151872:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 10.39/2.54 % (1788625)dis-21_1_sil=8000:lcm=predicate:random_seed=129965805:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 10.39/2.54 % (1788621)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1135370613:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 10.39/2.54 % (1788625)Instruction limit reached!
% 10.39/2.54 % (1788625)------------------------------
% 10.39/2.54 % (1788625)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.39/2.54 % (1788625)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.39/2.54 % (1788625)CaDiCaL version: 2.1.3
% 10.39/2.54 % (1788625)Termination reason: Instruction limit
% 10.39/2.54 % (1788625)Termination phase: Saturation
% 10.39/2.54 % (1788625)Time elapsed: 0.102 s
% 10.39/2.54 % (1788625)Peak memory usage: 87 MB
% 10.39/2.54 % (1788625)Instructions burned: 117 (million)
% 10.39/2.54 % (1788623)Instruction limit reached!
% 10.39/2.54 % (1788623)------------------------------
% 10.39/2.54 % (1788623)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.39/2.54 % (1788623)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.39/2.54 % (1788623)CaDiCaL version: 2.1.3
% 10.39/2.54 % (1788623)Termination reason: Instruction limit
% 10.39/2.54 % (1788623)Termination phase: Saturation
% 10.39/2.54 % (1788623)Time elapsed: 0.104 s
% 10.39/2.54 % (1788623)Peak memory usage: 87 MB
% 10.39/2.54 % (1788623)Instructions burned: 114 (million)
% 10.39/2.54 % (1788622)Instruction limit reached!
% 10.39/2.54 % (1788622)------------------------------
% 10.39/2.54 % (1788622)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.39/2.54 % (1788622)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.39/2.54 % (1788622)CaDiCaL version: 2.1.3
% 10.39/2.54 % (1788622)Termination reason: Instruction limit
% 10.39/2.54 % (1788622)Termination phase: Saturation
% 10.39/2.54 % (1788622)Time elapsed: 0.111 s
% 10.39/2.54 % (1788622)Peak memory usage: 89 MB
% 10.39/2.54 % (1788622)Instructions burned: 108 (million)
% 10.39/2.54 % (1788624)Instruction limit reached!
% 10.39/2.54 % (1788624)------------------------------
% 10.39/2.54 % (1788624)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.39/2.54 % (1788624)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.39/2.54 % (1788624)CaDiCaL version: 2.1.3
% 10.39/2.54 % (1788624)Termination reason: Instruction limit
% 10.39/2.54 % (1788624)Termination phase: Saturation
% 10.39/2.54 % (1788624)Time elapsed: 0.182 s
% 10.39/2.54 % (1788624)Peak memory usage: 89 MB
% 10.39/2.54 % (1788624)Instructions burned: 180 (million)
% 10.39/2.54 % (1788638)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=1191314355:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2996 on theBenchmark for (2996ds/189Mi)
% 10.39/2.54 % (1788638)Refutation not found, incomplete strategy
% 10.39/2.54 % (1788638)------------------------------
% 10.39/2.54 % (1788638)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.39/2.54 % (1788638)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.39/2.54 % (1788638)CaDiCaL version: 2.1.3
% 10.39/2.54 % (1788638)Termination reason: Refutation not found, incomplete strategy
% 10.39/2.54 % (1788638)Time elapsed: 0.002 s
% 10.39/2.54 % (1788638)Peak memory usage: 87 MB
% 10.39/2.54 % (1788637)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=698398404:i=143:sd=2:aac=none:ss=axioms:sgt=16_2996 on theBenchmark for (2996ds/143Mi)
% 10.39/2.54 % (1788637)Refutation not found, incomplete strategy
% 10.39/2.54 % (1788637)------------------------------
% 10.39/2.54 % (1788637)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.39/2.54 % (1788637)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.39/2.54 % (1788637)CaDiCaL version: 2.1.3
% 10.39/2.54 % (1788637)Termination reason: Refutation not found, incomplete strategy
% 10.39/2.54 % (1788637)Time elapsed: 0.002 s
% 10.39/2.54 % (1788637)Peak memory usage: 88 MB
% 10.39/2.54 % (1788639)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=2214233941:st=4:i=219:sd=3:ss=axioms_2996 on theBenchmark for (2996ds/219Mi)
% 10.39/2.54 % (1788639)Refutation not found, incomplete strategy
% 10.39/2.54 % (1788639)------------------------------
% 10.39/2.54 % (1788639)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.39/2.54 % (1788639)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.39/2.54 % (1788639)CaDiCaL version: 2.1.3
% 10.39/2.54 % (1788639)Termination reason: Refutation not found, incomplete strategy
% 10.39/2.54 % (1788639)Time elapsed: 0.002 s
% 10.39/2.54 % (1788639)Peak memory usage: 88 MB
% 10.39/2.54 % (1788641)lrs+10_64_to=lpo:sil=8000:random_seed=2981651342:i=126:bd=preordered_2995 on theBenchmark for (2995ds/126Mi)
% 10.39/2.54 % (1788641)Instruction limit reached!
% 10.39/2.54 % (1788641)------------------------------
% 10.39/2.54 % (1788641)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.39/2.54 % (1788641)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.39/2.54 % (1788641)CaDiCaL version: 2.1.3
% 10.39/2.54 % (1788641)Termination reason: Instruction limit
% 10.39/2.54 % (1788641)Termination phase: Saturation
% 10.39/2.54 % (1788641)Time elapsed: 0.118 s
% 10.39/2.54 % (1788641)Peak memory usage: 89 MB
% 10.39/2.54 % (1788641)Instructions burned: 126 (million)
% 10.39/2.54 % (1788649)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=88388885:avsq=on:i=194:fgj=on:bd=preordered_2992 on theBenchmark for (2992ds/194Mi)
% 10.39/2.54 % (1788638)------------------------------
% 10.39/2.54 % (1788638)------------------------------
% 10.39/2.54 % (1788637)------------------------------
% 10.39/2.54 % (1788637)------------------------------
% 10.39/2.54 % (1788639)------------------------------
% 10.39/2.54 % (1788639)------------------------------
% 10.39/2.54 % (1788653)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=667951505:i=157:gtg=all_2990 on theBenchmark for (2990ds/157Mi)
% 10.39/2.54 % (1788649)Instruction limit reached!
% 10.39/2.54 % (1788649)------------------------------
% 10.39/2.54 % (1788649)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.39/2.54 % (1788649)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.39/2.54 % (1788649)CaDiCaL version: 2.1.3
% 10.39/2.54 % (1788649)Termination reason: Instruction limit
% 10.39/2.54 % (1788649)Termination phase: Saturation
% 10.39/2.54 % (1788649)Time elapsed: 0.191 s
% 10.39/2.54 % (1788649)Peak memory usage: 90 MB
% 10.39/2.54 % (1788649)Instructions burned: 194 (million)
% 10.39/2.54 % (1788654)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:random_seed=1070223295:i=3394:sd=4:ss=included:sgt=64_2990 on theBenchmark for (2990ds/3394Mi)
% 10.39/2.54 % (1788656)lrs+1011_5_to=lpo:sil=8000:tgt=full:plsq=on:prc=on:drc=off:plsqr=31,4:sp=occurrence:urr=on:nwc=0.8:s2agt=16:br=off:random_seed=4116884514:cts=off:s2a=on:i=106:fsr=off:gsp=on:ss=axioms:sgt=16:rawr=on_2990 on theBenchmark for (2990ds/106Mi)
% 10.39/2.54 % (1788653)Instruction limit reached!
% 10.39/2.54 % (1788653)------------------------------
% 10.39/2.54 % (1788653)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.39/2.54 % (1788653)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.39/2.54 % (1788653)CaDiCaL version: 2.1.3
% 10.39/2.54 % (1788653)Termination reason: Instruction limit
% 10.39/2.54 % (1788653)Termination phase: Saturation
% 10.39/2.54 % (1788653)Time elapsed: 0.164 s
% 10.39/2.54 % (1788653)Peak memory usage: 91 MB
% 10.39/2.54 % (1788653)Instructions burned: 157 (million)
% 10.39/2.54 % (1788656)Instruction limit reached!
% 10.39/2.54 % (1788656)------------------------------
% 10.39/2.54 % (1788656)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.39/2.54 % (1788656)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.39/2.54 % (1788656)CaDiCaL version: 2.1.3
% 10.39/2.54 % (1788656)Termination reason: Instruction limit
% 10.39/2.54 % (1788656)Termination phase: Saturation
% 10.39/2.54 % (1788656)Time elapsed: 0.096 s
% 10.39/2.54 % (1788656)Peak memory usage: 88 MB
% 10.39/2.54 % (1788656)Instructions burned: 106 (million)
% 10.39/2.54 % (1788619)First to succeed.
% 10.39/2.54 % (1788619)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1788573"
% 10.39/2.54 % (1788659)lrs+2_4096_sil=8000:plsq=on:plsqr=12672147,131072:sos=on:spb=goal:lcm=predicate:random_seed=292403893:i=107_2989 on theBenchmark for (2989ds/107Mi)
% 10.39/2.54 % (1788659)Refutation not found, incomplete strategy
% 10.39/2.54 % (1788659)------------------------------
% 10.39/2.54 % (1788659)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.39/2.54 % (1788659)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.39/2.54 % (1788659)CaDiCaL version: 2.1.3
% 10.39/2.54 % (1788659)Termination reason: Refutation not found, incomplete strategy
% 10.39/2.54 % (1788659)Time elapsed: 0.001 s
% 10.39/2.54 % (1788659)Peak memory usage: 87 MB
% 10.39/2.54 % (1788663)lrs+1011_20_sil=64000:tgt=ground:plsq=on:fde=unused:plsqc=1:plsqr=14,1:plsql=on:nwc=0.6:random_seed=3673097803:st=6:i=242:gtgl=5:kws=arity_squared:av=off:gtg=exists_sym:ss=included_2987 on theBenchmark for (2987ds/242Mi)
% 10.39/2.54 % (1788665)lrs+1010_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:tgt=ground:npcc=on:sims=off:random_seed=1752305317:cond=fast:i=5208:av=off_2987 on theBenchmark for (2987ds/5208Mi)
% 10.39/2.54 % (1788619)Refutation found. Thanks to Tanya!
% 10.39/2.54 % SZS status Unsatisfiable for theBenchmark
% 10.39/2.54 % SZS output start Proof for theBenchmark
% See solution above
% 11.84/2.79 % (1788619)------------------------------
% 11.84/2.79 % (1788619)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.84/2.79 % (1788619)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.84/2.79 % (1788619)CaDiCaL version: 2.1.3
% 11.84/2.79 % (1788619)Termination reason: Refutation
% 11.84/2.79 % (1788619)Time elapsed: 1.162 s
% 11.84/2.79 % (1788619)Peak memory usage: 140 MB
% 11.84/2.79 % (1788619)Instructions burned: 2112 (million)
% 11.84/2.79 % (1788619)------------------------------
% 11.84/2.79 % (1788619)------------------------------
% 11.84/2.79 % (1788573)Success in time 1.574 s
% 11.84/2.79 % Vampire exiting
%------------------------------------------------------------------------------