%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL245-10 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n007.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:44 AM UTC 2026
% Result : Unsatisfiable 4.94s 1.76s
% Output : Refutation 6.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 23
% Syntax : Number of formulae : 104 ( 104 unt; 12 def)
% Number of atoms : 104 ( 103 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 : 9 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 23 ( 23 usr; 16 con; 0-4 aty)
% Number of variables : 126 ( 126 !; 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,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_defn) ).
fof(f17,negated_conjecture,
theorem(implies(and(implies(q,r),implies(p,q)),implies(p,r))) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f18,plain,
true != theorem(implies(and(implies(q,r),implies(p,q)),implies(p,r))),
inference(reorient_equations,[],[f17]) ).
fof(f19,plain,
! [X0] : true = axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f2,f11]) ).
fof(f20,plain,
! [X0,X1] : true = axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f4,f11]) ).
fof(f21,plain,
! [X0,X1] : true = axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f6,f11]) ).
fof(f22,plain,
! [X2,X0,X1] : true = axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f8,f11]) ).
fof(f23,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(f24,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(f25,plain,
true != theorem(or(not(not(or(not(or(not(q),r)),not(or(not(p),q))))),or(not(p),r))),
inference(definition_unfolding,[],[f18,f11,f16,f11,f11,f11]) ).
fof(f26,definition,
sF0 = not(q),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f27,plain,
not(q) = sF0,
inference(reorient_equations,[],[f26]) ).
fof(f28,definition,
sF1 = or(sF0,r),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f29,plain,
or(sF0,r) = sF1,
inference(reorient_equations,[],[f28]) ).
fof(f30,definition,
sF2 = not(sF1),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f31,plain,
not(sF1) = sF2,
inference(reorient_equations,[],[f30]) ).
fof(f32,definition,
sF3 = not(p),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f33,plain,
not(p) = sF3,
inference(reorient_equations,[],[f32]) ).
fof(f34,definition,
sF4 = or(sF3,q),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f35,plain,
or(sF3,q) = sF4,
inference(reorient_equations,[],[f34]) ).
fof(f36,definition,
sF5 = not(sF4),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f37,plain,
not(sF4) = sF5,
inference(reorient_equations,[],[f36]) ).
fof(f38,definition,
sF6 = or(sF2,sF5),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f39,plain,
or(sF2,sF5) = sF6,
inference(reorient_equations,[],[f38]) ).
fof(f40,definition,
sF7 = not(sF6),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
fof(f41,plain,
not(sF6) = sF7,
inference(reorient_equations,[],[f40]) ).
fof(f42,definition,
sF8 = not(sF7),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
fof(f43,plain,
not(sF7) = sF8,
inference(reorient_equations,[],[f42]) ).
fof(f44,definition,
sF9 = or(sF3,r),
introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).
fof(f45,plain,
or(sF3,r) = sF9,
inference(reorient_equations,[],[f44]) ).
fof(f46,definition,
sF10 = or(sF8,sF9),
introduced(definition,[new_symbols(definition,[sF10])],[function_definition]) ).
fof(f47,plain,
or(sF8,sF9) = sF10,
inference(reorient_equations,[],[f46]) ).
fof(f48,definition,
sF11 = theorem(sF10),
introduced(definition,[new_symbols(definition,[sF11])],[function_definition]) ).
fof(f49,plain,
theorem(sF10) = sF11,
inference(reorient_equations,[],[f48]) ).
fof(f50,plain,
true != sF11,
inference(definition_folding,[],[f25,f49,f47,f45,f33,f43,f41,f39,f37,f35,f33,f31,f29,f27]) ).
fof(f66,plain,
! [X0] : true = axiom(or(not(or(not(q),X0)),or(not(sF4),or(sF3,X0)))),
inference(superposition,[],[f23,f35]) ).
fof(f72,plain,
! [X0] : true = axiom(or(not(or(not(q),X0)),or(sF5,or(sF3,X0)))),
inference(forward_demodulation,[],[f66,f37]) ).
fof(f73,plain,
! [X0] : true = axiom(or(not(or(sF0,X0)),or(sF5,or(sF3,X0)))),
inference(forward_demodulation,[],[f72,f27]) ).
fof(f104,plain,
true = axiom(or(not(or(sF0,r)),or(sF5,sF9))),
inference(superposition,[],[f73,f45]) ).
fof(f105,plain,
true = axiom(or(not(sF1),or(sF5,sF9))),
inference(forward_demodulation,[],[f104,f29]) ).
fof(f107,plain,
true = axiom(or(sF2,or(sF5,sF9))),
inference(forward_demodulation,[],[f105,f31]) ).
fof(f109,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(not(or(X0,X1)),or(X1,X0))),true),
inference(superposition,[],[f13,f21]) ).
fof(f110,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,f22]) ).
fof(f111,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,f23]) ).
fof(f113,plain,
! [X0] : true = ifeq(true,true,theorem(or(not(or(X0,X0)),X0)),true),
inference(superposition,[],[f13,f19]) ).
fof(f115,plain,
! [X0] : true = theorem(or(not(or(X0,X0)),X0)),
inference(forward_demodulation,[],[f113,f1]) ).
fof(f117,plain,
! [X2,X0,X1] : true = theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(forward_demodulation,[],[f111,f1]) ).
fof(f118,plain,
! [X2,X0,X1] : true = theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(forward_demodulation,[],[f110,f1]) ).
fof(f119,plain,
! [X0,X1] : true = theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(forward_demodulation,[],[f109,f1]) ).
fof(f136,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,[],[f24,f117]) ).
fof(f142,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,[],[f136,f1]) ).
fof(f183,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,[],[f24,f118]) ).
fof(f189,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(X0,or(X1,X2))),true,theorem(or(X1,or(X0,X2))),true),
inference(forward_demodulation,[],[f183,f1]) ).
fof(f202,plain,
! [X2,X0,X1] : true = ifeq(true,true,theorem(or(not(or(X2,or(X0,X1))),or(X2,or(X1,X0)))),true),
inference(superposition,[],[f142,f119]) ).
fof(f203,plain,
! [X0,X1] : true = ifeq(true,true,ifeq(theorem(or(X0,X1)),true,theorem(or(X1,X0)),true),true),
inference(superposition,[],[f24,f119]) ).
fof(f209,plain,
! [X0,X1] : true = ifeq(theorem(or(X0,X1)),true,theorem(or(X1,X0)),true),
inference(forward_demodulation,[],[f203,f1]) ).
fof(f210,plain,
! [X2,X0,X1] : true = theorem(or(not(or(X2,or(X0,X1))),or(X2,or(X1,X0)))),
inference(forward_demodulation,[],[f202,f1]) ).
fof(f245,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(not(or(X1,or(X0,X0))),or(X1,X0))),true),
inference(superposition,[],[f142,f115]) ).
fof(f256,plain,
! [X0,X1] : true = theorem(or(not(or(X1,or(X0,X0))),or(X1,X0))),
inference(forward_demodulation,[],[f245,f1]) ).
fof(f369,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(not(X0),or(X1,X0))),true),
inference(superposition,[],[f13,f20]) ).
fof(f370,plain,
! [X0,X1] : true = theorem(or(not(X0),or(X1,X0))),
inference(forward_demodulation,[],[f369,f1]) ).
fof(f372,plain,
true = ifeq(true,true,theorem(or(sF2,or(sF5,sF9))),true),
inference(superposition,[],[f13,f107]) ).
fof(f373,plain,
true = theorem(or(sF2,or(sF5,sF9))),
inference(forward_demodulation,[],[f372,f1]) ).
fof(f381,plain,
! [X0,X1] : true = ifeq(true,true,ifeq(theorem(or(X0,or(X1,X1))),true,theorem(or(X0,X1)),true),true),
inference(superposition,[],[f24,f256]) ).
fof(f394,plain,
! [X0,X1] : true = ifeq(theorem(or(X0,or(X1,X1))),true,theorem(or(X0,X1)),true),
inference(forward_demodulation,[],[f381,f1]) ).
fof(f437,plain,
! [X0] : true = ifeq(true,true,theorem(or(not(X0),X0)),true),
inference(superposition,[],[f394,f370]) ).
fof(f449,plain,
! [X0] : true = theorem(or(not(X0),X0)),
inference(forward_demodulation,[],[f437,f1]) ).
fof(f473,plain,
! [X0] : true = ifeq(true,true,theorem(or(X0,not(X0))),true),
inference(superposition,[],[f209,f449]) ).
fof(f481,plain,
! [X0] : true = theorem(or(X0,not(X0))),
inference(forward_demodulation,[],[f473,f1]) ).
fof(f574,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(not(or(X1,X0)),or(X1,not(not(X0))))),true),
inference(superposition,[],[f142,f481]) ).
fof(f584,plain,
! [X0,X1] : true = theorem(or(not(or(X1,X0)),or(X1,not(not(X0))))),
inference(forward_demodulation,[],[f574,f1]) ).
fof(f919,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,[],[f24,f210]) ).
fof(f943,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(X0,or(X1,X2))),true,theorem(or(X0,or(X2,X1))),true),
inference(forward_demodulation,[],[f919,f1]) ).
fof(f961,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(not(or(X0,X1)),or(not(not(X1)),X0))),true),
inference(superposition,[],[f943,f584]) ).
fof(f992,plain,
! [X0,X1] : true = theorem(or(not(or(X0,X1)),or(not(not(X1)),X0))),
inference(forward_demodulation,[],[f961,f1]) ).
fof(f1372,plain,
! [X0,X1] : true = ifeq(true,true,ifeq(theorem(or(X0,X1)),true,theorem(or(not(not(X1)),X0)),true),true),
inference(superposition,[],[f24,f992]) ).
fof(f1403,plain,
! [X0,X1] : true = ifeq(theorem(or(X0,X1)),true,theorem(or(not(not(X1)),X0)),true),
inference(forward_demodulation,[],[f1372,f1]) ).
fof(f2365,plain,
! [X0] : true = ifeq(theorem(or(X0,sF6)),true,theorem(or(not(sF7),X0)),true),
inference(superposition,[],[f1403,f41]) ).
fof(f2376,plain,
! [X0] : true = ifeq(theorem(or(X0,sF6)),true,theorem(or(sF8,X0)),true),
inference(forward_demodulation,[],[f2365,f43]) ).
fof(f2420,plain,
true = ifeq(theorem(or(sF9,sF6)),true,theorem(sF10),true),
inference(superposition,[],[f2376,f47]) ).
fof(f2425,plain,
true = ifeq(theorem(or(sF9,sF6)),true,sF11,true),
inference(forward_demodulation,[],[f2420,f49]) ).
fof(f2961,plain,
true = ifeq(true,true,theorem(or(sF2,or(sF9,sF5))),true),
inference(superposition,[],[f943,f373]) ).
fof(f2993,plain,
true = theorem(or(sF2,or(sF9,sF5))),
inference(forward_demodulation,[],[f2961,f1]) ).
fof(f2997,plain,
true = ifeq(true,true,theorem(or(sF9,or(sF2,sF5))),true),
inference(superposition,[],[f189,f2993]) ).
fof(f3033,plain,
true = theorem(or(sF9,or(sF2,sF5))),
inference(forward_demodulation,[],[f2997,f1]) ).
fof(f3035,plain,
true = theorem(or(sF9,sF6)),
inference(forward_demodulation,[],[f3033,f39]) ).
fof(f3036,plain,
true = ifeq(true,true,sF11,true),
inference(backward_demodulation,[],[f2425,f3035]) ).
fof(f3037,plain,
true = sF11,
inference(forward_demodulation,[],[f3036,f1]) ).
fof(f3038,plain,
$false,
inference(forward_subsumption_resolution,[],[f3037,f50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL245-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n007.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sun Sep 27 15:28:10 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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
% 4.94/1.76 % (1588358)Detected a unit-equality problem, will run specialized UEQ schedule.
% 4.94/1.76 % (1588505)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=1835418150:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 4.94/1.76 % (1588504)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=2432720135:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 4.94/1.76 % (1588503)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=124961147:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 4.94/1.76 % (1588506)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=2915451812:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 4.94/1.76 % (1588507)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=4097016577:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 4.94/1.76 % (1588508)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=2489886034:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 4.94/1.76 % (1588509)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=1178382508:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 4.94/1.76 % (1588506)Instruction limit reached!
% 4.94/1.76 % (1588506)------------------------------
% 4.94/1.76 % (1588506)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.94/1.76 % (1588506)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.94/1.76 % (1588506)CaDiCaL version: 2.1.3
% 4.94/1.76 % (1588506)Termination reason: Instruction limit
% 4.94/1.76 % (1588506)Termination phase: Saturation
% 4.94/1.76 % (1588506)Time elapsed: 0.086 s
% 4.94/1.76 % (1588506)Peak memory usage: 89 MB
% 4.94/1.76 % (1588506)Instructions burned: 138 (million)
% 4.94/1.76 % (1588507)Instruction limit reached!
% 4.94/1.76 % (1588507)------------------------------
% 4.94/1.76 % (1588507)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.94/1.76 % (1588507)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.94/1.76 % (1588507)CaDiCaL version: 2.1.3
% 4.94/1.76 % (1588507)Termination reason: Instruction limit
% 4.94/1.76 % (1588507)Termination phase: Saturation
% 4.94/1.76 % (1588507)Time elapsed: 0.104 s
% 4.94/1.76 % (1588507)Peak memory usage: 89 MB
% 4.94/1.76 % (1588507)Instructions burned: 181 (million)
% 4.94/1.76 % (1588508)Instruction limit reached!
% 4.94/1.76 % (1588508)------------------------------
% 4.94/1.76 % (1588508)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.94/1.76 % (1588508)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.94/1.76 % (1588508)CaDiCaL version: 2.1.3
% 4.94/1.76 % (1588508)Termination reason: Instruction limit
% 4.94/1.76 % (1588508)Termination phase: Saturation
% 4.94/1.76 % (1588508)Time elapsed: 0.154 s
% 4.94/1.76 % (1588508)Peak memory usage: 90 MB
% 4.94/1.76 % (1588508)Instructions burned: 258 (million)
% 4.94/1.76 % (1588517)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=1949421938:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2997 on theBenchmark for (2997ds/2051Mi)
% 4.94/1.76 % (1588518)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=1161661194:i=4948:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/4948Mi)
% 4.94/1.76 % (1588519)lrs+10_5:1_sil=8000:sos=all:urr=on:br=off:flr=on:random_seed=3238301229:i=215:ep=RSTC_2996 on theBenchmark for (2996ds/215Mi)
% 4.94/1.76 % (1588519)Instruction limit reached!
% 4.94/1.76 % (1588519)------------------------------
% 4.94/1.76 % (1588519)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.94/1.76 % (1588519)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.94/1.76 % (1588519)CaDiCaL version: 2.1.3
% 4.94/1.76 % (1588519)Termination reason: Instruction limit
% 4.94/1.76 % (1588519)Termination phase: Saturation
% 4.94/1.76 % (1588519)Time elapsed: 0.109 s
% 4.94/1.76 % (1588519)Peak memory usage: 88 MB
% 4.94/1.76 % (1588519)Instructions burned: 216 (million)
% 4.94/1.76 % (1588505)First to succeed.
% 4.94/1.76 % (1588505)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1588358"
% 4.94/1.76 % (1588523)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=4233227427:avsq=on:i=317:avsqr=1,16:kws=arity_squared:add=off:fgj=on:ins=10:fsr=off:gtg=exists_sym_2994 on theBenchmark for (2994ds/317Mi)
% 4.94/1.76 % (1588509)Instruction limit reached!
% 4.94/1.76 % (1588509)------------------------------
% 4.94/1.76 % (1588509)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.94/1.76 % (1588509)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.94/1.76 % (1588509)CaDiCaL version: 2.1.3
% 4.94/1.76 % (1588509)Termination reason: Instruction limit
% 4.94/1.76 % (1588509)Termination phase: Saturation
% 4.94/1.76 % (1588509)Time elapsed: 0.697 s
% 4.94/1.76 % (1588509)Peak memory usage: 101 MB
% 4.94/1.76 % (1588509)Instructions burned: 1188 (million)
% 4.94/1.76 % (1588505)Refutation found. Thanks to Tanya!
% 4.94/1.76 % SZS status Unsatisfiable for theBenchmark
% 4.94/1.76 % SZS output start Proof for theBenchmark
% See solution above
% 6.95/1.96 % (1588505)------------------------------
% 6.95/1.96 % (1588505)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.95/1.96 % (1588505)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.95/1.96 % (1588505)CaDiCaL version: 2.1.3
% 6.95/1.96 % (1588505)Termination reason: Refutation
% 6.95/1.96 % (1588505)Time elapsed: 0.618 s
% 6.95/1.96 % (1588505)Peak memory usage: 137 MB
% 6.95/1.96 % (1588505)Instructions burned: 1753 (million)
% 6.95/1.96 % (1588505)------------------------------
% 6.95/1.96 % (1588505)------------------------------
% 6.95/1.96 % (1588358)Success in time 0.909 s
% 6.95/1.96 % Vampire exiting
%------------------------------------------------------------------------------