%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : GRP179-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 : n008.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 5.75s 2.70s
% Output : Refutation 12.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 13
% Syntax : Number of formulae : 64 ( 64 unt; 0 def)
% Number of atoms : 64 ( 63 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 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 : 117 ( 117 !; 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(f13,axiom,
! [X2,X0,X1] : multiply(X0,least_upper_bound(X1,X2)) = least_upper_bound(multiply(X0,X1),multiply(X0,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',monotony_lub1) ).
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(f17,negated_conjecture,
least_upper_bound(inverse(a),identity) != inverse(greatest_lower_bound(a,identity)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p18) ).
fof(f18,plain,
inverse(greatest_lower_bound(a,identity)) != least_upper_bound(identity,inverse(a)),
inference(backward_demodulation,[],[f17,f6]) ).
fof(f19,plain,
least_upper_bound(identity,inverse(a)) != inverse(greatest_lower_bound(identity,a)),
inference(forward_demodulation,[],[f18,f5]) ).
fof(f21,plain,
! [X0,X1] : least_upper_bound(X1,greatest_lower_bound(X0,X1)) = X1,
inference(superposition,[],[f11,f5]) ).
fof(f26,plain,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(least_upper_bound(X0,X1),X0),
inference(superposition,[],[f21,f12]) ).
fof(f28,plain,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X0,least_upper_bound(X0,X1)),
inference(forward_demodulation,[],[f26,f6]) ).
fof(f39,plain,
! [X2,X0,X1] : greatest_lower_bound(X1,X2) = least_upper_bound(greatest_lower_bound(X1,X2),greatest_lower_bound(X1,greatest_lower_bound(X2,X0))),
inference(superposition,[],[f11,f7]) ).
fof(f43,plain,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X1,X0)) = X0,
inference(superposition,[],[f12,f6]) ).
fof(f90,plain,
! [X0,X1] : multiply(identity,X0) = multiply(inverse(X1),multiply(X1,X0)),
inference(superposition,[],[f4,f3]) ).
fof(f93,plain,
! [X0,X1] : multiply(inverse(X1),multiply(X1,X0)) = X0,
inference(forward_demodulation,[],[f90,f1]) ).
fof(f96,plain,
! [X0] : multiply(inverse(inverse(X0)),identity) = X0,
inference(superposition,[],[f93,f3]) ).
fof(f98,plain,
! [X0,X1] : multiply(X1,X0) = multiply(inverse(inverse(X1)),X0),
inference(superposition,[],[f93,f93]) ).
fof(f101,plain,
! [X0] : multiply(X0,identity) = X0,
inference(forward_demodulation,[],[f96,f98]) ).
fof(f102,plain,
identity = inverse(identity),
inference(superposition,[],[f101,f3]) ).
fof(f110,plain,
! [X0,X1] : multiply(inverse(X0),greatest_lower_bound(X0,X1)) = greatest_lower_bound(identity,multiply(inverse(X0),X1)),
inference(superposition,[],[f14,f3]) ).
fof(f352,plain,
! [X0] : inverse(inverse(X0)) = multiply(X0,identity),
inference(superposition,[],[f101,f98]) ).
fof(f357,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(forward_demodulation,[],[f352,f101]) ).
fof(f492,plain,
! [X0,X1] : multiply(X0,least_upper_bound(identity,X1)) = least_upper_bound(X0,multiply(X0,X1)),
inference(superposition,[],[f13,f101]) ).
fof(f636,plain,
! [X0,X1] : multiply(least_upper_bound(inverse(X0),X1),X0) = least_upper_bound(identity,multiply(X1,X0)),
inference(superposition,[],[f15,f3]) ).
fof(f758,plain,
! [X0,X1] : multiply(inverse(least_upper_bound(inverse(X0),X1)),least_upper_bound(identity,multiply(X1,X0))) = X0,
inference(superposition,[],[f93,f636]) ).
fof(f840,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = multiply(inverse(least_upper_bound(inverse(greatest_lower_bound(X0,X1)),inverse(X0))),least_upper_bound(identity,greatest_lower_bound(identity,multiply(inverse(X0),X1)))),
inference(superposition,[],[f758,f110]) ).
fof(f856,plain,
! [X0,X1] : multiply(inverse(least_upper_bound(inverse(X0),X1)),least_upper_bound(identity,least_upper_bound(identity,multiply(X1,X0)))) = least_upper_bound(inverse(least_upper_bound(inverse(X0),X1)),X0),
inference(superposition,[],[f492,f758]) ).
fof(f859,plain,
! [X0,X1] : multiply(inverse(least_upper_bound(inverse(X0),X1)),least_upper_bound(identity,least_upper_bound(identity,multiply(X1,X0)))) = least_upper_bound(X0,inverse(least_upper_bound(inverse(X0),X1))),
inference(forward_demodulation,[],[f856,f6]) ).
fof(f870,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = multiply(inverse(least_upper_bound(inverse(greatest_lower_bound(X0,X1)),inverse(X0))),identity),
inference(forward_demodulation,[],[f840,f11]) ).
fof(f881,plain,
! [X0,X1] : multiply(inverse(least_upper_bound(inverse(X0),X1)),least_upper_bound(identity,multiply(X1,X0))) = least_upper_bound(X0,inverse(least_upper_bound(inverse(X0),X1))),
inference(forward_demodulation,[],[f859,f28]) ).
fof(f887,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = inverse(least_upper_bound(inverse(greatest_lower_bound(X0,X1)),inverse(X0))),
inference(forward_demodulation,[],[f870,f101]) ).
fof(f895,plain,
! [X0,X1] : least_upper_bound(X0,inverse(least_upper_bound(inverse(X0),X1))) = X0,
inference(forward_demodulation,[],[f881,f758]) ).
fof(f897,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = inverse(least_upper_bound(inverse(X0),inverse(greatest_lower_bound(X0,X1)))),
inference(forward_demodulation,[],[f887,f6]) ).
fof(f917,plain,
! [X0,X1] : inverse(least_upper_bound(inverse(X0),X1)) = greatest_lower_bound(inverse(least_upper_bound(inverse(X0),X1)),X0),
inference(superposition,[],[f43,f895]) ).
fof(f920,plain,
! [X0,X1] : inverse(least_upper_bound(inverse(X0),X1)) = greatest_lower_bound(X0,inverse(least_upper_bound(inverse(X0),X1))),
inference(forward_demodulation,[],[f917,f5]) ).
fof(f951,plain,
! [X0,X1] : inverse(greatest_lower_bound(X0,X1)) = least_upper_bound(inverse(X0),inverse(greatest_lower_bound(X0,X1))),
inference(superposition,[],[f357,f897]) ).
fof(f979,plain,
! [X0,X1] : inverse(greatest_lower_bound(inverse(X0),X1)) = least_upper_bound(X0,inverse(greatest_lower_bound(inverse(X0),X1))),
inference(superposition,[],[f951,f357]) ).
fof(f982,plain,
! [X0,X1] : inverse(greatest_lower_bound(X1,X0)) = least_upper_bound(inverse(X0),inverse(greatest_lower_bound(X1,X0))),
inference(superposition,[],[f951,f5]) ).
fof(f994,plain,
! [X0,X1] : inverse(X0) = greatest_lower_bound(inverse(X0),inverse(greatest_lower_bound(X0,X1))),
inference(superposition,[],[f12,f951]) ).
fof(f1007,plain,
! [X0,X1] : inverse(X0) = greatest_lower_bound(inverse(X0),inverse(greatest_lower_bound(X1,X0))),
inference(superposition,[],[f994,f5]) ).
fof(f1068,plain,
! [X0,X1] : inverse(least_upper_bound(X1,X0)) = greatest_lower_bound(inverse(least_upper_bound(X1,X0)),inverse(X0)),
inference(superposition,[],[f1007,f43]) ).
fof(f1091,plain,
! [X0,X1] : inverse(least_upper_bound(X1,X0)) = greatest_lower_bound(inverse(X0),inverse(least_upper_bound(X1,X0))),
inference(forward_demodulation,[],[f1068,f5]) ).
fof(f1109,plain,
! [X0,X1] : inverse(X0) = least_upper_bound(inverse(least_upper_bound(X1,X0)),inverse(X0)),
inference(superposition,[],[f982,f43]) ).
fof(f1125,plain,
! [X0,X1] : inverse(X0) = least_upper_bound(inverse(X0),inverse(least_upper_bound(X1,X0))),
inference(forward_demodulation,[],[f1109,f6]) ).
fof(f1645,plain,
! [X2,X0,X1] : greatest_lower_bound(X2,X0) = least_upper_bound(greatest_lower_bound(X2,X0),greatest_lower_bound(X2,inverse(least_upper_bound(inverse(X0),X1)))),
inference(superposition,[],[f39,f920]) ).
fof(f2561,plain,
! [X0,X1] : greatest_lower_bound(inverse(X0),X1) = least_upper_bound(greatest_lower_bound(inverse(X0),X1),inverse(least_upper_bound(inverse(X1),X0))),
inference(superposition,[],[f1645,f1091]) ).
fof(f2635,plain,
! [X0,X1] : inverse(inverse(least_upper_bound(inverse(X1),X0))) = least_upper_bound(inverse(inverse(least_upper_bound(inverse(X1),X0))),inverse(greatest_lower_bound(inverse(X0),X1))),
inference(superposition,[],[f1125,f2561]) ).
fof(f2636,plain,
! [X0,X1] : inverse(inverse(least_upper_bound(inverse(X1),X0))) = least_upper_bound(inverse(greatest_lower_bound(inverse(X0),X1)),inverse(inverse(least_upper_bound(inverse(X1),X0)))),
inference(forward_demodulation,[],[f2635,f6]) ).
fof(f2652,plain,
! [X0,X1] : least_upper_bound(inverse(X1),X0) = least_upper_bound(inverse(greatest_lower_bound(inverse(X0),X1)),least_upper_bound(inverse(X1),X0)),
inference(forward_demodulation,[],[f2636,f357]) ).
fof(f2658,plain,
! [X0,X1] : least_upper_bound(inverse(X1),X0) = least_upper_bound(least_upper_bound(inverse(X1),X0),inverse(greatest_lower_bound(inverse(X0),X1))),
inference(forward_demodulation,[],[f2652,f6]) ).
fof(f2663,plain,
! [X0,X1] : least_upper_bound(inverse(X1),X0) = least_upper_bound(inverse(X1),least_upper_bound(X0,inverse(greatest_lower_bound(inverse(X0),X1)))),
inference(forward_demodulation,[],[f2658,f8]) ).
fof(f2666,plain,
! [X0,X1] : least_upper_bound(inverse(X1),X0) = least_upper_bound(inverse(X1),inverse(greatest_lower_bound(inverse(X0),X1))),
inference(forward_demodulation,[],[f2663,f979]) ).
fof(f2669,plain,
! [X0,X1] : inverse(greatest_lower_bound(inverse(X0),X1)) = least_upper_bound(inverse(X1),X0),
inference(forward_demodulation,[],[f2666,f982]) ).
fof(f2752,plain,
! [X0] : inverse(greatest_lower_bound(identity,X0)) = least_upper_bound(inverse(X0),identity),
inference(superposition,[],[f2669,f102]) ).
fof(f2920,plain,
! [X0] : inverse(greatest_lower_bound(identity,X0)) = least_upper_bound(identity,inverse(X0)),
inference(forward_demodulation,[],[f2752,f6]) ).
fof(f2978,plain,
$false,
inference(backward_subsumption_resolution,[],[f19,f2920]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP179-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.09 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.48 % Computer : n008.cluster.edu
% 0.19/0.48 % Model : x86_64 x86_64
% 0.19/0.48 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.48 % Memory : 8046.5625MB
% 0.19/0.48 % OS : Linux 6.8.0-71-generic
% 0.19/0.48 % CPULimit : 300
% 0.19/0.48 % WCLimit : 300
% 0.19/0.48 % DateTime : Sun Sep 27 09:36:40 UTC 2026
% 0.19/0.48 % CPUTime :
% 0.19/0.48 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.54 Running first-order theorem proving
% 0.25/0.54 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
% 5.75/2.70 % (978266)Detected a unit-equality problem, will run specialized UEQ schedule.
% 5.75/2.70 % (978276)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=2335620742:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 5.75/2.70 % (978274)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=565458755:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 5.75/2.70 % (978277)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=3078911660:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 5.75/2.70 % (978273)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=2780808910:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 5.75/2.70 % (978275)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=390691278:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 5.75/2.70 % (978271)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=1864177934:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 5.75/2.70 % (978272)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=2106157855:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 5.75/2.70 % (978276)Instruction limit reached!
% 5.75/2.70 % (978276)------------------------------
% 5.75/2.70 % (978276)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.75/2.70 % (978276)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.75/2.70 % (978276)CaDiCaL version: 2.1.3
% 5.75/2.70 % (978276)Termination reason: Instruction limit
% 5.75/2.70 % (978276)Termination phase: Saturation
% 5.75/2.70 % (978276)Time elapsed: 0.142 s
% 5.75/2.70 % (978276)Peak memory usage: 91 MB
% 5.75/2.70 % (978276)Instructions burned: 257 (million)
% 5.75/2.70 % (978274)Instruction limit reached!
% 5.75/2.70 % (978274)------------------------------
% 5.75/2.70 % (978274)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.75/2.70 % (978274)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.75/2.70 % (978274)CaDiCaL version: 2.1.3
% 5.75/2.70 % (978274)Termination reason: Instruction limit
% 5.75/2.70 % (978274)Termination phase: Saturation
% 5.75/2.70 % (978274)Time elapsed: 0.143 s
% 5.75/2.70 % (978274)Peak memory usage: 89 MB
% 5.75/2.70 % (978274)Instructions burned: 137 (million)
% 5.75/2.70 % (978275)Instruction limit reached!
% 5.75/2.70 % (978275)------------------------------
% 5.75/2.70 % (978275)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.75/2.70 % (978275)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.75/2.70 % (978275)CaDiCaL version: 2.1.3
% 5.75/2.70 % (978275)Termination reason: Instruction limit
% 5.75/2.70 % (978275)Termination phase: Saturation
% 5.75/2.70 % (978275)Time elapsed: 0.182 s
% 5.75/2.70 % (978275)Peak memory usage: 89 MB
% 5.75/2.70 % (978275)Instructions burned: 181 (million)
% 5.75/2.70 % (978285)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=3991599313:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2995 on theBenchmark for (2995ds/2051Mi)
% 5.75/2.70 % (978286)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=132768666:i=4948:ss=axioms:sgt=16_2995 on theBenchmark for (2995ds/4948Mi)
% 5.75/2.70 % (978287)lrs+10_5:1_sil=8000:sos=all:urr=on:br=off:flr=on:random_seed=2562134433:i=215:ep=RSTC_2995 on theBenchmark for (2995ds/215Mi)
% 5.75/2.70 % (978287)Instruction limit reached!
% 5.75/2.70 % (978287)------------------------------
% 5.75/2.70 % (978287)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.75/2.70 % (978287)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.75/2.70 % (978287)CaDiCaL version: 2.1.3
% 5.75/2.70 % (978287)Termination reason: Instruction limit
% 5.75/2.70 % (978287)Termination phase: Saturation
% 5.75/2.70 % (978287)Time elapsed: 0.191 s
% 5.75/2.70 % (978287)Peak memory usage: 90 MB
% 5.75/2.70 % (978287)Instructions burned: 215 (million)
% 5.75/2.70 % (978291)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=4023437178: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)
% 5.75/2.70 % (978277)Instruction limit reached!
% 5.75/2.70 % (978277)------------------------------
% 5.75/2.70 % (978277)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.75/2.70 % (978277)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.75/2.70 % (978277)CaDiCaL version: 2.1.3
% 5.75/2.70 % (978277)Termination reason: Instruction limit
% 5.75/2.70 % (978277)Termination phase: Saturation
% 5.75/2.70 % (978277)Time elapsed: 1.095 s
% 5.75/2.70 % (978277)Peak memory usage: 99 MB
% 5.75/2.70 % (978277)Instructions burned: 1187 (million)
% 5.75/2.70 % (978285)First to succeed.
% 5.75/2.70 % (978285)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-978266"
% 5.75/2.70 % (978291)Instruction limit reached!
% 5.75/2.70 % (978291)------------------------------
% 5.75/2.70 % (978291)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.75/2.70 % (978291)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.75/2.70 % (978291)CaDiCaL version: 2.1.3
% 5.75/2.70 % (978291)Termination reason: Instruction limit
% 5.75/2.70 % (978291)Termination phase: Saturation
% 5.75/2.70 % (978291)Time elapsed: 0.341 s
% 5.75/2.70 % (978291)Peak memory usage: 92 MB
% 5.75/2.70 % (978291)Instructions burned: 317 (million)
% 5.75/2.70 % (978293)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=1596213092:i=12125:sd=2:fgj=on:ss=axioms:sgt=64_2986 on theBenchmark for (2986ds/12125Mi)
% 5.75/2.70 % (978285)Refutation found. Thanks to Tanya!
% 5.75/2.70 % SZS status Unsatisfiable for theBenchmark
% 5.75/2.70 % SZS output start Proof for theBenchmark
% See solution above
% 12.65/2.89 % (978285)------------------------------
% 12.65/2.89 % (978285)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.65/2.89 % (978285)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.65/2.89 % (978285)CaDiCaL version: 2.1.3
% 12.65/2.89 % (978285)Termination reason: Refutation
% 12.65/2.89 % (978285)Time elapsed: 0.839 s
% 12.65/2.89 % (978285)Peak memory usage: 134 MB
% 12.65/2.89 % (978285)Instructions burned: 1403 (million)
% 12.65/2.89 % (978285)------------------------------
% 12.65/2.89 % (978285)------------------------------
% 12.65/2.89 % (978266)Success in time 1.71 s
% 12.65/2.89 % Vampire exiting
%------------------------------------------------------------------------------