%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : GRP186-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 : n007.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 12.92s 2.70s
% Output : Refutation 12.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 33
% Number of leaves : 17
% Syntax : Number of formulae : 91 ( 91 unt; 0 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 ( 3 avg)
% Maximal term depth : 7 ( 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 : 161 ( 161 !; 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(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',p23_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',p23_2) ).
fof(f20,axiom,
! [X0,X1] : inverse(multiply(X0,X1)) = multiply(inverse(X1),inverse(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p23_3) ).
fof(f21,negated_conjecture,
least_upper_bound(multiply(a,b),identity) != multiply(a,inverse(greatest_lower_bound(a,inverse(b)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p23) ).
fof(f22,plain,
multiply(a,inverse(greatest_lower_bound(a,inverse(b)))) != least_upper_bound(identity,multiply(a,b)),
inference(forward_demodulation,[],[f21,f6]) ).
fof(f25,plain,
! [X0] : inverse(multiply(identity,X0)) = multiply(inverse(X0),identity),
inference(superposition,[],[f20,f18]) ).
fof(f28,plain,
! [X0] : inverse(X0) = multiply(inverse(X0),identity),
inference(forward_demodulation,[],[f25,f1]) ).
fof(f44,plain,
! [X0] : multiply(X0,identity) = X0,
inference(superposition,[],[f28,f19]) ).
fof(f46,plain,
! [X0,X1] : inverse(multiply(X1,inverse(X0))) = multiply(X0,inverse(X1)),
inference(superposition,[],[f20,f19]) ).
fof(f47,plain,
! [X0] : identity = multiply(X0,inverse(X0)),
inference(superposition,[],[f3,f19]) ).
fof(f136,plain,
! [X0,X1] : multiply(least_upper_bound(identity,X1),X0) = least_upper_bound(X0,multiply(X1,X0)),
inference(superposition,[],[f15,f1]) ).
fof(f156,plain,
! [X0,X1] : least_upper_bound(X1,greatest_lower_bound(X0,X1)) = X1,
inference(superposition,[],[f11,f5]) ).
fof(f160,plain,
! [X0,X1] : multiply(inverse(X0),least_upper_bound(X0,X1)) = least_upper_bound(identity,multiply(inverse(X0),X1)),
inference(superposition,[],[f13,f3]) ).
fof(f162,plain,
! [X0,X1] : least_upper_bound(identity,multiply(X0,X1)) = multiply(X0,least_upper_bound(inverse(X0),X1)),
inference(superposition,[],[f13,f47]) ).
fof(f182,plain,
! [X0,X1] : multiply(greatest_lower_bound(inverse(X0),X1),X0) = greatest_lower_bound(identity,multiply(X1,X0)),
inference(superposition,[],[f16,f3]) ).
fof(f188,plain,
! [X0,X1] : multiply(greatest_lower_bound(X0,inverse(X1)),X1) = greatest_lower_bound(multiply(X0,X1),identity),
inference(superposition,[],[f16,f3]) ).
fof(f204,plain,
! [X0,X1] : multiply(greatest_lower_bound(X0,inverse(X1)),X1) = greatest_lower_bound(identity,multiply(X0,X1)),
inference(forward_demodulation,[],[f188,f5]) ).
fof(f225,plain,
! [X0,X1] : multiply(inverse(X0),greatest_lower_bound(X0,X1)) = greatest_lower_bound(identity,multiply(inverse(X0),X1)),
inference(superposition,[],[f14,f3]) ).
fof(f229,plain,
! [X0,X1] : multiply(X0,greatest_lower_bound(identity,X1)) = greatest_lower_bound(X0,multiply(X0,X1)),
inference(superposition,[],[f14,f44]) ).
fof(f283,plain,
! [X0,X1] : multiply(identity,X1) = multiply(inverse(X0),multiply(X0,X1)),
inference(superposition,[],[f4,f3]) ).
fof(f311,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(forward_demodulation,[],[f283,f1]) ).
fof(f332,plain,
! [X0,X1] : inverse(X0) = multiply(inverse(inverse(X1)),inverse(multiply(X0,X1))),
inference(superposition,[],[f311,f20]) ).
fof(f353,plain,
! [X0,X1] : inverse(X0) = inverse(multiply(multiply(X0,X1),inverse(X1))),
inference(forward_demodulation,[],[f332,f20]) ).
fof(f364,plain,
! [X0,X1] : inverse(X0) = multiply(X1,inverse(multiply(X0,X1))),
inference(forward_demodulation,[],[f353,f46]) ).
fof(f442,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(f770,plain,
! [X0] : greatest_lower_bound(inverse(X0),identity) = multiply(inverse(X0),greatest_lower_bound(identity,X0)),
inference(superposition,[],[f229,f3]) ).
fof(f808,plain,
! [X0] : greatest_lower_bound(identity,inverse(X0)) = multiply(inverse(X0),greatest_lower_bound(identity,X0)),
inference(forward_demodulation,[],[f770,f5]) ).
fof(f857,plain,
! [X0] : inverse(inverse(X0)) = multiply(greatest_lower_bound(identity,X0),inverse(greatest_lower_bound(identity,inverse(X0)))),
inference(superposition,[],[f364,f808]) ).
fof(f858,plain,
! [X0] : multiply(greatest_lower_bound(identity,X0),inverse(greatest_lower_bound(identity,inverse(X0)))) = X0,
inference(forward_demodulation,[],[f857,f19]) ).
fof(f926,plain,
! [X0] : multiply(least_upper_bound(identity,greatest_lower_bound(identity,X0)),inverse(greatest_lower_bound(identity,inverse(X0)))) = least_upper_bound(inverse(greatest_lower_bound(identity,inverse(X0))),X0),
inference(superposition,[],[f136,f858]) ).
fof(f936,plain,
! [X0] : multiply(least_upper_bound(identity,greatest_lower_bound(identity,X0)),inverse(greatest_lower_bound(identity,inverse(X0)))) = least_upper_bound(X0,inverse(greatest_lower_bound(identity,inverse(X0)))),
inference(forward_demodulation,[],[f926,f6]) ).
fof(f948,plain,
! [X0] : least_upper_bound(X0,inverse(greatest_lower_bound(identity,inverse(X0)))) = multiply(identity,inverse(greatest_lower_bound(identity,inverse(X0)))),
inference(forward_demodulation,[],[f936,f11]) ).
fof(f955,plain,
! [X0] : inverse(greatest_lower_bound(identity,inverse(X0))) = least_upper_bound(X0,inverse(greatest_lower_bound(identity,inverse(X0)))),
inference(forward_demodulation,[],[f948,f1]) ).
fof(f987,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,f156]) ).
fof(f1000,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(f1010,plain,
! [X0] : greatest_lower_bound(X0,inverse(greatest_lower_bound(identity,inverse(X0)))) = X0,
inference(superposition,[],[f12,f955]) ).
fof(f2005,plain,
! [X0] : multiply(inverse(X0),X0) = greatest_lower_bound(identity,multiply(inverse(X0),inverse(greatest_lower_bound(identity,inverse(X0))))),
inference(superposition,[],[f225,f1010]) ).
fof(f2026,plain,
! [X0] : multiply(inverse(X0),X0) = greatest_lower_bound(identity,inverse(multiply(greatest_lower_bound(identity,inverse(X0)),X0))),
inference(forward_demodulation,[],[f2005,f20]) ).
fof(f2037,plain,
! [X0] : multiply(inverse(X0),X0) = greatest_lower_bound(identity,inverse(greatest_lower_bound(identity,multiply(identity,X0)))),
inference(forward_demodulation,[],[f2026,f204]) ).
fof(f2042,plain,
! [X0] : multiply(inverse(X0),X0) = greatest_lower_bound(identity,inverse(multiply(identity,greatest_lower_bound(identity,X0)))),
inference(forward_demodulation,[],[f2037,f229]) ).
fof(f2044,plain,
! [X0] : multiply(inverse(X0),X0) = greatest_lower_bound(identity,inverse(greatest_lower_bound(identity,X0))),
inference(forward_demodulation,[],[f2042,f1]) ).
fof(f2046,plain,
! [X0] : identity = greatest_lower_bound(identity,inverse(greatest_lower_bound(identity,X0))),
inference(forward_demodulation,[],[f2044,f3]) ).
fof(f3054,plain,
! [X0,X1] : multiply(inverse(greatest_lower_bound(inverse(X1),X0)),greatest_lower_bound(identity,multiply(X0,X1))) = X1,
inference(superposition,[],[f311,f182]) ).
fof(f3159,plain,
! [X0,X1] : inverse(X0) = multiply(inverse(greatest_lower_bound(inverse(inverse(X0)),inverse(X1))),greatest_lower_bound(identity,inverse(multiply(X0,X1)))),
inference(superposition,[],[f3054,f20]) ).
fof(f3170,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,[],[f3054,f160]) ).
fof(f3226,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,[],[f3170,f12]) ).
fof(f3237,plain,
! [X0,X1] : inverse(X0) = multiply(inverse(greatest_lower_bound(X0,inverse(X1))),greatest_lower_bound(identity,inverse(multiply(X0,X1)))),
inference(forward_demodulation,[],[f3159,f19]) ).
fof(f3270,plain,
! [X0,X1] : least_upper_bound(X0,X1) = inverse(greatest_lower_bound(inverse(least_upper_bound(X0,X1)),inverse(X0))),
inference(forward_demodulation,[],[f3226,f28]) ).
fof(f3300,plain,
! [X0,X1] : least_upper_bound(X0,X1) = inverse(greatest_lower_bound(inverse(X0),inverse(least_upper_bound(X0,X1)))),
inference(forward_demodulation,[],[f3270,f5]) ).
fof(f3377,plain,
! [X0,X1] : inverse(inverse(X0)) = multiply(inverse(greatest_lower_bound(inverse(X0),inverse(greatest_lower_bound(X0,X1)))),greatest_lower_bound(identity,inverse(greatest_lower_bound(identity,multiply(inverse(X0),X1))))),
inference(superposition,[],[f3237,f225]) ).
fof(f3446,plain,
! [X0,X1] : inverse(inverse(X0)) = multiply(inverse(greatest_lower_bound(inverse(X0),inverse(greatest_lower_bound(X0,X1)))),identity),
inference(forward_demodulation,[],[f3377,f2046]) ).
fof(f3489,plain,
! [X0,X1] : inverse(inverse(X0)) = inverse(greatest_lower_bound(inverse(X0),inverse(greatest_lower_bound(X0,X1)))),
inference(forward_demodulation,[],[f3446,f28]) ).
fof(f3516,plain,
! [X0,X1] : inverse(greatest_lower_bound(inverse(X0),inverse(greatest_lower_bound(X0,X1)))) = X0,
inference(forward_demodulation,[],[f3489,f19]) ).
fof(f3595,plain,
! [X0,X1] : inverse(X0) = greatest_lower_bound(inverse(X0),inverse(greatest_lower_bound(X0,X1))),
inference(superposition,[],[f19,f3516]) ).
fof(f3704,plain,
! [X0,X1] : inverse(X1) = greatest_lower_bound(inverse(X1),inverse(greatest_lower_bound(X0,X1))),
inference(superposition,[],[f3595,f5]) ).
fof(f3732,plain,
! [X0,X1] : inverse(greatest_lower_bound(X0,X1)) = least_upper_bound(inverse(greatest_lower_bound(X0,X1)),inverse(X0)),
inference(superposition,[],[f156,f3595]) ).
fof(f3744,plain,
! [X0,X1] : inverse(greatest_lower_bound(X0,X1)) = least_upper_bound(inverse(X0),inverse(greatest_lower_bound(X0,X1))),
inference(forward_demodulation,[],[f3732,f6]) ).
fof(f3815,plain,
! [X2,X0,X1] : least_upper_bound(inverse(greatest_lower_bound(X1,X0)),X2) = least_upper_bound(inverse(greatest_lower_bound(X1,X0)),least_upper_bound(inverse(X0),X2)),
inference(superposition,[],[f987,f3704]) ).
fof(f3822,plain,
! [X2,X0,X1] : least_upper_bound(inverse(greatest_lower_bound(X1,X0)),X2) = least_upper_bound(inverse(X0),least_upper_bound(X2,inverse(greatest_lower_bound(X1,X0)))),
inference(forward_demodulation,[],[f3815,f1000]) ).
fof(f4894,plain,
! [X0,X1] : least_upper_bound(inverse(X0),X1) = inverse(greatest_lower_bound(X0,inverse(least_upper_bound(inverse(X0),X1)))),
inference(superposition,[],[f3300,f19]) ).
fof(f5148,plain,
! [X0,X1] : inverse(least_upper_bound(inverse(X0),X1)) = greatest_lower_bound(X0,inverse(least_upper_bound(inverse(X0),X1))),
inference(superposition,[],[f19,f4894]) ).
fof(f5297,plain,
! [X0,X1] : least_upper_bound(X0,inverse(least_upper_bound(inverse(X0),X1))) = X0,
inference(superposition,[],[f11,f5148]) ).
fof(f5301,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,[],[f442,f5148]) ).
fof(f5457,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,[],[f5301,f6]) ).
fof(f5659,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = least_upper_bound(greatest_lower_bound(X0,X1),inverse(least_upper_bound(inverse(X0),inverse(X1)))),
inference(superposition,[],[f5457,f5148]) ).
fof(f5799,plain,
! [X0,X1] : least_upper_bound(X1,inverse(least_upper_bound(X0,inverse(X1)))) = X1,
inference(superposition,[],[f5297,f6]) ).
fof(f6223,plain,
! [X0,X1] : least_upper_bound(inverse(X0),inverse(X1)) = least_upper_bound(least_upper_bound(inverse(X0),inverse(X1)),inverse(greatest_lower_bound(X0,X1))),
inference(superposition,[],[f5799,f5659]) ).
fof(f6239,plain,
! [X0,X1] : least_upper_bound(inverse(X0),inverse(X1)) = least_upper_bound(inverse(greatest_lower_bound(X0,X1)),least_upper_bound(inverse(X0),inverse(X1))),
inference(forward_demodulation,[],[f6223,f6]) ).
fof(f6274,plain,
! [X0,X1] : least_upper_bound(inverse(X0),inverse(X1)) = least_upper_bound(inverse(X1),least_upper_bound(inverse(greatest_lower_bound(X0,X1)),inverse(X0))),
inference(forward_demodulation,[],[f6239,f1000]) ).
fof(f6299,plain,
! [X0,X1] : least_upper_bound(inverse(X0),inverse(X1)) = least_upper_bound(inverse(X1),least_upper_bound(inverse(X0),inverse(greatest_lower_bound(X0,X1)))),
inference(forward_demodulation,[],[f6274,f6]) ).
fof(f6322,plain,
! [X0,X1] : least_upper_bound(inverse(greatest_lower_bound(X0,X1)),inverse(X0)) = least_upper_bound(inverse(X0),inverse(X1)),
inference(forward_demodulation,[],[f6299,f3822]) ).
fof(f6332,plain,
! [X0,X1] : least_upper_bound(inverse(X0),inverse(greatest_lower_bound(X0,X1))) = least_upper_bound(inverse(X0),inverse(X1)),
inference(forward_demodulation,[],[f6322,f6]) ).
fof(f6334,plain,
! [X0,X1] : inverse(greatest_lower_bound(X0,X1)) = least_upper_bound(inverse(X0),inverse(X1)),
inference(forward_demodulation,[],[f6332,f3744]) ).
fof(f6354,plain,
! [X0,X1] : least_upper_bound(inverse(X1),X0) = inverse(greatest_lower_bound(X1,inverse(X0))),
inference(superposition,[],[f6334,f19]) ).
fof(f6506,plain,
least_upper_bound(identity,multiply(a,b)) != multiply(a,least_upper_bound(inverse(a),b)),
inference(superposition,[],[f22,f6354]) ).
fof(f6607,plain,
$false,
inference(forward_subsumption_resolution,[],[f6506,f162]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP186-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.10/0.38 % Computer : n007.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 27 09:34:55 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.44 Running first-order theorem proving
% 0.15/0.44 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
% 12.19/2.70 % (1157654)Detected a unit-equality problem, will run specialized UEQ schedule.
% 12.19/2.70 % (1157690)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=2906679396:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 12.19/2.70 % (1157686)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=3280510910:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 12.19/2.70 % (1157682)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=2020186297:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 12.19/2.70 % (1157687)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=182938323:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 12.19/2.70 % (1157684)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=13680554:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 12.19/2.70 % (1157681)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=3292587894:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 12.19/2.70 % (1157688)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=2906021720:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 12.19/2.70 % (1157686)Instruction limit reached!
% 12.19/2.70 % (1157686)------------------------------
% 12.19/2.70 % (1157686)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.19/2.70 % (1157686)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.19/2.70 % (1157686)CaDiCaL version: 2.1.3
% 12.19/2.70 % (1157686)Termination reason: Instruction limit
% 12.19/2.70 % (1157686)Termination phase: Saturation
% 12.19/2.70 % (1157686)Time elapsed: 0.080 s
% 12.19/2.70 % (1157686)Peak memory usage: 88 MB
% 12.19/2.70 % (1157686)Instructions burned: 136 (million)
% 12.19/2.70 % (1157687)Instruction limit reached!
% 12.19/2.70 % (1157687)------------------------------
% 12.19/2.70 % (1157687)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.19/2.70 % (1157687)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.19/2.70 % (1157687)CaDiCaL version: 2.1.3
% 12.19/2.70 % (1157687)Termination reason: Instruction limit
% 12.19/2.70 % (1157687)Termination phase: Saturation
% 12.19/2.70 % (1157687)Time elapsed: 0.110 s
% 12.19/2.70 % (1157687)Peak memory usage: 89 MB
% 12.19/2.70 % (1157687)Instructions burned: 182 (million)
% 12.19/2.70 % (1157688)Instruction limit reached!
% 12.19/2.70 % (1157688)------------------------------
% 12.19/2.70 % (1157688)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.19/2.70 % (1157688)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.19/2.70 % (1157688)CaDiCaL version: 2.1.3
% 12.19/2.70 % (1157688)Termination reason: Instruction limit
% 12.19/2.70 % (1157688)Termination phase: Saturation
% 12.19/2.70 % (1157688)Time elapsed: 0.157 s
% 12.19/2.70 % (1157688)Peak memory usage: 90 MB
% 12.19/2.70 % (1157688)Instructions burned: 258 (million)
% 12.19/2.70 % (1157754)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=3908667063:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2997 on theBenchmark for (2997ds/2051Mi)
% 12.19/2.70 % (1157766)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=2379050351:i=4948:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/4948Mi)
% 12.19/2.70 % (1157778)lrs+10_5:1_sil=8000:sos=all:urr=on:br=off:flr=on:random_seed=3141806602:i=215:ep=RSTC_2996 on theBenchmark for (2996ds/215Mi)
% 12.19/2.70 % (1157690)Instruction limit reached!
% 12.19/2.70 % (1157690)------------------------------
% 12.19/2.70 % (1157690)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.19/2.70 % (1157690)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.19/2.70 % (1157690)CaDiCaL version: 2.1.3
% 12.19/2.70 % (1157690)Termination reason: Instruction limit
% 12.19/2.70 % (1157690)Termination phase: Saturation
% 12.19/2.70 % (1157690)Time elapsed: 0.352 s
% 12.19/2.70 % (1157690)Peak memory usage: 99 MB
% 12.19/2.70 % (1157690)Instructions burned: 1190 (million)
% 12.19/2.70 % (1157791)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=506881377: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)
% 12.19/2.70 % (1157778)Instruction limit reached!
% 12.19/2.70 % (1157778)------------------------------
% 12.19/2.70 % (1157778)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.19/2.70 % (1157778)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.19/2.70 % (1157778)CaDiCaL version: 2.1.3
% 12.19/2.70 % (1157778)Termination reason: Instruction limit
% 12.19/2.70 % (1157778)Termination phase: Saturation
% 12.19/2.70 % (1157778)Time elapsed: 0.122 s
% 12.19/2.70 % (1157778)Peak memory usage: 92 MB
% 12.19/2.70 % (1157778)Instructions burned: 216 (million)
% 12.19/2.70 % (1157791)Instruction limit reached!
% 12.19/2.70 % (1157791)------------------------------
% 12.19/2.70 % (1157791)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.92/2.70 % (1157791)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.92/2.70 % (1157791)CaDiCaL version: 2.1.3
% 12.92/2.70 % (1157791)Termination reason: Instruction limit
% 12.92/2.70 % (1157791)Termination phase: Saturation
% 12.92/2.70 % (1157791)Time elapsed: 0.111 s
% 12.92/2.70 % (1157791)Peak memory usage: 93 MB
% 12.92/2.70 % (1157791)Instructions burned: 320 (million)
% 12.92/2.70 % (1157833)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=3658625702:i=12125:sd=2:fgj=on:ss=axioms:sgt=64_2994 on theBenchmark for (2994ds/12125Mi)
% 12.92/2.70 % (1157836)lrs+10_32_sil=8000:tgt=ground:prc=on:sp=reverse_arity:spb=non_intro:random_seed=2824360291:i=2836:kws=inv_precedence:fgj=on:bd=preordered:ins=10_2993 on theBenchmark for (2993ds/2836Mi)
% 12.92/2.70 % (1157766)First to succeed.
% 12.92/2.70 % (1157766)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1157654"
% 12.92/2.70 % (1157754)Instruction limit reached!
% 12.92/2.70 % (1157754)------------------------------
% 12.92/2.70 % (1157754)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.92/2.70 % (1157754)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.92/2.70 % (1157754)CaDiCaL version: 2.1.3
% 12.92/2.70 % (1157754)Termination reason: Instruction limit
% 12.92/2.70 % (1157754)Termination phase: Saturation
% 12.92/2.70 % (1157754)Time elapsed: 1.320 s
% 12.92/2.70 % (1157754)Peak memory usage: 142 MB
% 12.92/2.70 % (1157754)Instructions burned: 2052 (million)
% 12.92/2.70 % (1157766)Refutation found. Thanks to Tanya!
% 12.92/2.70 % SZS status Unsatisfiable for theBenchmark
% 12.92/2.70 % SZS output start Proof for theBenchmark
% See solution above
% 12.92/2.79 % (1157766)------------------------------
% 12.92/2.79 % (1157766)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.92/2.79 % (1157766)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.92/2.79 % (1157766)CaDiCaL version: 2.1.3
% 12.92/2.79 % (1157766)Termination reason: Refutation
% 12.92/2.79 % (1157766)Time elapsed: 1.119 s
% 12.92/2.79 % (1157766)Peak memory usage: 137 MB
% 12.92/2.79 % (1157766)Instructions burned: 1779 (million)
% 12.92/2.79 % (1157766)------------------------------
% 12.92/2.79 % (1157766)------------------------------
% 12.92/2.79 % (1157654)Success in time 1.744 s
% 12.92/2.79 % Vampire exiting
%------------------------------------------------------------------------------