%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : GRP183-3 : 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:14 AM UTC 2026
% Result : Unsatisfiable 9.52s 2.34s
% Output : Refutation 10.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 32
% Number of leaves : 15
% Syntax : Number of formulae : 78 ( 78 unt; 0 def)
% Number of atoms : 78 ( 77 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 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 : 133 ( 133 !; 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(f9,axiom,
! [X0] : least_upper_bound(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_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(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,negated_conjecture,
greatest_lower_bound(least_upper_bound(a,identity),least_upper_bound(inverse(a),identity)) != identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_20x) ).
fof(f18,plain,
identity != greatest_lower_bound(least_upper_bound(a,identity),least_upper_bound(inverse(a),identity)),
inference(reorient_equations,[],[f17]) ).
fof(f19,plain,
identity != greatest_lower_bound(least_upper_bound(a,identity),least_upper_bound(identity,inverse(a))),
inference(backward_demodulation,[],[f18,f6]) ).
fof(f20,plain,
identity != greatest_lower_bound(least_upper_bound(identity,a),least_upper_bound(identity,inverse(a))),
inference(forward_demodulation,[],[f19,f6]) ).
fof(f22,plain,
! [X0,X1] : greatest_lower_bound(X1,least_upper_bound(X0,X1)) = X1,
inference(superposition,[],[f12,f6]) ).
fof(f31,plain,
! [X2,X0,X1] : least_upper_bound(X1,X2) = greatest_lower_bound(least_upper_bound(X1,X2),least_upper_bound(X1,least_upper_bound(X2,X0))),
inference(superposition,[],[f12,f8]) ).
fof(f39,plain,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X1,X0)) = X0,
inference(superposition,[],[f11,f5]) ).
fof(f47,plain,
! [X0,X1] : least_upper_bound(X1,X0) = least_upper_bound(X1,least_upper_bound(X1,X0)),
inference(superposition,[],[f8,f9]) ).
fof(f100,plain,
! [X0,X1] : multiply(inverse(X0),least_upper_bound(X1,X0)) = least_upper_bound(multiply(inverse(X0),X1),identity),
inference(superposition,[],[f13,f3]) ).
fof(f116,plain,
! [X0,X1] : least_upper_bound(identity,multiply(inverse(X0),X1)) = multiply(inverse(X0),least_upper_bound(X1,X0)),
inference(forward_demodulation,[],[f100,f6]) ).
fof(f141,plain,
! [X0,X1] : multiply(least_upper_bound(inverse(X0),X1),X0) = least_upper_bound(identity,multiply(X1,X0)),
inference(superposition,[],[f15,f3]) ).
fof(f142,plain,
! [X0,X1] : multiply(least_upper_bound(identity,X1),X0) = least_upper_bound(X0,multiply(X1,X0)),
inference(superposition,[],[f15,f1]) ).
fof(f196,plain,
! [X0,X1] : multiply(identity,X1) = multiply(inverse(X0),multiply(X0,X1)),
inference(superposition,[],[f4,f3]) ).
fof(f206,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(forward_demodulation,[],[f196,f1]) ).
fof(f210,plain,
! [X0] : multiply(inverse(inverse(X0)),identity) = X0,
inference(superposition,[],[f206,f3]) ).
fof(f213,plain,
! [X0,X1] : multiply(X0,X1) = multiply(inverse(inverse(X0)),X1),
inference(superposition,[],[f206,f206]) ).
fof(f228,plain,
! [X0] : multiply(X0,identity) = X0,
inference(forward_demodulation,[],[f210,f213]) ).
fof(f234,plain,
identity = inverse(identity),
inference(superposition,[],[f228,f3]) ).
fof(f237,plain,
! [X0,X1] : least_upper_bound(X0,multiply(X0,X1)) = multiply(X0,least_upper_bound(identity,X1)),
inference(superposition,[],[f13,f228]) ).
fof(f263,plain,
! [X2,X0,X1] : greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(X1,greatest_lower_bound(X2,X0)),
inference(superposition,[],[f5,f7]) ).
fof(f267,plain,
! [X0] : identity = multiply(X0,inverse(X0)),
inference(superposition,[],[f213,f3]) ).
fof(f277,plain,
! [X0] : inverse(inverse(X0)) = multiply(X0,identity),
inference(superposition,[],[f228,f213]) ).
fof(f280,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(forward_demodulation,[],[f277,f228]) ).
fof(f302,plain,
! [X0] : multiply(least_upper_bound(identity,X0),inverse(X0)) = least_upper_bound(inverse(X0),identity),
inference(superposition,[],[f142,f267]) ).
fof(f305,plain,
! [X0] : least_upper_bound(identity,inverse(X0)) = multiply(least_upper_bound(identity,X0),inverse(X0)),
inference(forward_demodulation,[],[f302,f6]) ).
fof(f335,plain,
! [X0] : least_upper_bound(identity,inverse(X0)) = multiply(inverse(X0),least_upper_bound(identity,X0)),
inference(superposition,[],[f116,f228]) ).
fof(f428,plain,
! [X0,X1] : multiply(X0,greatest_lower_bound(identity,X1)) = greatest_lower_bound(X0,multiply(X0,X1)),
inference(superposition,[],[f14,f228]) ).
fof(f519,plain,
! [X0,X1] : multiply(inverse(least_upper_bound(inverse(X0),X1)),least_upper_bound(identity,multiply(X1,X0))) = X0,
inference(superposition,[],[f206,f141]) ).
fof(f573,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,[],[f237,f519]) ).
fof(f574,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,[],[f573,f6]) ).
fof(f593,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,[],[f574,f47]) ).
fof(f604,plain,
! [X0,X1] : least_upper_bound(X0,inverse(least_upper_bound(inverse(X0),X1))) = X0,
inference(forward_demodulation,[],[f593,f519]) ).
fof(f612,plain,
! [X0,X1] : inverse(X0) = least_upper_bound(inverse(X0),inverse(least_upper_bound(X0,X1))),
inference(superposition,[],[f604,f280]) ).
fof(f624,plain,
! [X0,X1] : inverse(least_upper_bound(inverse(X0),X1)) = greatest_lower_bound(inverse(least_upper_bound(inverse(X0),X1)),X0),
inference(superposition,[],[f22,f604]) ).
fof(f631,plain,
! [X0,X1] : inverse(least_upper_bound(inverse(X0),X1)) = greatest_lower_bound(X0,inverse(least_upper_bound(inverse(X0),X1))),
inference(forward_demodulation,[],[f624,f5]) ).
fof(f639,plain,
! [X0,X1] : inverse(least_upper_bound(X0,X1)) = greatest_lower_bound(inverse(X0),inverse(least_upper_bound(X0,X1))),
inference(superposition,[],[f631,f280]) ).
fof(f694,plain,
! [X0,X1] : multiply(greatest_lower_bound(identity,X1),X0) = greatest_lower_bound(X0,multiply(X1,X0)),
inference(superposition,[],[f16,f1]) ).
fof(f829,plain,
! [X0,X1] : inverse(X0) = least_upper_bound(inverse(X0),inverse(least_upper_bound(X1,X0))),
inference(superposition,[],[f612,f6]) ).
fof(f890,plain,
! [X0,X1] : inverse(least_upper_bound(X1,X0)) = greatest_lower_bound(inverse(least_upper_bound(X1,X0)),inverse(X0)),
inference(superposition,[],[f22,f829]) ).
fof(f895,plain,
! [X0,X1] : inverse(least_upper_bound(X1,X0)) = greatest_lower_bound(inverse(X0),inverse(least_upper_bound(X1,X0))),
inference(forward_demodulation,[],[f890,f5]) ).
fof(f921,plain,
! [X0,X1] : inverse(X0) = greatest_lower_bound(inverse(greatest_lower_bound(X0,X1)),inverse(X0)),
inference(superposition,[],[f895,f11]) ).
fof(f934,plain,
! [X0,X1] : inverse(X0) = greatest_lower_bound(inverse(X0),inverse(greatest_lower_bound(X0,X1))),
inference(forward_demodulation,[],[f921,f5]) ).
fof(f936,plain,
! [X0,X1] : greatest_lower_bound(X0,inverse(greatest_lower_bound(inverse(X0),X1))) = X0,
inference(superposition,[],[f934,f280]) ).
fof(f967,plain,
! [X0,X1] : greatest_lower_bound(X0,inverse(greatest_lower_bound(X1,inverse(X0)))) = X0,
inference(superposition,[],[f936,f5]) ).
fof(f1505,plain,
! [X0] : multiply(greatest_lower_bound(identity,inverse(X0)),least_upper_bound(identity,X0)) = greatest_lower_bound(least_upper_bound(identity,X0),least_upper_bound(identity,inverse(X0))),
inference(superposition,[],[f694,f335]) ).
fof(f1508,plain,
identity != multiply(greatest_lower_bound(identity,inverse(a)),least_upper_bound(identity,a)),
inference(backward_demodulation,[],[f20,f1505]) ).
fof(f1561,plain,
! [X0,X1] : inverse(greatest_lower_bound(X1,inverse(X0))) = least_upper_bound(inverse(greatest_lower_bound(X1,inverse(X0))),X0),
inference(superposition,[],[f39,f967]) ).
fof(f1571,plain,
! [X0,X1] : inverse(greatest_lower_bound(X1,inverse(X0))) = least_upper_bound(X0,inverse(greatest_lower_bound(X1,inverse(X0)))),
inference(forward_demodulation,[],[f1561,f6]) ).
fof(f1720,plain,
! [X2,X0,X1] : least_upper_bound(X2,X0) = greatest_lower_bound(least_upper_bound(X2,X0),least_upper_bound(X2,inverse(greatest_lower_bound(X1,inverse(X0))))),
inference(superposition,[],[f31,f1571]) ).
fof(f1776,plain,
! [X2,X0,X1] : least_upper_bound(X0,X1) = greatest_lower_bound(least_upper_bound(X0,X1),least_upper_bound(X0,inverse(greatest_lower_bound(inverse(X1),X2)))),
inference(superposition,[],[f1720,f5]) ).
fof(f2273,plain,
! [X0] : greatest_lower_bound(least_upper_bound(identity,X0),least_upper_bound(identity,inverse(X0))) = multiply(least_upper_bound(identity,X0),greatest_lower_bound(identity,inverse(X0))),
inference(superposition,[],[f428,f305]) ).
fof(f2276,plain,
! [X0] : multiply(greatest_lower_bound(identity,inverse(X0)),least_upper_bound(identity,X0)) = multiply(least_upper_bound(identity,X0),greatest_lower_bound(identity,inverse(X0))),
inference(backward_demodulation,[],[f1505,f2273]) ).
fof(f2293,plain,
identity != multiply(least_upper_bound(identity,a),greatest_lower_bound(identity,inverse(a))),
inference(backward_demodulation,[],[f1508,f2276]) ).
fof(f2554,plain,
! [X0,X1] : least_upper_bound(X0,X1) = greatest_lower_bound(least_upper_bound(X0,X1),inverse(greatest_lower_bound(inverse(X1),inverse(X0)))),
inference(superposition,[],[f1776,f1571]) ).
fof(f2628,plain,
! [X0,X1] : greatest_lower_bound(inverse(X1),inverse(X0)) = greatest_lower_bound(greatest_lower_bound(inverse(X1),inverse(X0)),inverse(least_upper_bound(X0,X1))),
inference(superposition,[],[f967,f2554]) ).
fof(f2643,plain,
! [X0,X1] : greatest_lower_bound(inverse(X1),inverse(X0)) = greatest_lower_bound(inverse(least_upper_bound(X0,X1)),greatest_lower_bound(inverse(X1),inverse(X0))),
inference(forward_demodulation,[],[f2628,f5]) ).
fof(f2659,plain,
! [X0,X1] : greatest_lower_bound(inverse(X1),inverse(X0)) = greatest_lower_bound(inverse(X1),greatest_lower_bound(inverse(X0),inverse(least_upper_bound(X0,X1)))),
inference(forward_demodulation,[],[f2643,f263]) ).
fof(f2669,plain,
! [X0,X1] : greatest_lower_bound(inverse(X1),inverse(least_upper_bound(X0,X1))) = greatest_lower_bound(inverse(X1),inverse(X0)),
inference(forward_demodulation,[],[f2659,f639]) ).
fof(f2677,plain,
! [X0,X1] : inverse(least_upper_bound(X0,X1)) = greatest_lower_bound(inverse(X1),inverse(X0)),
inference(forward_demodulation,[],[f2669,f895]) ).
fof(f2833,plain,
! [X0] : inverse(least_upper_bound(identity,X0)) = greatest_lower_bound(inverse(X0),identity),
inference(superposition,[],[f2677,f234]) ).
fof(f2898,plain,
! [X0] : greatest_lower_bound(identity,inverse(X0)) = inverse(least_upper_bound(identity,X0)),
inference(forward_demodulation,[],[f2833,f5]) ).
fof(f2994,plain,
! [X0] : identity = multiply(least_upper_bound(identity,X0),greatest_lower_bound(identity,inverse(X0))),
inference(superposition,[],[f267,f2898]) ).
fof(f3021,plain,
$false,
inference(backward_subsumption_resolution,[],[f2293,f2994]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP183-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n017.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 09:31:50 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.41 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
% 9.52/2.34 % (2288213)Detected a unit-equality problem, will run specialized UEQ schedule.
% 9.52/2.34 % (2288249)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=4197102725:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 9.52/2.34 % (2288245)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=134351342:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 9.52/2.34 % (2288248)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=1344950645:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 9.52/2.34 % (2288247)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=3475969247:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 9.52/2.34 % (2288246)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=4157340751:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 9.52/2.34 % (2288250)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=3918941523:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 9.52/2.34 % (2288249)Instruction limit reached!
% 9.52/2.34 % (2288249)------------------------------
% 9.52/2.34 % (2288249)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.52/2.34 % (2288249)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.52/2.34 % (2288249)CaDiCaL version: 2.1.3
% 9.52/2.34 % (2288249)Termination reason: Instruction limit
% 9.52/2.34 % (2288249)Termination phase: Saturation
% 9.52/2.34 % (2288249)Time elapsed: 0.059 s
% 9.52/2.34 % (2288249)Peak memory usage: 89 MB
% 9.52/2.34 % (2288249)Instructions burned: 183 (million)
% 9.52/2.34 % (2288251)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=3227016228:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 9.52/2.34 % (2288248)Instruction limit reached!
% 9.52/2.34 % (2288248)------------------------------
% 9.52/2.34 % (2288248)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.52/2.34 % (2288248)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.52/2.34 % (2288248)CaDiCaL version: 2.1.3
% 9.52/2.34 % (2288248)Termination reason: Instruction limit
% 9.52/2.34 % (2288248)Termination phase: Saturation
% 9.52/2.34 % (2288248)Time elapsed: 0.086 s
% 9.52/2.34 % (2288248)Peak memory usage: 89 MB
% 9.52/2.34 % (2288248)Instructions burned: 137 (million)
% 9.52/2.34 % (2288258)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=2556889108:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2997 on theBenchmark for (2997ds/2051Mi)
% 9.52/2.34 % (2288250)Instruction limit reached!
% 9.52/2.34 % (2288250)------------------------------
% 9.52/2.34 % (2288250)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.52/2.34 % (2288250)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.52/2.34 % (2288250)CaDiCaL version: 2.1.3
% 9.52/2.34 % (2288250)Termination reason: Instruction limit
% 9.52/2.34 % (2288250)Termination phase: Saturation
% 9.52/2.34 % (2288250)Time elapsed: 0.161 s
% 9.52/2.34 % (2288250)Peak memory usage: 91 MB
% 9.52/2.34 % (2288250)Instructions burned: 257 (million)
% 9.52/2.34 % (2288260)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=40771845:i=4948:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/4948Mi)
% 9.52/2.34 % (2288264)lrs+10_5:1_sil=8000:sos=all:urr=on:br=off:flr=on:random_seed=3123892696:i=215:ep=RSTC_2996 on theBenchmark for (2996ds/215Mi)
% 9.52/2.34 % (2288264)Instruction limit reached!
% 9.52/2.34 % (2288264)------------------------------
% 9.52/2.34 % (2288264)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.52/2.34 % (2288264)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.52/2.34 % (2288264)CaDiCaL version: 2.1.3
% 9.52/2.34 % (2288264)Termination reason: Instruction limit
% 9.52/2.34 % (2288264)Termination phase: Saturation
% 9.52/2.34 % (2288264)Time elapsed: 0.113 s
% 9.52/2.34 % (2288264)Peak memory usage: 90 MB
% 9.52/2.34 % (2288264)Instructions burned: 217 (million)
% 9.52/2.34 % (2288334)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=1053952393:avsq=on:i=317:avsqr=1,16:kws=arity_squared:add=off:fgj=on:ins=10:fsr=off:gtg=exists_sym_2993 on theBenchmark for (2993ds/317Mi)
% 9.52/2.34 % (2288251)Instruction limit reached!
% 9.52/2.34 % (2288251)------------------------------
% 9.52/2.34 % (2288251)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.52/2.34 % (2288251)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.52/2.34 % (2288251)CaDiCaL version: 2.1.3
% 9.52/2.34 % (2288251)Termination reason: Instruction limit
% 9.52/2.34 % (2288251)Termination phase: Saturation
% 9.52/2.34 % (2288251)Time elapsed: 0.643 s
% 9.52/2.34 % (2288251)Peak memory usage: 99 MB
% 9.52/2.34 % (2288251)Instructions burned: 1187 (million)
% 9.52/2.34 % (2288334)Instruction limit reached!
% 9.52/2.34 % (2288334)------------------------------
% 9.52/2.34 % (2288334)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.52/2.34 % (2288334)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.52/2.34 % (2288334)CaDiCaL version: 2.1.3
% 9.52/2.34 % (2288334)Termination reason: Instruction limit
% 9.52/2.34 % (2288334)Termination phase: Saturation
% 9.52/2.34 % (2288334)Time elapsed: 0.199 s
% 9.52/2.34 % (2288334)Peak memory usage: 92 MB
% 9.52/2.34 % (2288334)Instructions burned: 318 (million)
% 9.52/2.34 % (2288421)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=2835498922:i=12125:sd=2:fgj=on:ss=axioms:sgt=64_2991 on theBenchmark for (2991ds/12125Mi)
% 9.52/2.34 % (2288258)First to succeed.
% 9.52/2.34 % (2288258)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2288213"
% 9.52/2.34 % (2288422)lrs+10_32_sil=8000:tgt=ground:prc=on:sp=reverse_arity:spb=non_intro:random_seed=1076566853:i=2836:kws=inv_precedence:fgj=on:bd=preordered:ins=10_2990 on theBenchmark for (2990ds/2836Mi)
% 9.52/2.34 % (2288258)Refutation found. Thanks to Tanya!
% 9.52/2.34 % SZS status Unsatisfiable for theBenchmark
% 9.52/2.34 % SZS output start Proof for theBenchmark
% See solution above
% 10.04/2.54 % (2288258)------------------------------
% 10.04/2.54 % (2288258)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.04/2.54 % (2288258)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.04/2.54 % (2288258)CaDiCaL version: 2.1.3
% 10.04/2.54 % (2288258)Termination reason: Refutation
% 10.04/2.54 % (2288258)Time elapsed: 0.735 s
% 10.04/2.54 % (2288258)Peak memory usage: 135 MB
% 10.04/2.54 % (2288258)Instructions burned: 1465 (million)
% 10.04/2.54 % (2288258)------------------------------
% 10.04/2.54 % (2288258)------------------------------
% 10.04/2.54 % (2288213)Success in time 1.317 s
% 10.04/2.54 % Vampire exiting
%------------------------------------------------------------------------------