%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : GRP181-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 : 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:13 AM UTC 2026
% Result : Unsatisfiable 12.54s 2.97s
% Output : Refutation 14.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 15
% Syntax : Number of formulae : 75 ( 75 unt; 0 def)
% Number of atoms : 75 ( 74 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 1 ( 1 ~; 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 : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 131 ( 131 !; 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(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,axiom,
greatest_lower_bound(a,c) = greatest_lower_bound(b,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p12_1) ).
fof(f18,axiom,
least_upper_bound(a,c) = least_upper_bound(b,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p12_2) ).
fof(f19,negated_conjecture,
a != b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p12) ).
fof(f20,plain,
least_upper_bound(a,c) = least_upper_bound(c,b),
inference(forward_demodulation,[],[f18,f6]) ).
fof(f21,plain,
greatest_lower_bound(a,c) = greatest_lower_bound(c,b),
inference(forward_demodulation,[],[f17,f5]) ).
fof(f22,plain,
least_upper_bound(c,b) = least_upper_bound(c,a),
inference(forward_demodulation,[],[f20,f6]) ).
fof(f23,plain,
greatest_lower_bound(c,b) = greatest_lower_bound(c,a),
inference(forward_demodulation,[],[f21,f5]) ).
fof(f51,plain,
! [X0,X1] : least_upper_bound(X1,greatest_lower_bound(X0,X1)) = X1,
inference(superposition,[],[f11,f5]) ).
fof(f85,plain,
! [X0,X1] : multiply(least_upper_bound(inverse(X0),X1),X0) = least_upper_bound(identity,multiply(X1,X0)),
inference(superposition,[],[f15,f3]) ).
fof(f87,plain,
! [X0,X1] : multiply(greatest_lower_bound(inverse(X0),X1),X0) = greatest_lower_bound(identity,multiply(X1,X0)),
inference(superposition,[],[f16,f3]) ).
fof(f88,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = multiply(identity,X1),
inference(superposition,[],[f4,f3]) ).
fof(f89,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(forward_demodulation,[],[f88,f1]) ).
fof(f94,plain,
! [X0] : multiply(inverse(inverse(X0)),identity) = X0,
inference(superposition,[],[f89,f3]) ).
fof(f95,plain,
! [X0,X1] : multiply(X1,X0) = multiply(inverse(inverse(X1)),X0),
inference(superposition,[],[f89,f89]) ).
fof(f104,plain,
! [X0] : multiply(X0,identity) = X0,
inference(forward_demodulation,[],[f94,f95]) ).
fof(f136,plain,
! [X0,X1] : multiply(inverse(X0),least_upper_bound(X0,X1)) = least_upper_bound(identity,multiply(inverse(X0),X1)),
inference(superposition,[],[f13,f3]) ).
fof(f140,plain,
! [X0,X1] : multiply(inverse(X0),least_upper_bound(X1,X0)) = least_upper_bound(multiply(inverse(X0),X1),identity),
inference(superposition,[],[f13,f3]) ).
fof(f154,plain,
! [X0,X1] : least_upper_bound(identity,multiply(inverse(X0),X1)) = multiply(inverse(X0),least_upper_bound(X1,X0)),
inference(forward_demodulation,[],[f140,f6]) ).
fof(f164,plain,
! [X2,X0,X1] : greatest_lower_bound(greatest_lower_bound(X0,X1),X2) = greatest_lower_bound(X1,greatest_lower_bound(X0,X2)),
inference(superposition,[],[f7,f5]) ).
fof(f179,plain,
! [X2,X0,X1] : greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(X2,greatest_lower_bound(X0,X1)),
inference(superposition,[],[f5,f7]) ).
fof(f198,plain,
! [X0,X1] : multiply(inverse(greatest_lower_bound(inverse(X1),X0)),greatest_lower_bound(identity,multiply(X0,X1))) = X1,
inference(superposition,[],[f89,f87]) ).
fof(f225,plain,
! [X0,X1] : multiply(inverse(least_upper_bound(inverse(X1),X0)),least_upper_bound(identity,multiply(X0,X1))) = X1,
inference(superposition,[],[f89,f85]) ).
fof(f251,plain,
! [X2,X0,X1] : least_upper_bound(X0,X1) = greatest_lower_bound(least_upper_bound(X0,X1),least_upper_bound(X0,least_upper_bound(X1,X2))),
inference(superposition,[],[f12,f8]) ).
fof(f366,plain,
! [X0] : inverse(inverse(X0)) = multiply(X0,identity),
inference(superposition,[],[f104,f95]) ).
fof(f367,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(forward_demodulation,[],[f366,f104]) ).
fof(f964,plain,
! [X0,X1] : least_upper_bound(X0,X1) = multiply(inverse(greatest_lower_bound(inverse(least_upper_bound(X0,X1)),inverse(X0))),greatest_lower_bound(identity,least_upper_bound(identity,multiply(inverse(X0),X1)))),
inference(superposition,[],[f198,f136]) ).
fof(f965,plain,
! [X0,X1] : least_upper_bound(X1,X0) = multiply(inverse(greatest_lower_bound(inverse(least_upper_bound(X1,X0)),inverse(X0))),greatest_lower_bound(identity,least_upper_bound(identity,multiply(inverse(X0),X1)))),
inference(superposition,[],[f198,f154]) ).
fof(f1002,plain,
! [X0,X1] : least_upper_bound(X1,X0) = multiply(inverse(greatest_lower_bound(inverse(least_upper_bound(X1,X0)),inverse(X0))),identity),
inference(forward_demodulation,[],[f965,f12]) ).
fof(f1003,plain,
! [X0,X1] : least_upper_bound(X0,X1) = multiply(inverse(greatest_lower_bound(inverse(least_upper_bound(X0,X1)),inverse(X0))),identity),
inference(forward_demodulation,[],[f964,f12]) ).
fof(f1020,plain,
! [X0,X1] : least_upper_bound(X1,X0) = inverse(greatest_lower_bound(inverse(least_upper_bound(X1,X0)),inverse(X0))),
inference(forward_demodulation,[],[f1002,f104]) ).
fof(f1021,plain,
! [X0,X1] : least_upper_bound(X0,X1) = inverse(greatest_lower_bound(inverse(least_upper_bound(X0,X1)),inverse(X0))),
inference(forward_demodulation,[],[f1003,f104]) ).
fof(f1032,plain,
! [X0,X1] : least_upper_bound(X1,X0) = inverse(greatest_lower_bound(inverse(X0),inverse(least_upper_bound(X1,X0)))),
inference(forward_demodulation,[],[f1020,f5]) ).
fof(f1033,plain,
! [X0,X1] : least_upper_bound(X0,X1) = inverse(greatest_lower_bound(inverse(X0),inverse(least_upper_bound(X0,X1)))),
inference(forward_demodulation,[],[f1021,f5]) ).
fof(f1076,plain,
! [X0,X1] : inverse(least_upper_bound(X0,X1)) = greatest_lower_bound(inverse(X0),inverse(least_upper_bound(X0,X1))),
inference(superposition,[],[f367,f1033]) ).
fof(f1104,plain,
! [X0,X1] : inverse(greatest_lower_bound(inverse(greatest_lower_bound(X0,X1)),inverse(X0))) = X0,
inference(superposition,[],[f1032,f11]) ).
fof(f1130,plain,
! [X0,X1] : inverse(least_upper_bound(X0,X1)) = greatest_lower_bound(inverse(X1),inverse(least_upper_bound(X0,X1))),
inference(superposition,[],[f367,f1032]) ).
fof(f1149,plain,
! [X0,X1] : inverse(greatest_lower_bound(inverse(X0),inverse(greatest_lower_bound(X0,X1)))) = X0,
inference(forward_demodulation,[],[f1104,f5]) ).
fof(f1190,plain,
! [X0,X1] : inverse(X0) = greatest_lower_bound(inverse(X0),inverse(greatest_lower_bound(X0,X1))),
inference(superposition,[],[f367,f1149]) ).
fof(f1329,plain,
! [X0,X1] : greatest_lower_bound(X0,inverse(greatest_lower_bound(inverse(X0),X1))) = X0,
inference(superposition,[],[f1190,f367]) ).
fof(f1361,plain,
! [X0,X1] : inverse(greatest_lower_bound(X0,X1)) = least_upper_bound(inverse(greatest_lower_bound(X0,X1)),inverse(X0)),
inference(superposition,[],[f51,f1190]) ).
fof(f1370,plain,
! [X0,X1] : inverse(greatest_lower_bound(X0,X1)) = least_upper_bound(inverse(X0),inverse(greatest_lower_bound(X0,X1))),
inference(forward_demodulation,[],[f1361,f6]) ).
fof(f1394,plain,
! [X0,X1] : greatest_lower_bound(X1,inverse(greatest_lower_bound(X0,inverse(X1)))) = X1,
inference(superposition,[],[f1329,f5]) ).
fof(f1594,plain,
! [X0,X1] : inverse(least_upper_bound(X1,inverse(X0))) = greatest_lower_bound(X0,inverse(least_upper_bound(X1,inverse(X0)))),
inference(superposition,[],[f1130,f367]) ).
fof(f1806,plain,
! [X0,X1] : inverse(greatest_lower_bound(X1,inverse(X0))) = least_upper_bound(inverse(greatest_lower_bound(X1,inverse(X0))),X0),
inference(superposition,[],[f51,f1394]) ).
fof(f1831,plain,
! [X0,X1] : inverse(greatest_lower_bound(X1,inverse(X0))) = least_upper_bound(X0,inverse(greatest_lower_bound(X1,inverse(X0)))),
inference(forward_demodulation,[],[f1806,f6]) ).
fof(f7353,plain,
! [X2,X0,X1] : least_upper_bound(X2,inverse(X0)) = greatest_lower_bound(least_upper_bound(X2,inverse(X0)),least_upper_bound(X2,inverse(greatest_lower_bound(X0,X1)))),
inference(superposition,[],[f251,f1370]) ).
fof(f8343,plain,
! [X2,X0,X1] : greatest_lower_bound(inverse(least_upper_bound(X0,inverse(X1))),X2) = greatest_lower_bound(inverse(least_upper_bound(X0,inverse(X1))),greatest_lower_bound(X1,X2)),
inference(superposition,[],[f164,f1594]) ).
fof(f8384,plain,
! [X2,X0,X1] : greatest_lower_bound(inverse(least_upper_bound(X0,inverse(X1))),X2) = greatest_lower_bound(X1,greatest_lower_bound(X2,inverse(least_upper_bound(X0,inverse(X1))))),
inference(forward_demodulation,[],[f8343,f179]) ).
fof(f30072,plain,
! [X0,X1] : least_upper_bound(X1,inverse(X0)) = greatest_lower_bound(least_upper_bound(X1,inverse(X0)),inverse(greatest_lower_bound(X0,inverse(X1)))),
inference(superposition,[],[f7353,f1831]) ).
fof(f30320,plain,
! [X0,X1] : greatest_lower_bound(X1,inverse(X0)) = greatest_lower_bound(greatest_lower_bound(X1,inverse(X0)),inverse(least_upper_bound(X0,inverse(X1)))),
inference(superposition,[],[f1394,f30072]) ).
fof(f30384,plain,
! [X0,X1] : greatest_lower_bound(X1,inverse(X0)) = greatest_lower_bound(X1,greatest_lower_bound(inverse(X0),inverse(least_upper_bound(X0,inverse(X1))))),
inference(forward_demodulation,[],[f30320,f7]) ).
fof(f30457,plain,
! [X0,X1] : greatest_lower_bound(X1,inverse(X0)) = greatest_lower_bound(inverse(least_upper_bound(X0,inverse(X1))),inverse(X0)),
inference(forward_demodulation,[],[f30384,f8384]) ).
fof(f30518,plain,
! [X0,X1] : greatest_lower_bound(X1,inverse(X0)) = greatest_lower_bound(inverse(X0),inverse(least_upper_bound(X0,inverse(X1)))),
inference(forward_demodulation,[],[f30457,f5]) ).
fof(f30559,plain,
! [X0,X1] : greatest_lower_bound(X1,inverse(X0)) = inverse(least_upper_bound(X0,inverse(X1))),
inference(forward_demodulation,[],[f30518,f1076]) ).
fof(f30714,plain,
! [X0,X1] : multiply(greatest_lower_bound(X0,inverse(inverse(X1))),least_upper_bound(identity,multiply(inverse(X0),X1))) = X1,
inference(superposition,[],[f225,f30559]) ).
fof(f30829,plain,
! [X0,X1] : multiply(greatest_lower_bound(X0,X1),least_upper_bound(identity,multiply(inverse(X0),X1))) = X1,
inference(forward_demodulation,[],[f30714,f367]) ).
fof(f38934,plain,
b = multiply(greatest_lower_bound(c,a),least_upper_bound(identity,multiply(inverse(c),b))),
inference(superposition,[],[f30829,f23]) ).
fof(f39018,plain,
! [X0,X1] : multiply(greatest_lower_bound(X0,X1),multiply(inverse(X0),least_upper_bound(X0,X1))) = X1,
inference(superposition,[],[f30829,f136]) ).
fof(f39158,plain,
b = multiply(greatest_lower_bound(c,a),multiply(inverse(c),least_upper_bound(c,b))),
inference(forward_demodulation,[],[f38934,f136]) ).
fof(f39279,plain,
b = multiply(greatest_lower_bound(c,a),multiply(inverse(c),least_upper_bound(c,a))),
inference(forward_demodulation,[],[f39158,f22]) ).
fof(f39363,plain,
a = b,
inference(forward_demodulation,[],[f39279,f39018]) ).
fof(f39413,plain,
$false,
inference(forward_subsumption_resolution,[],[f39363,f19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP181-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.11/0.40 % Computer : n017.cluster.edu
% 0.11/0.40 % Model : x86_64 x86_64
% 0.11/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.40 % Memory : 8046.5625MB
% 0.11/0.40 % OS : Linux 6.8.0-71-generic
% 0.11/0.40 % CPULimit : 300
% 0.11/0.40 % WCLimit : 300
% 0.11/0.40 % DateTime : Sun Sep 27 09:31:35 UTC 2026
% 0.11/0.40 % CPUTime :
% 0.11/0.40 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.44 Running first-order theorem proving
% 0.11/0.44 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
% 12.54/2.97 % (2287360)Detected a unit-equality problem, will run specialized UEQ schedule.
% 12.54/2.97 % (2287386)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=906575308:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 12.54/2.97 % (2287388)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=1133502149:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 12.54/2.97 % (2287387)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=924739079:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 12.54/2.97 % (2287385)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=2736975989:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 12.54/2.97 % (2287391)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=2672005024:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 12.54/2.97 % (2287389)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=3334442018:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 12.54/2.97 % (2287390)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=328111104:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 12.54/2.97 % (2287388)Instruction limit reached!
% 12.54/2.97 % (2287388)------------------------------
% 12.54/2.97 % (2287388)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.54/2.97 % (2287388)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.54/2.97 % (2287388)CaDiCaL version: 2.1.3
% 12.54/2.97 % (2287388)Termination reason: Instruction limit
% 12.54/2.97 % (2287388)Termination phase: Saturation
% 12.54/2.97 % (2287388)Time elapsed: 0.121 s
% 12.54/2.97 % (2287388)Peak memory usage: 88 MB
% 12.54/2.97 % (2287388)Instructions burned: 136 (million)
% 12.54/2.97 % (2287389)Instruction limit reached!
% 12.54/2.97 % (2287389)------------------------------
% 12.54/2.97 % (2287389)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.54/2.97 % (2287389)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.54/2.97 % (2287389)CaDiCaL version: 2.1.3
% 12.54/2.97 % (2287389)Termination reason: Instruction limit
% 12.54/2.97 % (2287389)Termination phase: Saturation
% 12.54/2.97 % (2287389)Time elapsed: 0.168 s
% 12.54/2.97 % (2287389)Peak memory usage: 89 MB
% 12.54/2.97 % (2287389)Instructions burned: 182 (million)
% 12.54/2.97 % (2287390)Instruction limit reached!
% 12.54/2.97 % (2287390)------------------------------
% 12.54/2.97 % (2287390)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.54/2.97 % (2287390)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.54/2.97 % (2287390)CaDiCaL version: 2.1.3
% 12.54/2.97 % (2287390)Termination reason: Instruction limit
% 12.54/2.97 % (2287390)Termination phase: Saturation
% 12.54/2.97 % (2287390)Time elapsed: 0.266 s
% 12.54/2.97 % (2287390)Peak memory usage: 91 MB
% 12.54/2.97 % (2287390)Instructions burned: 257 (million)
% 12.54/2.97 % (2287400)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=1497274621:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2996 on theBenchmark for (2996ds/2051Mi)
% 12.54/2.97 % (2287401)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=3156540135:i=4948:ss=axioms:sgt=16_2995 on theBenchmark for (2995ds/4948Mi)
% 12.54/2.97 % (2287403)lrs+10_5:1_sil=8000:sos=all:urr=on:br=off:flr=on:random_seed=329381610:i=215:ep=RSTC_2994 on theBenchmark for (2994ds/215Mi)
% 12.54/2.97 % (2287403)Instruction limit reached!
% 12.54/2.97 % (2287403)------------------------------
% 12.54/2.97 % (2287403)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.54/2.97 % (2287403)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.54/2.97 % (2287403)CaDiCaL version: 2.1.3
% 12.54/2.97 % (2287403)Termination reason: Instruction limit
% 12.54/2.97 % (2287403)Termination phase: Saturation
% 12.54/2.97 % (2287403)Time elapsed: 0.170 s
% 12.54/2.97 % (2287403)Peak memory usage: 93 MB
% 12.54/2.97 % (2287403)Instructions burned: 216 (million)
% 12.54/2.97 % (2287409)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=2369396715:avsq=on:i=317:avsqr=1,16:kws=arity_squared:add=off:fgj=on:ins=10:fsr=off:gtg=exists_sym_2991 on theBenchmark for (2991ds/317Mi)
% 12.54/2.97 % (2287391)Instruction limit reached!
% 12.54/2.97 % (2287391)------------------------------
% 12.54/2.97 % (2287391)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.54/2.97 % (2287391)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.54/2.97 % (2287391)CaDiCaL version: 2.1.3
% 12.54/2.97 % (2287391)Termination reason: Instruction limit
% 12.54/2.97 % (2287391)Termination phase: Saturation
% 12.54/2.97 % (2287391)Time elapsed: 0.917 s
% 12.54/2.97 % (2287391)Peak memory usage: 99 MB
% 12.54/2.97 % (2287391)Instructions burned: 1187 (million)
% 12.54/2.97 % (2287409)Instruction limit reached!
% 12.54/2.97 % (2287409)------------------------------
% 12.54/2.97 % (2287409)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.54/2.97 % (2287409)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.54/2.97 % (2287409)CaDiCaL version: 2.1.3
% 12.54/2.97 % (2287409)Termination reason: Instruction limit
% 12.54/2.97 % (2287409)Termination phase: Saturation
% 12.54/2.97 % (2287409)Time elapsed: 0.163 s
% 12.54/2.97 % (2287409)Peak memory usage: 90 MB
% 12.54/2.97 % (2287409)Instructions burned: 317 (million)
% 12.54/2.97 % (2287412)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=843786972:i=12125:sd=2:fgj=on:ss=axioms:sgt=64_2988 on theBenchmark for (2988ds/12125Mi)
% 12.54/2.97 % (2287413)lrs+10_32_sil=8000:tgt=ground:prc=on:sp=reverse_arity:spb=non_intro:random_seed=579333495:i=2836:kws=inv_precedence:fgj=on:bd=preordered:ins=10_2987 on theBenchmark for (2987ds/2836Mi)
% 12.54/2.97 % (2287386)First to succeed.
% 12.54/2.97 % (2287386)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2287360"
% 12.54/2.97 % (2287385)Also succeeded, but the first one will report.
% 12.54/2.97 % (2287400)Also succeeded, but the first one will report.
% 12.54/2.97 % (2287386)Refutation found. Thanks to Tanya!
% 12.54/2.97 % SZS status Unsatisfiable for theBenchmark
% 12.54/2.97 % SZS output start Proof for theBenchmark
% See solution above
% 14.64/3.17 % (2287386)------------------------------
% 14.64/3.17 % (2287386)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 14.64/3.17 % (2287386)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.64/3.17 % (2287386)CaDiCaL version: 2.1.3
% 14.64/3.17 % (2287386)Termination reason: Refutation
% 14.64/3.17 % (2287386)Time elapsed: 1.651 s
% 14.64/3.17 % (2287386)Peak memory usage: 156 MB
% 14.64/3.17 % (2287386)Instructions burned: 3876 (million)
% 14.64/3.17 % (2287386)------------------------------
% 14.64/3.17 % (2287386)------------------------------
% 14.64/3.17 % (2287360)Success in time 1.973 s
% 14.64/3.17 % Vampire exiting
%------------------------------------------------------------------------------