%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : GRP186-1 : 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 : 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:16 AM UTC 2026
% Result : Unsatisfiable 26.69s 4.78s
% Output : Refutation 27.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 31
% Number of leaves : 13
% Syntax : Number of formulae : 65 ( 65 unt; 0 def)
% Number of atoms : 65 ( 64 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 127 ( 127 !; 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(f14,axiom,
! [X2,X0,X1] : multiply(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(multiply(X0,X1),multiply(X0,X2)),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',monotony_glb2) ).
fof(f17,negated_conjecture,
least_upper_bound(multiply(a,b),identity) != multiply(a,inverse(greatest_lower_bound(a,inverse(b)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p23) ).
fof(f18,plain,
multiply(a,inverse(greatest_lower_bound(a,inverse(b)))) != least_upper_bound(identity,multiply(a,b)),
inference(forward_demodulation,[],[f17,f6]) ).
fof(f37,plain,
! [X0,X1] : least_upper_bound(X1,greatest_lower_bound(X0,X1)) = X1,
inference(superposition,[],[f11,f5]) ).
fof(f41,plain,
! [X0,X1] : multiply(greatest_lower_bound(inverse(X0),X1),X0) = greatest_lower_bound(identity,multiply(X1,X0)),
inference(superposition,[],[f16,f3]) ).
fof(f107,plain,
! [X0,X1] : multiply(identity,X1) = multiply(inverse(X0),multiply(X0,X1)),
inference(superposition,[],[f4,f3]) ).
fof(f124,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(forward_demodulation,[],[f107,f1]) ).
fof(f135,plain,
! [X0] : multiply(inverse(inverse(X0)),identity) = X0,
inference(superposition,[],[f124,f3]) ).
fof(f137,plain,
! [X0,X1] : multiply(X1,X0) = multiply(inverse(inverse(X1)),X0),
inference(superposition,[],[f124,f124]) ).
fof(f156,plain,
! [X0] : multiply(X0,identity) = X0,
inference(forward_demodulation,[],[f135,f137]) ).
fof(f163,plain,
! [X0] : identity = multiply(X0,inverse(X0)),
inference(superposition,[],[f3,f137]) ).
fof(f199,plain,
! [X0,X1] : multiply(X0,greatest_lower_bound(identity,X1)) = greatest_lower_bound(X0,multiply(X0,X1)),
inference(superposition,[],[f14,f156]) ).
fof(f210,plain,
! [X0] : inverse(inverse(X0)) = multiply(X0,identity),
inference(superposition,[],[f137,f156]) ).
fof(f211,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(forward_demodulation,[],[f210,f156]) ).
fof(f231,plain,
! [X2,X0,X1] : greatest_lower_bound(X0,X1) = least_upper_bound(greatest_lower_bound(X0,X1),greatest_lower_bound(X0,greatest_lower_bound(X1,X2))),
inference(superposition,[],[f11,f7]) ).
fof(f243,plain,
! [X0,X1] : least_upper_bound(multiply(X0,X1),identity) = multiply(X0,least_upper_bound(X1,inverse(X0))),
inference(superposition,[],[f13,f163]) ).
fof(f262,plain,
! [X0,X1] : least_upper_bound(identity,multiply(X0,X1)) = multiply(X0,least_upper_bound(X1,inverse(X0))),
inference(forward_demodulation,[],[f243,f6]) ).
fof(f451,plain,
! [X0,X1] : greatest_lower_bound(X1,least_upper_bound(X0,X1)) = X1,
inference(superposition,[],[f12,f6]) ).
fof(f762,plain,
! [X2,X0,X1] : least_upper_bound(X0,X2) = least_upper_bound(X0,least_upper_bound(greatest_lower_bound(X1,X0),X2)),
inference(superposition,[],[f8,f37]) ).
fof(f771,plain,
! [X2,X0,X1] : least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(X2,least_upper_bound(X0,X1)),
inference(superposition,[],[f6,f8]) ).
fof(f956,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(greatest_lower_bound(X0,X1),X0),
inference(superposition,[],[f451,f11]) ).
fof(f976,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X0,greatest_lower_bound(X0,X1)),
inference(forward_demodulation,[],[f956,f5]) ).
fof(f1001,plain,
! [X0,X1] : multiply(inverse(greatest_lower_bound(inverse(X1),X0)),greatest_lower_bound(identity,multiply(X0,X1))) = X1,
inference(superposition,[],[f124,f41]) ).
fof(f1205,plain,
! [X0,X1] : multiply(inverse(greatest_lower_bound(inverse(X0),X1)),greatest_lower_bound(identity,greatest_lower_bound(identity,multiply(X1,X0)))) = greatest_lower_bound(inverse(greatest_lower_bound(inverse(X0),X1)),X0),
inference(superposition,[],[f199,f1001]) ).
fof(f1214,plain,
! [X0,X1] : multiply(inverse(greatest_lower_bound(inverse(X0),X1)),greatest_lower_bound(identity,greatest_lower_bound(identity,multiply(X1,X0)))) = greatest_lower_bound(X0,inverse(greatest_lower_bound(inverse(X0),X1))),
inference(forward_demodulation,[],[f1205,f5]) ).
fof(f1244,plain,
! [X0,X1] : multiply(inverse(greatest_lower_bound(inverse(X0),X1)),greatest_lower_bound(identity,multiply(X1,X0))) = greatest_lower_bound(X0,inverse(greatest_lower_bound(inverse(X0),X1))),
inference(forward_demodulation,[],[f1214,f976]) ).
fof(f1260,plain,
! [X0,X1] : greatest_lower_bound(X0,inverse(greatest_lower_bound(inverse(X0),X1))) = X0,
inference(forward_demodulation,[],[f1244,f1001]) ).
fof(f1276,plain,
! [X0,X1] : inverse(X0) = greatest_lower_bound(inverse(X0),inverse(greatest_lower_bound(X0,X1))),
inference(superposition,[],[f1260,f211]) ).
fof(f1279,plain,
! [X0,X1] : greatest_lower_bound(X1,inverse(greatest_lower_bound(X0,inverse(X1)))) = X1,
inference(superposition,[],[f1260,f5]) ).
fof(f1319,plain,
! [X0,X1] : inverse(X0) = greatest_lower_bound(inverse(X0),inverse(greatest_lower_bound(X1,X0))),
inference(superposition,[],[f1279,f211]) ).
fof(f1390,plain,
! [X0,X1] : inverse(greatest_lower_bound(X0,X1)) = least_upper_bound(inverse(greatest_lower_bound(X0,X1)),inverse(X0)),
inference(superposition,[],[f37,f1276]) ).
fof(f1398,plain,
! [X0,X1] : inverse(greatest_lower_bound(X0,X1)) = least_upper_bound(inverse(X0),inverse(greatest_lower_bound(X0,X1))),
inference(forward_demodulation,[],[f1390,f6]) ).
fof(f1434,plain,
! [X0,X1] : inverse(greatest_lower_bound(X1,X0)) = least_upper_bound(inverse(greatest_lower_bound(X1,X0)),inverse(X0)),
inference(superposition,[],[f37,f1319]) ).
fof(f1443,plain,
! [X0,X1] : inverse(greatest_lower_bound(X1,X0)) = least_upper_bound(inverse(X0),inverse(greatest_lower_bound(X1,X0))),
inference(forward_demodulation,[],[f1434,f6]) ).
fof(f1738,plain,
! [X2,X0,X1] : least_upper_bound(inverse(greatest_lower_bound(X1,inverse(X0))),X2) = least_upper_bound(inverse(greatest_lower_bound(X1,inverse(X0))),least_upper_bound(X0,X2)),
inference(superposition,[],[f762,f1279]) ).
fof(f1785,plain,
! [X2,X0,X1] : least_upper_bound(inverse(greatest_lower_bound(X1,inverse(X0))),X2) = least_upper_bound(X0,least_upper_bound(X2,inverse(greatest_lower_bound(X1,inverse(X0))))),
inference(forward_demodulation,[],[f1738,f771]) ).
fof(f6896,plain,
! [X0,X1] : inverse(X0) = least_upper_bound(inverse(least_upper_bound(X0,X1)),inverse(X0)),
inference(superposition,[],[f1443,f12]) ).
fof(f6948,plain,
! [X0,X1] : inverse(X0) = least_upper_bound(inverse(X0),inverse(least_upper_bound(X0,X1))),
inference(forward_demodulation,[],[f6896,f6]) ).
fof(f6988,plain,
! [X0,X1] : least_upper_bound(X0,inverse(least_upper_bound(inverse(X0),X1))) = X0,
inference(superposition,[],[f6948,f211]) ).
fof(f7079,plain,
! [X0,X1] : least_upper_bound(X1,inverse(least_upper_bound(X0,inverse(X1)))) = X1,
inference(superposition,[],[f6988,f6]) ).
fof(f7176,plain,
! [X0,X1] : inverse(least_upper_bound(X1,inverse(X0))) = greatest_lower_bound(inverse(least_upper_bound(X1,inverse(X0))),X0),
inference(superposition,[],[f451,f7079]) ).
fof(f7199,plain,
! [X0,X1] : inverse(least_upper_bound(X1,inverse(X0))) = greatest_lower_bound(X0,inverse(least_upper_bound(X1,inverse(X0)))),
inference(forward_demodulation,[],[f7176,f5]) ).
fof(f7256,plain,
! [X2,X0,X1] : greatest_lower_bound(X2,X1) = least_upper_bound(greatest_lower_bound(X2,X1),greatest_lower_bound(X2,inverse(least_upper_bound(X0,inverse(X1))))),
inference(superposition,[],[f231,f7199]) ).
fof(f7389,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,[],[f7256,f6]) ).
fof(f7617,plain,
! [X0,X1] : greatest_lower_bound(X1,X0) = least_upper_bound(greatest_lower_bound(X1,X0),inverse(least_upper_bound(inverse(X0),inverse(X1)))),
inference(superposition,[],[f7389,f7199]) ).
fof(f7715,plain,
! [X0,X1] : greatest_lower_bound(X1,inverse(X0)) = least_upper_bound(greatest_lower_bound(X1,inverse(X0)),inverse(least_upper_bound(X0,inverse(X1)))),
inference(superposition,[],[f7617,f211]) ).
fof(f9707,plain,
! [X0,X1] : least_upper_bound(X1,inverse(X0)) = least_upper_bound(least_upper_bound(X1,inverse(X0)),inverse(greatest_lower_bound(X0,inverse(X1)))),
inference(superposition,[],[f7079,f7715]) ).
fof(f9736,plain,
! [X0,X1] : least_upper_bound(X1,inverse(X0)) = least_upper_bound(X1,least_upper_bound(inverse(X0),inverse(greatest_lower_bound(X0,inverse(X1))))),
inference(forward_demodulation,[],[f9707,f8]) ).
fof(f9772,plain,
! [X0,X1] : least_upper_bound(X1,inverse(X0)) = least_upper_bound(inverse(greatest_lower_bound(X0,inverse(X1))),inverse(X0)),
inference(forward_demodulation,[],[f9736,f1785]) ).
fof(f9797,plain,
! [X0,X1] : least_upper_bound(X1,inverse(X0)) = least_upper_bound(inverse(X0),inverse(greatest_lower_bound(X0,inverse(X1)))),
inference(forward_demodulation,[],[f9772,f6]) ).
fof(f9817,plain,
! [X0,X1] : least_upper_bound(X1,inverse(X0)) = inverse(greatest_lower_bound(X0,inverse(X1))),
inference(forward_demodulation,[],[f9797,f1398]) ).
fof(f12235,plain,
least_upper_bound(identity,multiply(a,b)) != multiply(a,least_upper_bound(b,inverse(a))),
inference(superposition,[],[f18,f9817]) ).
fof(f12369,plain,
$false,
inference(forward_subsumption_resolution,[],[f12235,f262]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP186-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.41 % Computer : n005.cluster.edu
% 0.16/0.41 % Model : x86_64 x86_64
% 0.16/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.41 % Memory : 8046.5625MB
% 0.16/0.41 % OS : Linux 6.8.0-71-generic
% 0.16/0.41 % CPULimit : 300
% 0.16/0.41 % WCLimit : 300
% 0.16/0.41 % DateTime : Sun Sep 27 09:36:32 UTC 2026
% 0.16/0.42 % CPUTime :
% 0.16/0.42 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.47 Running first-order theorem proving
% 0.16/0.47 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
% 26.69/4.78 % (3741052)Detected a unit-equality problem, will run specialized UEQ schedule.
% 26.69/4.78 % (3741063)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=2060920674:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 26.69/4.78 % (3741061)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=3704676577:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 26.69/4.78 % (3741060)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=614425633:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 26.69/4.78 % (3741058)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=3616048045:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 26.69/4.78 % (3741057)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=1869876725:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 26.69/4.78 % (3741059)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=2874570621:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 26.69/4.78 % (3741062)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=2311034166:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 26.69/4.78 % (3741060)Instruction limit reached!
% 26.69/4.78 % (3741060)------------------------------
% 26.69/4.78 % (3741060)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 26.69/4.78 % (3741060)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.69/4.78 % (3741060)CaDiCaL version: 2.1.3
% 26.69/4.78 % (3741060)Termination reason: Instruction limit
% 26.69/4.78 % (3741060)Termination phase: Saturation
% 26.69/4.78 % (3741060)Time elapsed: 0.124 s
% 26.69/4.78 % (3741060)Peak memory usage: 88 MB
% 26.69/4.78 % (3741060)Instructions burned: 136 (million)
% 26.69/4.78 % (3741061)Instruction limit reached!
% 26.69/4.78 % (3741061)------------------------------
% 26.69/4.78 % (3741061)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 26.69/4.78 % (3741061)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.69/4.78 % (3741061)CaDiCaL version: 2.1.3
% 26.69/4.78 % (3741061)Termination reason: Instruction limit
% 26.69/4.78 % (3741061)Termination phase: Saturation
% 26.69/4.78 % (3741061)Time elapsed: 0.167 s
% 26.69/4.78 % (3741061)Peak memory usage: 89 MB
% 26.69/4.78 % (3741061)Instructions burned: 181 (million)
% 26.69/4.78 % (3741062)Instruction limit reached!
% 26.69/4.78 % (3741062)------------------------------
% 26.69/4.78 % (3741062)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 26.69/4.78 % (3741062)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.69/4.78 % (3741062)CaDiCaL version: 2.1.3
% 26.69/4.78 % (3741062)Termination reason: Instruction limit
% 26.69/4.78 % (3741062)Termination phase: Saturation
% 26.69/4.78 % (3741062)Time elapsed: 0.255 s
% 26.69/4.78 % (3741062)Peak memory usage: 91 MB
% 26.69/4.78 % (3741062)Instructions burned: 257 (million)
% 26.69/4.78 % (3741071)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=607759970:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2996 on theBenchmark for (2996ds/2051Mi)
% 26.69/4.78 % (3741072)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=3252298164:i=4948:ss=axioms:sgt=16_2995 on theBenchmark for (2995ds/4948Mi)
% 26.69/4.78 % (3741063)Instruction limit reached!
% 26.69/4.78 % (3741063)------------------------------
% 26.69/4.78 % (3741063)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 26.69/4.78 % (3741063)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.69/4.78 % (3741063)CaDiCaL version: 2.1.3
% 26.69/4.78 % (3741063)Termination reason: Instruction limit
% 26.69/4.78 % (3741063)Termination phase: Saturation
% 26.69/4.78 % (3741063)Time elapsed: 0.584 s
% 26.69/4.78 % (3741063)Peak memory usage: 99 MB
% 26.69/4.78 % (3741063)Instructions burned: 1189 (million)
% 26.69/4.78 % (3741073)lrs+10_5:1_sil=8000:sos=all:urr=on:br=off:flr=on:random_seed=818189859:i=215:ep=RSTC_2994 on theBenchmark for (2994ds/215Mi)
% 26.69/4.78 % (3741076)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=824619851:avsq=on:i=317:avsqr=1,16:kws=arity_squared:add=off:fgj=on:ins=10:fsr=off:gtg=exists_sym_2992 on theBenchmark for (2992ds/317Mi)
% 26.69/4.78 % (3741073)Instruction limit reached!
% 26.69/4.78 % (3741073)------------------------------
% 26.69/4.78 % (3741073)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 26.69/4.78 % (3741073)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.69/4.78 % (3741073)CaDiCaL version: 2.1.3
% 26.69/4.78 % (3741073)Termination reason: Instruction limit
% 26.69/4.78 % (3741073)Termination phase: Saturation
% 26.69/4.78 % (3741073)Time elapsed: 0.183 s
% 26.69/4.78 % (3741073)Peak memory usage: 89 MB
% 26.69/4.78 % (3741073)Instructions burned: 215 (million)
% 26.69/4.78 % (3741076)Instruction limit reached!
% 26.69/4.78 % (3741076)------------------------------
% 26.69/4.78 % (3741076)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 26.69/4.78 % (3741076)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.69/4.78 % (3741076)CaDiCaL version: 2.1.3
% 26.69/4.78 % (3741076)Termination reason: Instruction limit
% 26.69/4.78 % (3741076)Termination phase: Saturation
% 26.69/4.78 % (3741076)Time elapsed: 0.191 s
% 26.69/4.78 % (3741076)Peak memory usage: 92 MB
% 26.69/4.78 % (3741076)Instructions burned: 318 (million)
% 26.69/4.78 % (3741079)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=2978311052:i=12125:sd=2:fgj=on:ss=axioms:sgt=64_2989 on theBenchmark for (2989ds/12125Mi)
% 26.69/4.78 % (3741080)lrs+10_32_sil=8000:tgt=ground:prc=on:sp=reverse_arity:spb=non_intro:random_seed=1451655196:i=2836:kws=inv_precedence:fgj=on:bd=preordered:ins=10_2988 on theBenchmark for (2988ds/2836Mi)
% 26.69/4.78 % (3741071)Instruction limit reached!
% 26.69/4.78 % (3741071)------------------------------
% 26.69/4.78 % (3741071)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 26.69/4.78 % (3741071)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.69/4.78 % (3741071)CaDiCaL version: 2.1.3
% 26.69/4.78 % (3741071)Termination reason: Instruction limit
% 26.69/4.78 % (3741071)Termination phase: Saturation
% 26.69/4.78 % (3741071)Time elapsed: 2.116 s
% 26.69/4.78 % (3741071)Peak memory usage: 142 MB
% 26.69/4.78 % (3741071)Instructions burned: 2051 (million)
% 26.69/4.78 % (3741083)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:lma=off:kmz=on:random_seed=815696323:i=14534:kws=arity:fgj=on:bd=preordered:ins=6:ss=axioms:sgt=30_2971 on theBenchmark for (2971ds/14534Mi)
% 26.69/4.78 % (3741072)First to succeed.
% 26.69/4.78 % (3741072)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3741052"
% 26.69/4.78 % (3741072)Refutation found. Thanks to Tanya!
% 26.69/4.78 % SZS status Unsatisfiable for theBenchmark
% 26.69/4.78 % SZS output start Proof for theBenchmark
% See solution above
% 27.38/5.02 % (3741072)------------------------------
% 27.38/5.02 % (3741072)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 27.38/5.02 % (3741072)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 27.38/5.02 % (3741072)CaDiCaL version: 2.1.3
% 27.38/5.02 % (3741072)Termination reason: Refutation
% 27.38/5.02 % (3741072)Time elapsed: 2.645 s
% 27.38/5.02 % (3741072)Peak memory usage: 146 MB
% 27.38/5.02 % (3741072)Instructions burned: 2712 (million)
% 27.38/5.02 % (3741072)------------------------------
% 27.38/5.02 % (3741072)------------------------------
% 27.38/5.02 % (3741052)Success in time 3.756 s
% 27.38/5.02 % Vampire exiting
%------------------------------------------------------------------------------