%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : GRP183-4 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:15 AM UTC 2026
% Result : Unsatisfiable 8.87s 2.10s
% Output : Refutation 9.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 19
% Syntax : Number of formulae : 91 ( 91 unt; 4 def)
% Number of atoms : 91 ( 90 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 81 ( 81 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : multiply(identity,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_identity) ).
fof(f2,axiom,
! [X0] : multiply(inverse(X0),X0) = identity,
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',associativity) ).
fof(f5,axiom,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_glb) ).
fof(f6,axiom,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',associativity_of_glb) ).
fof(f8,axiom,
! [X2,X0,X1] : least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(least_upper_bound(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity_of_lub) ).
fof(f11,axiom,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lub_absorbtion) ).
fof(f12,axiom,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',glb_absorbtion) ).
fof(f13,axiom,
! [X2,X0,X1] : multiply(X0,least_upper_bound(X1,X2)) = least_upper_bound(multiply(X0,X1),multiply(X0,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',monotony_lub1) ).
fof(f15,axiom,
! [X2,X0,X1] : multiply(least_upper_bound(X0,X1),X2) = least_upper_bound(multiply(X0,X2),multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',monotony_lub2) ).
fof(f17,axiom,
inverse(identity) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p20x_1) ).
fof(f18,plain,
identity = inverse(identity),
inference(reorient_equations,[],[f17]) ).
fof(f19,axiom,
! [X0] : inverse(inverse(X0)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p20x_2) ).
fof(f20,axiom,
! [X0,X1] : inverse(multiply(X0,X1)) = multiply(inverse(X1),inverse(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p20x_3) ).
fof(f21,negated_conjecture,
greatest_lower_bound(least_upper_bound(a,identity),least_upper_bound(inverse(a),identity)) != identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_20x) ).
fof(f22,plain,
identity != greatest_lower_bound(least_upper_bound(a,identity),least_upper_bound(inverse(a),identity)),
inference(reorient_equations,[],[f21]) ).
fof(f23,definition,
sF0 = least_upper_bound(a,identity),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f24,plain,
least_upper_bound(a,identity) = sF0,
inference(reorient_equations,[],[f23]) ).
fof(f25,definition,
sF1 = inverse(a),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f26,plain,
inverse(a) = sF1,
inference(reorient_equations,[],[f25]) ).
fof(f27,definition,
sF2 = least_upper_bound(sF1,identity),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f28,plain,
least_upper_bound(sF1,identity) = sF2,
inference(reorient_equations,[],[f27]) ).
fof(f29,definition,
sF3 = greatest_lower_bound(sF0,sF2),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f30,plain,
greatest_lower_bound(sF0,sF2) = sF3,
inference(reorient_equations,[],[f29]) ).
fof(f31,plain,
identity != sF3,
inference(definition_folding,[],[f22,f30,f28,f26,f24]) ).
fof(f32,plain,
sF2 = least_upper_bound(identity,sF1),
inference(forward_demodulation,[],[f28,f6]) ).
fof(f33,plain,
sF3 = greatest_lower_bound(sF2,sF0),
inference(forward_demodulation,[],[f30,f5]) ).
fof(f34,plain,
sF2 = least_upper_bound(identity,inverse(a)),
inference(forward_demodulation,[],[f32,f26]) ).
fof(f35,plain,
sF3 = greatest_lower_bound(sF2,least_upper_bound(a,identity)),
inference(forward_demodulation,[],[f33,f24]) ).
fof(f36,plain,
sF3 = greatest_lower_bound(least_upper_bound(a,identity),sF2),
inference(forward_demodulation,[],[f35,f5]) ).
fof(f39,plain,
! [X0] : identity = multiply(X0,inverse(X0)),
inference(superposition,[],[f3,f19]) ).
fof(f44,plain,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X1,X0)) = X0,
inference(superposition,[],[f11,f5]) ).
fof(f47,plain,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X1,X0)) = X0,
inference(superposition,[],[f12,f6]) ).
fof(f49,plain,
identity = greatest_lower_bound(identity,sF2),
inference(superposition,[],[f12,f34]) ).
fof(f52,plain,
least_upper_bound(a,identity) = least_upper_bound(least_upper_bound(a,identity),sF3),
inference(superposition,[],[f11,f36]) ).
fof(f53,plain,
least_upper_bound(a,identity) = least_upper_bound(sF3,least_upper_bound(a,identity)),
inference(forward_demodulation,[],[f52,f6]) ).
fof(f59,plain,
sF2 = least_upper_bound(sF2,sF3),
inference(superposition,[],[f44,f36]) ).
fof(f61,plain,
sF2 = least_upper_bound(sF3,sF2),
inference(forward_demodulation,[],[f59,f6]) ).
fof(f77,plain,
! [X0,X1] : least_upper_bound(X1,X0) = least_upper_bound(least_upper_bound(X1,X0),X0),
inference(superposition,[],[f44,f47]) ).
fof(f79,plain,
! [X0,X1] : least_upper_bound(X1,X0) = least_upper_bound(X0,least_upper_bound(X1,X0)),
inference(forward_demodulation,[],[f77,f6]) ).
fof(f160,plain,
! [X0] : inverse(multiply(identity,X0)) = multiply(inverse(X0),identity),
inference(superposition,[],[f20,f18]) ).
fof(f162,plain,
! [X0] : inverse(X0) = multiply(inverse(X0),identity),
inference(forward_demodulation,[],[f160,f1]) ).
fof(f165,plain,
! [X0] : multiply(X0,identity) = X0,
inference(superposition,[],[f162,f19]) ).
fof(f192,plain,
! [X0,X1] : multiply(identity,X1) = multiply(X0,multiply(inverse(X0),X1)),
inference(superposition,[],[f4,f39]) ).
fof(f197,plain,
! [X0,X1] : multiply(X0,multiply(inverse(X0),X1)) = X1,
inference(forward_demodulation,[],[f192,f1]) ).
fof(f219,plain,
! [X0,X1] : inverse(X0) = multiply(X1,inverse(multiply(X0,X1))),
inference(superposition,[],[f197,f20]) ).
fof(f349,plain,
! [X2,X0,X1] : greatest_lower_bound(X0,X2) = greatest_lower_bound(X0,greatest_lower_bound(least_upper_bound(X1,X0),X2)),
inference(superposition,[],[f7,f47]) ).
fof(f350,plain,
! [X0] : greatest_lower_bound(identity,greatest_lower_bound(sF2,X0)) = greatest_lower_bound(identity,X0),
inference(superposition,[],[f7,f49]) ).
fof(f379,plain,
! [X0] : greatest_lower_bound(identity,X0) = greatest_lower_bound(identity,greatest_lower_bound(X0,sF2)),
inference(superposition,[],[f350,f5]) ).
fof(f575,plain,
greatest_lower_bound(identity,sF3) = greatest_lower_bound(identity,least_upper_bound(a,identity)),
inference(superposition,[],[f379,f36]) ).
fof(f587,plain,
identity = greatest_lower_bound(identity,sF3),
inference(forward_demodulation,[],[f575,f47]) ).
fof(f596,plain,
sF3 = least_upper_bound(sF3,identity),
inference(superposition,[],[f44,f587]) ).
fof(f601,plain,
sF3 = least_upper_bound(identity,sF3),
inference(forward_demodulation,[],[f596,f6]) ).
fof(f908,plain,
! [X2,X0,X1] : least_upper_bound(X1,least_upper_bound(X2,X0)) = least_upper_bound(least_upper_bound(X2,X1),X0),
inference(superposition,[],[f8,f6]) ).
fof(f915,plain,
! [X0] : least_upper_bound(sF2,X0) = least_upper_bound(identity,least_upper_bound(inverse(a),X0)),
inference(superposition,[],[f8,f34]) ).
fof(f919,plain,
! [X0] : least_upper_bound(sF3,X0) = least_upper_bound(identity,least_upper_bound(sF3,X0)),
inference(superposition,[],[f8,f601]) ).
fof(f1730,plain,
! [X0] : least_upper_bound(X0,sF3) = least_upper_bound(identity,least_upper_bound(X0,sF3)),
inference(superposition,[],[f919,f79]) ).
fof(f2011,plain,
least_upper_bound(sF2,sF3) = least_upper_bound(inverse(a),sF3),
inference(superposition,[],[f915,f1730]) ).
fof(f2026,plain,
least_upper_bound(sF3,sF2) = least_upper_bound(inverse(a),sF3),
inference(forward_demodulation,[],[f2011,f6]) ).
fof(f2038,plain,
sF2 = least_upper_bound(inverse(a),sF3),
inference(forward_demodulation,[],[f2026,f61]) ).
fof(f2047,plain,
! [X0,X1] : multiply(X1,least_upper_bound(identity,X0)) = least_upper_bound(X1,multiply(X1,X0)),
inference(superposition,[],[f13,f165]) ).
fof(f3102,plain,
! [X0] : least_upper_bound(least_upper_bound(a,identity),X0) = least_upper_bound(least_upper_bound(a,identity),least_upper_bound(sF3,X0)),
inference(superposition,[],[f908,f53]) ).
fof(f3138,plain,
! [X0] : least_upper_bound(least_upper_bound(a,identity),X0) = least_upper_bound(a,least_upper_bound(identity,least_upper_bound(sF3,X0))),
inference(forward_demodulation,[],[f3102,f8]) ).
fof(f3179,plain,
! [X0] : least_upper_bound(least_upper_bound(a,identity),X0) = least_upper_bound(a,least_upper_bound(sF3,X0)),
inference(forward_demodulation,[],[f3138,f919]) ).
fof(f3195,plain,
! [X0] : least_upper_bound(a,least_upper_bound(identity,X0)) = least_upper_bound(a,least_upper_bound(sF3,X0)),
inference(forward_demodulation,[],[f3179,f8]) ).
fof(f5372,plain,
! [X0] : least_upper_bound(a,least_upper_bound(identity,multiply(sF3,X0))) = least_upper_bound(a,multiply(sF3,least_upper_bound(identity,X0))),
inference(superposition,[],[f3195,f2047]) ).
fof(f5722,plain,
! [X0,X1] : multiply(least_upper_bound(identity,X1),X0) = least_upper_bound(X0,multiply(X1,X0)),
inference(superposition,[],[f15,f1]) ).
fof(f5723,plain,
! [X0,X1] : multiply(least_upper_bound(inverse(X0),X1),X0) = least_upper_bound(identity,multiply(X1,X0)),
inference(superposition,[],[f15,f3]) ).
fof(f9351,plain,
! [X0] : multiply(sF2,X0) = least_upper_bound(X0,multiply(inverse(a),X0)),
inference(superposition,[],[f5722,f34]) ).
fof(f9413,plain,
! [X0,X1] : greatest_lower_bound(X0,multiply(least_upper_bound(identity,X1),X0)) = X0,
inference(superposition,[],[f12,f5722]) ).
fof(f9604,plain,
! [X0] : greatest_lower_bound(X0,multiply(sF3,X0)) = X0,
inference(superposition,[],[f9413,f601]) ).
fof(f9774,plain,
! [X0,X1] : greatest_lower_bound(X1,least_upper_bound(X0,X1)) = greatest_lower_bound(X1,multiply(sF3,least_upper_bound(X0,X1))),
inference(superposition,[],[f349,f9604]) ).
fof(f9789,plain,
! [X0,X1] : greatest_lower_bound(X1,multiply(sF3,least_upper_bound(X0,X1))) = X1,
inference(forward_demodulation,[],[f9774,f47]) ).
fof(f12111,plain,
! [X0,X1] : multiply(sF3,least_upper_bound(X0,X1)) = least_upper_bound(multiply(sF3,least_upper_bound(X0,X1)),X1),
inference(superposition,[],[f44,f9789]) ).
fof(f12156,plain,
! [X0,X1] : multiply(sF3,least_upper_bound(X0,X1)) = least_upper_bound(X1,multiply(sF3,least_upper_bound(X0,X1))),
inference(forward_demodulation,[],[f12111,f6]) ).
fof(f15463,plain,
least_upper_bound(a,identity) = multiply(sF2,a),
inference(superposition,[],[f9351,f3]) ).
fof(f16742,plain,
multiply(sF2,a) = least_upper_bound(identity,multiply(sF3,a)),
inference(superposition,[],[f5723,f2038]) ).
fof(f16840,plain,
least_upper_bound(a,identity) = least_upper_bound(identity,multiply(sF3,a)),
inference(forward_demodulation,[],[f16742,f15463]) ).
fof(f17000,plain,
least_upper_bound(a,identity) = least_upper_bound(multiply(sF3,a),least_upper_bound(a,identity)),
inference(superposition,[],[f79,f16840]) ).
fof(f17023,plain,
least_upper_bound(a,identity) = least_upper_bound(least_upper_bound(a,identity),multiply(sF3,a)),
inference(forward_demodulation,[],[f17000,f6]) ).
fof(f17029,plain,
least_upper_bound(a,identity) = least_upper_bound(a,least_upper_bound(identity,multiply(sF3,a))),
inference(forward_demodulation,[],[f17023,f8]) ).
fof(f17030,plain,
least_upper_bound(a,identity) = least_upper_bound(a,multiply(sF3,least_upper_bound(identity,a))),
inference(forward_demodulation,[],[f17029,f5372]) ).
fof(f17031,plain,
least_upper_bound(a,identity) = multiply(sF3,least_upper_bound(identity,a)),
inference(forward_demodulation,[],[f17030,f12156]) ).
fof(f17032,plain,
least_upper_bound(a,identity) = multiply(sF3,least_upper_bound(a,identity)),
inference(forward_demodulation,[],[f17031,f6]) ).
fof(f17054,plain,
inverse(sF3) = multiply(least_upper_bound(a,identity),inverse(least_upper_bound(a,identity))),
inference(superposition,[],[f219,f17032]) ).
fof(f17060,plain,
identity = inverse(sF3),
inference(forward_demodulation,[],[f17054,f39]) ).
fof(f18115,plain,
identity = multiply(sF3,identity),
inference(superposition,[],[f39,f17060]) ).
fof(f18135,plain,
identity = sF3,
inference(forward_demodulation,[],[f18115,f165]) ).
fof(f18442,plain,
$false,
inference(forward_subsumption_resolution,[],[f18135,f31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP183-4 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n018.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 27 09:38:39 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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
% 8.87/2.10 % (2081360)Detected a unit-equality problem, will run specialized UEQ schedule.
% 8.87/2.10 % (2081371)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=2074480184:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 8.87/2.10 % (2081366)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=220871939:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 8.87/2.10 % (2081370)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=2772806651:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 8.87/2.10 % (2081365)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=204595819:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 8.87/2.10 % (2081369)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=1981648864:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 8.87/2.10 % (2081367)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=2004976686:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 8.87/2.10 % (2081368)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=1003566973:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 8.87/2.10 % (2081368)Instruction limit reached!
% 8.87/2.10 % (2081368)------------------------------
% 8.87/2.10 % (2081368)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.87/2.10 % (2081368)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.87/2.10 % (2081368)CaDiCaL version: 2.1.3
% 8.87/2.10 % (2081368)Termination reason: Instruction limit
% 8.87/2.10 % (2081368)Termination phase: Saturation
% 8.87/2.10 % (2081368)Time elapsed: 0.084 s
% 8.87/2.10 % (2081368)Peak memory usage: 89 MB
% 8.87/2.10 % (2081368)Instructions burned: 137 (million)
% 8.87/2.10 % (2081369)Instruction limit reached!
% 8.87/2.10 % (2081369)------------------------------
% 8.87/2.10 % (2081369)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.87/2.10 % (2081369)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.87/2.10 % (2081369)CaDiCaL version: 2.1.3
% 8.87/2.10 % (2081369)Termination reason: Instruction limit
% 8.87/2.10 % (2081369)Termination phase: Saturation
% 8.87/2.10 % (2081369)Time elapsed: 0.108 s
% 8.87/2.10 % (2081369)Peak memory usage: 89 MB
% 8.87/2.10 % (2081369)Instructions burned: 183 (million)
% 8.87/2.10 % (2081370)Instruction limit reached!
% 8.87/2.10 % (2081370)------------------------------
% 8.87/2.10 % (2081370)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.87/2.10 % (2081370)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.87/2.10 % (2081370)CaDiCaL version: 2.1.3
% 8.87/2.10 % (2081370)Termination reason: Instruction limit
% 8.87/2.10 % (2081370)Termination phase: Saturation
% 8.87/2.10 % (2081370)Time elapsed: 0.156 s
% 8.87/2.10 % (2081370)Peak memory usage: 90 MB
% 8.87/2.10 % (2081370)Instructions burned: 257 (million)
% 8.87/2.10 % (2081379)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=1499301446:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2997 on theBenchmark for (2997ds/2051Mi)
% 8.87/2.10 % (2081380)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=3805244195:i=4948:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/4948Mi)
% 8.87/2.10 % (2081381)lrs+10_5:1_sil=8000:sos=all:urr=on:br=off:flr=on:random_seed=982208077:i=215:ep=RSTC_2996 on theBenchmark for (2996ds/215Mi)
% 8.87/2.10 % (2081371)Instruction limit reached!
% 8.87/2.10 % (2081371)------------------------------
% 8.87/2.10 % (2081371)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.87/2.10 % (2081371)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.87/2.10 % (2081371)CaDiCaL version: 2.1.3
% 8.87/2.10 % (2081371)Termination reason: Instruction limit
% 8.87/2.10 % (2081371)Termination phase: Saturation
% 8.87/2.10 % (2081371)Time elapsed: 0.347 s
% 8.87/2.10 % (2081371)Peak memory usage: 99 MB
% 8.87/2.10 % (2081371)Instructions burned: 1190 (million)
% 8.87/2.10 % (2081381)Instruction limit reached!
% 8.87/2.10 % (2081381)------------------------------
% 8.87/2.10 % (2081381)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.87/2.10 % (2081381)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.87/2.10 % (2081381)CaDiCaL version: 2.1.3
% 8.87/2.10 % (2081381)Termination reason: Instruction limit
% 8.87/2.10 % (2081381)Termination phase: Saturation
% 8.87/2.10 % (2081381)Time elapsed: 0.121 s
% 8.87/2.10 % (2081381)Peak memory usage: 92 MB
% 8.87/2.10 % (2081381)Instructions burned: 216 (million)
% 8.87/2.10 % (2081385)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=802146405:avsq=on:i=317:avsqr=1,16:kws=arity_squared:add=off:fgj=on:ins=10:fsr=off:gtg=exists_sym_2995 on theBenchmark for (2995ds/317Mi)
% 8.87/2.10 % (2081385)Instruction limit reached!
% 8.87/2.10 % (2081385)------------------------------
% 8.87/2.10 % (2081385)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.87/2.10 % (2081385)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.87/2.10 % (2081385)CaDiCaL version: 2.1.3
% 8.87/2.10 % (2081385)Termination reason: Instruction limit
% 8.87/2.10 % (2081385)Termination phase: Saturation
% 8.87/2.10 % (2081385)Time elapsed: 0.110 s
% 8.87/2.10 % (2081385)Peak memory usage: 93 MB
% 8.87/2.10 % (2081385)Instructions burned: 320 (million)
% 8.87/2.10 % (2081386)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=2503435267:i=12125:sd=2:fgj=on:ss=axioms:sgt=64_2994 on theBenchmark for (2994ds/12125Mi)
% 8.87/2.10 % (2081388)lrs+10_32_sil=8000:tgt=ground:prc=on:sp=reverse_arity:spb=non_intro:random_seed=3400180777:i=2836:kws=inv_precedence:fgj=on:bd=preordered:ins=10_2993 on theBenchmark for (2993ds/2836Mi)
% 8.87/2.10 % (2081388)First to succeed.
% 8.87/2.10 % (2081388)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2081360"
% 8.87/2.10 % (2081388)Refutation found. Thanks to Tanya!
% 8.87/2.10 % SZS status Unsatisfiable for theBenchmark
% 8.87/2.10 % SZS output start Proof for theBenchmark
% See solution above
% 9.48/2.28 % (2081388)------------------------------
% 9.48/2.28 % (2081388)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.48/2.28 % (2081388)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.48/2.28 % (2081388)CaDiCaL version: 2.1.3
% 9.48/2.28 % (2081388)Termination reason: Refutation
% 9.48/2.28 % (2081388)Time elapsed: 0.332 s
% 9.48/2.28 % (2081388)Peak memory usage: 106 MB
% 9.48/2.28 % (2081388)Instructions burned: 918 (million)
% 9.48/2.28 % (2081388)------------------------------
% 9.48/2.28 % (2081388)------------------------------
% 9.48/2.28 % (2081360)Success in time 1.266 s
% 9.48/2.28 % Vampire exiting
%------------------------------------------------------------------------------