%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KLE143+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n001.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 5.82s 1.41s
% Output : Refutation 5.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 18
% Syntax : Number of formulae : 73 ( 61 unt; 2 def)
% Number of atoms : 87 ( 66 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 30 ( 16 ~; 11 |; 1 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 93 ( 92 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/KLE004+0.ax',additive_associativity) ).
fof(f3,axiom,
! [X0] : addition(X0,zero) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',additive_identity) ).
fof(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/KLE004+0.ax',multiplicative_associativity) ).
fof(f6,axiom,
! [X0] : multiplication(X0,one) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',multiplicative_right_identity) ).
fof(f7,axiom,
! [X0] : multiplication(one,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+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/sandbox/benchmark/Axioms/KLE004+0.ax',distributivity1) ).
fof(f9,axiom,
! [X0,X1,X2] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',distributivity2) ).
fof(f10,axiom,
! [X0] : multiplication(zero,X0) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',left_annihilation) ).
fof(f12,axiom,
! [X0] : addition(one,multiplication(star(X0),X0)) = star(X0),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',star_unfold2) ).
fof(f13,axiom,
! [X0,X1,X2] :
( leq(addition(multiplication(X0,X2),X1),X2)
=> leq(multiplication(star(X0),X1),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',star_induction1) ).
fof(f15,axiom,
! [X0] : strong_iteration(X0) = addition(multiplication(X0,strong_iteration(X0)),one),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',infty_unfold1) ).
fof(f17,axiom,
! [X0] : strong_iteration(X0) = addition(star(X0),multiplication(strong_iteration(X0),zero)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',isolation) ).
fof(f18,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> addition(X0,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',order) ).
fof(f19,conjecture,
! [X0] : multiplication(strong_iteration(X0),strong_iteration(X0)) = strong_iteration(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f20,negated_conjecture,
~ ! [X0] : multiplication(strong_iteration(X0),strong_iteration(X0)) = strong_iteration(X0),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f21,plain,
! [X0,X1,X2] :
( leq(multiplication(star(X0),X1),X2)
| ~ leq(addition(multiplication(X0,X2),X1),X2) ),
inference(ennf_transformation,[],[f13]) ).
fof(f24,plain,
? [X0] : strong_iteration(X0) != multiplication(strong_iteration(X0),strong_iteration(X0)),
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(sK0) != multiplication(strong_iteration(sK0),strong_iteration(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(f29,plain,
! [X0] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f3]) ).
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(f34,plain,
! [X2,X0,X1] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
inference(cnf_transformation,[],[f8]) ).
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(f39,plain,
! [X2,X0,X1] :
( ~ leq(addition(multiplication(X0,X2),X1),X2)
| leq(multiplication(star(X0),X1),X2) ),
inference(cnf_transformation,[],[f21]) ).
fof(f41,plain,
! [X0] : strong_iteration(X0) = addition(multiplication(X0,strong_iteration(X0)),one),
inference(cnf_transformation,[],[f15]) ).
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(sK0) != multiplication(strong_iteration(sK0),strong_iteration(sK0)),
inference(cnf_transformation,[],[f26]) ).
fof(f47,definition,
sF1 = strong_iteration(sK0),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f48,plain,
strong_iteration(sK0) = sF1,
inference(reorient_equations,[],[f47]) ).
fof(f49,definition,
sF2 = multiplication(sF1,sF1),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f50,plain,
multiplication(sF1,sF1) = sF2,
inference(reorient_equations,[],[f49]) ).
fof(f51,plain,
sF1 != sF2,
inference(definition_folding,[],[f46,f50,f48,f48,f48]) ).
fof(f79,plain,
sF1 = addition(multiplication(sK0,sF1),one),
inference(superposition,[],[f41,f48]) ).
fof(f89,plain,
sF1 = addition(one,multiplication(sK0,sF1)),
inference(forward_demodulation,[],[f79,f27]) ).
fof(f94,plain,
sF1 = addition(star(sK0),multiplication(sF1,zero)),
inference(superposition,[],[f43,f48]) ).
fof(f103,plain,
! [X0,X1] : addition(X0,X1) = addition(X0,addition(X0,X1)),
inference(superposition,[],[f28,f30]) ).
fof(f130,plain,
! [X0] : multiplication(sF1,multiplication(sF1,X0)) = multiplication(sF2,X0),
inference(superposition,[],[f31,f50]) ).
fof(f140,plain,
! [X0,X1] : multiplication(X1,X0) = addition(multiplication(X1,X0),multiplication(X1,zero)),
inference(superposition,[],[f34,f29]) ).
fof(f196,plain,
! [X0,X1] : multiplication(star(X0),X1) = addition(multiplication(one,X1),multiplication(multiplication(star(X0),X0),X1)),
inference(superposition,[],[f35,f38]) ).
fof(f216,plain,
! [X0,X1] : multiplication(star(X0),X1) = addition(multiplication(one,X1),multiplication(star(X0),multiplication(X0,X1))),
inference(forward_demodulation,[],[f196,f31]) ).
fof(f226,plain,
! [X0,X1] : multiplication(star(X0),X1) = addition(X1,multiplication(star(X0),multiplication(X0,X1))),
inference(forward_demodulation,[],[f216,f33]) ).
fof(f251,plain,
! [X0,X1] :
( leq(multiplication(star(X0),multiplication(X0,X1)),X1)
| ~ leq(multiplication(X0,X1),X1) ),
inference(superposition,[],[f39,f30]) ).
fof(f382,plain,
! [X0] : multiplication(sF1,X0) = addition(multiplication(star(sK0),X0),multiplication(multiplication(sF1,zero),X0)),
inference(superposition,[],[f35,f94]) ).
fof(f394,plain,
! [X0] : multiplication(sF1,X0) = addition(multiplication(star(sK0),X0),multiplication(sF1,multiplication(zero,X0))),
inference(forward_demodulation,[],[f382,f31]) ).
fof(f395,plain,
! [X0] : multiplication(sF1,X0) = addition(multiplication(star(sK0),X0),multiplication(sF1,zero)),
inference(forward_demodulation,[],[f394,f36]) ).
fof(f433,plain,
! [X0,X1] :
( addition(X0,X1) != addition(X0,X1)
| leq(X0,addition(X0,X1)) ),
inference(superposition,[],[f45,f103]) ).
fof(f439,plain,
! [X0,X1] : leq(X0,addition(X0,X1)),
inference(trivial_inequality_removal,[],[f433]) ).
fof(f461,plain,
sF2 = multiplication(sF1,multiplication(sF1,one)),
inference(superposition,[],[f32,f130]) ).
fof(f468,plain,
sF2 = addition(multiplication(star(sK0),multiplication(sF1,one)),multiplication(sF1,zero)),
inference(forward_demodulation,[],[f461,f395]) ).
fof(f479,plain,
sF2 = addition(multiplication(sF1,zero),multiplication(star(sK0),multiplication(sF1,one))),
inference(forward_demodulation,[],[f468,f27]) ).
fof(f490,plain,
sF2 = addition(multiplication(sF1,zero),multiplication(star(sK0),sF1)),
inference(forward_demodulation,[],[f479,f32]) ).
fof(f498,plain,
sF2 = addition(multiplication(star(sK0),sF1),multiplication(sF1,zero)),
inference(forward_demodulation,[],[f490,f27]) ).
fof(f950,plain,
! [X0,X1] : leq(X1,addition(X0,X1)),
inference(superposition,[],[f439,f27]) ).
fof(f970,plain,
! [X0] : addition(X0,multiplication(X0,zero)) = X0,
inference(superposition,[],[f140,f32]) ).
fof(f1312,plain,
leq(multiplication(sK0,sF1),sF1),
inference(superposition,[],[f950,f89]) ).
fof(f3004,plain,
! [X0,X1] :
( ~ leq(multiplication(X0,X1),X1)
| addition(multiplication(star(X0),multiplication(X0,X1)),X1) = X1 ),
inference(resolution,[],[f251,f44]) ).
fof(f3026,plain,
! [X0,X1] :
( addition(X1,multiplication(star(X0),multiplication(X0,X1))) = X1
| ~ leq(multiplication(X0,X1),X1) ),
inference(forward_demodulation,[],[f3004,f27]) ).
fof(f3029,plain,
! [X0,X1] :
( ~ leq(multiplication(X0,X1),X1)
| multiplication(star(X0),X1) = X1 ),
inference(forward_demodulation,[],[f3026,f226]) ).
fof(f21261,plain,
sF1 = multiplication(star(sK0),sF1),
inference(resolution,[],[f3029,f1312]) ).
fof(f21323,plain,
sF2 = addition(sF1,multiplication(sF1,zero)),
inference(superposition,[],[f498,f21261]) ).
fof(f21382,plain,
sF1 = sF2,
inference(forward_demodulation,[],[f21323,f970]) ).
fof(f21394,plain,
$false,
inference(forward_subsumption_resolution,[],[f21382,f51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : KLE143+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.09 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.18/0.46 % Computer : n001.cluster.edu
% 0.18/0.46 % Model : x86_64 x86_64
% 0.18/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.46 % Memory : 8046.5625MB
% 0.18/0.46 % OS : Linux 6.8.0-71-generic
% 0.18/0.46 % CPULimit : 300
% 0.18/0.46 % WCLimit : 300
% 0.18/0.46 % DateTime : Sun Sep 27 13:17:45 UTC 2026
% 0.18/0.47 % CPUTime :
% 0.18/0.47 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.24/0.52 Running first-order model finding
% 0.24/0.52 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.82/1.41 % (3564452)Will run a generic schedule for satisfiability detection.
% 5.82/1.41 % (3564461)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1233956513:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 5.82/1.41 % (3564462)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2056835590:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 5.82/1.41 % (3564457)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3125224417_2999 on theBenchmark for (2999ds/0Mi)
% 5.82/1.41 % (3564460)dis+10_1_sil=32000:sp=arity:random_seed=2246155085:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 5.82/1.41 % (3564459)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2837742391:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 5.82/1.41 % (3564463)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3965569799:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 5.82/1.41 % TRYING [1]
% 5.82/1.41 % TRYING [2]
% 5.82/1.41 % TRYING [3]
% 5.82/1.41 % (3564458)% WARNING: option uhcvi not known.
% 5.82/1.41 % (3564458)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1838958138:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 5.82/1.41 % TRYING [4]
% 5.82/1.41 % (3564461)Instruction limit reached!
% 5.82/1.41 % (3564461)------------------------------
% 5.82/1.41 % (3564461)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.82/1.41 % (3564461)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.82/1.41 % (3564461)CaDiCaL version: 2.1.3
% 5.82/1.41 % (3564461)Termination reason: Instruction limit
% 5.82/1.41 % (3564461)Termination phase: Saturation
% 5.82/1.41 % (3564461)Time elapsed: 0.059 s
% 5.82/1.41 % (3564461)Peak memory usage: 13 MB
% 5.82/1.41 % (3564461)Instructions burned: 117 (million)
% 5.82/1.41 % TRYING [5]
% 5.82/1.41 % (3564471)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3415819050:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 5.82/1.41 % TRYING [1]
% 5.82/1.41 % TRYING [2]
% 5.82/1.41 % TRYING [3]
% 5.82/1.41 % (3564460)Instruction limit reached!
% 5.82/1.41 % (3564460)------------------------------
% 5.82/1.41 % (3564460)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.82/1.41 % (3564460)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.82/1.41 % (3564460)CaDiCaL version: 2.1.3
% 5.82/1.41 % (3564460)Termination reason: Instruction limit
% 5.82/1.41 % (3564460)Termination phase: Saturation
% 5.82/1.41 % (3564460)Time elapsed: 0.102 s
% 5.82/1.41 % (3564460)Peak memory usage: 12 MB
% 5.82/1.41 % (3564460)Instructions burned: 104 (million)
% 5.82/1.41 % TRYING [4]
% 5.82/1.41 % TRYING [5]
% 5.82/1.41 % (3564462)Instruction limit reached!
% 5.82/1.41 % (3564462)------------------------------
% 5.82/1.41 % (3564462)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.82/1.41 % (3564462)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.82/1.41 % (3564462)CaDiCaL version: 2.1.3
% 5.82/1.41 % (3564462)Termination reason: Instruction limit
% 5.82/1.41 % (3564462)Termination phase: Saturation
% 5.82/1.41 % (3564462)Time elapsed: 0.135 s
% 5.82/1.41 % (3564462)Peak memory usage: 13 MB
% 5.82/1.41 % (3564462)Instructions burned: 131 (million)
% 5.82/1.41 % (3564473)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1820588084:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 5.82/1.41 % TRYING [6]
% 5.82/1.41 % (3564463)Instruction limit reached!
% 5.82/1.41 % (3564463)------------------------------
% 5.82/1.41 % (3564463)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.82/1.41 % (3564463)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.82/1.41 % (3564463)CaDiCaL version: 2.1.3
% 5.82/1.41 % (3564463)Termination reason: Instruction limit
% 5.82/1.41 % (3564463)Termination phase: Saturation
% 5.82/1.41 % (3564463)Time elapsed: 0.171 s
% 5.82/1.41 % (3564463)Peak memory usage: 13 MB
% 5.82/1.41 % (3564463)Instructions burned: 159 (million)
% 5.82/1.41 % (3564474)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=972641263:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 5.82/1.41 % TRYING [6]
% 5.82/1.41 % (3564476)ott-21_1_sil=16000:fs=off:random_seed=1910012756:i=180:av=off:fsr=off_2997 on theBenchmark for (2997ds/180Mi)
% 5.82/1.41 % (3564473)Instruction limit reached!
% 5.82/1.41 % (3564473)------------------------------
% 5.82/1.41 % (3564473)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.82/1.41 % (3564473)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.82/1.41 % (3564473)CaDiCaL version: 2.1.3
% 5.82/1.41 % (3564473)Termination reason: Instruction limit
% 5.82/1.41 % (3564473)Termination phase: Saturation
% 5.82/1.41 % (3564473)Time elapsed: 0.139 s
% 5.82/1.41 % (3564473)Peak memory usage: 13 MB
% 5.82/1.41 % (3564473)Instructions burned: 131 (million)
% 5.82/1.41 % (3564479)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=605630929:i=477:bd=all_2996 on theBenchmark for (2996ds/477Mi)
% 5.82/1.41 % TRYING [7]
% 5.82/1.41 % (3564476)Instruction limit reached!
% 5.82/1.41 % (3564476)------------------------------
% 5.82/1.41 % (3564476)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.82/1.41 % (3564476)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.82/1.41 % (3564476)CaDiCaL version: 2.1.3
% 5.82/1.41 % (3564476)Termination reason: Instruction limit
% 5.82/1.41 % (3564476)Termination phase: Saturation
% 5.82/1.41 % (3564476)Time elapsed: 0.137 s
% 5.82/1.41 % (3564476)Peak memory usage: 12 MB
% 5.82/1.41 % (3564476)Instructions burned: 181 (million)
% 5.82/1.41 % (3564471)Instruction limit reached!
% 5.82/1.41 % (3564471)------------------------------
% 5.82/1.41 % (3564471)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.82/1.41 % (3564471)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.82/1.41 % (3564471)CaDiCaL version: 2.1.3
% 5.82/1.41 % (3564471)Termination reason: Instruction limit
% 5.82/1.41 % (3564471)Termination phase: Finite model building constraint generation
% 5.82/1.41 % (3564471)Time elapsed: 0.276 s
% 5.82/1.41 % (3564471)Peak memory usage: 32 MB
% 5.82/1.41 % (3564471)Instructions burned: 715 (million)
% 5.82/1.41 % (3564482)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=405551496:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 5.82/1.41 % (3564481)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2981984652:fmbsr=1.3:i=865:ins=25_2995 on theBenchmark for (2995ds/865Mi)
% 5.82/1.41 % TRYING [1]
% 5.82/1.41 % TRYING [2]
% 5.82/1.41 % TRYING [3]
% 5.82/1.41 % TRYING [7]
% 5.82/1.41 % TRYING [4]
% 5.82/1.41 % TRYING [5]
% 5.82/1.41 % TRYING [6]
% 5.82/1.41 % (3564479)Instruction limit reached!
% 5.82/1.41 % (3564479)------------------------------
% 5.82/1.41 % (3564479)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.82/1.41 % (3564479)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.82/1.41 % (3564479)CaDiCaL version: 2.1.3
% 5.82/1.41 % (3564479)Termination reason: Instruction limit
% 5.82/1.41 % (3564479)Termination phase: Saturation
% 5.82/1.41 % (3564479)Time elapsed: 0.480 s
% 5.82/1.41 % (3564479)Peak memory usage: 14 MB
% 5.82/1.41 % (3564479)Instructions burned: 478 (million)
% 5.82/1.41 % (3564482) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3564452-3564482"...
% 5.82/1.41 % (3564482)...printing done.
% 5.82/1.41 % (3564482)Refutation found. Thanks to Tanya!
% 5.82/1.41 % SZS status Theorem for theBenchmark
% 5.82/1.41 % SZS output start Proof for theBenchmark
% See solution above
% 5.82/1.41 % (3564482)------------------------------
% 5.82/1.41 % (3564482)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.82/1.41 % (3564482)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.82/1.41 % (3564482)CaDiCaL version: 2.1.3
% 5.82/1.41 % (3564482)Termination reason: Refutation
% 5.82/1.41 % (3564482)Time elapsed: 0.423 s
% 5.82/1.41 % (3564482)Peak memory usage: 20 MB
% 5.82/1.41 % (3564482)Instructions burned: 855 (million)
% 5.82/1.41 % (3564452)Success in time 0.877 s
% 5.82/1.41 % Vampire exiting
%------------------------------------------------------------------------------