%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : GRP180-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 : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 10:13:13 AM UTC 2026
% Result : Unsatisfiable 21.19s 3.86s
% Output : Refutation 21.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 34
% Number of leaves : 14
% Syntax : Number of formulae : 87 ( 87 unt; 0 def)
% Number of atoms : 87 ( 86 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 : 6 ( 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 : 175 ( 175 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : multiply(identity,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_identity) ).
fof(f2,axiom,
! [X0] : multiply(inverse(X0),X0) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_inverse) ).
fof(f3,plain,
! [X0] : identity = multiply(inverse(X0),X0),
inference(reorient_equations,[],[f2]) ).
fof(f4,axiom,
! [X2,X0,X1] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity) ).
fof(f5,axiom,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_glb) ).
fof(f6,axiom,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_lub) ).
fof(f7,axiom,
! [X2,X0,X1] : greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(greatest_lower_bound(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity_of_glb) ).
fof(f8,axiom,
! [X2,X0,X1] : least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(least_upper_bound(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity_of_lub) ).
fof(f11,axiom,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lub_absorbtion) ).
fof(f12,axiom,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',glb_absorbtion) ).
fof(f13,axiom,
! [X2,X0,X1] : multiply(X0,least_upper_bound(X1,X2)) = least_upper_bound(multiply(X0,X1),multiply(X0,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',monotony_lub1) ).
fof(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,
multiply(a,multiply(inverse(greatest_lower_bound(a,b)),b)) != least_upper_bound(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p11) ).
fof(f23,plain,
! [X0,X1] : least_upper_bound(X1,greatest_lower_bound(X0,X1)) = X1,
inference(superposition,[],[f11,f5]) ).
fof(f27,plain,
! [X0,X1] : multiply(least_upper_bound(inverse(X0),X1),X0) = least_upper_bound(identity,multiply(X1,X0)),
inference(superposition,[],[f15,f3]) ).
fof(f28,plain,
! [X0,X1] : multiply(inverse(X0),least_upper_bound(X1,X0)) = least_upper_bound(multiply(inverse(X0),X1),identity),
inference(superposition,[],[f13,f3]) ).
fof(f30,plain,
! [X0,X1] : multiply(inverse(X0),least_upper_bound(X1,X0)) = least_upper_bound(identity,multiply(inverse(X0),X1)),
inference(forward_demodulation,[],[f28,f6]) ).
fof(f43,plain,
! [X0,X1] : multiply(inverse(X0),greatest_lower_bound(X0,X1)) = greatest_lower_bound(identity,multiply(inverse(X0),X1)),
inference(superposition,[],[f14,f3]) ).
fof(f58,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = multiply(identity,X1),
inference(superposition,[],[f4,f3]) ).
fof(f73,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(forward_demodulation,[],[f58,f1]) ).
fof(f83,plain,
! [X0] : multiply(inverse(inverse(X0)),identity) = X0,
inference(superposition,[],[f73,f3]) ).
fof(f84,plain,
! [X0,X1] : multiply(X1,X0) = multiply(inverse(inverse(X1)),X0),
inference(superposition,[],[f73,f73]) ).
fof(f85,plain,
! [X2,X0,X1] : multiply(inverse(multiply(X0,X1)),multiply(X0,multiply(X1,X2))) = X2,
inference(superposition,[],[f73,f4]) ).
fof(f88,plain,
! [X2,X0,X1] : multiply(inverse(X1),least_upper_bound(X2,multiply(X1,X0))) = least_upper_bound(multiply(inverse(X1),X2),X0),
inference(superposition,[],[f13,f73]) ).
fof(f98,plain,
! [X0] : multiply(X0,identity) = X0,
inference(forward_demodulation,[],[f83,f84]) ).
fof(f101,plain,
! [X0] : identity = multiply(X0,inverse(X0)),
inference(superposition,[],[f3,f84]) ).
fof(f102,plain,
! [X0,X1] : multiply(X0,multiply(inverse(X0),X1)) = X1,
inference(superposition,[],[f73,f84]) ).
fof(f111,plain,
! [X2,X0,X1] : greatest_lower_bound(multiply(X0,X1),multiply(X2,X1)) = multiply(greatest_lower_bound(inverse(inverse(X0)),X2),X1),
inference(superposition,[],[f16,f84]) ).
fof(f114,plain,
! [X2,X0,X1] : multiply(greatest_lower_bound(X0,X2),X1) = multiply(greatest_lower_bound(inverse(inverse(X0)),X2),X1),
inference(forward_demodulation,[],[f111,f16]) ).
fof(f162,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(f180,plain,
! [X0] : inverse(inverse(X0)) = multiply(X0,identity),
inference(superposition,[],[f84,f98]) ).
fof(f181,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(forward_demodulation,[],[f180,f98]) ).
fof(f232,plain,
! [X0,X1] : greatest_lower_bound(X1,least_upper_bound(X0,X1)) = X1,
inference(superposition,[],[f12,f6]) ).
fof(f239,plain,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(least_upper_bound(X0,X1),X0),
inference(superposition,[],[f23,f12]) ).
fof(f242,plain,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X0,least_upper_bound(X0,X1)),
inference(forward_demodulation,[],[f239,f6]) ).
fof(f858,plain,
! [X0,X1] : multiply(inverse(least_upper_bound(inverse(X1),X0)),least_upper_bound(identity,multiply(X0,X1))) = X1,
inference(superposition,[],[f73,f27]) ).
fof(f907,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = multiply(inverse(least_upper_bound(inverse(greatest_lower_bound(X0,X1)),inverse(X0))),least_upper_bound(identity,greatest_lower_bound(identity,multiply(inverse(X0),X1)))),
inference(superposition,[],[f858,f43]) ).
fof(f949,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = multiply(inverse(least_upper_bound(inverse(greatest_lower_bound(X0,X1)),inverse(X0))),identity),
inference(forward_demodulation,[],[f907,f11]) ).
fof(f964,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = inverse(least_upper_bound(inverse(greatest_lower_bound(X0,X1)),inverse(X0))),
inference(forward_demodulation,[],[f949,f98]) ).
fof(f972,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = inverse(least_upper_bound(inverse(X0),inverse(greatest_lower_bound(X0,X1)))),
inference(forward_demodulation,[],[f964,f6]) ).
fof(f1958,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,[],[f858,f242]) ).
fof(f1965,plain,
! [X0,X1] : least_upper_bound(multiply(inverse(least_upper_bound(inverse(X0),X1)),identity),X0) = X0,
inference(forward_demodulation,[],[f1958,f88]) ).
fof(f1983,plain,
! [X0,X1] : least_upper_bound(X0,multiply(inverse(least_upper_bound(inverse(X0),X1)),identity)) = X0,
inference(forward_demodulation,[],[f1965,f6]) ).
fof(f1992,plain,
! [X0,X1] : least_upper_bound(X0,inverse(least_upper_bound(inverse(X0),X1))) = X0,
inference(forward_demodulation,[],[f1983,f98]) ).
fof(f2002,plain,
! [X0,X1] : least_upper_bound(X1,inverse(least_upper_bound(X0,inverse(X1)))) = X1,
inference(superposition,[],[f1992,f6]) ).
fof(f2055,plain,
! [X0,X1] : inverse(X0) = least_upper_bound(inverse(X0),inverse(least_upper_bound(X1,X0))),
inference(superposition,[],[f2002,f181]) ).
fof(f2068,plain,
! [X0,X1] : inverse(least_upper_bound(X1,inverse(X0))) = greatest_lower_bound(inverse(least_upper_bound(X1,inverse(X0))),X0),
inference(superposition,[],[f232,f2002]) ).
fof(f2096,plain,
! [X0,X1] : inverse(least_upper_bound(X1,inverse(X0))) = greatest_lower_bound(X0,inverse(least_upper_bound(X1,inverse(X0)))),
inference(forward_demodulation,[],[f2068,f5]) ).
fof(f2177,plain,
! [X0,X1] : inverse(greatest_lower_bound(X1,X0)) = least_upper_bound(inverse(greatest_lower_bound(X1,X0)),inverse(X0)),
inference(superposition,[],[f2055,f23]) ).
fof(f2225,plain,
! [X0,X1] : inverse(greatest_lower_bound(X1,X0)) = least_upper_bound(inverse(X0),inverse(greatest_lower_bound(X1,X0))),
inference(forward_demodulation,[],[f2177,f6]) ).
fof(f2337,plain,
! [X2,X0,X1] : multiply(inverse(X2),X0) = multiply(inverse(multiply(X1,X2)),multiply(X1,X0)),
inference(superposition,[],[f85,f102]) ).
fof(f2447,plain,
! [X0,X1] : multiply(inverse(multiply(X0,X1)),X0) = multiply(inverse(X1),identity),
inference(superposition,[],[f2337,f98]) ).
fof(f2448,plain,
! [X0,X1] : multiply(inverse(X0),inverse(X1)) = multiply(inverse(multiply(X1,X0)),identity),
inference(superposition,[],[f2337,f101]) ).
fof(f2449,plain,
! [X2,X0,X1] : multiply(inverse(X1),multiply(inverse(X2),X0)) = multiply(inverse(multiply(X2,X1)),X0),
inference(superposition,[],[f2337,f102]) ).
fof(f2510,plain,
! [X0,X1] : inverse(multiply(X1,X0)) = multiply(inverse(X0),inverse(X1)),
inference(forward_demodulation,[],[f2448,f98]) ).
fof(f2511,plain,
! [X0,X1] : inverse(X1) = multiply(inverse(multiply(X0,X1)),X0),
inference(forward_demodulation,[],[f2447,f98]) ).
fof(f2540,plain,
! [X0,X1] : multiply(inverse(X0),X1) = inverse(multiply(inverse(X1),X0)),
inference(superposition,[],[f2511,f102]) ).
fof(f2714,plain,
! [X0,X1] : multiply(X1,inverse(X0)) = inverse(multiply(X0,inverse(X1))),
inference(superposition,[],[f84,f2510]) ).
fof(f3256,plain,
! [X0,X1] : greatest_lower_bound(inverse(X0),X1) = inverse(least_upper_bound(X0,inverse(greatest_lower_bound(inverse(X0),X1)))),
inference(superposition,[],[f972,f181]) ).
fof(f3387,plain,
! [X0,X1] : inverse(greatest_lower_bound(inverse(X0),X1)) = least_upper_bound(X0,inverse(greatest_lower_bound(inverse(X0),X1))),
inference(superposition,[],[f181,f3256]) ).
fof(f4644,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,[],[f162,f2096]) ).
fof(f4722,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,[],[f4644,f6]) ).
fof(f4831,plain,
! [X0,X1] : greatest_lower_bound(X1,X0) = least_upper_bound(greatest_lower_bound(X1,X0),inverse(least_upper_bound(inverse(X0),inverse(X1)))),
inference(superposition,[],[f4722,f2096]) ).
fof(f5246,plain,
! [X0,X1] : greatest_lower_bound(inverse(X0),X1) = least_upper_bound(greatest_lower_bound(inverse(X0),X1),inverse(least_upper_bound(inverse(X1),X0))),
inference(superposition,[],[f4831,f181]) ).
fof(f5542,plain,
! [X0,X1] : least_upper_bound(inverse(X1),X0) = least_upper_bound(least_upper_bound(inverse(X1),X0),inverse(greatest_lower_bound(inverse(X0),X1))),
inference(superposition,[],[f2002,f5246]) ).
fof(f5566,plain,
! [X0,X1] : least_upper_bound(inverse(X1),X0) = least_upper_bound(inverse(X1),least_upper_bound(X0,inverse(greatest_lower_bound(inverse(X0),X1)))),
inference(forward_demodulation,[],[f5542,f8]) ).
fof(f5605,plain,
! [X0,X1] : least_upper_bound(inverse(X1),X0) = least_upper_bound(inverse(X1),inverse(greatest_lower_bound(inverse(X0),X1))),
inference(forward_demodulation,[],[f5566,f3387]) ).
fof(f5633,plain,
! [X0,X1] : inverse(greatest_lower_bound(inverse(X0),X1)) = least_upper_bound(inverse(X1),X0),
inference(forward_demodulation,[],[f5605,f2225]) ).
fof(f5887,plain,
! [X0,X1] : least_upper_bound(inverse(X0),X1) = inverse(greatest_lower_bound(X0,inverse(X1))),
inference(superposition,[],[f5633,f5]) ).
fof(f6034,plain,
! [X0,X1] : least_upper_bound(inverse(X1),inverse(X0)) = inverse(greatest_lower_bound(X1,X0)),
inference(superposition,[],[f5887,f181]) ).
fof(f6187,plain,
! [X0,X1] : least_upper_bound(X0,inverse(X1)) = inverse(greatest_lower_bound(inverse(X0),X1)),
inference(superposition,[],[f6034,f181]) ).
fof(f6414,plain,
! [X2,X0,X1] : multiply(greatest_lower_bound(inverse(X0),X1),inverse(X2)) = inverse(multiply(X2,least_upper_bound(X0,inverse(X1)))),
inference(superposition,[],[f2714,f6187]) ).
fof(f20489,plain,
! [X0,X1] : multiply(inverse(least_upper_bound(inverse(X1),inverse(X0))),multiply(inverse(X0),least_upper_bound(X1,X0))) = X1,
inference(superposition,[],[f858,f30]) ).
fof(f20533,plain,
! [X0,X1] : multiply(inverse(multiply(X0,least_upper_bound(inverse(X1),inverse(X0)))),least_upper_bound(X1,X0)) = X1,
inference(forward_demodulation,[],[f20489,f2449]) ).
fof(f20672,plain,
! [X0,X1] : multiply(multiply(greatest_lower_bound(inverse(inverse(X1)),X0),inverse(X0)),least_upper_bound(X1,X0)) = X1,
inference(forward_demodulation,[],[f20533,f6414]) ).
fof(f20774,plain,
! [X0,X1] : multiply(greatest_lower_bound(inverse(inverse(X1)),X0),multiply(inverse(X0),least_upper_bound(X1,X0))) = X1,
inference(forward_demodulation,[],[f20672,f4]) ).
fof(f20831,plain,
! [X0,X1] : multiply(greatest_lower_bound(X1,X0),multiply(inverse(X0),least_upper_bound(X1,X0))) = X1,
inference(forward_demodulation,[],[f20774,f114]) ).
fof(f21039,plain,
! [X0,X1] : multiply(inverse(X0),greatest_lower_bound(X0,X1)) = inverse(multiply(inverse(X1),least_upper_bound(X0,X1))),
inference(superposition,[],[f2511,f20831]) ).
fof(f21049,plain,
! [X0,X1] : multiply(inverse(X0),greatest_lower_bound(X0,X1)) = multiply(inverse(least_upper_bound(X0,X1)),X1),
inference(forward_demodulation,[],[f21039,f2540]) ).
fof(f21428,plain,
! [X0,X1] : multiply(inverse(X1),greatest_lower_bound(X0,X1)) = multiply(inverse(least_upper_bound(X1,X0)),X0),
inference(superposition,[],[f21049,f5]) ).
fof(f22802,plain,
! [X0,X1] : multiply(inverse(X1),least_upper_bound(X0,X1)) = inverse(multiply(inverse(X0),greatest_lower_bound(X1,X0))),
inference(superposition,[],[f2540,f21428]) ).
fof(f22893,plain,
! [X0,X1] : multiply(inverse(X1),least_upper_bound(X0,X1)) = multiply(inverse(greatest_lower_bound(X1,X0)),X0),
inference(forward_demodulation,[],[f22802,f2540]) ).
fof(f24878,plain,
least_upper_bound(a,b) != multiply(a,multiply(inverse(a),least_upper_bound(b,a))),
inference(superposition,[],[f17,f22893]) ).
fof(f24969,plain,
least_upper_bound(a,b) != least_upper_bound(b,a),
inference(forward_demodulation,[],[f24878,f102]) ).
fof(f25153,plain,
$false,
inference(forward_subsumption_resolution,[],[f24969,f6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP180-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n018.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:38:08 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/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
% 21.19/3.86 % (2080513)Detected a unit-equality problem, will run specialized UEQ schedule.
% 21.19/3.86 % (2080519)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=1195651797:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 21.19/3.86 % (2080522)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=322289149:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 21.19/3.86 % (2080520)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=327815781:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 21.19/3.86 % (2080524)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=3085156775:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 21.19/3.86 % (2080523)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=1022677607:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 21.19/3.86 % (2080518)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=2038232030:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 21.19/3.86 % (2080521)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=2056896558:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 21.19/3.86 % (2080521)Instruction limit reached!
% 21.19/3.86 % (2080521)------------------------------
% 21.19/3.86 % (2080521)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 21.19/3.86 % (2080521)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.19/3.86 % (2080521)CaDiCaL version: 2.1.3
% 21.19/3.86 % (2080521)Termination reason: Instruction limit
% 21.19/3.86 % (2080521)Termination phase: Saturation
% 21.19/3.86 % (2080521)Time elapsed: 0.079 s
% 21.19/3.86 % (2080521)Peak memory usage: 89 MB
% 21.19/3.86 % (2080521)Instructions burned: 137 (million)
% 21.19/3.86 % (2080522)Instruction limit reached!
% 21.19/3.86 % (2080522)------------------------------
% 21.19/3.86 % (2080522)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 21.19/3.86 % (2080522)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.19/3.86 % (2080522)CaDiCaL version: 2.1.3
% 21.19/3.86 % (2080522)Termination reason: Instruction limit
% 21.19/3.86 % (2080522)Termination phase: Saturation
% 21.19/3.86 % (2080522)Time elapsed: 0.107 s
% 21.19/3.86 % (2080522)Peak memory usage: 89 MB
% 21.19/3.86 % (2080522)Instructions burned: 181 (million)
% 21.19/3.86 % (2080523)Instruction limit reached!
% 21.19/3.86 % (2080523)------------------------------
% 21.19/3.86 % (2080523)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 21.19/3.86 % (2080523)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.19/3.86 % (2080523)CaDiCaL version: 2.1.3
% 21.19/3.86 % (2080523)Termination reason: Instruction limit
% 21.19/3.86 % (2080523)Termination phase: Saturation
% 21.19/3.86 % (2080523)Time elapsed: 0.161 s
% 21.19/3.86 % (2080523)Peak memory usage: 91 MB
% 21.19/3.86 % (2080523)Instructions burned: 258 (million)
% 21.19/3.86 % (2080532)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=3074563307:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2997 on theBenchmark for (2997ds/2051Mi)
% 21.19/3.86 % (2080533)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=2979700635:i=4948:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/4948Mi)
% 21.19/3.86 % (2080534)lrs+10_5:1_sil=8000:sos=all:urr=on:br=off:flr=on:random_seed=4124926900:i=215:ep=RSTC_2996 on theBenchmark for (2996ds/215Mi)
% 21.19/3.86 % (2080534)Instruction limit reached!
% 21.19/3.86 % (2080534)------------------------------
% 21.19/3.86 % (2080534)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 21.19/3.86 % (2080534)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.19/3.86 % (2080534)CaDiCaL version: 2.1.3
% 21.19/3.86 % (2080534)Termination reason: Instruction limit
% 21.19/3.86 % (2080534)Termination phase: Saturation
% 21.19/3.86 % (2080534)Time elapsed: 0.108 s
% 21.19/3.86 % (2080534)Peak memory usage: 90 MB
% 21.19/3.86 % (2080534)Instructions burned: 216 (million)
% 21.19/3.86 % (2080538)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=3611814092: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)
% 21.19/3.86 % (2080524)Instruction limit reached!
% 21.19/3.86 % (2080524)------------------------------
% 21.19/3.86 % (2080524)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 21.19/3.86 % (2080524)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.19/3.86 % (2080524)CaDiCaL version: 2.1.3
% 21.19/3.86 % (2080524)Termination reason: Instruction limit
% 21.19/3.86 % (2080524)Termination phase: Saturation
% 21.19/3.86 % (2080524)Time elapsed: 0.641 s
% 21.19/3.86 % (2080524)Peak memory usage: 99 MB
% 21.19/3.86 % (2080524)Instructions burned: 1188 (million)
% 21.19/3.86 % (2080538)Instruction limit reached!
% 21.19/3.86 % (2080538)------------------------------
% 21.19/3.86 % (2080538)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 21.19/3.86 % (2080538)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.19/3.86 % (2080538)CaDiCaL version: 2.1.3
% 21.19/3.86 % (2080538)Termination reason: Instruction limit
% 21.19/3.86 % (2080538)Termination phase: Saturation
% 21.19/3.86 % (2080538)Time elapsed: 0.197 s
% 21.19/3.86 % (2080538)Peak memory usage: 92 MB
% 21.19/3.86 % (2080538)Instructions burned: 317 (million)
% 21.19/3.86 % (2080540)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=609779368:i=12125:sd=2:fgj=on:ss=axioms:sgt=64_2991 on theBenchmark for (2991ds/12125Mi)
% 21.19/3.86 % (2080541)lrs+10_32_sil=8000:tgt=ground:prc=on:sp=reverse_arity:spb=non_intro:random_seed=2679899899:i=2836:kws=inv_precedence:fgj=on:bd=preordered:ins=10_2990 on theBenchmark for (2990ds/2836Mi)
% 21.19/3.86 % (2080532)Instruction limit reached!
% 21.19/3.86 % (2080532)------------------------------
% 21.19/3.86 % (2080532)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 21.19/3.86 % (2080532)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.19/3.86 % (2080532)CaDiCaL version: 2.1.3
% 21.19/3.86 % (2080532)Termination reason: Instruction limit
% 21.19/3.86 % (2080532)Termination phase: Saturation
% 21.19/3.86 % (2080532)Time elapsed: 1.302 s
% 21.19/3.86 % (2080532)Peak memory usage: 142 MB
% 21.19/3.86 % (2080532)Instructions burned: 2051 (million)
% 21.19/3.86 % (2080544)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:lma=off:kmz=on:random_seed=2444715610:i=14534:kws=arity:fgj=on:bd=preordered:ins=6:ss=axioms:sgt=30_2983 on theBenchmark for (2983ds/14534Mi)
% 21.19/3.86 % (2080533)First to succeed.
% 21.19/3.86 % (2080533)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2080513"
% 21.19/3.86 % (2080533)Refutation found. Thanks to Tanya!
% 21.19/3.86 % SZS status Unsatisfiable for theBenchmark
% 21.19/3.86 % SZS output start Proof for theBenchmark
% See solution above
% 21.83/4.06 % (2080533)------------------------------
% 21.83/4.06 % (2080533)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 21.83/4.06 % (2080533)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 21.83/4.06 % (2080533)CaDiCaL version: 2.1.3
% 21.83/4.06 % (2080533)Termination reason: Refutation
% 21.83/4.06 % (2080533)Time elapsed: 2.305 s
% 21.83/4.06 % (2080533)Peak memory usage: 158 MB
% 21.83/4.06 % (2080533)Instructions burned: 3833 (million)
% 21.83/4.06 % (2080533)------------------------------
% 21.83/4.06 % (2080533)------------------------------
% 21.83/4.06 % (2080513)Success in time 2.994 s
% 21.83/4.06 % Vampire exiting
%------------------------------------------------------------------------------