%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : GRP184-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 : n010.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:15 AM UTC 2026
% Result : Unsatisfiable 13.24s 2.77s
% Output : Refutation 14.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 19
% Syntax : Number of formulae : 80 ( 80 unt; 6 def)
% Number of atoms : 80 ( 79 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 74 ( 74 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
! [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(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',p21_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',p21_2) ).
fof(f20,axiom,
! [X0,X1] : inverse(multiply(X0,X1)) = multiply(inverse(X1),inverse(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p21_3) ).
fof(f21,negated_conjecture,
multiply(least_upper_bound(a,identity),inverse(greatest_lower_bound(a,identity))) != multiply(inverse(greatest_lower_bound(a,identity)),least_upper_bound(a,identity)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p21) ).
fof(f22,definition,
sF0 = inverse(identity),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f23,plain,
inverse(identity) = sF0,
inference(reorient_equations,[],[f22]) ).
fof(f24,plain,
identity = sF0,
inference(definition_folding,[],[f18,f23]) ).
fof(f25,definition,
sF1 = least_upper_bound(a,identity),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f26,plain,
least_upper_bound(a,identity) = sF1,
inference(reorient_equations,[],[f25]) ).
fof(f27,definition,
sF2 = greatest_lower_bound(a,identity),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f28,plain,
greatest_lower_bound(a,identity) = sF2,
inference(reorient_equations,[],[f27]) ).
fof(f29,definition,
sF3 = inverse(sF2),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f30,plain,
inverse(sF2) = sF3,
inference(reorient_equations,[],[f29]) ).
fof(f31,definition,
sF4 = multiply(sF1,sF3),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f32,plain,
multiply(sF1,sF3) = sF4,
inference(reorient_equations,[],[f31]) ).
fof(f33,definition,
sF5 = multiply(sF3,sF1),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f34,plain,
multiply(sF3,sF1) = sF5,
inference(reorient_equations,[],[f33]) ).
fof(f35,plain,
sF4 != sF5,
inference(definition_folding,[],[f21,f34,f26,f30,f28,f32,f30,f28,f26]) ).
fof(f36,plain,
identity = inverse(identity),
inference(forward_demodulation,[],[f23,f24]) ).
fof(f37,plain,
sF1 = least_upper_bound(identity,a),
inference(forward_demodulation,[],[f26,f6]) ).
fof(f38,plain,
sF2 = greatest_lower_bound(identity,a),
inference(forward_demodulation,[],[f28,f5]) ).
fof(f46,plain,
! [X0,X1] : multiply(inverse(X0),greatest_lower_bound(X1,X0)) = greatest_lower_bound(multiply(inverse(X0),X1),identity),
inference(superposition,[],[f14,f3]) ).
fof(f51,plain,
! [X0,X1] : greatest_lower_bound(identity,multiply(inverse(X0),X1)) = multiply(inverse(X0),greatest_lower_bound(X1,X0)),
inference(forward_demodulation,[],[f46,f5]) ).
fof(f85,plain,
! [X0] : identity = multiply(X0,inverse(X0)),
inference(superposition,[],[f3,f19]) ).
fof(f88,plain,
! [X0,X1] : multiply(identity,X1) = multiply(inverse(X0),multiply(X0,X1)),
inference(superposition,[],[f4,f3]) ).
fof(f99,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(forward_demodulation,[],[f88,f1]) ).
fof(f118,plain,
! [X0,X1] : inverse(multiply(X1,inverse(X0))) = multiply(X0,inverse(X1)),
inference(superposition,[],[f20,f19]) ).
fof(f119,plain,
! [X0] : inverse(multiply(sF2,X0)) = multiply(inverse(X0),sF3),
inference(superposition,[],[f20,f30]) ).
fof(f121,plain,
! [X0,X1] : inverse(multiply(inverse(X0),X1)) = multiply(inverse(X1),X0),
inference(superposition,[],[f20,f19]) ).
fof(f135,plain,
! [X0,X1] : multiply(X0,multiply(inverse(X0),X1)) = X1,
inference(superposition,[],[f99,f19]) ).
fof(f139,plain,
! [X0,X1] : inverse(X0) = multiply(inverse(inverse(X1)),inverse(multiply(X0,X1))),
inference(superposition,[],[f99,f20]) ).
fof(f150,plain,
! [X0,X1] : inverse(X0) = inverse(multiply(multiply(X0,X1),inverse(X1))),
inference(forward_demodulation,[],[f139,f20]) ).
fof(f154,plain,
! [X0,X1] : inverse(X0) = multiply(X1,inverse(multiply(X0,X1))),
inference(forward_demodulation,[],[f150,f118]) ).
fof(f155,plain,
! [X0,X1] : inverse(X1) = multiply(inverse(multiply(X0,X1)),inverse(inverse(X0))),
inference(superposition,[],[f154,f154]) ).
fof(f158,plain,
! [X0] : inverse(inverse(X0)) = multiply(X0,inverse(identity)),
inference(superposition,[],[f154,f3]) ).
fof(f180,plain,
! [X0] : inverse(inverse(X0)) = multiply(X0,identity),
inference(forward_demodulation,[],[f158,f36]) ).
fof(f183,plain,
! [X0,X1] : inverse(X1) = inverse(multiply(inverse(X0),multiply(X0,X1))),
inference(forward_demodulation,[],[f155,f20]) ).
fof(f188,plain,
! [X0] : multiply(X0,identity) = X0,
inference(forward_demodulation,[],[f180,f19]) ).
fof(f189,plain,
! [X0,X1] : inverse(X1) = multiply(inverse(multiply(X0,X1)),X0),
inference(forward_demodulation,[],[f183,f121]) ).
fof(f195,plain,
! [X0,X1] : multiply(X0,least_upper_bound(identity,X1)) = least_upper_bound(X0,multiply(X0,X1)),
inference(superposition,[],[f13,f188]) ).
fof(f232,plain,
! [X0,X1] : multiply(least_upper_bound(identity,X1),X0) = least_upper_bound(X0,multiply(X1,X0)),
inference(superposition,[],[f15,f1]) ).
fof(f271,plain,
! [X0,X1] : multiply(greatest_lower_bound(identity,X1),X0) = greatest_lower_bound(X0,multiply(X1,X0)),
inference(superposition,[],[f16,f1]) ).
fof(f336,plain,
! [X0] : multiply(inverse(X0),sF2) = inverse(multiply(sF3,X0)),
inference(superposition,[],[f121,f30]) ).
fof(f735,plain,
! [X0] : greatest_lower_bound(inverse(X0),identity) = multiply(greatest_lower_bound(identity,X0),inverse(X0)),
inference(superposition,[],[f271,f85]) ).
fof(f776,plain,
! [X0] : greatest_lower_bound(identity,inverse(X0)) = multiply(greatest_lower_bound(identity,X0),inverse(X0)),
inference(forward_demodulation,[],[f735,f5]) ).
fof(f979,plain,
! [X0] : multiply(sF2,multiply(sF3,X0)) = X0,
inference(superposition,[],[f135,f30]) ).
fof(f1100,plain,
! [X0] : inverse(multiply(X0,sF3)) = multiply(sF2,inverse(X0)),
inference(superposition,[],[f979,f154]) ).
fof(f2209,plain,
! [X2,X0,X1] : multiply(X2,inverse(multiply(X0,X1))) = inverse(multiply(X0,multiply(X1,inverse(X2)))),
inference(superposition,[],[f118,f4]) ).
fof(f8760,plain,
! [X0,X1] : inverse(multiply(X1,multiply(sF3,X0))) = multiply(multiply(inverse(X0),sF2),inverse(X1)),
inference(superposition,[],[f20,f336]) ).
fof(f8805,plain,
! [X0,X1] : inverse(multiply(X1,multiply(sF3,X0))) = multiply(inverse(X0),multiply(sF2,inverse(X1))),
inference(forward_demodulation,[],[f8760,f4]) ).
fof(f11221,plain,
greatest_lower_bound(identity,inverse(a)) = multiply(sF2,inverse(a)),
inference(superposition,[],[f776,f38]) ).
fof(f11382,plain,
greatest_lower_bound(identity,multiply(inverse(inverse(a)),identity)) = multiply(inverse(inverse(a)),multiply(sF2,inverse(a))),
inference(superposition,[],[f51,f11221]) ).
fof(f11399,plain,
greatest_lower_bound(identity,multiply(inverse(inverse(a)),identity)) = inverse(multiply(a,multiply(sF3,inverse(a)))),
inference(forward_demodulation,[],[f11382,f8805]) ).
fof(f11408,plain,
greatest_lower_bound(identity,multiply(inverse(inverse(a)),identity)) = multiply(a,inverse(multiply(a,sF3))),
inference(forward_demodulation,[],[f11399,f2209]) ).
fof(f11415,plain,
greatest_lower_bound(identity,multiply(inverse(inverse(a)),identity)) = multiply(a,multiply(sF2,inverse(a))),
inference(forward_demodulation,[],[f11408,f1100]) ).
fof(f11421,plain,
multiply(a,multiply(sF2,inverse(a))) = multiply(greatest_lower_bound(identity,inverse(inverse(a))),identity),
inference(forward_demodulation,[],[f11415,f271]) ).
fof(f11426,plain,
greatest_lower_bound(identity,inverse(inverse(a))) = multiply(a,multiply(sF2,inverse(a))),
inference(forward_demodulation,[],[f11421,f188]) ).
fof(f11431,plain,
greatest_lower_bound(identity,a) = multiply(a,multiply(sF2,inverse(a))),
inference(forward_demodulation,[],[f11426,f19]) ).
fof(f11435,plain,
sF2 = multiply(a,multiply(sF2,inverse(a))),
inference(forward_demodulation,[],[f11431,f38]) ).
fof(f11505,plain,
multiply(inverse(sF2),a) = inverse(multiply(sF2,inverse(a))),
inference(superposition,[],[f189,f11435]) ).
fof(f11524,plain,
multiply(inverse(sF2),a) = multiply(inverse(inverse(a)),sF3),
inference(forward_demodulation,[],[f11505,f119]) ).
fof(f11545,plain,
multiply(inverse(sF2),a) = multiply(a,sF3),
inference(forward_demodulation,[],[f11524,f19]) ).
fof(f11559,plain,
multiply(sF3,a) = multiply(a,sF3),
inference(forward_demodulation,[],[f11545,f30]) ).
fof(f11599,plain,
multiply(least_upper_bound(identity,a),sF3) = least_upper_bound(sF3,multiply(sF3,a)),
inference(superposition,[],[f232,f11559]) ).
fof(f11608,plain,
multiply(least_upper_bound(identity,a),sF3) = multiply(sF3,least_upper_bound(identity,a)),
inference(forward_demodulation,[],[f11599,f195]) ).
fof(f11628,plain,
multiply(sF1,sF3) = multiply(sF3,sF1),
inference(forward_demodulation,[],[f11608,f37]) ).
fof(f11644,plain,
multiply(sF1,sF3) = sF5,
inference(forward_demodulation,[],[f11628,f34]) ).
fof(f11654,plain,
sF4 = sF5,
inference(forward_demodulation,[],[f11644,f32]) ).
fof(f11661,plain,
$false,
inference(forward_subsumption_resolution,[],[f11654,f35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP184-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n010.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 09:36:32 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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
% 13.24/2.77 % (698227)Detected a unit-equality problem, will run specialized UEQ schedule.
% 13.24/2.77 % (698238)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=865621761:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 13.24/2.77 % (698234)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=1154982780:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 13.24/2.77 % (698233)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=3551942369:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 13.24/2.77 % (698235)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=420638567:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 13.24/2.77 % (698236)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=1913632193:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 13.24/2.77 % (698237)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=3372587471:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 13.24/2.77 % (698232)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=2547769913:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 13.24/2.77 % (698235)Instruction limit reached!
% 13.24/2.77 % (698235)------------------------------
% 13.24/2.77 % (698235)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.24/2.77 % (698235)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.24/2.77 % (698235)CaDiCaL version: 2.1.3
% 13.24/2.77 % (698235)Termination reason: Instruction limit
% 13.24/2.77 % (698235)Termination phase: Saturation
% 13.24/2.77 % (698235)Time elapsed: 0.081 s
% 13.24/2.77 % (698235)Peak memory usage: 88 MB
% 13.24/2.77 % (698235)Instructions burned: 138 (million)
% 13.24/2.77 % (698236)Instruction limit reached!
% 13.24/2.77 % (698236)------------------------------
% 13.24/2.77 % (698236)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.24/2.77 % (698236)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.24/2.77 % (698236)CaDiCaL version: 2.1.3
% 13.24/2.77 % (698236)Termination reason: Instruction limit
% 13.24/2.77 % (698236)Termination phase: Saturation
% 13.24/2.77 % (698236)Time elapsed: 0.109 s
% 13.24/2.77 % (698236)Peak memory usage: 89 MB
% 13.24/2.77 % (698236)Instructions burned: 181 (million)
% 13.24/2.77 % (698237)Instruction limit reached!
% 13.24/2.77 % (698237)------------------------------
% 13.24/2.77 % (698237)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.24/2.77 % (698237)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.24/2.77 % (698237)CaDiCaL version: 2.1.3
% 13.24/2.77 % (698237)Termination reason: Instruction limit
% 13.24/2.77 % (698237)Termination phase: Saturation
% 13.24/2.77 % (698237)Time elapsed: 0.156 s
% 13.24/2.77 % (698237)Peak memory usage: 90 MB
% 13.24/2.77 % (698237)Instructions burned: 257 (million)
% 13.24/2.77 % (698246)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=1819317067:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2997 on theBenchmark for (2997ds/2051Mi)
% 13.24/2.77 % (698247)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=3108111457:i=4948:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/4948Mi)
% 13.24/2.77 % (698248)lrs+10_5:1_sil=8000:sos=all:urr=on:br=off:flr=on:random_seed=2604358876:i=215:ep=RSTC_2996 on theBenchmark for (2996ds/215Mi)
% 13.24/2.77 % (698238)Instruction limit reached!
% 13.24/2.77 % (698238)------------------------------
% 13.24/2.77 % (698238)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.24/2.77 % (698238)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.24/2.77 % (698238)CaDiCaL version: 2.1.3
% 13.24/2.77 % (698238)Termination reason: Instruction limit
% 13.24/2.77 % (698238)Termination phase: Saturation
% 13.24/2.77 % (698238)Time elapsed: 0.346 s
% 13.24/2.77 % (698238)Peak memory usage: 99 MB
% 13.24/2.77 % (698238)Instructions burned: 1188 (million)
% 13.24/2.77 % (698252)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=2266751386: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)
% 13.24/2.77 % (698248)Instruction limit reached!
% 13.24/2.77 % (698248)------------------------------
% 13.24/2.77 % (698248)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.24/2.77 % (698248)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.24/2.77 % (698248)CaDiCaL version: 2.1.3
% 13.24/2.77 % (698248)Termination reason: Instruction limit
% 13.24/2.77 % (698248)Termination phase: Saturation
% 13.24/2.77 % (698248)Time elapsed: 0.121 s
% 13.24/2.77 % (698248)Peak memory usage: 92 MB
% 13.24/2.77 % (698248)Instructions burned: 215 (million)
% 13.24/2.77 % (698252)Instruction limit reached!
% 13.24/2.77 % (698252)------------------------------
% 13.24/2.77 % (698252)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.24/2.77 % (698252)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.24/2.77 % (698252)CaDiCaL version: 2.1.3
% 13.24/2.77 % (698252)Termination reason: Instruction limit
% 13.24/2.77 % (698252)Termination phase: Saturation
% 13.24/2.77 % (698252)Time elapsed: 0.110 s
% 13.24/2.77 % (698252)Peak memory usage: 93 MB
% 13.24/2.77 % (698252)Instructions burned: 318 (million)
% 13.24/2.77 % (698254)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=1845340354:i=12125:sd=2:fgj=on:ss=axioms:sgt=64_2994 on theBenchmark for (2994ds/12125Mi)
% 13.24/2.77 % (698255)lrs+10_32_sil=8000:tgt=ground:prc=on:sp=reverse_arity:spb=non_intro:random_seed=1517305232:i=2836:kws=inv_precedence:fgj=on:bd=preordered:ins=10_2993 on theBenchmark for (2993ds/2836Mi)
% 13.24/2.77 % (698234)First to succeed.
% 13.24/2.77 % (698234)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-698227"
% 13.24/2.77 % (698246)Instruction limit reached!
% 13.24/2.77 % (698246)------------------------------
% 13.24/2.77 % (698246)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.24/2.77 % (698246)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.24/2.77 % (698246)CaDiCaL version: 2.1.3
% 13.24/2.77 % (698246)Termination reason: Instruction limit
% 13.24/2.77 % (698246)Termination phase: Saturation
% 13.24/2.77 % (698246)Time elapsed: 1.329 s
% 13.24/2.77 % (698246)Peak memory usage: 141 MB
% 13.24/2.77 % (698246)Instructions burned: 2052 (million)
% 13.24/2.77 % (698255)Instruction limit reached!
% 13.24/2.77 % (698255)------------------------------
% 13.24/2.77 % (698255)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.24/2.77 % (698255)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.24/2.77 % (698255)CaDiCaL version: 2.1.3
% 13.24/2.77 % (698255)Termination reason: Instruction limit
% 13.24/2.77 % (698255)Termination phase: Saturation
% 13.24/2.77 % (698255)Time elapsed: 1.035 s
% 13.24/2.77 % (698255)Peak memory usage: 146 MB
% 13.24/2.77 % (698255)Instructions burned: 2837 (million)
% 13.24/2.77 % (698258)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:lma=off:kmz=on:random_seed=642262438:i=14534:kws=arity:fgj=on:bd=preordered:ins=6:ss=axioms:sgt=30_2982 on theBenchmark for (2982ds/14534Mi)
% 13.24/2.77 % (698259)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:sas=cadical:sp=reverse_frequency:bsr=on:alpa=false:sac=on:random_seed=2888850763:i=11832:s2at=3:bs=on:bd=preordered:fsd=on_2982 on theBenchmark for (2982ds/11832Mi)
% 13.24/2.77 % (698247)Also succeeded, but the first one will report.
% 13.24/2.77 % (698234)Refutation found. Thanks to Tanya!
% 13.24/2.77 % SZS status Unsatisfiable for theBenchmark
% 13.24/2.77 % SZS output start Proof for theBenchmark
% See solution above
% 14.09/2.96 % (698234)------------------------------
% 14.09/2.96 % (698234)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 14.09/2.96 % (698234)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.09/2.96 % (698234)CaDiCaL version: 2.1.3
% 14.09/2.96 % (698234)Termination reason: Refutation
% 14.09/2.96 % (698234)Time elapsed: 1.496 s
% 14.09/2.96 % (698234)Peak memory usage: 142 MB
% 14.09/2.96 % (698234)Instructions burned: 2372 (million)
% 14.09/2.96 % (698234)------------------------------
% 14.09/2.96 % (698234)------------------------------
% 14.09/2.96 % (698227)Success in time 1.91 s
% 14.09/2.96 % Vampire exiting
%------------------------------------------------------------------------------