%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL192-10 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n004.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:29 AM UTC 2026
% Result : Unsatisfiable 12.65s 3.01s
% Output : Refutation 14.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 17
% Syntax : Number of formulae : 100 ( 100 unt; 7 def)
% Number of atoms : 100 ( 99 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 11 con; 0-4 aty)
% Number of variables : 133 ( 133 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
! [X2,X0,X1] : ifeq(X0,X0,X1,X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
fof(f2,axiom,
! [X0] : axiom(implies(or(X0,X0),X0)) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_2) ).
fof(f3,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_3) ).
fof(f4,plain,
! [X0,X1] : true = axiom(implies(X0,or(X1,X0))),
inference(reorient_equations,[],[f3]) ).
fof(f5,axiom,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_4) ).
fof(f6,plain,
! [X0,X1] : true = axiom(implies(or(X0,X1),or(X1,X0))),
inference(reorient_equations,[],[f5]) ).
fof(f7,axiom,
! [X2,X0,X1] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_5) ).
fof(f8,plain,
! [X2,X0,X1] : true = axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(reorient_equations,[],[f7]) ).
fof(f9,axiom,
! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_6) ).
fof(f10,plain,
! [X2,X0,X1] : true = axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
inference(reorient_equations,[],[f9]) ).
fof(f11,negated_conjecture,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_definition) ).
fof(f12,axiom,
! [X0] : ifeq(axiom(X0),true,theorem(X0),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).
fof(f13,plain,
! [X0] : true = ifeq(axiom(X0),true,theorem(X0),true),
inference(reorient_equations,[],[f12]) ).
fof(f14,axiom,
! [X0,X1] : ifeq(theorem(implies(X0,X1)),true,ifeq(theorem(X0),true,theorem(X1),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).
fof(f15,plain,
! [X0,X1] : true = ifeq(theorem(implies(X0,X1)),true,ifeq(theorem(X0),true,theorem(X1),true),true),
inference(reorient_equations,[],[f14]) ).
fof(f16,negated_conjecture,
theorem(implies(or(or(p,q),r),or(p,or(q,r)))) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f17,plain,
true != theorem(implies(or(or(p,q),r),or(p,or(q,r)))),
inference(reorient_equations,[],[f16]) ).
fof(f18,plain,
! [X0] : true = axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f2,f11]) ).
fof(f19,plain,
! [X0,X1] : true = axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f4,f11]) ).
fof(f20,plain,
! [X0,X1] : true = axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f6,f11]) ).
fof(f21,plain,
! [X2,X0,X1] : true = axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f8,f11]) ).
fof(f22,plain,
! [X2,X0,X1] : true = axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(definition_unfolding,[],[f10,f11,f11,f11]) ).
fof(f23,plain,
! [X0,X1] : true = ifeq(theorem(or(not(X0),X1)),true,ifeq(theorem(X0),true,theorem(X1),true),true),
inference(definition_unfolding,[],[f15,f11]) ).
fof(f24,plain,
true != theorem(or(not(or(or(p,q),r)),or(p,or(q,r)))),
inference(definition_unfolding,[],[f17,f11]) ).
fof(f25,definition,
sF0 = or(p,q),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f26,plain,
or(p,q) = sF0,
inference(reorient_equations,[],[f25]) ).
fof(f27,definition,
sF1 = or(sF0,r),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f28,plain,
or(sF0,r) = sF1,
inference(reorient_equations,[],[f27]) ).
fof(f29,definition,
sF2 = not(sF1),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f30,plain,
not(sF1) = sF2,
inference(reorient_equations,[],[f29]) ).
fof(f31,definition,
sF3 = or(q,r),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f32,plain,
or(q,r) = sF3,
inference(reorient_equations,[],[f31]) ).
fof(f33,definition,
sF4 = or(p,sF3),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f34,plain,
or(p,sF3) = sF4,
inference(reorient_equations,[],[f33]) ).
fof(f35,definition,
sF5 = or(sF2,sF4),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f36,plain,
or(sF2,sF4) = sF5,
inference(reorient_equations,[],[f35]) ).
fof(f37,definition,
sF6 = theorem(sF5),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f38,plain,
theorem(sF5) = sF6,
inference(reorient_equations,[],[f37]) ).
fof(f39,plain,
true != sF6,
inference(definition_folding,[],[f24,f38,f36,f34,f32,f30,f28,f26]) ).
fof(f40,plain,
! [X0] : true = ifeq(theorem(or(not(X0),sF5)),true,ifeq(theorem(X0),true,sF6,true),true),
inference(superposition,[],[f23,f38]) ).
fof(f76,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(not(or(X0,X1)),or(X1,X0))),true),
inference(superposition,[],[f13,f20]) ).
fof(f77,plain,
! [X2,X0,X1] : true = ifeq(true,true,theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),true),
inference(superposition,[],[f13,f22]) ).
fof(f78,plain,
! [X2,X0,X1] : true = ifeq(true,true,theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),true),
inference(superposition,[],[f13,f21]) ).
fof(f79,plain,
! [X0] : true = ifeq(true,true,theorem(or(not(or(X0,X0)),X0)),true),
inference(superposition,[],[f13,f18]) ).
fof(f81,plain,
! [X0] : true = theorem(or(not(or(X0,X0)),X0)),
inference(forward_demodulation,[],[f79,f1]) ).
fof(f82,plain,
! [X2,X0,X1] : true = theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(forward_demodulation,[],[f78,f1]) ).
fof(f83,plain,
! [X2,X0,X1] : true = theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(forward_demodulation,[],[f77,f1]) ).
fof(f84,plain,
! [X0,X1] : true = theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(forward_demodulation,[],[f76,f1]) ).
fof(f95,plain,
! [X2,X0,X1] : true = ifeq(true,true,ifeq(theorem(or(X0,or(X1,X2))),true,theorem(or(X1,or(X0,X2))),true),true),
inference(superposition,[],[f23,f82]) ).
fof(f101,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(X0,or(X1,X2))),true,theorem(or(X1,or(X0,X2))),true),
inference(forward_demodulation,[],[f95,f1]) ).
fof(f113,plain,
! [X2,X0,X1] : true = ifeq(true,true,ifeq(theorem(or(not(X0),X1)),true,theorem(or(not(or(X2,X0)),or(X2,X1))),true),true),
inference(superposition,[],[f23,f83]) ).
fof(f119,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,[],[f113,f1]) ).
fof(f127,plain,
! [X0] : true = ifeq(theorem(or(not(r),X0)),true,theorem(or(not(sF1),or(sF0,X0))),true),
inference(superposition,[],[f119,f28]) ).
fof(f137,plain,
! [X0] : true = ifeq(theorem(or(not(r),X0)),true,theorem(or(sF2,or(sF0,X0))),true),
inference(forward_demodulation,[],[f127,f30]) ).
fof(f151,plain,
! [X2,X0,X1] : true = ifeq(true,true,theorem(or(not(or(X2,or(X0,X1))),or(X2,or(X1,X0)))),true),
inference(superposition,[],[f119,f84]) ).
fof(f152,plain,
! [X0,X1] : true = ifeq(true,true,ifeq(theorem(or(X0,X1)),true,theorem(or(X1,X0)),true),true),
inference(superposition,[],[f23,f84]) ).
fof(f158,plain,
! [X0,X1] : true = ifeq(theorem(or(X0,X1)),true,theorem(or(X1,X0)),true),
inference(forward_demodulation,[],[f152,f1]) ).
fof(f159,plain,
! [X2,X0,X1] : true = theorem(or(not(or(X2,or(X0,X1))),or(X2,or(X1,X0)))),
inference(forward_demodulation,[],[f151,f1]) ).
fof(f167,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(not(X0),or(X1,X0))),true),
inference(superposition,[],[f13,f19]) ).
fof(f168,plain,
! [X0,X1] : true = theorem(or(not(X0),or(X1,X0))),
inference(forward_demodulation,[],[f167,f1]) ).
fof(f219,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(not(or(X1,or(X0,X0))),or(X1,X0))),true),
inference(superposition,[],[f119,f81]) ).
fof(f233,plain,
! [X0,X1] : true = theorem(or(not(or(X1,or(X0,X0))),or(X1,X0))),
inference(forward_demodulation,[],[f219,f1]) ).
fof(f239,plain,
true = theorem(or(not(r),sF3)),
inference(superposition,[],[f168,f32]) ).
fof(f242,plain,
! [X2,X0,X1] : true = ifeq(true,true,theorem(or(not(or(X2,X0)),or(X2,or(X1,X0)))),true),
inference(superposition,[],[f119,f168]) ).
fof(f258,plain,
! [X2,X0,X1] : true = theorem(or(not(or(X2,X0)),or(X2,or(X1,X0)))),
inference(forward_demodulation,[],[f242,f1]) ).
fof(f291,plain,
! [X2,X0,X1] : true = ifeq(true,true,ifeq(theorem(or(X0,X1)),true,theorem(or(X0,or(X2,X1))),true),true),
inference(superposition,[],[f23,f258]) ).
fof(f302,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(X0,X1)),true,theorem(or(X0,or(X2,X1))),true),
inference(forward_demodulation,[],[f291,f1]) ).
fof(f320,plain,
! [X0] : true = ifeq(theorem(or(X0,sF3)),true,theorem(or(X0,sF4)),true),
inference(superposition,[],[f302,f34]) ).
fof(f323,plain,
! [X0] : true = ifeq(theorem(or(X0,sF4)),true,theorem(or(X0,sF5)),true),
inference(superposition,[],[f302,f36]) ).
fof(f577,plain,
! [X0,X1] : true = ifeq(true,true,ifeq(theorem(or(X0,or(X1,X1))),true,theorem(or(X0,X1)),true),true),
inference(superposition,[],[f23,f233]) ).
fof(f599,plain,
! [X0,X1] : true = ifeq(theorem(or(X0,or(X1,X1))),true,theorem(or(X0,X1)),true),
inference(forward_demodulation,[],[f577,f1]) ).
fof(f663,plain,
! [X2,X0,X1] : true = ifeq(true,true,ifeq(theorem(or(X0,or(X1,X2))),true,theorem(or(X0,or(X2,X1))),true),true),
inference(superposition,[],[f23,f159]) ).
fof(f688,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(X0,or(X1,X2))),true,theorem(or(X0,or(X2,X1))),true),
inference(forward_demodulation,[],[f663,f1]) ).
fof(f704,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(not(X0),or(X0,X1))),true),
inference(superposition,[],[f688,f168]) ).
fof(f730,plain,
! [X0,X1] : true = theorem(or(not(X0),or(X0,X1))),
inference(forward_demodulation,[],[f704,f1]) ).
fof(f747,plain,
! [X2,X0,X1] : true = ifeq(true,true,theorem(or(not(or(X2,X0)),or(X2,or(X0,X1)))),true),
inference(superposition,[],[f119,f730]) ).
fof(f779,plain,
! [X2,X0,X1] : true = theorem(or(not(or(X2,X0)),or(X2,or(X0,X1)))),
inference(forward_demodulation,[],[f747,f1]) ).
fof(f821,plain,
! [X0] : true = theorem(or(not(or(X0,q)),or(X0,sF3))),
inference(superposition,[],[f779,f32]) ).
fof(f1949,plain,
true = theorem(or(not(or(p,q)),sF4)),
inference(superposition,[],[f821,f34]) ).
fof(f1993,plain,
true = theorem(or(not(sF0),sF4)),
inference(forward_demodulation,[],[f1949,f26]) ).
fof(f5318,plain,
true = ifeq(true,true,theorem(or(not(sF0),sF5)),true),
inference(superposition,[],[f323,f1993]) ).
fof(f5328,plain,
true = theorem(or(not(sF0),sF5)),
inference(forward_demodulation,[],[f5318,f1]) ).
fof(f5379,plain,
! [X0] : true = ifeq(true,true,theorem(or(not(or(X0,sF0)),or(X0,sF5))),true),
inference(superposition,[],[f119,f5328]) ).
fof(f5415,plain,
! [X0] : true = theorem(or(not(or(X0,sF0)),or(X0,sF5))),
inference(forward_demodulation,[],[f5379,f1]) ).
fof(f5480,plain,
true = ifeq(true,true,theorem(or(not(or(sF5,sF0)),sF5)),true),
inference(superposition,[],[f599,f5415]) ).
fof(f5513,plain,
true = theorem(or(not(or(sF5,sF0)),sF5)),
inference(forward_demodulation,[],[f5480,f1]) ).
fof(f8020,plain,
true = ifeq(true,true,theorem(or(not(r),sF4)),true),
inference(superposition,[],[f320,f239]) ).
fof(f8032,plain,
true = theorem(or(not(r),sF4)),
inference(forward_demodulation,[],[f8020,f1]) ).
fof(f8038,plain,
true = ifeq(true,true,theorem(or(sF2,or(sF0,sF4))),true),
inference(superposition,[],[f137,f8032]) ).
fof(f8084,plain,
true = theorem(or(sF2,or(sF0,sF4))),
inference(forward_demodulation,[],[f8038,f1]) ).
fof(f8239,plain,
true = ifeq(true,true,theorem(or(sF0,or(sF2,sF4))),true),
inference(superposition,[],[f101,f8084]) ).
fof(f8285,plain,
true = theorem(or(sF0,or(sF2,sF4))),
inference(forward_demodulation,[],[f8239,f1]) ).
fof(f8288,plain,
true = theorem(or(sF0,sF5)),
inference(forward_demodulation,[],[f8285,f36]) ).
fof(f8293,plain,
true = ifeq(true,true,theorem(or(sF5,sF0)),true),
inference(superposition,[],[f158,f8288]) ).
fof(f8326,plain,
true = theorem(or(sF5,sF0)),
inference(forward_demodulation,[],[f8293,f1]) ).
fof(f8349,plain,
true = ifeq(theorem(or(not(or(sF5,sF0)),sF5)),true,ifeq(true,true,sF6,true),true),
inference(superposition,[],[f40,f8326]) ).
fof(f8359,plain,
true = ifeq(theorem(or(not(or(sF5,sF0)),sF5)),true,sF6,true),
inference(forward_demodulation,[],[f8349,f1]) ).
fof(f8371,plain,
true = ifeq(true,true,sF6,true),
inference(forward_demodulation,[],[f8359,f5513]) ).
fof(f8373,plain,
true = sF6,
inference(forward_demodulation,[],[f8371,f1]) ).
fof(f8375,plain,
$false,
inference(forward_subsumption_resolution,[],[f8373,f39]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL192-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.07 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.44 % Computer : n004.cluster.edu
% 0.17/0.44 % Model : x86_64 x86_64
% 0.17/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44 % Memory : 8046.5625MB
% 0.17/0.44 % OS : Linux 6.8.0-71-generic
% 0.17/0.44 % CPULimit : 300
% 0.17/0.44 % WCLimit : 300
% 0.17/0.44 % DateTime : Sun Sep 27 15:25:37 UTC 2026
% 0.17/0.45 % CPUTime :
% 0.17/0.45 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.65/3.01 % (3665605)Detected a unit-equality problem, will run specialized UEQ schedule.
% 12.65/3.01 % (3665612)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=1340223436:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 12.65/3.01 % (3665615)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=3911033039:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 12.65/3.01 % (3665610)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=2473189024:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 12.65/3.01 % (3665613)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=198589245:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 12.65/3.01 % (3665616)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=3572147134:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 12.65/3.01 % (3665611)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=2315898899:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 12.65/3.01 % (3665614)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=2318588830:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 12.65/3.01 % (3665613)Instruction limit reached!
% 12.65/3.01 % (3665613)------------------------------
% 12.65/3.01 % (3665613)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.65/3.01 % (3665613)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.65/3.01 % (3665613)CaDiCaL version: 2.1.3
% 12.65/3.01 % (3665613)Termination reason: Instruction limit
% 12.65/3.01 % (3665613)Termination phase: Saturation
% 12.65/3.01 % (3665613)Time elapsed: 0.134 s
% 12.65/3.01 % (3665613)Peak memory usage: 89 MB
% 12.65/3.01 % (3665613)Instructions burned: 136 (million)
% 12.65/3.01 % (3665614)Instruction limit reached!
% 12.65/3.01 % (3665614)------------------------------
% 12.65/3.01 % (3665614)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.65/3.01 % (3665614)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.65/3.01 % (3665614)CaDiCaL version: 2.1.3
% 12.65/3.01 % (3665614)Termination reason: Instruction limit
% 12.65/3.01 % (3665614)Termination phase: Saturation
% 12.65/3.01 % (3665614)Time elapsed: 0.175 s
% 12.65/3.01 % (3665614)Peak memory usage: 89 MB
% 12.65/3.01 % (3665614)Instructions burned: 182 (million)
% 12.65/3.01 % (3665615)Instruction limit reached!
% 12.65/3.01 % (3665615)------------------------------
% 12.65/3.01 % (3665615)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.65/3.01 % (3665615)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.65/3.01 % (3665615)CaDiCaL version: 2.1.3
% 12.65/3.01 % (3665615)Termination reason: Instruction limit
% 12.65/3.01 % (3665615)Termination phase: Saturation
% 12.65/3.01 % (3665615)Time elapsed: 0.259 s
% 12.65/3.01 % (3665615)Peak memory usage: 91 MB
% 12.65/3.01 % (3665615)Instructions burned: 263 (million)
% 12.65/3.01 % (3665632)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=3206236908:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2996 on theBenchmark for (2996ds/2051Mi)
% 12.65/3.01 % (3665633)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=1786526736:i=4948:ss=axioms:sgt=16_2995 on theBenchmark for (2995ds/4948Mi)
% 12.65/3.01 % (3665634)lrs+10_5:1_sil=8000:sos=all:urr=on:br=off:flr=on:random_seed=1321827858:i=215:ep=RSTC_2995 on theBenchmark for (2995ds/215Mi)
% 12.65/3.01 % (3665634)Instruction limit reached!
% 12.65/3.01 % (3665634)------------------------------
% 12.65/3.01 % (3665634)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.65/3.01 % (3665634)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.65/3.01 % (3665634)CaDiCaL version: 2.1.3
% 12.65/3.01 % (3665634)Termination reason: Instruction limit
% 12.65/3.01 % (3665634)Termination phase: Saturation
% 12.65/3.01 % (3665634)Time elapsed: 0.179 s
% 12.65/3.01 % (3665634)Peak memory usage: 88 MB
% 12.65/3.01 % (3665634)Instructions burned: 216 (million)
% 12.65/3.01 % (3665638)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=160812931:avsq=on:i=317:avsqr=1,16:kws=arity_squared:add=off:fgj=on:ins=10:fsr=off:gtg=exists_sym_2991 on theBenchmark for (2991ds/317Mi)
% 12.65/3.01 % (3665616)Instruction limit reached!
% 12.65/3.01 % (3665616)------------------------------
% 12.65/3.01 % (3665616)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.65/3.01 % (3665616)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.65/3.01 % (3665616)CaDiCaL version: 2.1.3
% 12.65/3.01 % (3665616)Termination reason: Instruction limit
% 12.65/3.01 % (3665616)Termination phase: Saturation
% 12.65/3.01 % (3665616)Time elapsed: 1.089 s
% 12.65/3.01 % (3665616)Peak memory usage: 101 MB
% 12.65/3.01 % (3665616)Instructions burned: 1187 (million)
% 12.65/3.01 % (3665638)Instruction limit reached!
% 12.65/3.01 % (3665638)------------------------------
% 12.65/3.01 % (3665638)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.65/3.01 % (3665638)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.65/3.01 % (3665638)CaDiCaL version: 2.1.3
% 12.65/3.01 % (3665638)Termination reason: Instruction limit
% 12.65/3.01 % (3665638)Termination phase: Saturation
% 12.65/3.01 % (3665638)Time elapsed: 0.314 s
% 12.65/3.01 % (3665638)Peak memory usage: 96 MB
% 12.65/3.01 % (3665638)Instructions burned: 318 (million)
% 12.65/3.01 % (3665640)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=190734973:i=12125:sd=2:fgj=on:ss=axioms:sgt=64_2986 on theBenchmark for (2986ds/12125Mi)
% 12.65/3.01 % (3665612)First to succeed.
% 12.65/3.01 % (3665612)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3665605"
% 12.65/3.01 % (3665641)lrs+10_32_sil=8000:tgt=ground:prc=on:sp=reverse_arity:spb=non_intro:random_seed=108235059:i=2836:kws=inv_precedence:fgj=on:bd=preordered:ins=10_2984 on theBenchmark for (2984ds/2836Mi)
% 12.65/3.01 % (3665612)Refutation found. Thanks to Tanya!
% 12.65/3.01 % SZS status Unsatisfiable for theBenchmark
% 12.65/3.01 % SZS output start Proof for theBenchmark
% See solution above
% 14.47/3.33 % (3665612)------------------------------
% 14.47/3.33 % (3665612)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 14.47/3.33 % (3665612)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.47/3.33 % (3665612)CaDiCaL version: 2.1.3
% 14.47/3.33 % (3665612)Termination reason: Refutation
% 14.47/3.33 % (3665612)Time elapsed: 1.484 s
% 14.47/3.33 % (3665612)Peak memory usage: 145 MB
% 14.47/3.33 % (3665612)Instructions burned: 2562 (million)
% 14.47/3.33 % (3665612)------------------------------
% 14.47/3.33 % (3665612)------------------------------
% 14.47/3.33 % (3665605)Success in time 1.903 s
% 14.47/3.33 % Vampire exiting
%------------------------------------------------------------------------------