%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : GRP183-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 : n020.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.27s 2.17s
% Output : Refutation 9.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 32
% Number of leaves : 14
% Syntax : Number of formulae : 83 ( 83 unt; 0 def)
% Number of atoms : 83 ( 82 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 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 : 142 ( 142 !; 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(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),inverse(greatest_lower_bound(a,identity))) != identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p20) ).
fof(f18,plain,
identity != greatest_lower_bound(least_upper_bound(a,identity),inverse(greatest_lower_bound(a,identity))),
inference(reorient_equations,[],[f17]) ).
fof(f19,plain,
identity != greatest_lower_bound(least_upper_bound(identity,a),inverse(greatest_lower_bound(a,identity))),
inference(backward_demodulation,[],[f18,f6]) ).
fof(f20,plain,
identity != greatest_lower_bound(least_upper_bound(identity,a),inverse(greatest_lower_bound(identity,a))),
inference(forward_demodulation,[],[f19,f5]) ).
fof(f22,plain,
! [X0,X1] : greatest_lower_bound(X1,least_upper_bound(X0,X1)) = X1,
inference(superposition,[],[f12,f6]) ).
fof(f28,plain,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X1,X0)) = X0,
inference(superposition,[],[f11,f5]) ).
fof(f43,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(f56,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(f64,plain,
! [X0,X1] : least_upper_bound(X1,X0) = least_upper_bound(X1,least_upper_bound(X1,X0)),
inference(superposition,[],[f8,f9]) ).
fof(f87,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = multiply(identity,X1),
inference(superposition,[],[f4,f3]) ).
fof(f91,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(forward_demodulation,[],[f87,f1]) ).
fof(f93,plain,
! [X0] : multiply(inverse(inverse(X0)),identity) = X0,
inference(superposition,[],[f91,f3]) ).
fof(f96,plain,
! [X0,X1] : multiply(X0,X1) = multiply(inverse(inverse(X0)),X1),
inference(superposition,[],[f91,f91]) ).
fof(f99,plain,
! [X0] : multiply(X0,identity) = X0,
inference(forward_demodulation,[],[f93,f96]) ).
fof(f100,plain,
identity = inverse(identity),
inference(superposition,[],[f99,f3]) ).
fof(f112,plain,
! [X0,X1] : multiply(inverse(X0),least_upper_bound(X1,X0)) = least_upper_bound(multiply(inverse(X0),X1),identity),
inference(superposition,[],[f13,f3]) ).
fof(f114,plain,
! [X2,X0,X1] : multiply(inverse(X0),least_upper_bound(X2,multiply(X0,X1))) = least_upper_bound(multiply(inverse(X0),X2),X1),
inference(superposition,[],[f13,f91]) ).
fof(f128,plain,
! [X0,X1] : least_upper_bound(identity,multiply(inverse(X0),X1)) = multiply(inverse(X0),least_upper_bound(X1,X0)),
inference(forward_demodulation,[],[f112,f6]) ).
fof(f180,plain,
! [X0,X1] : multiply(least_upper_bound(inverse(X0),X1),X0) = least_upper_bound(identity,multiply(X1,X0)),
inference(superposition,[],[f15,f3]) ).
fof(f181,plain,
! [X0,X1] : multiply(least_upper_bound(identity,X1),X0) = least_upper_bound(X0,multiply(X1,X0)),
inference(superposition,[],[f15,f1]) ).
fof(f186,plain,
! [X0,X1] : multiply(least_upper_bound(X1,inverse(X0)),X0) = least_upper_bound(multiply(X1,X0),identity),
inference(superposition,[],[f15,f3]) ).
fof(f207,plain,
! [X0,X1] : least_upper_bound(identity,multiply(X1,X0)) = multiply(least_upper_bound(X1,inverse(X0)),X0),
inference(forward_demodulation,[],[f186,f6]) ).
fof(f302,plain,
! [X0] : inverse(inverse(X0)) = multiply(X0,identity),
inference(superposition,[],[f99,f96]) ).
fof(f305,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(forward_demodulation,[],[f302,f99]) ).
fof(f392,plain,
! [X0] : least_upper_bound(identity,inverse(X0)) = multiply(inverse(X0),least_upper_bound(identity,X0)),
inference(superposition,[],[f128,f99]) ).
fof(f462,plain,
! [X0,X1] : multiply(inverse(least_upper_bound(X1,inverse(X0))),least_upper_bound(identity,multiply(X1,X0))) = X0,
inference(superposition,[],[f91,f207]) ).
fof(f476,plain,
! [X0,X1] : multiply(greatest_lower_bound(identity,X1),X0) = greatest_lower_bound(X0,multiply(X1,X0)),
inference(superposition,[],[f16,f1]) ).
fof(f642,plain,
! [X0,X1] : multiply(inverse(least_upper_bound(inverse(X0),X1)),least_upper_bound(identity,multiply(X1,X0))) = X0,
inference(superposition,[],[f91,f180]) ).
fof(f677,plain,
! [X0,X1] : multiply(inverse(least_upper_bound(inverse(X0),X1)),least_upper_bound(identity,multiply(least_upper_bound(inverse(X0),X1),X0))) = X0,
inference(superposition,[],[f642,f64]) ).
fof(f713,plain,
! [X0,X1] : least_upper_bound(multiply(inverse(least_upper_bound(inverse(X0),X1)),identity),X0) = X0,
inference(forward_demodulation,[],[f677,f114]) ).
fof(f724,plain,
! [X0,X1] : least_upper_bound(X0,multiply(inverse(least_upper_bound(inverse(X0),X1)),identity)) = X0,
inference(forward_demodulation,[],[f713,f6]) ).
fof(f729,plain,
! [X0,X1] : least_upper_bound(X0,inverse(least_upper_bound(inverse(X0),X1))) = X0,
inference(forward_demodulation,[],[f724,f99]) ).
fof(f737,plain,
! [X0,X1] : inverse(X0) = least_upper_bound(inverse(X0),inverse(least_upper_bound(X0,X1))),
inference(superposition,[],[f729,f305]) ).
fof(f750,plain,
! [X0,X1] : inverse(least_upper_bound(inverse(X0),X1)) = greatest_lower_bound(inverse(least_upper_bound(inverse(X0),X1)),X0),
inference(superposition,[],[f22,f729]) ).
fof(f760,plain,
! [X0,X1] : inverse(least_upper_bound(inverse(X0),X1)) = greatest_lower_bound(X0,inverse(least_upper_bound(inverse(X0),X1))),
inference(forward_demodulation,[],[f750,f5]) ).
fof(f769,plain,
! [X0,X1] : inverse(least_upper_bound(X0,X1)) = greatest_lower_bound(inverse(X0),inverse(least_upper_bound(X0,X1))),
inference(superposition,[],[f760,f305]) ).
fof(f791,plain,
! [X0,X1] : inverse(X0) = least_upper_bound(inverse(X0),inverse(least_upper_bound(X1,X0))),
inference(superposition,[],[f737,f6]) ).
fof(f853,plain,
! [X0,X1] : inverse(least_upper_bound(X1,X0)) = greatest_lower_bound(inverse(least_upper_bound(X1,X0)),inverse(X0)),
inference(superposition,[],[f22,f791]) ).
fof(f859,plain,
! [X0,X1] : inverse(least_upper_bound(X1,X0)) = greatest_lower_bound(inverse(X0),inverse(least_upper_bound(X1,X0))),
inference(forward_demodulation,[],[f853,f5]) ).
fof(f884,plain,
! [X0,X1] : inverse(X0) = greatest_lower_bound(inverse(greatest_lower_bound(X0,X1)),inverse(X0)),
inference(superposition,[],[f859,f11]) ).
fof(f900,plain,
! [X0,X1] : inverse(X0) = greatest_lower_bound(inverse(X0),inverse(greatest_lower_bound(X0,X1))),
inference(forward_demodulation,[],[f884,f5]) ).
fof(f902,plain,
! [X0,X1] : greatest_lower_bound(X0,inverse(greatest_lower_bound(inverse(X0),X1))) = X0,
inference(superposition,[],[f900,f305]) ).
fof(f933,plain,
! [X0,X1] : greatest_lower_bound(X0,inverse(greatest_lower_bound(X1,inverse(X0)))) = X0,
inference(superposition,[],[f902,f5]) ).
fof(f941,plain,
! [X0,X1] : inverse(greatest_lower_bound(inverse(X0),X1)) = least_upper_bound(inverse(greatest_lower_bound(inverse(X0),X1)),X0),
inference(superposition,[],[f28,f902]) ).
fof(f947,plain,
! [X0,X1] : inverse(greatest_lower_bound(inverse(X0),X1)) = least_upper_bound(X0,inverse(greatest_lower_bound(inverse(X0),X1))),
inference(forward_demodulation,[],[f941,f6]) ).
fof(f1010,plain,
! [X0,X1] : inverse(greatest_lower_bound(X1,inverse(X0))) = least_upper_bound(inverse(greatest_lower_bound(X1,inverse(X0))),X0),
inference(superposition,[],[f28,f933]) ).
fof(f1018,plain,
! [X0,X1] : inverse(greatest_lower_bound(X1,inverse(X0))) = least_upper_bound(X0,inverse(greatest_lower_bound(X1,inverse(X0)))),
inference(forward_demodulation,[],[f1010,f6]) ).
fof(f1029,plain,
! [X0] : identity = multiply(inverse(least_upper_bound(X0,identity)),least_upper_bound(identity,multiply(X0,identity))),
inference(superposition,[],[f462,f100]) ).
fof(f1071,plain,
! [X0] : identity = multiply(inverse(least_upper_bound(X0,identity)),multiply(least_upper_bound(identity,X0),identity)),
inference(forward_demodulation,[],[f1029,f181]) ).
fof(f1079,plain,
! [X0] : identity = multiply(inverse(least_upper_bound(X0,identity)),least_upper_bound(identity,X0)),
inference(forward_demodulation,[],[f1071,f99]) ).
fof(f1503,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,[],[f56,f1018]) ).
fof(f1623,plain,
! [X0,X1] : least_upper_bound(X0,X1) = greatest_lower_bound(least_upper_bound(X0,X1),inverse(greatest_lower_bound(inverse(X0),inverse(X1)))),
inference(superposition,[],[f1503,f947]) ).
fof(f1683,plain,
! [X0,X1] : greatest_lower_bound(inverse(X0),inverse(X1)) = greatest_lower_bound(greatest_lower_bound(inverse(X0),inverse(X1)),inverse(least_upper_bound(X0,X1))),
inference(superposition,[],[f933,f1623]) ).
fof(f1697,plain,
! [X0,X1] : greatest_lower_bound(inverse(X0),inverse(X1)) = greatest_lower_bound(inverse(least_upper_bound(X0,X1)),greatest_lower_bound(inverse(X0),inverse(X1))),
inference(forward_demodulation,[],[f1683,f5]) ).
fof(f1710,plain,
! [X0,X1] : greatest_lower_bound(inverse(X0),inverse(X1)) = greatest_lower_bound(inverse(X0),greatest_lower_bound(inverse(X1),inverse(least_upper_bound(X0,X1)))),
inference(forward_demodulation,[],[f1697,f43]) ).
fof(f1718,plain,
! [X0,X1] : greatest_lower_bound(inverse(X0),inverse(least_upper_bound(X0,X1))) = greatest_lower_bound(inverse(X0),inverse(X1)),
inference(forward_demodulation,[],[f1710,f859]) ).
fof(f1725,plain,
! [X0,X1] : inverse(least_upper_bound(X0,X1)) = greatest_lower_bound(inverse(X0),inverse(X1)),
inference(forward_demodulation,[],[f1718,f769]) ).
fof(f1816,plain,
! [X0,X1] : greatest_lower_bound(X0,inverse(X1)) = inverse(least_upper_bound(inverse(X0),X1)),
inference(superposition,[],[f1725,f305]) ).
fof(f1817,plain,
! [X0] : greatest_lower_bound(inverse(X0),identity) = inverse(least_upper_bound(X0,identity)),
inference(superposition,[],[f1725,f100]) ).
fof(f1869,plain,
! [X0] : greatest_lower_bound(identity,inverse(X0)) = inverse(least_upper_bound(X0,identity)),
inference(forward_demodulation,[],[f1817,f5]) ).
fof(f1904,plain,
! [X0] : identity = multiply(greatest_lower_bound(identity,inverse(X0)),least_upper_bound(identity,X0)),
inference(backward_demodulation,[],[f1079,f1869]) ).
fof(f2054,plain,
! [X0,X1] : least_upper_bound(inverse(X0),X1) = inverse(greatest_lower_bound(X0,inverse(X1))),
inference(superposition,[],[f305,f1816]) ).
fof(f2292,plain,
! [X0] : least_upper_bound(inverse(X0),identity) = inverse(greatest_lower_bound(X0,identity)),
inference(superposition,[],[f2054,f100]) ).
fof(f2381,plain,
! [X0] : least_upper_bound(identity,inverse(X0)) = inverse(greatest_lower_bound(X0,identity)),
inference(forward_demodulation,[],[f2292,f6]) ).
fof(f2426,plain,
! [X0] : least_upper_bound(identity,inverse(X0)) = inverse(greatest_lower_bound(identity,X0)),
inference(superposition,[],[f2381,f5]) ).
fof(f2454,plain,
identity != greatest_lower_bound(least_upper_bound(identity,a),least_upper_bound(identity,inverse(a))),
inference(backward_demodulation,[],[f20,f2426]) ).
fof(f3201,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,[],[f476,f392]) ).
fof(f3202,plain,
! [X0] : identity = greatest_lower_bound(least_upper_bound(identity,X0),least_upper_bound(identity,inverse(X0))),
inference(forward_demodulation,[],[f3201,f1904]) ).
fof(f3217,plain,
$false,
inference(backward_subsumption_resolution,[],[f2454,f3202]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP183-1 : 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.38 % Computer : n020.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:37:04 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.42 Running first-order theorem proving
% 0.14/0.42 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.27/2.17 % (3137964)Detected a unit-equality problem, will run specialized UEQ schedule.
% 9.27/2.17 % (3138049)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=3550314748:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 9.27/2.17 % (3138051)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=2474280588:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 9.27/2.17 % (3138052)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=3795773588:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 9.27/2.17 % (3138045)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=1453743066:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 9.27/2.17 % (3138047)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=1942757735:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 9.27/2.17 % (3138048)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=3961747522:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 9.27/2.17 % (3138044)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=1793105926:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 9.27/2.17 % (3138049)Instruction limit reached!
% 9.27/2.17 % (3138049)------------------------------
% 9.27/2.17 % (3138049)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.27/2.17 % (3138049)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.27/2.17 % (3138049)CaDiCaL version: 2.1.3
% 9.27/2.17 % (3138049)Termination reason: Instruction limit
% 9.27/2.17 % (3138049)Termination phase: Saturation
% 9.27/2.17 % (3138049)Time elapsed: 0.061 s
% 9.27/2.17 % (3138049)Peak memory usage: 89 MB
% 9.27/2.17 % (3138049)Instructions burned: 184 (million)
% 9.27/2.17 % (3138048)Instruction limit reached!
% 9.27/2.17 % (3138048)------------------------------
% 9.27/2.17 % (3138048)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.27/2.17 % (3138048)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.27/2.17 % (3138048)CaDiCaL version: 2.1.3
% 9.27/2.17 % (3138048)Termination reason: Instruction limit
% 9.27/2.17 % (3138048)Termination phase: Saturation
% 9.27/2.17 % (3138048)Time elapsed: 0.086 s
% 9.27/2.17 % (3138048)Peak memory usage: 89 MB
% 9.27/2.17 % (3138048)Instructions burned: 137 (million)
% 9.27/2.17 % (3138095)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=3298104160:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2998 on theBenchmark for (2998ds/2051Mi)
% 9.27/2.17 % (3138051)Instruction limit reached!
% 9.27/2.17 % (3138051)------------------------------
% 9.27/2.17 % (3138051)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.27/2.17 % (3138051)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.27/2.17 % (3138051)CaDiCaL version: 2.1.3
% 9.27/2.17 % (3138051)Termination reason: Instruction limit
% 9.27/2.17 % (3138051)Termination phase: Saturation
% 9.27/2.17 % (3138051)Time elapsed: 0.161 s
% 9.27/2.17 % (3138051)Peak memory usage: 90 MB
% 9.27/2.17 % (3138051)Instructions burned: 258 (million)
% 9.27/2.17 % (3138117)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=2945715699:i=4948:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/4948Mi)
% 9.27/2.17 % (3138142)lrs+10_5:1_sil=8000:sos=all:urr=on:br=off:flr=on:random_seed=1298183022:i=215:ep=RSTC_2996 on theBenchmark for (2996ds/215Mi)
% 9.27/2.17 % (3138142)Instruction limit reached!
% 9.27/2.17 % (3138142)------------------------------
% 9.27/2.17 % (3138142)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.27/2.17 % (3138142)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.27/2.17 % (3138142)CaDiCaL version: 2.1.3
% 9.27/2.17 % (3138142)Termination reason: Instruction limit
% 9.27/2.17 % (3138142)Termination phase: Saturation
% 9.27/2.17 % (3138142)Time elapsed: 0.111 s
% 9.27/2.17 % (3138142)Peak memory usage: 90 MB
% 9.27/2.17 % (3138142)Instructions burned: 215 (million)
% 9.27/2.17 % (3138145)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=3821630250:avsq=on:i=317:avsqr=1,16:kws=arity_squared:add=off:fgj=on:ins=10:fsr=off:gtg=exists_sym_2994 on theBenchmark for (2994ds/317Mi)
% 9.27/2.17 % (3138052)Instruction limit reached!
% 9.27/2.17 % (3138052)------------------------------
% 9.27/2.17 % (3138052)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.27/2.17 % (3138052)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.27/2.17 % (3138052)CaDiCaL version: 2.1.3
% 9.27/2.17 % (3138052)Termination reason: Instruction limit
% 9.27/2.17 % (3138052)Termination phase: Saturation
% 9.27/2.17 % (3138052)Time elapsed: 0.641 s
% 9.27/2.17 % (3138052)Peak memory usage: 99 MB
% 9.27/2.17 % (3138052)Instructions burned: 1189 (million)
% 9.27/2.17 % (3138145)Instruction limit reached!
% 9.27/2.17 % (3138145)------------------------------
% 9.27/2.17 % (3138145)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.27/2.17 % (3138145)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.27/2.17 % (3138145)CaDiCaL version: 2.1.3
% 9.27/2.17 % (3138145)Termination reason: Instruction limit
% 9.27/2.17 % (3138145)Termination phase: Saturation
% 9.27/2.17 % (3138145)Time elapsed: 0.197 s
% 9.27/2.17 % (3138145)Peak memory usage: 92 MB
% 9.27/2.17 % (3138145)Instructions burned: 318 (million)
% 9.27/2.17 % (3138147)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=3540982504:i=12125:sd=2:fgj=on:ss=axioms:sgt=64_2991 on theBenchmark for (2991ds/12125Mi)
% 9.27/2.17 % (3138095)First to succeed.
% 9.27/2.17 % (3138095)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3137964"
% 9.27/2.17 % (3138148)lrs+10_32_sil=8000:tgt=ground:prc=on:sp=reverse_arity:spb=non_intro:random_seed=4072800429:i=2836:kws=inv_precedence:fgj=on:bd=preordered:ins=10_2990 on theBenchmark for (2990ds/2836Mi)
% 9.27/2.17 % (3138045)Also succeeded, but the first one will report.
% 9.27/2.17 % (3138095)Refutation found. Thanks to Tanya!
% 9.27/2.17 % SZS status Unsatisfiable for theBenchmark
% 9.27/2.17 % SZS output start Proof for theBenchmark
% See solution above
% 9.74/2.37 % (3138095)------------------------------
% 9.74/2.37 % (3138095)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.74/2.37 % (3138095)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.74/2.37 % (3138095)CaDiCaL version: 2.1.3
% 9.74/2.37 % (3138095)Termination reason: Refutation
% 9.74/2.37 % (3138095)Time elapsed: 0.745 s
% 9.74/2.37 % (3138095)Peak memory usage: 134 MB
% 9.74/2.37 % (3138095)Instructions burned: 1490 (million)
% 9.74/2.37 % (3138095)------------------------------
% 9.74/2.37 % (3138095)------------------------------
% 9.74/2.37 % (3137964)Success in time 1.309 s
% 9.74/2.37 % Vampire exiting
%------------------------------------------------------------------------------