%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL225-10 : TPTP v9.3.1. Released v7.3.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:51:39 AM UTC 2026
% Result : Unsatisfiable 16.95s 5.81s
% Output : Refutation 33.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 41
% Number of leaves : 21
% Syntax : Number of formulae : 99 ( 99 unt; 11 def)
% Number of atoms : 99 ( 98 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 15 con; 0-4 aty)
% Number of variables : 96 ( 96 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : ifeq(X0,X0,X1,X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom) ).
fof(f2,axiom,
! [X0] : axiom(or(not(or(X0,X0)),X0)) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_2) ).
fof(f3,axiom,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_3) ).
fof(f4,plain,
! [X0,X1] : true = axiom(or(not(X0),or(X1,X0))),
inference(reorient_equations,[],[f3]) ).
fof(f5,axiom,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_4) ).
fof(f6,plain,
! [X0,X1] : true = axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(reorient_equations,[],[f5]) ).
fof(f7,axiom,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_5) ).
fof(f8,plain,
! [X2,X0,X1] : true = axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(reorient_equations,[],[f7]) ).
fof(f9,axiom,
! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_6) ).
fof(f10,plain,
! [X2,X0,X1] : true = axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(reorient_equations,[],[f9]) ).
fof(f11,axiom,
! [X0] : ifeq(axiom(X0),true,theorem(X0),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).
fof(f12,plain,
! [X0] : true = ifeq(axiom(X0),true,theorem(X0),true),
inference(reorient_equations,[],[f11]) ).
fof(f13,axiom,
! [X0,X1] : ifeq(theorem(X0),true,ifeq(axiom(or(not(X0),X1)),true,theorem(X1),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_2) ).
fof(f14,plain,
! [X0,X1] : true = ifeq(theorem(X0),true,ifeq(axiom(or(not(X0),X1)),true,theorem(X1),true),true),
inference(reorient_equations,[],[f13]) ).
fof(f15,axiom,
! [X2,X0,X1] : ifeq(theorem(or(not(X0),X1)),true,ifeq(axiom(or(not(X2),X0)),true,theorem(or(not(X2),X1)),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_3) ).
fof(f16,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(not(X0),X1)),true,ifeq(axiom(or(not(X2),X0)),true,theorem(or(not(X2),X1)),true),true),
inference(reorient_equations,[],[f15]) ).
fof(f17,negated_conjecture,
theorem(or(not(or(not(p),or(not(q),r))),or(not(or(not(p),q)),or(not(p),r)))) != true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f18,plain,
true != theorem(or(not(or(not(p),or(not(q),r))),or(not(or(not(p),q)),or(not(p),r)))),
inference(reorient_equations,[],[f17]) ).
fof(f19,definition,
sF0 = not(p),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f20,plain,
not(p) = sF0,
inference(reorient_equations,[],[f19]) ).
fof(f21,definition,
sF1 = not(q),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f22,plain,
not(q) = sF1,
inference(reorient_equations,[],[f21]) ).
fof(f23,definition,
sF2 = or(sF1,r),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f24,plain,
or(sF1,r) = sF2,
inference(reorient_equations,[],[f23]) ).
fof(f25,definition,
sF3 = or(sF0,sF2),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f26,plain,
or(sF0,sF2) = sF3,
inference(reorient_equations,[],[f25]) ).
fof(f27,definition,
sF4 = not(sF3),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f28,plain,
not(sF3) = sF4,
inference(reorient_equations,[],[f27]) ).
fof(f29,definition,
sF5 = or(sF0,q),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f30,plain,
or(sF0,q) = sF5,
inference(reorient_equations,[],[f29]) ).
fof(f31,definition,
sF6 = not(sF5),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f32,plain,
not(sF5) = sF6,
inference(reorient_equations,[],[f31]) ).
fof(f33,definition,
sF7 = or(sF0,r),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
fof(f34,plain,
or(sF0,r) = sF7,
inference(reorient_equations,[],[f33]) ).
fof(f35,definition,
sF8 = or(sF6,sF7),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
fof(f36,plain,
or(sF6,sF7) = sF8,
inference(reorient_equations,[],[f35]) ).
fof(f37,definition,
sF9 = or(sF4,sF8),
introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).
fof(f38,plain,
or(sF4,sF8) = sF9,
inference(reorient_equations,[],[f37]) ).
fof(f39,definition,
sF10 = theorem(sF9),
introduced(definition,[new_symbols(definition,[sF10])],[function_definition]) ).
fof(f40,plain,
theorem(sF9) = sF10,
inference(reorient_equations,[],[f39]) ).
fof(f41,plain,
true != sF10,
inference(definition_folding,[],[f18,f40,f38,f36,f34,f20,f32,f30,f20,f28,f26,f24,f22,f20]) ).
fof(f67,plain,
! [X0] : true = axiom(or(not(or(not(q),X0)),or(not(sF5),or(sF0,X0)))),
inference(superposition,[],[f10,f30]) ).
fof(f73,plain,
! [X0] : true = axiom(or(not(or(not(q),X0)),or(sF6,or(sF0,X0)))),
inference(forward_demodulation,[],[f67,f32]) ).
fof(f74,plain,
! [X0] : true = axiom(or(not(or(sF1,X0)),or(sF6,or(sF0,X0)))),
inference(forward_demodulation,[],[f73,f22]) ).
fof(f91,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(not(or(X0,X1)),X2)),true,ifeq(true,true,theorem(or(not(or(X1,X0)),X2)),true),true),
inference(superposition,[],[f16,f6]) ).
fof(f92,plain,
! [X2,X3,X0,X1] : true = ifeq(theorem(or(not(or(X0,or(X1,X2))),X3)),true,ifeq(true,true,theorem(or(not(or(X1,or(X0,X2))),X3)),true),true),
inference(superposition,[],[f16,f8]) ).
fof(f99,plain,
! [X2,X3,X0,X1] : true = ifeq(theorem(or(not(or(X0,or(X1,X2))),X3)),true,theorem(or(not(or(X1,or(X0,X2))),X3)),true),
inference(forward_demodulation,[],[f92,f1]) ).
fof(f100,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(not(or(X0,X1)),X2)),true,theorem(or(not(or(X1,X0)),X2)),true),
inference(forward_demodulation,[],[f91,f1]) ).
fof(f103,plain,
! [X0,X1] : true = ifeq(theorem(or(not(or(X0,sF7)),X1)),true,theorem(or(not(or(sF0,or(X0,r))),X1)),true),
inference(superposition,[],[f99,f34]) ).
fof(f123,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(not(or(X0,X1)),X2)),true,ifeq(true,true,theorem(or(not(X1),X2)),true),true),
inference(superposition,[],[f16,f4]) ).
fof(f124,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(not(or(X0,X1)),X2)),true,theorem(or(not(X1),X2)),true),
inference(forward_demodulation,[],[f123,f1]) ).
fof(f258,plain,
! [X0] : true = ifeq(theorem(or(not(sF2),X0)),true,theorem(or(not(or(r,sF1)),X0)),true),
inference(superposition,[],[f100,f24]) ).
fof(f317,plain,
! [X0,X1] : true = ifeq(theorem(or(X0,X1)),true,ifeq(true,true,theorem(or(X1,X0)),true),true),
inference(superposition,[],[f14,f6]) ).
fof(f318,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(X0,or(X1,X2))),true,ifeq(true,true,theorem(or(X1,or(X0,X2))),true),true),
inference(superposition,[],[f14,f8]) ).
fof(f319,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(not(X0),X1)),true,ifeq(true,true,theorem(or(not(or(X2,X0)),or(X2,X1))),true),true),
inference(superposition,[],[f14,f10]) ).
fof(f320,plain,
! [X0,X1] : true = ifeq(theorem(X0),true,ifeq(true,true,theorem(or(X1,X0)),true),true),
inference(superposition,[],[f14,f4]) ).
fof(f326,plain,
! [X0,X1] : true = ifeq(theorem(X0),true,theorem(or(X1,X0)),true),
inference(forward_demodulation,[],[f320,f1]) ).
fof(f327,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(not(X0),X1)),true,theorem(or(not(or(X2,X0)),or(X2,X1))),true),
inference(forward_demodulation,[],[f319,f1]) ).
fof(f328,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(X0,or(X1,X2))),true,theorem(or(X1,or(X0,X2))),true),
inference(forward_demodulation,[],[f318,f1]) ).
fof(f329,plain,
! [X0,X1] : true = ifeq(theorem(or(X0,X1)),true,theorem(or(X1,X0)),true),
inference(forward_demodulation,[],[f317,f1]) ).
fof(f499,plain,
! [X0] : true = ifeq(theorem(or(X0,X0)),true,ifeq(true,true,theorem(X0),true),true),
inference(superposition,[],[f14,f2]) ).
fof(f504,plain,
! [X0] : true = ifeq(theorem(or(X0,X0)),true,theorem(X0),true),
inference(forward_demodulation,[],[f499,f1]) ).
fof(f801,plain,
true = axiom(or(not(or(sF1,r)),or(sF6,sF7))),
inference(superposition,[],[f74,f34]) ).
fof(f808,plain,
true = axiom(or(not(or(sF1,r)),sF8)),
inference(forward_demodulation,[],[f801,f36]) ).
fof(f810,plain,
true = axiom(or(not(sF2),sF8)),
inference(forward_demodulation,[],[f808,f24]) ).
fof(f814,plain,
true = ifeq(true,true,theorem(or(not(sF2),sF8)),true),
inference(superposition,[],[f12,f810]) ).
fof(f815,plain,
true = theorem(or(not(sF2),sF8)),
inference(forward_demodulation,[],[f814,f1]) ).
fof(f11645,plain,
true = ifeq(true,true,theorem(or(not(or(r,sF1)),sF8)),true),
inference(superposition,[],[f258,f815]) ).
fof(f11702,plain,
true = theorem(or(not(or(r,sF1)),sF8)),
inference(forward_demodulation,[],[f11645,f1]) ).
fof(f14842,plain,
true = ifeq(true,true,theorem(or(not(sF1),sF8)),true),
inference(superposition,[],[f124,f11702]) ).
fof(f14889,plain,
true = theorem(or(not(sF1),sF8)),
inference(forward_demodulation,[],[f14842,f1]) ).
fof(f14907,plain,
! [X0] : true = ifeq(true,true,theorem(or(not(or(X0,sF1)),or(X0,sF8))),true),
inference(superposition,[],[f327,f14889]) ).
fof(f14923,plain,
! [X0] : true = theorem(or(not(or(X0,sF1)),or(X0,sF8))),
inference(forward_demodulation,[],[f14907,f1]) ).
fof(f14946,plain,
! [X0] : true = ifeq(true,true,theorem(or(not(or(sF1,X0)),or(X0,sF8))),true),
inference(superposition,[],[f100,f14923]) ).
fof(f14989,plain,
! [X0] : true = theorem(or(not(or(sF1,X0)),or(X0,sF8))),
inference(forward_demodulation,[],[f14946,f1]) ).
fof(f15007,plain,
true = ifeq(true,true,theorem(or(not(or(sF0,or(sF1,r))),or(sF7,sF8))),true),
inference(superposition,[],[f103,f14989]) ).
fof(f15052,plain,
true = theorem(or(not(or(sF0,or(sF1,r))),or(sF7,sF8))),
inference(forward_demodulation,[],[f15007,f1]) ).
fof(f15060,plain,
true = theorem(or(not(or(sF0,sF2)),or(sF7,sF8))),
inference(forward_demodulation,[],[f15052,f24]) ).
fof(f15062,plain,
true = theorem(or(not(sF3),or(sF7,sF8))),
inference(forward_demodulation,[],[f15060,f26]) ).
fof(f15063,plain,
true = theorem(or(sF4,or(sF7,sF8))),
inference(forward_demodulation,[],[f15062,f28]) ).
fof(f15070,plain,
true = ifeq(true,true,theorem(or(sF7,or(sF4,sF8))),true),
inference(superposition,[],[f328,f15063]) ).
fof(f15083,plain,
true = theorem(or(sF7,or(sF4,sF8))),
inference(forward_demodulation,[],[f15070,f1]) ).
fof(f15089,plain,
true = theorem(or(sF7,sF9)),
inference(forward_demodulation,[],[f15083,f38]) ).
fof(f15092,plain,
true = ifeq(true,true,theorem(or(sF9,sF7)),true),
inference(superposition,[],[f329,f15089]) ).
fof(f15101,plain,
true = theorem(or(sF9,sF7)),
inference(forward_demodulation,[],[f15092,f1]) ).
fof(f15107,plain,
! [X0] : true = ifeq(true,true,theorem(or(X0,or(sF9,sF7))),true),
inference(superposition,[],[f326,f15101]) ).
fof(f15114,plain,
! [X0] : true = theorem(or(X0,or(sF9,sF7))),
inference(forward_demodulation,[],[f15107,f1]) ).
fof(f15296,plain,
! [X0] : true = ifeq(true,true,theorem(or(sF9,or(X0,sF7))),true),
inference(superposition,[],[f328,f15114]) ).
fof(f15436,plain,
! [X0] : true = theorem(or(sF9,or(X0,sF7))),
inference(forward_demodulation,[],[f15296,f1]) ).
fof(f15447,plain,
true = theorem(or(sF9,sF8)),
inference(superposition,[],[f15436,f36]) ).
fof(f15466,plain,
! [X0] : true = ifeq(true,true,theorem(or(X0,or(sF9,sF8))),true),
inference(superposition,[],[f326,f15447]) ).
fof(f15473,plain,
! [X0] : true = theorem(or(X0,or(sF9,sF8))),
inference(forward_demodulation,[],[f15466,f1]) ).
fof(f15640,plain,
! [X0] : true = ifeq(true,true,theorem(or(sF9,or(X0,sF8))),true),
inference(superposition,[],[f328,f15473]) ).
fof(f15780,plain,
! [X0] : true = theorem(or(sF9,or(X0,sF8))),
inference(forward_demodulation,[],[f15640,f1]) ).
fof(f15791,plain,
true = theorem(or(sF9,sF9)),
inference(superposition,[],[f15780,f38]) ).
fof(f15807,plain,
true = ifeq(true,true,theorem(sF9),true),
inference(superposition,[],[f504,f15791]) ).
fof(f15819,plain,
true = theorem(sF9),
inference(forward_demodulation,[],[f15807,f1]) ).
fof(f15821,plain,
true = sF10,
inference(superposition,[],[f40,f15819]) ).
fof(f15830,plain,
$false,
inference(forward_subsumption_resolution,[],[f15821,f41]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL225-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n009.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 27 15:28:00 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.41 Running first-order theorem proving
% 0.16/0.41 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
% 16.95/5.81 % (2174349)Detected a unit-equality problem, will run specialized UEQ schedule.
% 16.95/5.81 % (2174361)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=4112936333:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 16.95/5.81 % (2174357)lrs+1002_1_ncem=casc2026/models/loop7.pt:sil=128000:tgt=ground:npcc=on:drc=off:sp=reverse_frequency:spb=goal:acc=on:s2agt=16:kmz=on:sac=on:random_seed=2711629230:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 16.95/5.81 % (2174359)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=2931426954:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 16.95/5.81 % (2174358)lrs+11_1_ncem=casc2026/models/loop6.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=2997367301:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 16.95/5.81 % (2174360)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=54669157:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 16.95/5.81 % (2174362)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=3282494500:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 16.95/5.81 % (2174363)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=3961123487:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 16.95/5.81 % (2174361)Instruction limit reached!
% 16.95/5.81 % (2174361)------------------------------
% 16.95/5.81 % (2174361)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 16.95/5.81 % (2174361)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.95/5.81 % (2174361)CaDiCaL version: 2.1.3
% 16.95/5.81 % (2174361)Termination reason: Instruction limit
% 16.95/5.81 % (2174361)Termination phase: Saturation
% 16.95/5.81 % (2174361)Time elapsed: 0.090 s
% 16.95/5.81 % (2174361)Peak memory usage: 90 MB
% 16.95/5.81 % (2174361)Instructions burned: 182 (million)
% 16.95/5.81 % (2174360)Instruction limit reached!
% 16.95/5.81 % (2174360)------------------------------
% 16.95/5.81 % (2174360)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 16.95/5.81 % (2174360)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.95/5.81 % (2174360)CaDiCaL version: 2.1.3
% 16.95/5.81 % (2174360)Termination reason: Instruction limit
% 16.95/5.81 % (2174360)Termination phase: Saturation
% 16.95/5.81 % (2174360)Time elapsed: 0.141 s
% 16.95/5.81 % (2174360)Peak memory usage: 89 MB
% 16.95/5.81 % (2174360)Instructions burned: 136 (million)
% 16.95/5.81 % (2174371)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=1850174045:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2996 on theBenchmark for (2996ds/2051Mi)
% 16.95/5.81 % (2174362)Instruction limit reached!
% 16.95/5.81 % (2174362)------------------------------
% 16.95/5.81 % (2174362)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 16.95/5.81 % (2174362)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.95/5.81 % (2174362)CaDiCaL version: 2.1.3
% 16.95/5.81 % (2174362)Termination reason: Instruction limit
% 16.95/5.81 % (2174362)Termination phase: Saturation
% 16.95/5.81 % (2174362)Time elapsed: 0.275 s
% 16.95/5.81 % (2174362)Peak memory usage: 91 MB
% 16.95/5.81 % (2174362)Instructions burned: 257 (million)
% 16.95/5.81 % (2174372)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=825524341:i=4948:ss=axioms:sgt=16_2995 on theBenchmark for (2995ds/4948Mi)
% 16.95/5.81 % (2174374)lrs+10_5:1_sil=8000:sos=all:urr=on:br=off:flr=on:random_seed=1147333713:i=215:ep=RSTC_2994 on theBenchmark for (2994ds/215Mi)
% 16.95/5.81 % (2174374)Instruction limit reached!
% 16.95/5.81 % (2174374)------------------------------
% 16.95/5.81 % (2174374)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 16.95/5.81 % (2174374)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.95/5.81 % (2174374)CaDiCaL version: 2.1.3
% 16.95/5.81 % (2174374)Termination reason: Instruction limit
% 16.95/5.81 % (2174374)Termination phase: Saturation
% 16.95/5.81 % (2174374)Time elapsed: 0.178 s
% 16.95/5.81 % (2174374)Peak memory usage: 88 MB
% 16.95/5.81 % (2174374)Instructions burned: 216 (million)
% 16.95/5.81 % (2174377)lrs+11_1_sil=16000:tgt=full:fde=none:sp=reverse_frequency:lma=off:fs=off:acc=on:bsr=unit_only:rp=on:random_seed=2586400695:avsq=on:i=317:avsqr=1,16:kws=arity_squared:add=off:fgj=on:ins=10:fsr=off:gtg=exists_sym_2989 on theBenchmark for (2989ds/317Mi)
% 16.95/5.81 % (2174363)Instruction limit reached!
% 16.95/5.81 % (2174363)------------------------------
% 16.95/5.81 % (2174363)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 16.95/5.81 % (2174363)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.95/5.81 % (2174363)CaDiCaL version: 2.1.3
% 16.95/5.81 % (2174363)Termination reason: Instruction limit
% 16.95/5.81 % (2174363)Termination phase: Saturation
% 16.95/5.81 % (2174363)Time elapsed: 1.111 s
% 16.95/5.81 % (2174363)Peak memory usage: 98 MB
% 16.95/5.81 % (2174363)Instructions burned: 1187 (million)
% 16.95/5.81 % (2174377)Instruction limit reached!
% 16.95/5.81 % (2174377)------------------------------
% 16.95/5.81 % (2174377)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 16.95/5.81 % (2174377)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.95/5.81 % (2174377)CaDiCaL version: 2.1.3
% 16.95/5.81 % (2174377)Termination reason: Instruction limit
% 16.95/5.81 % (2174377)Termination phase: Saturation
% 16.95/5.81 % (2174377)Time elapsed: 0.320 s
% 16.95/5.81 % (2174377)Peak memory usage: 96 MB
% 16.95/5.81 % (2174377)Instructions burned: 317 (million)
% 16.95/5.81 % (2174380)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=64000:tgt=full:npcc=on:sp=arity:lcm=predicate:urr=on:s2agt=16:br=off:random_seed=4138323561:i=12125:sd=2:fgj=on:ss=axioms:sgt=64_2985 on theBenchmark for (2985ds/12125Mi)
% 16.95/5.81 % (2174371)Instruction limit reached!
% 16.95/5.81 % (2174371)------------------------------
% 16.95/5.81 % (2174371)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 16.95/5.81 % (2174371)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.95/5.81 % (2174371)CaDiCaL version: 2.1.3
% 16.95/5.81 % (2174371)Termination reason: Instruction limit
% 16.95/5.81 % (2174371)Termination phase: Saturation
% 16.95/5.81 % (2174371)Time elapsed: 1.218 s
% 16.95/5.81 % (2174371)Peak memory usage: 141 MB
% 16.95/5.81 % (2174371)Instructions burned: 2052 (million)
% 16.95/5.81 % (2174381)lrs+10_32_sil=8000:tgt=ground:prc=on:sp=reverse_arity:spb=non_intro:random_seed=1005543765:i=2836:kws=inv_precedence:fgj=on:bd=preordered:ins=10_2983 on theBenchmark for (2983ds/2836Mi)
% 16.95/5.81 % (2174383)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:lma=off:kmz=on:random_seed=92229922:i=14534:kws=arity:fgj=on:bd=preordered:ins=6:ss=axioms:sgt=30_2982 on theBenchmark for (2982ds/14534Mi)
% 16.95/5.81 % (2174380)First to succeed.
% 16.95/5.81 % (2174380)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2174349"
% 16.95/5.81 % (2174380)Refutation found. Thanks to Tanya!
% 16.95/5.81 % SZS status Unsatisfiable for theBenchmark
% 16.95/5.81 % SZS output start Proof for theBenchmark
% See solution above
% 33.43/6.02 % (2174380)------------------------------
% 33.43/6.02 % (2174380)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 33.43/6.02 % (2174380)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 33.43/6.02 % (2174380)CaDiCaL version: 2.1.3
% 33.43/6.02 % (2174380)Termination reason: Refutation
% 33.43/6.02 % (2174380)Time elapsed: 2.614 s
% 33.43/6.02 % (2174380)Peak memory usage: 158 MB
% 33.43/6.02 % (2174380)Instructions burned: 3888 (million)
% 33.43/6.02 % (2174380)------------------------------
% 33.43/6.02 % (2174380)------------------------------
% 33.43/6.02 % (2174349)Success in time 4.624 s
% 33.43/6.02 % Vampire exiting
%------------------------------------------------------------------------------