%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : GRP177-2 : 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 : n002.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:12 AM UTC 2026
% Result : Unsatisfiable 17.08s 3.25s
% Output : Refutation 17.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 31
% Syntax : Number of formulae : 124 ( 68 unt; 19 def)
% Number of atoms : 225 ( 89 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 196 ( 95 ~; 88 |; 0 &)
% ( 13 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 14 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn 45 !; 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(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(f10,axiom,
! [X0] : greatest_lower_bound(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_of_gld) ).
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(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,axiom,
greatest_lower_bound(identity,a) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p08b_1) ).
fof(f18,plain,
identity = greatest_lower_bound(identity,a),
inference(reorient_equations,[],[f17]) ).
fof(f19,axiom,
greatest_lower_bound(identity,b) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p08b_2) ).
fof(f20,plain,
identity = greatest_lower_bound(identity,b),
inference(reorient_equations,[],[f19]) ).
fof(f21,axiom,
greatest_lower_bound(identity,c) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p08b_3) ).
fof(f22,plain,
identity = greatest_lower_bound(identity,c),
inference(reorient_equations,[],[f21]) ).
fof(f23,negated_conjecture,
greatest_lower_bound(greatest_lower_bound(a,multiply(b,c)),multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c))) != greatest_lower_bound(a,multiply(b,c)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p08b) ).
fof(f24,plain,
greatest_lower_bound(a,multiply(b,c)) != greatest_lower_bound(greatest_lower_bound(a,multiply(b,c)),multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c))),
inference(reorient_equations,[],[f23]) ).
fof(f25,definition,
sF0 = multiply(b,c),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f26,plain,
multiply(b,c) = sF0,
inference(reorient_equations,[],[f25]) ).
fof(f27,definition,
sF1 = greatest_lower_bound(a,sF0),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f28,plain,
greatest_lower_bound(a,sF0) = sF1,
inference(reorient_equations,[],[f27]) ).
fof(f29,definition,
sF2 = greatest_lower_bound(a,b),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f30,plain,
greatest_lower_bound(a,b) = sF2,
inference(reorient_equations,[],[f29]) ).
fof(f31,definition,
sF3 = greatest_lower_bound(a,c),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f32,plain,
greatest_lower_bound(a,c) = sF3,
inference(reorient_equations,[],[f31]) ).
fof(f33,definition,
sF4 = multiply(sF2,sF3),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f34,plain,
multiply(sF2,sF3) = sF4,
inference(reorient_equations,[],[f33]) ).
fof(f35,definition,
sF5 = greatest_lower_bound(sF1,sF4),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f36,plain,
greatest_lower_bound(sF1,sF4) = sF5,
inference(reorient_equations,[],[f35]) ).
fof(f37,plain,
sF1 != sF5,
inference(definition_folding,[],[f24,f36,f34,f32,f30,f28,f26,f28,f26]) ).
fof(f38,plain,
sF1 = greatest_lower_bound(sF0,a),
inference(forward_demodulation,[],[f28,f5]) ).
fof(f39,plain,
sF2 = greatest_lower_bound(b,a),
inference(forward_demodulation,[],[f30,f5]) ).
fof(f40,plain,
sF3 = greatest_lower_bound(c,a),
inference(forward_demodulation,[],[f32,f5]) ).
fof(f41,plain,
sF5 = greatest_lower_bound(sF4,sF1),
inference(forward_demodulation,[],[f36,f5]) ).
fof(f54,definition,
( spl6_1
<=> identity = greatest_lower_bound(identity,a) ),
introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition]) ).
fof(f56,plain,
( identity = greatest_lower_bound(identity,a)
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f54]) ).
fof(f57,plain,
spl6_1,
inference(avatar_split_clause,[],[f18,f54]) ).
fof(f59,definition,
( spl6_2
<=> identity = greatest_lower_bound(identity,b) ),
introduced(definition,[new_symbols(definition,[spl6_2])],[avatar_definition]) ).
fof(f61,plain,
( identity = greatest_lower_bound(identity,b)
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f59]) ).
fof(f62,plain,
spl6_2,
inference(avatar_split_clause,[],[f20,f59]) ).
fof(f64,definition,
( spl6_3
<=> identity = greatest_lower_bound(identity,c) ),
introduced(definition,[new_symbols(definition,[spl6_3])],[avatar_definition]) ).
fof(f66,plain,
( identity = greatest_lower_bound(identity,c)
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f64]) ).
fof(f67,plain,
spl6_3,
inference(avatar_split_clause,[],[f22,f64]) ).
fof(f91,definition,
( spl6_4
<=> sF1 = sF5 ),
introduced(definition,[new_symbols(definition,[spl6_4])],[avatar_definition]) ).
fof(f93,plain,
( sF1 != sF5
| spl6_4 ),
inference(avatar_component_clause,[],[f91]) ).
fof(f94,plain,
~ spl6_4,
inference(avatar_split_clause,[],[f37,f91]) ).
fof(f96,definition,
( spl6_5
<=> sF5 = greatest_lower_bound(sF4,sF1) ),
introduced(definition,[new_symbols(definition,[spl6_5])],[avatar_definition]) ).
fof(f98,plain,
( sF5 = greatest_lower_bound(sF4,sF1)
| ~ spl6_5 ),
inference(avatar_component_clause,[],[f96]) ).
fof(f99,plain,
spl6_5,
inference(avatar_split_clause,[],[f41,f96]) ).
fof(f102,definition,
( spl6_6
<=> multiply(b,c) = sF0 ),
introduced(definition,[new_symbols(definition,[spl6_6])],[avatar_definition]) ).
fof(f104,plain,
( multiply(b,c) = sF0
| ~ spl6_6 ),
inference(avatar_component_clause,[],[f102]) ).
fof(f105,plain,
spl6_6,
inference(avatar_split_clause,[],[f26,f102]) ).
fof(f115,definition,
( spl6_7
<=> sF2 = greatest_lower_bound(b,a) ),
introduced(definition,[new_symbols(definition,[spl6_7])],[avatar_definition]) ).
fof(f117,plain,
( sF2 = greatest_lower_bound(b,a)
| ~ spl6_7 ),
inference(avatar_component_clause,[],[f115]) ).
fof(f118,plain,
spl6_7,
inference(avatar_split_clause,[],[f39,f115]) ).
fof(f122,definition,
( spl6_8
<=> sF3 = greatest_lower_bound(c,a) ),
introduced(definition,[new_symbols(definition,[spl6_8])],[avatar_definition]) ).
fof(f124,plain,
( sF3 = greatest_lower_bound(c,a)
| ~ spl6_8 ),
inference(avatar_component_clause,[],[f122]) ).
fof(f125,plain,
spl6_8,
inference(avatar_split_clause,[],[f40,f122]) ).
fof(f129,definition,
( spl6_9
<=> sF1 = greatest_lower_bound(sF0,a) ),
introduced(definition,[new_symbols(definition,[spl6_9])],[avatar_definition]) ).
fof(f131,plain,
( sF1 = greatest_lower_bound(sF0,a)
| ~ spl6_9 ),
inference(avatar_component_clause,[],[f129]) ).
fof(f132,plain,
spl6_9,
inference(avatar_split_clause,[],[f38,f129]) ).
fof(f140,definition,
( spl6_10
<=> multiply(sF2,sF3) = sF4 ),
introduced(definition,[new_symbols(definition,[spl6_10])],[avatar_definition]) ).
fof(f142,plain,
( multiply(sF2,sF3) = sF4
| ~ spl6_10 ),
inference(avatar_component_clause,[],[f140]) ).
fof(f143,plain,
spl6_10,
inference(avatar_split_clause,[],[f34,f140]) ).
fof(f156,plain,
( ! [X0] : greatest_lower_bound(identity,X0) = greatest_lower_bound(identity,greatest_lower_bound(b,X0))
| ~ spl6_2 ),
inference(superposition,[],[f7,f61]) ).
fof(f159,plain,
! [X2,X3,X0,X1] : greatest_lower_bound(multiply(X0,X1),greatest_lower_bound(multiply(X0,X2),X3)) = greatest_lower_bound(multiply(X0,greatest_lower_bound(X1,X2)),X3),
inference(superposition,[],[f7,f14]) ).
fof(f264,plain,
! [X0,X1] : multiply(identity,X1) = multiply(inverse(X0),multiply(X0,X1)),
inference(superposition,[],[f4,f3]) ).
fof(f274,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(forward_demodulation,[],[f264,f1]) ).
fof(f277,plain,
! [X0] : multiply(inverse(inverse(X0)),identity) = X0,
inference(superposition,[],[f274,f3]) ).
fof(f278,plain,
! [X0,X1] : multiply(X1,X0) = multiply(inverse(inverse(X1)),X0),
inference(superposition,[],[f274,f274]) ).
fof(f290,plain,
! [X0] : multiply(X0,identity) = X0,
inference(forward_demodulation,[],[f277,f278]) ).
fof(f532,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X0,greatest_lower_bound(X0,X1)),
inference(superposition,[],[f7,f10]) ).
fof(f768,plain,
! [X2,X3,X0,X1] : greatest_lower_bound(multiply(X0,greatest_lower_bound(X3,X2)),multiply(X1,X2)) = greatest_lower_bound(multiply(X0,X3),multiply(greatest_lower_bound(X0,X1),X2)),
inference(superposition,[],[f159,f16]) ).
fof(f1030,plain,
( ! [X0,X1] : greatest_lower_bound(multiply(X0,identity),multiply(greatest_lower_bound(X0,X1),c)) = greatest_lower_bound(multiply(X0,identity),multiply(X1,c))
| ~ spl6_3 ),
inference(superposition,[],[f768,f66]) ).
fof(f1039,plain,
( ! [X0,X1] : greatest_lower_bound(multiply(X0,c),multiply(greatest_lower_bound(X0,X1),a)) = greatest_lower_bound(multiply(X0,sF3),multiply(X1,a))
| ~ spl6_8 ),
inference(superposition,[],[f768,f124]) ).
fof(f1200,plain,
( ! [X0,X1] : greatest_lower_bound(X0,multiply(greatest_lower_bound(X0,X1),c)) = greatest_lower_bound(X0,multiply(X1,c))
| ~ spl6_3 ),
inference(forward_demodulation,[],[f1030,f290]) ).
fof(f1399,plain,
( ! [X0,X1] : greatest_lower_bound(X1,multiply(X0,c)) = greatest_lower_bound(X1,multiply(greatest_lower_bound(X0,X1),c))
| ~ spl6_3 ),
inference(superposition,[],[f1200,f5]) ).
fof(f2177,plain,
( greatest_lower_bound(identity,a) = greatest_lower_bound(identity,sF2)
| ~ spl6_2
| ~ spl6_7 ),
inference(superposition,[],[f156,f117]) ).
fof(f2226,plain,
( greatest_lower_bound(identity,a) = greatest_lower_bound(sF2,identity)
| ~ spl6_2
| ~ spl6_7 ),
inference(forward_demodulation,[],[f2177,f5]) ).
fof(f2236,plain,
( identity = greatest_lower_bound(sF2,identity)
| ~ spl6_1
| ~ spl6_2
| ~ spl6_7 ),
inference(forward_demodulation,[],[f2226,f56]) ).
fof(f7823,plain,
( greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,multiply(sF2,c))
| ~ spl6_3
| ~ spl6_7 ),
inference(superposition,[],[f1399,f117]) ).
fof(f7932,plain,
( greatest_lower_bound(a,sF0) = greatest_lower_bound(a,multiply(sF2,c))
| ~ spl6_3
| ~ spl6_6
| ~ spl6_7 ),
inference(forward_demodulation,[],[f7823,f104]) ).
fof(f7983,plain,
( greatest_lower_bound(sF0,a) = greatest_lower_bound(a,multiply(sF2,c))
| ~ spl6_3
| ~ spl6_6
| ~ spl6_7 ),
inference(forward_demodulation,[],[f7932,f5]) ).
fof(f8023,plain,
( sF1 = greatest_lower_bound(a,multiply(sF2,c))
| ~ spl6_3
| ~ spl6_6
| ~ spl6_7
| ~ spl6_9 ),
inference(forward_demodulation,[],[f7983,f131]) ).
fof(f8073,definition,
( spl6_37
<=> sF1 = greatest_lower_bound(a,multiply(sF2,c)) ),
introduced(definition,[new_symbols(definition,[spl6_37])],[avatar_definition]) ).
fof(f8075,plain,
( sF1 = greatest_lower_bound(a,multiply(sF2,c))
| ~ spl6_37 ),
inference(avatar_component_clause,[],[f8073]) ).
fof(f8076,plain,
( spl6_37
| ~ spl6_3
| ~ spl6_6
| ~ spl6_7
| ~ spl6_9 ),
inference(avatar_split_clause,[],[f8023,f129,f115,f102,f64,f8073]) ).
fof(f12438,definition,
( spl6_77
<=> identity = greatest_lower_bound(sF2,identity) ),
introduced(definition,[new_symbols(definition,[spl6_77])],[avatar_definition]) ).
fof(f12440,plain,
( identity = greatest_lower_bound(sF2,identity)
| ~ spl6_77 ),
inference(avatar_component_clause,[],[f12438]) ).
fof(f12441,plain,
( spl6_77
| ~ spl6_1
| ~ spl6_2
| ~ spl6_7 ),
inference(avatar_split_clause,[],[f2236,f115,f59,f54,f12438]) ).
fof(f12451,plain,
( greatest_lower_bound(multiply(sF2,sF3),multiply(identity,a)) = greatest_lower_bound(multiply(sF2,c),multiply(identity,a))
| ~ spl6_8
| ~ spl6_77 ),
inference(superposition,[],[f1039,f12440]) ).
fof(f12462,plain,
( greatest_lower_bound(multiply(sF2,c),a) = greatest_lower_bound(multiply(sF2,sF3),a)
| ~ spl6_8
| ~ spl6_77 ),
inference(forward_demodulation,[],[f12451,f1]) ).
fof(f12475,plain,
( greatest_lower_bound(multiply(sF2,c),a) = greatest_lower_bound(a,multiply(sF2,sF3))
| ~ spl6_8
| ~ spl6_77 ),
inference(forward_demodulation,[],[f12462,f5]) ).
fof(f12484,plain,
( greatest_lower_bound(multiply(sF2,c),a) = greatest_lower_bound(a,sF4)
| ~ spl6_8
| ~ spl6_10
| ~ spl6_77 ),
inference(forward_demodulation,[],[f12475,f142]) ).
fof(f12488,plain,
( greatest_lower_bound(multiply(sF2,c),a) = greatest_lower_bound(sF4,a)
| ~ spl6_8
| ~ spl6_10
| ~ spl6_77 ),
inference(forward_demodulation,[],[f12484,f5]) ).
fof(f12492,plain,
( greatest_lower_bound(a,multiply(sF2,c)) = greatest_lower_bound(sF4,a)
| ~ spl6_8
| ~ spl6_10
| ~ spl6_77 ),
inference(forward_demodulation,[],[f12488,f5]) ).
fof(f12494,plain,
( sF1 = greatest_lower_bound(sF4,a)
| ~ spl6_8
| ~ spl6_10
| ~ spl6_37
| ~ spl6_77 ),
inference(forward_demodulation,[],[f12492,f8075]) ).
fof(f12496,definition,
( spl6_78
<=> sF1 = greatest_lower_bound(sF4,a) ),
introduced(definition,[new_symbols(definition,[spl6_78])],[avatar_definition]) ).
fof(f12498,plain,
( sF1 = greatest_lower_bound(sF4,a)
| ~ spl6_78 ),
inference(avatar_component_clause,[],[f12496]) ).
fof(f12499,plain,
( spl6_78
| ~ spl6_8
| ~ spl6_10
| ~ spl6_37
| ~ spl6_77 ),
inference(avatar_split_clause,[],[f12494,f12438,f8073,f140,f122,f12496]) ).
fof(f12507,plain,
( sF1 = greatest_lower_bound(sF4,sF1)
| ~ spl6_78 ),
inference(superposition,[],[f532,f12498]) ).
fof(f12532,plain,
( sF1 = sF5
| ~ spl6_5
| ~ spl6_78 ),
inference(forward_demodulation,[],[f12507,f98]) ).
fof(f12540,plain,
( $false
| spl6_4
| ~ spl6_5
| ~ spl6_78 ),
inference(forward_subsumption_resolution,[],[f12532,f93]) ).
fof(f12541,plain,
( spl6_4
| ~ spl6_5
| ~ spl6_78 ),
inference(avatar_contradiction_clause,[],[f12540]) ).
cnf(s1,plain,
spl6_1,
inference(sat_conversion,[],[f57]) ).
cnf(s2,plain,
spl6_2,
inference(sat_conversion,[],[f62]) ).
cnf(s3,plain,
spl6_3,
inference(sat_conversion,[],[f67]) ).
cnf(s4,plain,
~ spl6_4,
inference(sat_conversion,[],[f94]) ).
cnf(s5,plain,
spl6_5,
inference(sat_conversion,[],[f99]) ).
cnf(s6,plain,
spl6_6,
inference(sat_conversion,[],[f105]) ).
cnf(s7,plain,
spl6_7,
inference(sat_conversion,[],[f118]) ).
cnf(s8,plain,
spl6_8,
inference(sat_conversion,[],[f125]) ).
cnf(s9,plain,
spl6_9,
inference(sat_conversion,[],[f132]) ).
cnf(s10,plain,
spl6_10,
inference(sat_conversion,[],[f143]) ).
cnf(s37,plain,
( ~ spl6_3
| ~ spl6_6
| ~ spl6_7
| ~ spl6_9
| spl6_37 ),
inference(sat_conversion,[],[f8076]) ).
cnf(s77,plain,
( ~ spl6_1
| ~ spl6_2
| ~ spl6_7
| spl6_77 ),
inference(sat_conversion,[],[f12441]) ).
cnf(s78,plain,
( ~ spl6_8
| ~ spl6_10
| ~ spl6_37
| ~ spl6_77
| spl6_78 ),
inference(sat_conversion,[],[f12499]) ).
cnf(s79,plain,
( spl6_4
| ~ spl6_5
| ~ spl6_78 ),
inference(sat_conversion,[],[f12541]) ).
cnf(s88,plain,
~ spl6_78,
inference(rat,[],[s79,s5,s4]) ).
cnf(s93,plain,
spl6_37,
inference(rat,[],[s37,s6,s9,s7,s3]) ).
cnf(s101,plain,
~ spl6_77,
inference(rat,[],[s78,s88,s8,s10,s93]) ).
cnf(s106,plain,
~ spl6_1,
inference(rat,[],[s77,s101,s7,s2]) ).
cnf(s131,plain,
$false,
inference(rat,[],[s1,s106]) ).
fof(f12548,plain,
$false,
inference(avatar_sat_refutation,[],[s131]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP177-2 : 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 : n002.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:38:22 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/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
% 17.08/3.25 % (3291692)Detected a unit-equality problem, will run specialized UEQ schedule.
% 17.08/3.25 % (3291703)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=3700620480:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 17.08/3.25 % (3291700)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=638477050:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 17.08/3.25 % (3291701)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=141547292:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 17.08/3.25 % (3291699)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=2486869330:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 17.08/3.25 % (3291698)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=724788138:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 17.08/3.25 % (3291697)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=2211832165:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 17.08/3.25 % (3291702)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=1554641806:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 17.08/3.25 % (3291700)Instruction limit reached!
% 17.08/3.25 % (3291700)------------------------------
% 17.08/3.25 % (3291700)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.08/3.25 % (3291700)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.08/3.25 % (3291700)CaDiCaL version: 2.1.3
% 17.08/3.25 % (3291700)Termination reason: Instruction limit
% 17.08/3.25 % (3291700)Termination phase: Saturation
% 17.08/3.25 % (3291700)Time elapsed: 0.085 s
% 17.08/3.25 % (3291700)Peak memory usage: 89 MB
% 17.08/3.25 % (3291700)Instructions burned: 137 (million)
% 17.08/3.25 % (3291701)Instruction limit reached!
% 17.08/3.25 % (3291701)------------------------------
% 17.08/3.25 % (3291701)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.08/3.25 % (3291701)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.08/3.25 % (3291701)CaDiCaL version: 2.1.3
% 17.08/3.25 % (3291701)Termination reason: Instruction limit
% 17.08/3.25 % (3291701)Termination phase: Saturation
% 17.08/3.25 % (3291701)Time elapsed: 0.107 s
% 17.08/3.25 % (3291701)Peak memory usage: 89 MB
% 17.08/3.25 % (3291701)Instructions burned: 182 (million)
% 17.08/3.25 % (3291702)Instruction limit reached!
% 17.08/3.25 % (3291702)------------------------------
% 17.08/3.25 % (3291702)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.08/3.25 % (3291702)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.08/3.25 % (3291702)CaDiCaL version: 2.1.3
% 17.08/3.25 % (3291702)Termination reason: Instruction limit
% 17.08/3.25 % (3291702)Termination phase: Saturation
% 17.08/3.25 % (3291702)Time elapsed: 0.171 s
% 17.08/3.25 % (3291702)Peak memory usage: 91 MB
% 17.08/3.25 % (3291702)Instructions burned: 258 (million)
% 17.08/3.25 % (3291711)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=3364166046:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2997 on theBenchmark for (2997ds/2051Mi)
% 17.08/3.25 % (3291712)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=697955290:i=4948:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/4948Mi)
% 17.08/3.25 % (3291713)lrs+10_5:1_sil=8000:sos=all:urr=on:br=off:flr=on:random_seed=4048240999:i=215:ep=RSTC_2996 on theBenchmark for (2996ds/215Mi)
% 17.08/3.25 % (3291703)Instruction limit reached!
% 17.08/3.25 % (3291703)------------------------------
% 17.08/3.25 % (3291703)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.08/3.25 % (3291703)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.08/3.25 % (3291703)CaDiCaL version: 2.1.3
% 17.08/3.25 % (3291703)Termination reason: Instruction limit
% 17.08/3.25 % (3291703)Termination phase: Saturation
% 17.08/3.25 % (3291703)Time elapsed: 0.343 s
% 17.08/3.25 % (3291703)Peak memory usage: 99 MB
% 17.08/3.25 % (3291703)Instructions burned: 1191 (million)
% 17.08/3.25 % (3291717)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=3191140098: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)
% 17.08/3.25 % (3291713)Instruction limit reached!
% 17.08/3.25 % (3291713)------------------------------
% 17.08/3.25 % (3291713)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.08/3.25 % (3291713)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.08/3.25 % (3291713)CaDiCaL version: 2.1.3
% 17.08/3.25 % (3291713)Termination reason: Instruction limit
% 17.08/3.25 % (3291713)Termination phase: Saturation
% 17.08/3.25 % (3291713)Time elapsed: 0.118 s
% 17.08/3.25 % (3291713)Peak memory usage: 92 MB
% 17.08/3.25 % (3291713)Instructions burned: 216 (million)
% 17.08/3.25 % (3291717)Instruction limit reached!
% 17.08/3.25 % (3291717)------------------------------
% 17.08/3.25 % (3291717)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.08/3.25 % (3291717)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.08/3.25 % (3291717)CaDiCaL version: 2.1.3
% 17.08/3.25 % (3291717)Termination reason: Instruction limit
% 17.08/3.25 % (3291717)Termination phase: Saturation
% 17.08/3.25 % (3291717)Time elapsed: 0.108 s
% 17.08/3.25 % (3291717)Peak memory usage: 93 MB
% 17.08/3.25 % (3291717)Instructions burned: 318 (million)
% 17.08/3.25 % (3291719)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=2444152145:i=12125:sd=2:fgj=on:ss=axioms:sgt=64_2994 on theBenchmark for (2994ds/12125Mi)
% 17.08/3.25 % (3291720)lrs+10_32_sil=8000:tgt=ground:prc=on:sp=reverse_arity:spb=non_intro:random_seed=2103576137:i=2836:kws=inv_precedence:fgj=on:bd=preordered:ins=10_2993 on theBenchmark for (2993ds/2836Mi)
% 17.08/3.25 % (3291711)Instruction limit reached!
% 17.08/3.25 % (3291711)------------------------------
% 17.08/3.25 % (3291711)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.08/3.25 % (3291711)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.08/3.25 % (3291711)CaDiCaL version: 2.1.3
% 17.08/3.25 % (3291711)Termination reason: Instruction limit
% 17.08/3.25 % (3291711)Termination phase: Saturation
% 17.08/3.25 % (3291711)Time elapsed: 1.298 s
% 17.08/3.25 % (3291711)Peak memory usage: 141 MB
% 17.08/3.25 % (3291711)Instructions burned: 2051 (million)
% 17.08/3.25 % (3291720)Instruction limit reached!
% 17.08/3.25 % (3291720)------------------------------
% 17.08/3.25 % (3291720)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.08/3.25 % (3291720)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.08/3.25 % (3291720)CaDiCaL version: 2.1.3
% 17.08/3.25 % (3291720)Termination reason: Instruction limit
% 17.08/3.25 % (3291720)Termination phase: Saturation
% 17.08/3.25 % (3291720)Time elapsed: 1.008 s
% 17.08/3.25 % (3291720)Peak memory usage: 154 MB
% 17.08/3.25 % (3291720)Instructions burned: 2838 (million)
% 17.08/3.25 % (3291723)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:lma=off:kmz=on:random_seed=1802972466:i=14534:kws=arity:fgj=on:bd=preordered:ins=6:ss=axioms:sgt=30_2983 on theBenchmark for (2983ds/14534Mi)
% 17.08/3.25 % (3291724)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=2306410331:i=11832:s2at=3:bs=on:bd=preordered:fsd=on_2982 on theBenchmark for (2982ds/11832Mi)
% 17.08/3.25 % (3291697)First to succeed.
% 17.08/3.25 % (3291697)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3291692"
% 17.08/3.25 % (3291719)Also succeeded, but the first one will report.
% 17.08/3.25 % (3291697)Refutation found. Thanks to Tanya!
% 17.08/3.25 % SZS status Unsatisfiable for theBenchmark
% 17.08/3.25 % SZS output start Proof for theBenchmark
% See solution above
% 17.54/3.44 % (3291697)------------------------------
% 17.54/3.44 % (3291697)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.54/3.44 % (3291697)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.54/3.44 % (3291697)CaDiCaL version: 2.1.3
% 17.54/3.44 % (3291697)Termination reason: Refutation
% 17.54/3.44 % (3291697)Time elapsed: 1.976 s
% 17.54/3.44 % (3291697)Peak memory usage: 152 MB
% 17.54/3.44 % (3291697)Instructions burned: 3115 (million)
% 17.54/3.44 % (3291697)------------------------------
% 17.54/3.44 % (3291697)------------------------------
% 17.54/3.44 % (3291692)Success in time 2.398 s
% 17.54/3.44 % Vampire exiting
%------------------------------------------------------------------------------