%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : GRP183-2 : 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 : n017.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:14 AM UTC 2026
% Result : Unsatisfiable 4.38s 2.42s
% Output : Refutation 11.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 16
% Syntax : Number of formulae : 75 ( 75 unt; 0 def)
% Number of atoms : 75 ( 74 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 127 ( 127 !; 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(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/sandbox2/benchmark/theBenchmark.p',associativity_of_lub) ).
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(f15,axiom,
! [X2,X0,X1] : multiply(least_upper_bound(X0,X1),X2) = least_upper_bound(multiply(X0,X2),multiply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',monotony_lub2) ).
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,
inverse(identity) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p20_1) ).
fof(f18,plain,
identity = inverse(identity),
inference(reorient_equations,[],[f17]) ).
fof(f19,axiom,
! [X0] : inverse(inverse(X0)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p20_2) ).
fof(f20,axiom,
! [X0,X1] : inverse(multiply(X0,X1)) = multiply(inverse(X1),inverse(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p20_3) ).
fof(f21,negated_conjecture,
greatest_lower_bound(least_upper_bound(a,identity),inverse(greatest_lower_bound(a,identity))) != identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p20) ).
fof(f22,plain,
identity != greatest_lower_bound(least_upper_bound(a,identity),inverse(greatest_lower_bound(a,identity))),
inference(reorient_equations,[],[f21]) ).
fof(f23,plain,
identity != greatest_lower_bound(least_upper_bound(identity,a),inverse(greatest_lower_bound(a,identity))),
inference(backward_demodulation,[],[f22,f6]) ).
fof(f24,plain,
identity != greatest_lower_bound(least_upper_bound(identity,a),inverse(greatest_lower_bound(identity,a))),
inference(forward_demodulation,[],[f23,f5]) ).
fof(f26,plain,
! [X0,X1] : greatest_lower_bound(X1,least_upper_bound(X0,X1)) = X1,
inference(superposition,[],[f12,f6]) ).
fof(f32,plain,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X1,X0)) = X0,
inference(superposition,[],[f11,f5]) ).
fof(f33,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(greatest_lower_bound(X0,X1),X0),
inference(superposition,[],[f26,f11]) ).
fof(f35,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X0,greatest_lower_bound(X0,X1)),
inference(forward_demodulation,[],[f33,f5]) ).
fof(f47,plain,
! [X2,X0,X1] : greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(X1,greatest_lower_bound(X2,X0)),
inference(superposition,[],[f5,f7]) ).
fof(f50,plain,
! [X0] : identity = multiply(X0,inverse(X0)),
inference(superposition,[],[f3,f19]) ).
fof(f63,plain,
! [X2,X0,X1] : least_upper_bound(X1,X2) = greatest_lower_bound(least_upper_bound(X1,X2),least_upper_bound(X1,least_upper_bound(X2,X0))),
inference(superposition,[],[f12,f8]) ).
fof(f66,plain,
! [X0,X1] : inverse(multiply(X1,inverse(X0))) = multiply(X0,inverse(X1)),
inference(superposition,[],[f20,f19]) ).
fof(f115,plain,
! [X0,X1] : multiply(least_upper_bound(identity,X1),X0) = least_upper_bound(X0,multiply(X1,X0)),
inference(superposition,[],[f15,f1]) ).
fof(f282,plain,
! [X0,X1] : multiply(greatest_lower_bound(inverse(X0),X1),X0) = greatest_lower_bound(identity,multiply(X1,X0)),
inference(superposition,[],[f16,f3]) ).
fof(f332,plain,
! [X0] : inverse(inverse(X0)) = multiply(X0,inverse(identity)),
inference(superposition,[],[f66,f1]) ).
fof(f346,plain,
! [X0] : inverse(inverse(X0)) = multiply(X0,identity),
inference(forward_demodulation,[],[f332,f18]) ).
fof(f353,plain,
! [X0] : multiply(X0,identity) = X0,
inference(forward_demodulation,[],[f346,f19]) ).
fof(f359,plain,
! [X0,X1] : multiply(X1,greatest_lower_bound(identity,X0)) = greatest_lower_bound(X1,multiply(X1,X0)),
inference(superposition,[],[f14,f353]) ).
fof(f371,plain,
! [X0,X1] : multiply(identity,X1) = multiply(inverse(X0),multiply(X0,X1)),
inference(superposition,[],[f4,f3]) ).
fof(f391,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(forward_demodulation,[],[f371,f1]) ).
fof(f412,plain,
! [X2,X0,X1] : multiply(inverse(X0),greatest_lower_bound(X2,multiply(X0,X1))) = greatest_lower_bound(multiply(inverse(X0),X2),X1),
inference(superposition,[],[f14,f391]) ).
fof(f568,plain,
! [X0] : multiply(least_upper_bound(identity,X0),inverse(X0)) = least_upper_bound(inverse(X0),identity),
inference(superposition,[],[f115,f50]) ).
fof(f591,plain,
! [X0] : least_upper_bound(identity,inverse(X0)) = multiply(least_upper_bound(identity,X0),inverse(X0)),
inference(forward_demodulation,[],[f568,f6]) ).
fof(f973,plain,
! [X0,X1] : multiply(inverse(greatest_lower_bound(inverse(X0),X1)),greatest_lower_bound(identity,multiply(X1,X0))) = X0,
inference(superposition,[],[f391,f282]) ).
fof(f1006,plain,
! [X0,X1] : multiply(inverse(greatest_lower_bound(inverse(X0),X1)),greatest_lower_bound(identity,multiply(greatest_lower_bound(inverse(X0),X1),X0))) = X0,
inference(superposition,[],[f973,f35]) ).
fof(f1049,plain,
! [X0,X1] : greatest_lower_bound(multiply(inverse(greatest_lower_bound(inverse(X0),X1)),identity),X0) = X0,
inference(forward_demodulation,[],[f1006,f412]) ).
fof(f1063,plain,
! [X0,X1] : greatest_lower_bound(X0,multiply(inverse(greatest_lower_bound(inverse(X0),X1)),identity)) = X0,
inference(forward_demodulation,[],[f1049,f5]) ).
fof(f1071,plain,
! [X0,X1] : greatest_lower_bound(X0,inverse(greatest_lower_bound(inverse(X0),X1))) = X0,
inference(forward_demodulation,[],[f1063,f353]) ).
fof(f1078,plain,
! [X0,X1] : inverse(X0) = greatest_lower_bound(inverse(X0),inverse(greatest_lower_bound(X0,X1))),
inference(superposition,[],[f1071,f19]) ).
fof(f1084,plain,
! [X0,X1] : greatest_lower_bound(X0,inverse(greatest_lower_bound(X1,inverse(X0)))) = X0,
inference(superposition,[],[f1071,f5]) ).
fof(f1093,plain,
! [X0,X1] : inverse(greatest_lower_bound(inverse(X0),X1)) = least_upper_bound(inverse(greatest_lower_bound(inverse(X0),X1)),X0),
inference(superposition,[],[f32,f1071]) ).
fof(f1099,plain,
! [X0,X1] : inverse(greatest_lower_bound(inverse(X0),X1)) = least_upper_bound(X0,inverse(greatest_lower_bound(inverse(X0),X1))),
inference(forward_demodulation,[],[f1093,f6]) ).
fof(f1115,plain,
! [X0,X1] : inverse(X0) = greatest_lower_bound(inverse(X0),inverse(greatest_lower_bound(X1,X0))),
inference(superposition,[],[f1078,f5]) ).
fof(f1192,plain,
! [X0,X1] : inverse(greatest_lower_bound(X1,inverse(X0))) = least_upper_bound(inverse(greatest_lower_bound(X1,inverse(X0))),X0),
inference(superposition,[],[f32,f1084]) ).
fof(f1200,plain,
! [X0,X1] : inverse(greatest_lower_bound(X1,inverse(X0))) = least_upper_bound(X0,inverse(greatest_lower_bound(X1,inverse(X0)))),
inference(forward_demodulation,[],[f1192,f6]) ).
fof(f1219,plain,
! [X0,X1] : inverse(least_upper_bound(X0,X1)) = greatest_lower_bound(inverse(least_upper_bound(X0,X1)),inverse(X0)),
inference(superposition,[],[f1115,f12]) ).
fof(f1220,plain,
! [X0,X1] : inverse(least_upper_bound(X0,X1)) = greatest_lower_bound(inverse(least_upper_bound(X0,X1)),inverse(X1)),
inference(superposition,[],[f1115,f26]) ).
fof(f1247,plain,
! [X0,X1] : inverse(least_upper_bound(X0,X1)) = greatest_lower_bound(inverse(X1),inverse(least_upper_bound(X0,X1))),
inference(forward_demodulation,[],[f1220,f5]) ).
fof(f1248,plain,
! [X0,X1] : inverse(least_upper_bound(X0,X1)) = greatest_lower_bound(inverse(X0),inverse(least_upper_bound(X0,X1))),
inference(forward_demodulation,[],[f1219,f5]) ).
fof(f1804,plain,
! [X2,X0,X1] : least_upper_bound(X2,X0) = greatest_lower_bound(least_upper_bound(X2,X0),least_upper_bound(X2,inverse(greatest_lower_bound(inverse(X0),X1)))),
inference(superposition,[],[f63,f1099]) ).
fof(f1926,plain,
! [X0,X1] : least_upper_bound(X0,X1) = greatest_lower_bound(least_upper_bound(X0,X1),inverse(greatest_lower_bound(inverse(X1),inverse(X0)))),
inference(superposition,[],[f1804,f1200]) ).
fof(f2001,plain,
! [X0,X1] : greatest_lower_bound(inverse(X1),inverse(X0)) = greatest_lower_bound(greatest_lower_bound(inverse(X1),inverse(X0)),inverse(least_upper_bound(X0,X1))),
inference(superposition,[],[f1084,f1926]) ).
fof(f2017,plain,
! [X0,X1] : greatest_lower_bound(inverse(X1),inverse(X0)) = greatest_lower_bound(inverse(least_upper_bound(X0,X1)),greatest_lower_bound(inverse(X1),inverse(X0))),
inference(forward_demodulation,[],[f2001,f5]) ).
fof(f2031,plain,
! [X0,X1] : greatest_lower_bound(inverse(X1),inverse(X0)) = greatest_lower_bound(inverse(X1),greatest_lower_bound(inverse(X0),inverse(least_upper_bound(X0,X1)))),
inference(forward_demodulation,[],[f2017,f47]) ).
fof(f2041,plain,
! [X0,X1] : greatest_lower_bound(inverse(X1),inverse(X0)) = greatest_lower_bound(inverse(X1),inverse(least_upper_bound(X0,X1))),
inference(forward_demodulation,[],[f2031,f1248]) ).
fof(f2050,plain,
! [X0,X1] : inverse(least_upper_bound(X0,X1)) = greatest_lower_bound(inverse(X1),inverse(X0)),
inference(forward_demodulation,[],[f2041,f1247]) ).
fof(f2162,plain,
! [X0,X1] : greatest_lower_bound(X0,inverse(X1)) = inverse(least_upper_bound(X1,inverse(X0))),
inference(superposition,[],[f2050,f19]) ).
fof(f2167,plain,
! [X0] : greatest_lower_bound(inverse(X0),identity) = inverse(least_upper_bound(identity,X0)),
inference(superposition,[],[f2050,f18]) ).
fof(f2211,plain,
! [X0] : greatest_lower_bound(identity,inverse(X0)) = inverse(least_upper_bound(identity,X0)),
inference(forward_demodulation,[],[f2167,f5]) ).
fof(f2320,plain,
! [X0] : identity = multiply(least_upper_bound(identity,X0),greatest_lower_bound(identity,inverse(X0))),
inference(superposition,[],[f50,f2211]) ).
fof(f2495,plain,
! [X0,X1] : least_upper_bound(X1,inverse(X0)) = inverse(greatest_lower_bound(X0,inverse(X1))),
inference(superposition,[],[f19,f2162]) ).
fof(f2708,plain,
! [X0,X1] : inverse(greatest_lower_bound(X1,X0)) = least_upper_bound(inverse(X0),inverse(X1)),
inference(superposition,[],[f2495,f19]) ).
fof(f2862,plain,
! [X0] : least_upper_bound(inverse(X0),identity) = inverse(greatest_lower_bound(identity,X0)),
inference(superposition,[],[f2708,f18]) ).
fof(f2912,plain,
! [X0] : least_upper_bound(identity,inverse(X0)) = inverse(greatest_lower_bound(identity,X0)),
inference(forward_demodulation,[],[f2862,f6]) ).
fof(f2930,plain,
identity != greatest_lower_bound(least_upper_bound(identity,a),least_upper_bound(identity,inverse(a))),
inference(backward_demodulation,[],[f24,f2912]) ).
fof(f5252,plain,
! [X0] : multiply(least_upper_bound(identity,X0),greatest_lower_bound(identity,inverse(X0))) = greatest_lower_bound(least_upper_bound(identity,X0),least_upper_bound(identity,inverse(X0))),
inference(superposition,[],[f359,f591]) ).
fof(f5307,plain,
! [X0] : identity = greatest_lower_bound(least_upper_bound(identity,X0),least_upper_bound(identity,inverse(X0))),
inference(forward_demodulation,[],[f5252,f2320]) ).
fof(f5332,plain,
$false,
inference(backward_subsumption_resolution,[],[f2930,f5307]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP183-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.39 % Computer : n017.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Sun Sep 27 09:31:35 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/0.43 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.38/2.42 % (2287332)Detected a unit-equality problem, will run specialized UEQ schedule.
% 4.38/2.42 % (2287368)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=3506598828:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 4.38/2.42 % (2287367)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=3635052849:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 4.38/2.42 % (2287366)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=2868090833:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 4.38/2.42 % (2287369)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=736095391:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 4.38/2.42 % (2287365)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=2109398793:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 4.38/2.42 % (2287368)Instruction limit reached!
% 4.38/2.42 % (2287368)------------------------------
% 4.38/2.42 % (2287368)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.38/2.42 % (2287368)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.38/2.42 % (2287368)CaDiCaL version: 2.1.3
% 4.38/2.42 % (2287368)Termination reason: Instruction limit
% 4.38/2.42 % (2287368)Termination phase: Saturation
% 4.38/2.42 % (2287368)Time elapsed: 0.047 s
% 4.38/2.42 % (2287368)Peak memory usage: 89 MB
% 4.38/2.42 % (2287368)Instructions burned: 138 (million)
% 4.38/2.42 % (2287371)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=1945751283:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 4.38/2.42 % (2287370)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=2014518003:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 4.38/2.42 % (2287369)Instruction limit reached!
% 4.38/2.42 % (2287369)------------------------------
% 4.38/2.42 % (2287369)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.38/2.42 % (2287369)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.38/2.42 % (2287369)CaDiCaL version: 2.1.3
% 4.38/2.42 % (2287369)Termination reason: Instruction limit
% 4.38/2.42 % (2287369)Termination phase: Saturation
% 4.38/2.42 % (2287369)Time elapsed: 0.112 s
% 4.38/2.42 % (2287369)Peak memory usage: 89 MB
% 4.38/2.42 % (2287369)Instructions burned: 182 (million)
% 4.38/2.42 % (2287377)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=173136783:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2998 on theBenchmark for (2998ds/2051Mi)
% 4.38/2.42 % (2287380)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=1996590223:i=4948:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/4948Mi)
% 4.38/2.42 % (2287370)Instruction limit reached!
% 4.38/2.42 % (2287370)------------------------------
% 4.38/2.42 % (2287370)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.38/2.42 % (2287370)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.38/2.42 % (2287370)CaDiCaL version: 2.1.3
% 4.38/2.42 % (2287370)Termination reason: Instruction limit
% 4.38/2.42 % (2287370)Termination phase: Saturation
% 4.38/2.42 % (2287370)Time elapsed: 0.229 s
% 4.38/2.42 % (2287370)Peak memory usage: 90 MB
% 4.38/2.42 % (2287370)Instructions burned: 258 (million)
% 4.38/2.42 % (2287384)lrs+10_5:1_sil=8000:sos=all:urr=on:br=off:flr=on:random_seed=3539837266:i=215:ep=RSTC_2995 on theBenchmark for (2995ds/215Mi)
% 4.38/2.42 % (2287384)Instruction limit reached!
% 4.38/2.42 % (2287384)------------------------------
% 4.38/2.42 % (2287384)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.38/2.42 % (2287384)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.38/2.42 % (2287384)CaDiCaL version: 2.1.3
% 4.38/2.42 % (2287384)Termination reason: Instruction limit
% 4.38/2.42 % (2287384)Termination phase: Saturation
% 4.38/2.42 % (2287384)Time elapsed: 0.191 s
% 4.38/2.42 % (2287384)Peak memory usage: 92 MB
% 4.38/2.42 % (2287384)Instructions burned: 216 (million)
% 4.38/2.42 % (2287371)Instruction limit reached!
% 4.38/2.42 % (2287371)------------------------------
% 4.38/2.42 % (2287371)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.38/2.42 % (2287371)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.38/2.42 % (2287371)CaDiCaL version: 2.1.3
% 4.38/2.42 % (2287371)Termination reason: Instruction limit
% 4.38/2.42 % (2287371)Termination phase: Saturation
% 4.38/2.42 % (2287371)Time elapsed: 0.867 s
% 4.38/2.42 % (2287371)Peak memory usage: 99 MB
% 4.38/2.42 % (2287371)Instructions burned: 1187 (million)
% 4.38/2.42 % (2287402)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=3223582983:avsq=on:i=317:avsqr=1,16:kws=arity_squared:add=off:fgj=on:ins=10:fsr=off:gtg=exists_sym_2990 on theBenchmark for (2990ds/317Mi)
% 4.38/2.42 % (2287377)First to succeed.
% 4.38/2.42 % (2287377)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2287332"
% 4.38/2.42 % (2287406)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=870429602:i=12125:sd=2:fgj=on:ss=axioms:sgt=64_2989 on theBenchmark for (2989ds/12125Mi)
% 4.38/2.42 % (2287377)Refutation found. Thanks to Tanya!
% 4.38/2.42 % SZS status Unsatisfiable for theBenchmark
% 4.38/2.42 % SZS output start Proof for theBenchmark
% See solution above
% 11.38/2.66 % (2287377)------------------------------
% 11.38/2.66 % (2287377)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.38/2.66 % (2287377)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.38/2.66 % (2287377)CaDiCaL version: 2.1.3
% 11.38/2.66 % (2287377)Termination reason: Refutation
% 11.38/2.66 % (2287377)Time elapsed: 0.973 s
% 11.38/2.66 % (2287377)Peak memory usage: 139 MB
% 11.38/2.66 % (2287377)Instructions burned: 1848 (million)
% 11.38/2.66 % (2287377)------------------------------
% 11.38/2.66 % (2287377)------------------------------
% 11.38/2.66 % (2287332)Success in time 1.545 s
% 11.38/2.66 % Vampire exiting
%------------------------------------------------------------------------------