%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KLE044+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n004.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 11:40:45 AM UTC 2026
% Result : Theorem 0.98s 0.60s
% Output : Refutation 0.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 17
% Syntax : Number of formulae : 97 ( 42 unt; 4 def)
% Number of atoms : 160 ( 33 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 128 ( 65 ~; 54 |; 2 &)
% ( 5 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 109 ( 0 sgn 108 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',additive_commutativity) ).
fof(f2,axiom,
! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',additive_associativity) ).
fof(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',additive_idempotence) ).
fof(f6,axiom,
! [X0] : multiplication(X0,one) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',multiplicative_right_identity) ).
fof(f7,axiom,
! [X0] : multiplication(one,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',multiplicative_left_identity) ).
fof(f8,axiom,
! [X0,X1,X2] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',right_distributivity) ).
fof(f9,axiom,
! [X0,X1,X2] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',left_distributivity) ).
fof(f12,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> addition(X0,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',order) ).
fof(f13,axiom,
! [X0] : leq(addition(one,multiplication(X0,star(X0))),star(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',star_unfold_right) ).
fof(f14,axiom,
! [X0] : leq(addition(one,multiplication(star(X0),X0)),star(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',star_unfold_left) ).
fof(f15,axiom,
! [X0,X1,X2] :
( leq(addition(multiplication(X0,X1),X2),X1)
=> leq(multiplication(star(X0),X2),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',star_induction_left) ).
fof(f16,axiom,
! [X0,X1,X2] :
( leq(addition(multiplication(X0,X1),X2),X0)
=> leq(multiplication(X2,star(X1)),X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',star_induction_right) ).
fof(f17,conjecture,
! [X0] :
( leq(star(addition(one,X0)),star(X0))
& leq(star(X0),star(addition(one,X0))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f18,negated_conjecture,
~ ! [X0] :
( leq(star(addition(one,X0)),star(X0))
& leq(star(X0),star(addition(one,X0))) ),
inference(negated_conjecture,[status(cth)],[f17]) ).
fof(f19,plain,
! [X0,X1,X2] :
( leq(multiplication(star(X0),X2),X1)
| ~ leq(addition(multiplication(X0,X1),X2),X1) ),
inference(ennf_transformation,[],[f15]) ).
fof(f20,plain,
! [X0,X1,X2] :
( leq(multiplication(X2,star(X1)),X0)
| ~ leq(addition(multiplication(X0,X1),X2),X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f21,plain,
? [X0] :
( ~ leq(star(addition(one,X0)),star(X0))
| ~ leq(star(X0),star(addition(one,X0))) ),
inference(ennf_transformation,[],[f18]) ).
fof(f22,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f23,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f2]) ).
fof(f25,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f27,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f28,plain,
! [X0] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f7]) ).
fof(f29,plain,
! [X2,X0,X1] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
inference(cnf_transformation,[],[f8]) ).
fof(f30,plain,
! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f33,plain,
! [X0,X1] :
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f12]) ).
fof(f34,plain,
! [X0,X1] :
( addition(X0,X1) = X1
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f12]) ).
fof(f35,plain,
! [X0] : leq(addition(one,multiplication(X0,star(X0))),star(X0)),
inference(cnf_transformation,[],[f13]) ).
fof(f36,plain,
! [X0] : leq(addition(one,multiplication(star(X0),X0)),star(X0)),
inference(cnf_transformation,[],[f14]) ).
fof(f37,plain,
! [X2,X0,X1] :
( ~ leq(addition(multiplication(X0,X1),X2),X1)
| leq(multiplication(star(X0),X2),X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f38,plain,
! [X2,X0,X1] :
( ~ leq(addition(multiplication(X0,X1),X2),X0)
| leq(multiplication(X2,star(X1)),X0) ),
inference(cnf_transformation,[],[f20]) ).
fof(f39,plain,
( ~ leq(star(sK0),star(addition(one,sK0)))
| ~ leq(star(addition(one,sK0)),star(sK0)) ),
inference(cnf_transformation,[],[f21]) ).
fof(f40,plain,
! [X0,X1] :
( leq(X0,X1)
| addition(X0,X1) = X1 ),
inference(consistent_polarity_flipping,[],[f34]) ).
fof(f41,plain,
! [X0,X1] :
( addition(X0,X1) != X1
| ~ leq(X0,X1) ),
inference(consistent_polarity_flipping,[],[f33]) ).
fof(f42,plain,
! [X0] : ~ leq(addition(one,multiplication(X0,star(X0))),star(X0)),
inference(consistent_polarity_flipping,[],[f35]) ).
fof(f43,plain,
! [X0] : ~ leq(addition(one,multiplication(star(X0),X0)),star(X0)),
inference(consistent_polarity_flipping,[],[f36]) ).
fof(f44,plain,
! [X2,X0,X1] :
( leq(addition(multiplication(X0,X1),X2),X1)
| ~ leq(multiplication(star(X0),X2),X1) ),
inference(consistent_polarity_flipping,[],[f37]) ).
fof(f45,plain,
! [X2,X0,X1] :
( leq(addition(multiplication(X0,X1),X2),X0)
| ~ leq(multiplication(X2,star(X1)),X0) ),
inference(consistent_polarity_flipping,[],[f38]) ).
fof(f46,plain,
( leq(star(sK0),star(addition(one,sK0)))
| leq(star(addition(one,sK0)),star(sK0)) ),
inference(consistent_polarity_flipping,[],[f39]) ).
fof(f48,definition,
( spl1_1
<=> leq(star(addition(one,sK0)),star(sK0)) ),
introduced(definition,[new_symbols(definition,[spl1_1])],[avatar_definition]) ).
fof(f50,plain,
( leq(star(addition(one,sK0)),star(sK0))
| ~ spl1_1 ),
inference(avatar_component_clause,[],[f48]) ).
fof(f52,definition,
( spl1_2
<=> leq(star(sK0),star(addition(one,sK0))) ),
introduced(definition,[new_symbols(definition,[spl1_2])],[avatar_definition]) ).
fof(f54,plain,
( leq(star(sK0),star(addition(one,sK0)))
| ~ spl1_2 ),
inference(avatar_component_clause,[],[f52]) ).
fof(f55,plain,
( spl1_1
| spl1_2 ),
inference(avatar_split_clause,[],[f46,f52,f48]) ).
fof(f65,plain,
! [X0] :
( X0 != X0
| ~ leq(X0,X0) ),
inference(superposition,[],[f41,f25]) ).
fof(f70,plain,
! [X0] : ~ leq(X0,X0),
inference(trivial_inequality_removal,[],[f65]) ).
fof(f73,plain,
~ leq(addition(one,star(one)),star(one)),
inference(superposition,[],[f42,f28]) ).
fof(f78,plain,
! [X0] : star(X0) = addition(addition(one,multiplication(star(X0),X0)),star(X0)),
inference(resolution,[],[f43,f40]) ).
fof(f90,plain,
! [X2,X0,X1] : addition(X0,addition(X1,X2)) = addition(X1,addition(X2,X0)),
inference(superposition,[],[f23,f22]) ).
fof(f116,plain,
! [X0,X1] : multiplication(X0,addition(one,X1)) = addition(X0,multiplication(X0,X1)),
inference(superposition,[],[f29,f27]) ).
fof(f151,plain,
! [X0,X1] : multiplication(addition(one,X1),X0) = addition(X0,multiplication(X1,X0)),
inference(superposition,[],[f30,f28]) ).
fof(f182,plain,
! [X2,X0,X1] :
( ~ leq(multiplication(star(X0),multiplication(X0,X2)),X1)
| leq(multiplication(X0,addition(X1,X2)),X1) ),
inference(superposition,[],[f44,f29]) ).
fof(f185,plain,
! [X0,X1] :
( ~ leq(multiplication(star(X0),multiplication(X0,X1)),X1)
| leq(multiplication(X0,X1),X1) ),
inference(superposition,[],[f44,f25]) ).
fof(f186,plain,
! [X2,X0,X1] :
( ~ leq(multiplication(star(X1),X0),X2)
| leq(addition(X0,multiplication(X1,X2)),X2) ),
inference(superposition,[],[f44,f22]) ).
fof(f200,plain,
! [X2,X0,X1] :
( ~ leq(multiplication(X0,star(X2)),X1)
| leq(addition(X0,multiplication(X1,X2)),X1) ),
inference(superposition,[],[f45,f22]) ).
fof(f883,plain,
! [X0] : star(X0) = addition(one,addition(multiplication(star(X0),X0),star(X0))),
inference(superposition,[],[f23,f78]) ).
fof(f900,plain,
! [X0] : star(X0) = addition(one,addition(star(X0),multiplication(star(X0),X0))),
inference(forward_demodulation,[],[f883,f22]) ).
fof(f903,plain,
! [X0] : star(X0) = addition(one,multiplication(star(X0),addition(one,X0))),
inference(forward_demodulation,[],[f900,f116]) ).
fof(f1148,plain,
! [X0] :
( ~ leq(multiplication(star(one),X0),X0)
| leq(X0,X0) ),
inference(superposition,[],[f185,f28]) ).
fof(f1149,plain,
! [X0] : ~ leq(multiplication(star(one),X0),X0),
inference(forward_subsumption_resolution,[],[f1148,f70]) ).
fof(f1156,plain,
~ leq(star(one),one),
inference(superposition,[],[f1149,f27]) ).
fof(f1159,plain,
! [X0,X1] :
( ~ leq(star(X0),X1)
| leq(addition(one,multiplication(X0,X1)),X1) ),
inference(superposition,[],[f186,f27]) ).
fof(f1161,plain,
one = addition(star(one),one),
inference(resolution,[],[f1156,f40]) ).
fof(f1165,plain,
! [X0,X1] :
( ~ leq(star(X0),X1)
| leq(addition(one,multiplication(X1,X0)),X1) ),
inference(superposition,[],[f200,f28]) ).
fof(f1166,plain,
one = addition(one,star(one)),
inference(superposition,[],[f1161,f22]) ).
fof(f1189,plain,
~ leq(one,star(one)),
inference(superposition,[],[f73,f1166]) ).
fof(f1206,definition,
( spl1_5
<=> leq(one,star(one)) ),
introduced(definition,[new_symbols(definition,[spl1_5])],[avatar_definition]) ).
fof(f1208,plain,
( ~ leq(one,star(one))
| spl1_5 ),
inference(avatar_component_clause,[],[f1206]) ).
fof(f1210,definition,
( spl1_6
<=> one = star(one) ),
introduced(definition,[new_symbols(definition,[spl1_6])],[avatar_definition]) ).
fof(f1211,plain,
( one = star(one)
| ~ spl1_6 ),
inference(avatar_component_clause,[],[f1210]) ).
fof(f1216,plain,
~ spl1_5,
inference(avatar_split_clause,[],[f1189,f1206]) ).
fof(f1263,plain,
( star(one) = addition(one,star(one))
| spl1_5 ),
inference(resolution,[],[f1208,f40]) ).
fof(f1264,plain,
( one = star(one)
| spl1_5 ),
inference(forward_demodulation,[],[f1263,f1166]) ).
fof(f1265,plain,
( spl1_6
| spl1_5 ),
inference(avatar_split_clause,[],[f1264,f1206,f1210]) ).
fof(f1320,plain,
! [X0,X1] :
( ~ leq(multiplication(star(one),X0),X1)
| leq(multiplication(one,addition(X1,X0)),X1) ),
inference(superposition,[],[f182,f28]) ).
fof(f1321,plain,
( ! [X0,X1] :
( ~ leq(multiplication(one,X0),X1)
| leq(multiplication(one,addition(X1,X0)),X1) )
| ~ spl1_6 ),
inference(forward_demodulation,[],[f1320,f1211]) ).
fof(f1328,plain,
( ! [X0,X1] :
( ~ leq(X0,X1)
| leq(multiplication(one,addition(X1,X0)),X1) )
| ~ spl1_6 ),
inference(forward_demodulation,[],[f1321,f28]) ).
fof(f1330,plain,
( ! [X0,X1] :
( ~ leq(X0,X1)
| leq(addition(X1,X0),X1) )
| ~ spl1_6 ),
inference(forward_demodulation,[],[f1328,f28]) ).
fof(f6018,plain,
( leq(addition(one,multiplication(sK0,star(addition(one,sK0)))),star(addition(one,sK0)))
| ~ spl1_2 ),
inference(resolution,[],[f1159,f54]) ).
fof(f6045,plain,
( leq(addition(star(addition(one,sK0)),addition(one,multiplication(sK0,star(addition(one,sK0))))),star(addition(one,sK0)))
| ~ spl1_2
| ~ spl1_6 ),
inference(resolution,[],[f6018,f1330]) ).
fof(f6047,plain,
( leq(addition(one,addition(multiplication(sK0,star(addition(one,sK0))),star(addition(one,sK0)))),star(addition(one,sK0)))
| ~ spl1_2
| ~ spl1_6 ),
inference(forward_demodulation,[],[f6045,f90]) ).
fof(f6049,plain,
( leq(addition(one,addition(star(addition(one,sK0)),multiplication(sK0,star(addition(one,sK0))))),star(addition(one,sK0)))
| ~ spl1_2
| ~ spl1_6 ),
inference(forward_demodulation,[],[f6047,f22]) ).
fof(f6051,plain,
( leq(addition(one,multiplication(addition(one,sK0),star(addition(one,sK0)))),star(addition(one,sK0)))
| ~ spl1_2
| ~ spl1_6 ),
inference(forward_demodulation,[],[f6049,f151]) ).
fof(f6052,plain,
( $false
| ~ spl1_2
| ~ spl1_6 ),
inference(forward_subsumption_resolution,[],[f6051,f42]) ).
fof(f6053,plain,
( ~ spl1_2
| ~ spl1_6 ),
inference(avatar_contradiction_clause,[],[f6052]) ).
fof(f6054,plain,
( leq(addition(one,multiplication(star(sK0),addition(one,sK0))),star(sK0))
| ~ spl1_1 ),
inference(resolution,[],[f50,f1165]) ).
fof(f6059,plain,
( leq(star(sK0),star(sK0))
| ~ spl1_1 ),
inference(forward_demodulation,[],[f6054,f903]) ).
fof(f6062,plain,
( $false
| ~ spl1_1 ),
inference(forward_subsumption_resolution,[],[f6059,f70]) ).
fof(f6063,plain,
~ spl1_1,
inference(avatar_contradiction_clause,[],[f6062]) ).
cnf(s1,plain,
( spl1_1
| spl1_2 ),
inference(sat_conversion,[],[f55]) ).
cnf(s5,plain,
~ spl1_5,
inference(sat_conversion,[],[f1216]) ).
cnf(s6,plain,
( spl1_5
| spl1_6 ),
inference(sat_conversion,[],[f1265]) ).
cnf(s15,plain,
( ~ spl1_2
| ~ spl1_6 ),
inference(sat_conversion,[],[f6053]) ).
cnf(s17,plain,
~ spl1_1,
inference(sat_conversion,[],[f6063]) ).
cnf(s19,plain,
spl1_6,
inference(rat,[],[s6,s5]) ).
cnf(s20,plain,
~ spl1_2,
inference(rat,[],[s15,s19]) ).
cnf(s21,plain,
$false,
inference(rat,[],[s1,s20,s17]) ).
fof(f6064,plain,
$false,
inference(avatar_sat_refutation,[],[s21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE044+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38 % Computer : n004.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 27 13:06:52 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 Running first-order model finding
% 0.12/0.42 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.98/0.60 % (3502239)Will run a generic schedule for satisfiability detection.
% 0.98/0.60 % (3502249)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1598560416:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.98/0.60 % (3502245)% WARNING: option uhcvi not known.
% 0.98/0.60 % (3502247)dis+10_1_sil=32000:sp=arity:random_seed=3439830188:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.98/0.60 % (3502244)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1602073354_2999 on theBenchmark for (2999ds/0Mi)
% 0.98/0.60 % (3502245)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=784430225:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.98/0.60 % (3502246)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3554192783:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.98/0.60 % (3502248)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2781655252:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.98/0.60 % (3502250)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2150874396:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.98/0.60 % TRYING [1]
% 0.98/0.60 % TRYING [2]
% 0.98/0.60 % TRYING [3]
% 0.98/0.60 % TRYING [4]
% 0.98/0.60 % TRYING [5]
% 0.98/0.60 % (3502249)Instruction limit reached!
% 0.98/0.60 % (3502249)------------------------------
% 0.98/0.60 % (3502249)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.60 % (3502249)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.60 % (3502249)CaDiCaL version: 2.1.3
% 0.98/0.60 % (3502249)Termination reason: Instruction limit
% 0.98/0.60 % (3502249)Termination phase: Saturation
% 0.98/0.60 % (3502249)Time elapsed: 0.041 s
% 0.98/0.60 % (3502249)Peak memory usage: 13 MB
% 0.98/0.60 % (3502249)Instructions burned: 131 (million)
% 0.98/0.60 % (3502258)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=285271033:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.98/0.60 % TRYING [1]
% 0.98/0.60 % TRYING [2]
% 0.98/0.60 % TRYING [3]
% 0.98/0.60 % TRYING [4]
% 0.98/0.60 % TRYING [5]
% 0.98/0.60 % (3502247)Instruction limit reached!
% 0.98/0.60 % (3502247)------------------------------
% 0.98/0.60 % (3502247)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.60 % (3502247)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.60 % (3502247)CaDiCaL version: 2.1.3
% 0.98/0.60 % (3502247)Termination reason: Instruction limit
% 0.98/0.60 % (3502247)Termination phase: Saturation
% 0.98/0.60 % (3502247)Time elapsed: 0.064 s
% 0.98/0.60 % (3502247)Peak memory usage: 12 MB
% 0.98/0.60 % (3502247)Instructions burned: 104 (million)
% 0.98/0.60 % (3502248)Instruction limit reached!
% 0.98/0.60 % (3502248)------------------------------
% 0.98/0.60 % (3502248)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.60 % (3502248)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.60 % (3502248)CaDiCaL version: 2.1.3
% 0.98/0.60 % (3502248)Termination reason: Instruction limit
% 0.98/0.60 % (3502248)Termination phase: Saturation
% 0.98/0.60 % (3502248)Time elapsed: 0.074 s
% 0.98/0.60 % (3502248)Peak memory usage: 13 MB
% 0.98/0.60 % (3502248)Instructions burned: 118 (million)
% 0.98/0.60 % TRYING [6]
% 0.98/0.60 % (3502260)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=315142911:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.98/0.60 % (3502261)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=2467100090:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 0.98/0.60 % (3502250)Instruction limit reached!
% 0.98/0.60 % (3502250)------------------------------
% 0.98/0.60 % (3502250)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.60 % (3502250)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.60 % (3502250)CaDiCaL version: 2.1.3
% 0.98/0.60 % (3502250)Termination reason: Instruction limit
% 0.98/0.60 % (3502250)Termination phase: Saturation
% 0.98/0.60 % (3502250)Time elapsed: 0.099 s
% 0.98/0.60 % (3502250)Peak memory usage: 13 MB
% 0.98/0.60 % (3502250)Instructions burned: 159 (million)
% 0.98/0.60 % TRYING [6]
% 0.98/0.60 % (3502264)ott-21_1_sil=16000:fs=off:random_seed=2836701249:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 0.98/0.60 % (3502245) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3502239-3502245"...
% 0.98/0.60 % (3502245)...printing done.
% 0.98/0.60 % (3502245)Refutation found. Thanks to Tanya!
% 0.98/0.60 % SZS status Theorem for theBenchmark
% 0.98/0.60 % SZS output start Proof for theBenchmark
% See solution above
% 0.98/0.60 % (3502245)------------------------------
% 0.98/0.60 % (3502245)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.98/0.60 % (3502245)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.98/0.60 % (3502245)CaDiCaL version: 2.1.3
% 0.98/0.60 % (3502245)Termination reason: Refutation
% 0.98/0.60 % (3502245)Time elapsed: 0.138 s
% 0.98/0.60 % (3502245)Peak memory usage: 14 MB
% 0.98/0.60 % (3502245)Instructions burned: 240 (million)
% 0.98/0.60 % (3502239)Success in time 0.177 s
% 0.98/0.60 % Vampire exiting
%------------------------------------------------------------------------------