%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : GRP177-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n005.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 10:13:12 AM UTC 2026
% Result : Unsatisfiable 28.23s 4.96s
% Output : Refutation 28.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 20
% Syntax : Number of formulae : 78 ( 78 unt; 6 def)
% Number of atoms : 78 ( 77 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 : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 10 con; 0-2 aty)
% Number of variables : 54 ( 54 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : multiply(identity,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_identity) ).
fof(f2,axiom,
! [X0] : multiply(inverse(X0),X0) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_inverse) ).
fof(f3,plain,
! [X0] : identity = multiply(inverse(X0),X0),
inference(reorient_equations,[],[f2]) ).
fof(f4,axiom,
! [X2,X0,X1] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity) ).
fof(f5,axiom,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_glb) ).
fof(f6,axiom,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_lub) ).
fof(f7,axiom,
! [X2,X0,X1] : greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(greatest_lower_bound(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity_of_glb) ).
fof(f11,axiom,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lub_absorbtion) ).
fof(f12,axiom,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',glb_absorbtion) ).
fof(f14,axiom,
! [X2,X0,X1] : multiply(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(multiply(X0,X1),multiply(X0,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',monotony_glb1) ).
fof(f16,axiom,
! [X2,X0,X1] : multiply(greatest_lower_bound(X0,X1),X2) = greatest_lower_bound(multiply(X0,X2),multiply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',monotony_glb2) ).
fof(f17,axiom,
least_upper_bound(identity,a) = a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p08a_1) ).
fof(f18,plain,
a = least_upper_bound(identity,a),
inference(reorient_equations,[],[f17]) ).
fof(f19,axiom,
least_upper_bound(identity,b) = b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p08a_2) ).
fof(f20,plain,
b = least_upper_bound(identity,b),
inference(reorient_equations,[],[f19]) ).
fof(f21,axiom,
least_upper_bound(identity,c) = c,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p08a_3) ).
fof(f22,plain,
c = least_upper_bound(identity,c),
inference(reorient_equations,[],[f21]) ).
fof(f23,negated_conjecture,
least_upper_bound(greatest_lower_bound(a,multiply(b,c)),multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c))) != multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p08a) ).
fof(f24,plain,
multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c)) != least_upper_bound(greatest_lower_bound(a,multiply(b,c)),multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c))),
inference(reorient_equations,[],[f23]) ).
fof(f25,definition,
sF0 = greatest_lower_bound(a,b),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f26,plain,
greatest_lower_bound(a,b) = sF0,
inference(reorient_equations,[],[f25]) ).
fof(f27,definition,
sF1 = greatest_lower_bound(a,c),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f28,plain,
greatest_lower_bound(a,c) = sF1,
inference(reorient_equations,[],[f27]) ).
fof(f29,definition,
sF2 = multiply(sF0,sF1),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f30,plain,
multiply(sF0,sF1) = sF2,
inference(reorient_equations,[],[f29]) ).
fof(f31,definition,
sF3 = multiply(b,c),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f32,plain,
multiply(b,c) = sF3,
inference(reorient_equations,[],[f31]) ).
fof(f33,definition,
sF4 = greatest_lower_bound(a,sF3),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f34,plain,
greatest_lower_bound(a,sF3) = sF4,
inference(reorient_equations,[],[f33]) ).
fof(f35,definition,
sF5 = least_upper_bound(sF4,sF2),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f36,plain,
least_upper_bound(sF4,sF2) = sF5,
inference(reorient_equations,[],[f35]) ).
fof(f37,plain,
sF2 != sF5,
inference(definition_folding,[],[f24,f36,f30,f28,f26,f34,f32,f30,f28,f26]) ).
fof(f38,plain,
sF5 = least_upper_bound(sF2,sF4),
inference(forward_demodulation,[],[f36,f6]) ).
fof(f40,plain,
identity = greatest_lower_bound(identity,b),
inference(superposition,[],[f12,f20]) ).
fof(f41,plain,
identity = greatest_lower_bound(identity,c),
inference(superposition,[],[f12,f22]) ).
fof(f42,plain,
identity = greatest_lower_bound(identity,a),
inference(superposition,[],[f12,f18]) ).
fof(f48,plain,
! [X0,X1] : least_upper_bound(X1,greatest_lower_bound(X0,X1)) = X1,
inference(superposition,[],[f11,f5]) ).
fof(f61,plain,
! [X0,X1] : multiply(greatest_lower_bound(identity,X1),X0) = greatest_lower_bound(X0,multiply(X1,X0)),
inference(superposition,[],[f16,f1]) ).
fof(f77,plain,
! [X0] : multiply(b,greatest_lower_bound(c,X0)) = greatest_lower_bound(sF3,multiply(b,X0)),
inference(superposition,[],[f14,f32]) ).
fof(f142,plain,
! [X2,X3,X0,X1] : greatest_lower_bound(multiply(X0,X1),greatest_lower_bound(multiply(X0,X2),X3)) = greatest_lower_bound(multiply(X0,greatest_lower_bound(X1,X2)),X3),
inference(superposition,[],[f7,f14]) ).
fof(f145,plain,
! [X0] : greatest_lower_bound(sF1,X0) = greatest_lower_bound(a,greatest_lower_bound(c,X0)),
inference(superposition,[],[f7,f28]) ).
fof(f146,plain,
! [X0] : greatest_lower_bound(a,greatest_lower_bound(sF3,X0)) = greatest_lower_bound(sF4,X0),
inference(superposition,[],[f7,f34]) ).
fof(f186,plain,
! [X0,X1] : multiply(identity,X1) = multiply(inverse(X0),multiply(X0,X1)),
inference(superposition,[],[f4,f3]) ).
fof(f202,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(forward_demodulation,[],[f186,f1]) ).
fof(f215,plain,
! [X0] : multiply(inverse(inverse(X0)),identity) = X0,
inference(superposition,[],[f202,f3]) ).
fof(f216,plain,
! [X0,X1] : multiply(X1,X0) = multiply(inverse(inverse(X1)),X0),
inference(superposition,[],[f202,f202]) ).
fof(f234,plain,
! [X0] : multiply(X0,identity) = X0,
inference(forward_demodulation,[],[f215,f216]) ).
fof(f504,plain,
! [X2,X3,X0,X1] : greatest_lower_bound(multiply(X0,greatest_lower_bound(X3,X2)),multiply(X1,X2)) = greatest_lower_bound(multiply(X0,X3),multiply(greatest_lower_bound(X0,X1),X2)),
inference(superposition,[],[f142,f16]) ).
fof(f637,plain,
! [X0] : greatest_lower_bound(sF4,multiply(b,X0)) = greatest_lower_bound(a,multiply(b,greatest_lower_bound(c,X0))),
inference(superposition,[],[f146,f77]) ).
fof(f887,plain,
! [X0,X1] : greatest_lower_bound(multiply(X0,a),multiply(greatest_lower_bound(X0,X1),c)) = greatest_lower_bound(multiply(X0,sF1),multiply(X1,c)),
inference(superposition,[],[f504,f28]) ).
fof(f2123,plain,
greatest_lower_bound(multiply(identity,a),multiply(identity,c)) = greatest_lower_bound(multiply(identity,sF1),multiply(b,c)),
inference(superposition,[],[f887,f40]) ).
fof(f2180,plain,
greatest_lower_bound(multiply(identity,a),multiply(identity,c)) = greatest_lower_bound(multiply(identity,sF1),sF3),
inference(forward_demodulation,[],[f2123,f32]) ).
fof(f2217,plain,
greatest_lower_bound(multiply(identity,a),multiply(identity,c)) = greatest_lower_bound(sF3,multiply(identity,sF1)),
inference(forward_demodulation,[],[f2180,f5]) ).
fof(f2247,plain,
greatest_lower_bound(multiply(identity,a),multiply(identity,c)) = greatest_lower_bound(sF3,sF1),
inference(forward_demodulation,[],[f2217,f1]) ).
fof(f2267,plain,
greatest_lower_bound(multiply(identity,a),multiply(identity,c)) = greatest_lower_bound(sF1,sF3),
inference(forward_demodulation,[],[f2247,f5]) ).
fof(f2274,plain,
multiply(identity,greatest_lower_bound(a,c)) = greatest_lower_bound(sF1,sF3),
inference(forward_demodulation,[],[f2267,f14]) ).
fof(f2277,plain,
greatest_lower_bound(a,c) = greatest_lower_bound(sF1,sF3),
inference(forward_demodulation,[],[f2274,f1]) ).
fof(f2278,plain,
sF1 = greatest_lower_bound(sF1,sF3),
inference(forward_demodulation,[],[f2277,f28]) ).
fof(f2776,plain,
! [X0] : greatest_lower_bound(sF1,X0) = greatest_lower_bound(a,greatest_lower_bound(X0,c)),
inference(superposition,[],[f145,f5]) ).
fof(f3710,plain,
greatest_lower_bound(a,identity) = greatest_lower_bound(sF1,identity),
inference(superposition,[],[f2776,f41]) ).
fof(f3716,plain,
greatest_lower_bound(sF1,sF3) = greatest_lower_bound(sF4,c),
inference(superposition,[],[f146,f2776]) ).
fof(f3732,plain,
greatest_lower_bound(sF1,sF3) = greatest_lower_bound(c,sF4),
inference(forward_demodulation,[],[f3716,f5]) ).
fof(f3736,plain,
greatest_lower_bound(a,identity) = greatest_lower_bound(identity,sF1),
inference(forward_demodulation,[],[f3710,f5]) ).
fof(f3741,plain,
sF1 = greatest_lower_bound(c,sF4),
inference(forward_demodulation,[],[f3732,f2278]) ).
fof(f3744,plain,
greatest_lower_bound(identity,a) = greatest_lower_bound(identity,sF1),
inference(forward_demodulation,[],[f3736,f5]) ).
fof(f3747,plain,
identity = greatest_lower_bound(identity,sF1),
inference(forward_demodulation,[],[f3744,f42]) ).
fof(f11682,plain,
! [X0,X1] : greatest_lower_bound(multiply(X0,identity),multiply(greatest_lower_bound(X0,X1),sF1)) = greatest_lower_bound(multiply(X0,identity),multiply(X1,sF1)),
inference(superposition,[],[f504,f3747]) ).
fof(f11695,plain,
! [X0,X1] : greatest_lower_bound(X0,multiply(greatest_lower_bound(X0,X1),sF1)) = greatest_lower_bound(X0,multiply(X1,sF1)),
inference(forward_demodulation,[],[f11682,f234]) ).
fof(f11896,plain,
greatest_lower_bound(a,multiply(b,sF1)) = greatest_lower_bound(sF4,multiply(b,sF4)),
inference(superposition,[],[f637,f3741]) ).
fof(f11980,plain,
greatest_lower_bound(a,multiply(b,sF1)) = multiply(greatest_lower_bound(identity,b),sF4),
inference(forward_demodulation,[],[f11896,f61]) ).
fof(f12004,plain,
greatest_lower_bound(a,multiply(b,sF1)) = multiply(identity,sF4),
inference(forward_demodulation,[],[f11980,f40]) ).
fof(f12013,plain,
sF4 = greatest_lower_bound(a,multiply(b,sF1)),
inference(forward_demodulation,[],[f12004,f1]) ).
fof(f26394,plain,
greatest_lower_bound(a,multiply(b,sF1)) = greatest_lower_bound(a,multiply(sF0,sF1)),
inference(superposition,[],[f11695,f26]) ).
fof(f26663,plain,
greatest_lower_bound(a,multiply(b,sF1)) = greatest_lower_bound(a,sF2),
inference(forward_demodulation,[],[f26394,f30]) ).
fof(f26825,plain,
sF4 = greatest_lower_bound(a,sF2),
inference(forward_demodulation,[],[f26663,f12013]) ).
fof(f27148,plain,
sF2 = least_upper_bound(sF2,sF4),
inference(superposition,[],[f48,f26825]) ).
fof(f27187,plain,
sF2 = sF5,
inference(superposition,[],[f38,f27148]) ).
fof(f27243,plain,
$false,
inference(forward_subsumption_resolution,[],[f27187,f37]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP177-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n005.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 09:35:47 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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
% 27.13/4.76 % (3739713)Detected a unit-equality problem, will run specialized UEQ schedule.
% 27.13/4.76 % (3739720)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=3586922322:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 27.13/4.76 % (3739721)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=3257311382:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 27.13/4.76 % (3739718)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=3997260115:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 27.13/4.76 % (3739719)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=1018027070:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 27.13/4.76 % (3739724)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=223233637:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 27.13/4.76 % (3739722)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=234599366:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 27.13/4.76 % (3739723)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=2087130997:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 27.13/4.76 % (3739721)Instruction limit reached!
% 27.13/4.76 % (3739721)------------------------------
% 27.13/4.76 % (3739721)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 27.13/4.76 % (3739721)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 27.13/4.76 % (3739721)CaDiCaL version: 2.1.3
% 27.13/4.76 % (3739721)Termination reason: Instruction limit
% 27.13/4.76 % (3739721)Termination phase: Saturation
% 27.13/4.76 % (3739721)Time elapsed: 0.082 s
% 27.13/4.76 % (3739721)Peak memory usage: 89 MB
% 27.13/4.76 % (3739721)Instructions burned: 138 (million)
% 27.13/4.76 % (3739722)Instruction limit reached!
% 27.13/4.76 % (3739722)------------------------------
% 27.13/4.76 % (3739722)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 27.13/4.76 % (3739722)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 27.13/4.76 % (3739722)CaDiCaL version: 2.1.3
% 27.13/4.76 % (3739722)Termination reason: Instruction limit
% 27.13/4.76 % (3739722)Termination phase: Saturation
% 27.13/4.76 % (3739722)Time elapsed: 0.107 s
% 27.13/4.76 % (3739722)Peak memory usage: 89 MB
% 27.13/4.76 % (3739722)Instructions burned: 181 (million)
% 27.13/4.76 % (3739723)Instruction limit reached!
% 27.13/4.76 % (3739723)------------------------------
% 27.13/4.76 % (3739723)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 27.13/4.76 % (3739723)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 27.13/4.76 % (3739723)CaDiCaL version: 2.1.3
% 27.13/4.76 % (3739723)Termination reason: Instruction limit
% 27.13/4.76 % (3739723)Termination phase: Saturation
% 27.13/4.76 % (3739723)Time elapsed: 0.165 s
% 27.13/4.76 % (3739723)Peak memory usage: 91 MB
% 27.13/4.76 % (3739723)Instructions burned: 257 (million)
% 27.13/4.76 % (3739732)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=915610587:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2997 on theBenchmark for (2997ds/2051Mi)
% 27.13/4.76 % (3739733)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=893223038:i=4948:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/4948Mi)
% 27.13/4.76 % (3739734)lrs+10_5:1_sil=8000:sos=all:urr=on:br=off:flr=on:random_seed=597536674:i=215:ep=RSTC_2996 on theBenchmark for (2996ds/215Mi)
% 27.13/4.76 % (3739734)Instruction limit reached!
% 27.13/4.76 % (3739734)------------------------------
% 27.13/4.76 % (3739734)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 27.13/4.76 % (3739734)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 27.13/4.76 % (3739734)CaDiCaL version: 2.1.3
% 27.13/4.76 % (3739734)Termination reason: Instruction limit
% 27.13/4.76 % (3739734)Termination phase: Saturation
% 27.13/4.76 % (3739734)Time elapsed: 0.115 s
% 27.13/4.76 % (3739734)Peak memory usage: 93 MB
% 27.13/4.76 % (3739734)Instructions burned: 216 (million)
% 27.13/4.76 % (3739738)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=494376389: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)
% 27.13/4.76 % (3739724)Instruction limit reached!
% 27.13/4.76 % (3739724)------------------------------
% 27.13/4.76 % (3739724)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 27.13/4.76 % (3739724)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 27.13/4.76 % (3739724)CaDiCaL version: 2.1.3
% 27.13/4.76 % (3739724)Termination reason: Instruction limit
% 27.13/4.76 % (3739724)Termination phase: Saturation
% 27.13/4.76 % (3739724)Time elapsed: 0.632 s
% 27.13/4.76 % (3739724)Peak memory usage: 99 MB
% 27.13/4.76 % (3739724)Instructions burned: 1187 (million)
% 27.13/4.76 % (3739738)Instruction limit reached!
% 27.13/4.76 % (3739738)------------------------------
% 27.13/4.76 % (3739738)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 27.13/4.76 % (3739738)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 27.13/4.76 % (3739738)CaDiCaL version: 2.1.3
% 27.13/4.76 % (3739738)Termination reason: Instruction limit
% 27.13/4.76 % (3739738)Termination phase: Saturation
% 27.13/4.76 % (3739738)Time elapsed: 0.201 s
% 27.13/4.76 % (3739738)Peak memory usage: 93 MB
% 27.13/4.76 % (3739738)Instructions burned: 318 (million)
% 27.13/4.76 % (3739740)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=2898000622:i=12125:sd=2:fgj=on:ss=axioms:sgt=64_2992 on theBenchmark for (2992ds/12125Mi)
% 27.13/4.76 % (3739742)lrs+10_32_sil=8000:tgt=ground:prc=on:sp=reverse_arity:spb=non_intro:random_seed=3800316141:i=2836:kws=inv_precedence:fgj=on:bd=preordered:ins=10_2990 on theBenchmark for (2990ds/2836Mi)
% 27.13/4.76 % (3739732)Instruction limit reached!
% 27.13/4.76 % (3739732)------------------------------
% 27.13/4.76 % (3739732)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 27.13/4.76 % (3739732)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 27.13/4.76 % (3739732)CaDiCaL version: 2.1.3
% 27.13/4.76 % (3739732)Termination reason: Instruction limit
% 27.13/4.76 % (3739732)Termination phase: Saturation
% 27.13/4.76 % (3739732)Time elapsed: 1.300 s
% 27.13/4.76 % (3739732)Peak memory usage: 142 MB
% 27.13/4.76 % (3739732)Instructions burned: 2052 (million)
% 27.13/4.76 % (3739744)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:lma=off:kmz=on:random_seed=3977360175:i=14534:kws=arity:fgj=on:bd=preordered:ins=6:ss=axioms:sgt=30_2983 on theBenchmark for (2983ds/14534Mi)
% 27.13/4.76 % (3739742)Instruction limit reached!
% 27.13/4.76 % (3739742)------------------------------
% 27.13/4.76 % (3739742)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 27.13/4.76 % (3739742)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 27.13/4.76 % (3739742)CaDiCaL version: 2.1.3
% 27.13/4.76 % (3739742)Termination reason: Instruction limit
% 27.13/4.76 % (3739742)Termination phase: Saturation
% 27.13/4.76 % (3739742)Time elapsed: 1.831 s
% 27.13/4.76 % (3739742)Peak memory usage: 150 MB
% 27.13/4.76 % (3739742)Instructions burned: 2836 (million)
% 27.13/4.76 % (3739746)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:sas=cadical:sp=reverse_frequency:bsr=on:alpa=false:sac=on:random_seed=893526063:i=11832:s2at=3:bs=on:bd=preordered:fsd=on_2970 on theBenchmark for (2970ds/11832Mi)
% 27.13/4.76 % (3739733)Instruction limit reached!
% 27.13/4.76 % (3739733)------------------------------
% 27.13/4.76 % (3739733)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 27.13/4.76 % (3739733)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 27.13/4.76 % (3739733)CaDiCaL version: 2.1.3
% 27.13/4.76 % (3739733)Termination reason: Instruction limit
% 27.13/4.76 % (3739733)Termination phase: Saturation
% 27.13/4.76 % (3739733)Time elapsed: 2.896 s
% 27.13/4.76 % (3739733)Peak memory usage: 170 MB
% 27.13/4.76 % (3739733)Instructions burned: 4950 (million)
% 27.13/4.76 % (3739748)lrs+10_1_to=lpo:ncem=casc2026/models/loop6.pt:sil=32000:npcc=on:drc=off:fde=unused:sp=const_min:spb=goal:fd=preordered:random_seed=4184347208:i=2279:fgj=on:bd=all_2966 on theBenchmark for (2966ds/2279Mi)
% 27.13/4.76 % (3739740)First to succeed.
% 27.13/4.76 % (3739740)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3739713"
% 28.23/4.96 % (3739740)Refutation found. Thanks to Tanya!
% 28.23/4.96 % SZS status Unsatisfiable for theBenchmark
% 28.23/4.96 % SZS output start Proof for theBenchmark
% See solution above
% 28.23/4.96 % (3739740)------------------------------
% 28.23/4.96 % (3739740)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 28.23/4.96 % (3739740)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 28.23/4.96 % (3739740)CaDiCaL version: 2.1.3
% 28.23/4.96 % (3739740)Termination reason: Refutation
% 28.23/4.96 % (3739740)Time elapsed: 2.709 s
% 28.23/4.96 % (3739740)Peak memory usage: 167 MB
% 28.23/4.96 % (3739740)Instructions burned: 4512 (million)
% 28.23/4.96 % (3739740)------------------------------
% 28.23/4.96 % (3739740)------------------------------
% 28.23/4.96 % (3739713)Success in time 3.91 s
% 28.23/4.96 % Vampire exiting
%------------------------------------------------------------------------------