%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KLE144+1 : 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 : 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 11:40:58 AM UTC 2026
% Result : Theorem 1.90s 0.80s
% Output : Refutation 2.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 17
% Syntax : Number of formulae : 70 ( 57 unt; 3 def)
% Number of atoms : 85 ( 51 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 32 ( 17 ~; 12 |; 1 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 97 ( 96 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+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/KLE004+0.ax',additive_associativity) ).
fof(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',idempotence) ).
fof(f5,axiom,
! [X0,X1,X2] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',multiplicative_associativity) ).
fof(f6,axiom,
! [X0] : multiplication(X0,one) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',multiplicative_right_identity) ).
fof(f7,axiom,
! [X0] : multiplication(one,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',multiplicative_left_identity) ).
fof(f9,axiom,
! [X0,X1,X2] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',distributivity2) ).
fof(f10,axiom,
! [X0] : multiplication(zero,X0) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',left_annihilation) ).
fof(f12,axiom,
! [X0] : addition(one,multiplication(star(X0),X0)) = star(X0),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',star_unfold2) ).
fof(f15,axiom,
! [X0] : strong_iteration(X0) = addition(multiplication(X0,strong_iteration(X0)),one),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',infty_unfold1) ).
fof(f16,axiom,
! [X0,X1,X2] :
( leq(X2,addition(multiplication(X0,X2),X1))
=> leq(X2,multiplication(strong_iteration(X0),X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',infty_coinduction) ).
fof(f17,axiom,
! [X0] : strong_iteration(X0) = addition(star(X0),multiplication(strong_iteration(X0),zero)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',isolation) ).
fof(f18,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> addition(X0,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',order) ).
fof(f19,conjecture,
! [X0] : strong_iteration(star(X0)) = strong_iteration(one),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f20,negated_conjecture,
~ ! [X0] : strong_iteration(star(X0)) = strong_iteration(one),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f23,plain,
! [X0,X1,X2] :
( leq(X2,multiplication(strong_iteration(X0),X1))
| ~ leq(X2,addition(multiplication(X0,X2),X1)) ),
inference(ennf_transformation,[],[f16]) ).
fof(f24,plain,
? [X0] : strong_iteration(star(X0)) != strong_iteration(one),
inference(ennf_transformation,[],[f20]) ).
fof(f25,plain,
! [X0,X1] :
( ( leq(X0,X1)
| addition(X0,X1) != X1 )
& ( addition(X0,X1) = X1
| ~ leq(X0,X1) ) ),
inference(nnf_transformation,[],[f18]) ).
fof(f26,plain,
strong_iteration(one) != strong_iteration(star(sK0)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f24]) ).
fof(f27,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f28,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f2]) ).
fof(f30,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f31,plain,
! [X2,X0,X1] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
inference(cnf_transformation,[],[f5]) ).
fof(f32,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f33,plain,
! [X0] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f7]) ).
fof(f35,plain,
! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f36,plain,
! [X0] : zero = multiplication(zero,X0),
inference(cnf_transformation,[],[f10]) ).
fof(f38,plain,
! [X0] : star(X0) = addition(one,multiplication(star(X0),X0)),
inference(cnf_transformation,[],[f12]) ).
fof(f41,plain,
! [X0] : strong_iteration(X0) = addition(multiplication(X0,strong_iteration(X0)),one),
inference(cnf_transformation,[],[f15]) ).
fof(f42,plain,
! [X2,X0,X1] :
( ~ leq(X2,addition(multiplication(X0,X2),X1))
| leq(X2,multiplication(strong_iteration(X0),X1)) ),
inference(cnf_transformation,[],[f23]) ).
fof(f43,plain,
! [X0] : strong_iteration(X0) = addition(star(X0),multiplication(strong_iteration(X0),zero)),
inference(cnf_transformation,[],[f17]) ).
fof(f44,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| addition(X0,X1) = X1 ),
inference(cnf_transformation,[],[f25]) ).
fof(f45,plain,
! [X0,X1] :
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f46,plain,
strong_iteration(one) != strong_iteration(star(sK0)),
inference(cnf_transformation,[],[f26]) ).
fof(f47,definition,
sF1 = strong_iteration(one),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f48,plain,
strong_iteration(one) = sF1,
inference(reorient_equations,[],[f47]) ).
fof(f49,definition,
sF2 = star(sK0),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f50,plain,
star(sK0) = sF2,
inference(reorient_equations,[],[f49]) ).
fof(f51,definition,
sF3 = strong_iteration(sF2),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f52,plain,
strong_iteration(sF2) = sF3,
inference(reorient_equations,[],[f51]) ).
fof(f53,plain,
sF1 != sF3,
inference(definition_folding,[],[f46,f52,f50,f48]) ).
fof(f75,plain,
sF2 = addition(one,multiplication(sF2,sK0)),
inference(superposition,[],[f38,f50]) ).
fof(f116,plain,
! [X0,X1] : addition(X0,X1) = addition(X0,addition(X0,X1)),
inference(superposition,[],[f28,f30]) ).
fof(f206,plain,
! [X0,X1] : multiplication(strong_iteration(X0),X1) = addition(multiplication(star(X0),X1),multiplication(multiplication(strong_iteration(X0),zero),X1)),
inference(superposition,[],[f35,f43]) ).
fof(f220,plain,
! [X0,X1] : multiplication(strong_iteration(X0),X1) = addition(multiplication(star(X0),X1),multiplication(strong_iteration(X0),multiplication(zero,X1))),
inference(forward_demodulation,[],[f206,f31]) ).
fof(f231,plain,
! [X0,X1] : multiplication(strong_iteration(X0),X1) = addition(multiplication(star(X0),X1),multiplication(strong_iteration(X0),zero)),
inference(forward_demodulation,[],[f220,f36]) ).
fof(f310,plain,
! [X2,X3,X0,X1] :
( ~ leq(X1,addition(addition(multiplication(X0,X1),multiplication(X2,X1)),X3))
| leq(X1,multiplication(strong_iteration(addition(X0,X2)),X3)) ),
inference(superposition,[],[f42,f35]) ).
fof(f313,plain,
! [X0,X1] :
( ~ leq(X0,addition(X0,X1))
| leq(X0,multiplication(strong_iteration(one),X1)) ),
inference(superposition,[],[f42,f33]) ).
fof(f321,plain,
! [X0,X1] :
( ~ leq(X0,addition(X0,X1))
| leq(X0,multiplication(sF1,X1)) ),
inference(forward_demodulation,[],[f313,f48]) ).
fof(f323,plain,
! [X2,X3,X0,X1] :
( ~ leq(X1,addition(multiplication(X0,X1),addition(multiplication(X2,X1),X3)))
| leq(X1,multiplication(strong_iteration(addition(X0,X2)),X3)) ),
inference(forward_demodulation,[],[f310,f28]) ).
fof(f570,plain,
sF2 = addition(one,sF2),
inference(superposition,[],[f116,f75]) ).
fof(f580,plain,
! [X0,X1] :
( addition(X0,X1) != addition(X0,X1)
| leq(X0,addition(X0,X1)) ),
inference(superposition,[],[f45,f116]) ).
fof(f586,plain,
! [X0,X1] : leq(X0,addition(X0,X1)),
inference(trivial_inequality_removal,[],[f580]) ).
fof(f595,plain,
sF2 = addition(sF2,one),
inference(forward_demodulation,[],[f570,f27]) ).
fof(f1640,plain,
! [X0,X1] : leq(X0,multiplication(sF1,X1)),
inference(resolution,[],[f586,f321]) ).
fof(f1644,plain,
! [X0,X1] : leq(X1,addition(X0,X1)),
inference(superposition,[],[f586,f27]) ).
fof(f3161,plain,
! [X0] : leq(X0,sF1),
inference(superposition,[],[f1640,f32]) ).
fof(f3337,plain,
! [X0] : sF1 = addition(X0,sF1),
inference(resolution,[],[f3161,f44]) ).
fof(f4267,plain,
! [X0] : sF1 = addition(sF1,X0),
inference(superposition,[],[f27,f3337]) ).
fof(f4501,plain,
! [X0,X1] :
( ~ leq(strong_iteration(X0),addition(multiplication(X1,strong_iteration(X0)),strong_iteration(X0)))
| leq(strong_iteration(X0),multiplication(strong_iteration(addition(X1,X0)),one)) ),
inference(superposition,[],[f323,f41]) ).
fof(f4541,plain,
! [X0,X1] : leq(strong_iteration(X0),multiplication(strong_iteration(addition(X1,X0)),one)),
inference(forward_subsumption_resolution,[],[f4501,f1644]) ).
fof(f4574,plain,
! [X0,X1] : leq(strong_iteration(X0),addition(multiplication(star(addition(X1,X0)),one),multiplication(strong_iteration(addition(X1,X0)),zero))),
inference(forward_demodulation,[],[f4541,f231]) ).
fof(f4594,plain,
! [X0,X1] : leq(strong_iteration(X0),addition(star(addition(X1,X0)),multiplication(strong_iteration(addition(X1,X0)),zero))),
inference(forward_demodulation,[],[f4574,f32]) ).
fof(f4604,plain,
! [X0,X1] : leq(strong_iteration(X0),strong_iteration(addition(X1,X0))),
inference(forward_demodulation,[],[f4594,f43]) ).
fof(f8756,plain,
leq(strong_iteration(one),strong_iteration(sF2)),
inference(superposition,[],[f4604,f595]) ).
fof(f8760,plain,
leq(strong_iteration(one),sF3),
inference(forward_demodulation,[],[f8756,f52]) ).
fof(f8780,plain,
leq(sF1,sF3),
inference(forward_demodulation,[],[f8760,f48]) ).
fof(f8782,plain,
sF3 = addition(sF1,sF3),
inference(resolution,[],[f8780,f44]) ).
fof(f8783,plain,
sF1 = sF3,
inference(forward_demodulation,[],[f8782,f4267]) ).
fof(f8784,plain,
$false,
inference(forward_subsumption_resolution,[],[f8783,f53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE144+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.36 % Computer : n018.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8046.5625MB
% 0.12/0.36 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Sun Sep 27 13:14:39 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.40 Running first-order model finding
% 0.12/0.40 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
% 1.90/0.80 % (2342340)Will run a generic schedule for satisfiability detection.
% 1.90/0.80 % (2342349)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3246201675:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.90/0.80 % (2342346)% WARNING: option uhcvi not known.
% 1.90/0.80 % (2342345)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=996632666_2999 on theBenchmark for (2999ds/0Mi)
% 1.90/0.80 % (2342351)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1426006930:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.90/0.80 % (2342350)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1420635047:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.90/0.80 % (2342347)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4264996157:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.90/0.80 % (2342348)dis+10_1_sil=32000:sp=arity:random_seed=2969443449:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.90/0.80 % (2342346)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3799699948:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.90/0.80 % TRYING [1]
% 1.90/0.80 % TRYING [2]
% 1.90/0.80 % TRYING [3]
% 1.90/0.80 % TRYING [4]
% 1.90/0.80 % TRYING [5]
% 1.90/0.80 % (2342349)Instruction limit reached!
% 1.90/0.80 % (2342349)------------------------------
% 1.90/0.80 % (2342349)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.90/0.80 % (2342349)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.90/0.80 % (2342349)CaDiCaL version: 2.1.3
% 1.90/0.80 % (2342349)Termination reason: Instruction limit
% 1.90/0.80 % (2342349)Termination phase: Saturation
% 1.90/0.80 % (2342349)Time elapsed: 0.041 s
% 1.90/0.80 % (2342349)Peak memory usage: 13 MB
% 1.90/0.80 % (2342349)Instructions burned: 116 (million)
% 1.90/0.80 % (2342359)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=568089573:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.90/0.80 % TRYING [1]
% 1.90/0.80 % TRYING [2]
% 1.90/0.80 % TRYING [3]
% 1.90/0.80 % TRYING [4]
% 1.90/0.80 % TRYING [5]
% 1.90/0.80 % (2342348)Instruction limit reached!
% 1.90/0.80 % (2342348)------------------------------
% 1.90/0.80 % (2342348)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.90/0.80 % (2342348)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.90/0.80 % (2342348)CaDiCaL version: 2.1.3
% 1.90/0.80 % (2342348)Termination reason: Instruction limit
% 1.90/0.80 % (2342348)Termination phase: Saturation
% 1.90/0.80 % (2342348)Time elapsed: 0.063 s
% 1.90/0.80 % (2342348)Peak memory usage: 12 MB
% 1.90/0.80 % (2342348)Instructions burned: 103 (million)
% 1.90/0.80 % (2342350)Instruction limit reached!
% 1.90/0.80 % (2342350)------------------------------
% 1.90/0.80 % (2342350)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.90/0.80 % (2342350)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.90/0.80 % (2342350)CaDiCaL version: 2.1.3
% 1.90/0.80 % (2342350)Termination reason: Instruction limit
% 1.90/0.80 % (2342350)Termination phase: Saturation
% 1.90/0.80 % (2342350)Time elapsed: 0.082 s
% 1.90/0.80 % (2342350)Peak memory usage: 13 MB
% 1.90/0.80 % (2342350)Instructions burned: 131 (million)
% 1.90/0.80 % (2342361)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3555332737:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 1.90/0.80 % TRYING [6]
% 1.90/0.80 % (2342351)Instruction limit reached!
% 1.90/0.80 % (2342351)------------------------------
% 1.90/0.80 % (2342351)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.90/0.80 % (2342351)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.90/0.80 % (2342351)CaDiCaL version: 2.1.3
% 1.90/0.80 % (2342351)Termination reason: Instruction limit
% 1.90/0.80 % (2342351)Termination phase: Saturation
% 1.90/0.80 % (2342351)Time elapsed: 0.104 s
% 1.90/0.80 % (2342351)Peak memory usage: 13 MB
% 1.90/0.80 % (2342351)Instructions burned: 159 (million)
% 1.90/0.80 % (2342363)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=384704051:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.90/0.80 % TRYING [6]
% 1.90/0.80 % (2342365)ott-21_1_sil=16000:fs=off:random_seed=339348962:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.90/0.80 % (2342361)Instruction limit reached!
% 1.90/0.80 % (2342361)------------------------------
% 1.90/0.80 % (2342361)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.90/0.80 % (2342361)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.90/0.80 % (2342361)CaDiCaL version: 2.1.3
% 1.90/0.80 % (2342361)Termination reason: Instruction limit
% 1.90/0.80 % (2342361)Termination phase: Saturation
% 1.90/0.80 % (2342361)Time elapsed: 0.090 s
% 1.90/0.80 % (2342361)Peak memory usage: 13 MB
% 1.90/0.80 % (2342361)Instructions burned: 132 (million)
% 1.90/0.80 % (2342367)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3137027700:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 1.90/0.80 % (2342365)Instruction limit reached!
% 1.90/0.80 % (2342365)------------------------------
% 1.90/0.80 % (2342365)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.90/0.80 % (2342365)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.90/0.80 % (2342365)CaDiCaL version: 2.1.3
% 1.90/0.80 % (2342365)Termination reason: Instruction limit
% 1.90/0.80 % (2342365)Termination phase: Saturation
% 1.90/0.80 % (2342365)Time elapsed: 0.074 s
% 1.90/0.80 % (2342365)Peak memory usage: 12 MB
% 1.90/0.80 % (2342365)Instructions burned: 180 (million)
% 1.90/0.80 % (2342369)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=4055579761:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 1.90/0.80 % (2342359)Instruction limit reached!
% 1.90/0.80 % (2342359)------------------------------
% 1.90/0.80 % (2342359)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.90/0.80 % (2342359)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.90/0.80 % (2342359)CaDiCaL version: 2.1.3
% 1.90/0.80 % (2342359)Termination reason: Instruction limit
% 1.90/0.80 % (2342359)Termination phase: Finite model building SAT solving
% 1.90/0.80 % (2342359)Time elapsed: 0.174 s
% 1.90/0.80 % (2342359)Peak memory usage: 32 MB
% 1.90/0.80 % (2342359)Instructions burned: 716 (million)
% 1.90/0.80 % TRYING [1]
% 1.90/0.80 % TRYING [2]
% 1.90/0.80 % TRYING [3]
% 1.90/0.80 % (2342371)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=4053322542:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 1.90/0.80 % TRYING [4]
% 1.90/0.80 % TRYING [7]
% 1.90/0.80 % TRYING [5]
% 1.90/0.80 % (2342371) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2342340-2342371"...
% 1.90/0.80 % (2342371)...printing done.
% 1.90/0.80 % (2342371)Refutation found. Thanks to Tanya!
% 1.90/0.80 % SZS status Theorem for theBenchmark
% 1.90/0.80 % SZS output start Proof for theBenchmark
% See solution above
% 2.81/0.80 % (2342371)------------------------------
% 2.81/0.80 % (2342371)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.81/0.80 % (2342371)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.81/0.80 % (2342371)CaDiCaL version: 2.1.3
% 2.81/0.80 % (2342371)Termination reason: Refutation
% 2.81/0.80 % (2342371)Time elapsed: 0.121 s
% 2.81/0.80 % (2342371)Peak memory usage: 16 MB
% 2.81/0.80 % (2342371)Instructions burned: 376 (million)
% 2.81/0.80 % (2342340)Success in time 0.39 s
% 2.81/0.80 % Vampire exiting
%------------------------------------------------------------------------------