Average Error: 0.4 → 0.3
Time: 35.1s
Precision: binary64
\[\left(\left(\left(\left(\left(\left(\left(\left(1 \leq a \land a \leq 2\right) \land 2 \leq b\right) \land b \leq 4\right) \land 4 \leq c\right) \land c \leq 8\right) \land 8 \leq d\right) \land d \leq 16\right) \land 16 \leq e\right) \land e \leq 32\]
\[\left(\left(\left(e + d\right) + c\right) + b\right) + a \]
\[\mathsf{log1p}\left(\mathsf{expm1}\left(\left(e + d\right) + \left(c + \left(b + a\right)\right)\right)\right) \]
(FPCore (a b c d e) :precision binary64 (+ (+ (+ (+ e d) c) b) a))
(FPCore (a b c d e)
 :precision binary64
 (log1p (expm1 (+ (+ e d) (+ c (+ b a))))))
double code(double a, double b, double c, double d, double e) {
	return (((e + d) + c) + b) + a;
}
double code(double a, double b, double c, double d, double e) {
	return log1p(expm1(((e + d) + (c + (b + a)))));
}
public static double code(double a, double b, double c, double d, double e) {
	return (((e + d) + c) + b) + a;
}
public static double code(double a, double b, double c, double d, double e) {
	return Math.log1p(Math.expm1(((e + d) + (c + (b + a)))));
}
def code(a, b, c, d, e):
	return (((e + d) + c) + b) + a
def code(a, b, c, d, e):
	return math.log1p(math.expm1(((e + d) + (c + (b + a)))))
function code(a, b, c, d, e)
	return Float64(Float64(Float64(Float64(e + d) + c) + b) + a)
end
function code(a, b, c, d, e)
	return log1p(expm1(Float64(Float64(e + d) + Float64(c + Float64(b + a)))))
end
code[a_, b_, c_, d_, e_] := N[(N[(N[(N[(e + d), $MachinePrecision] + c), $MachinePrecision] + b), $MachinePrecision] + a), $MachinePrecision]
code[a_, b_, c_, d_, e_] := N[Log[1 + N[(Exp[N[(N[(e + d), $MachinePrecision] + N[(c + N[(b + a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]] - 1), $MachinePrecision]], $MachinePrecision]
\left(\left(\left(e + d\right) + c\right) + b\right) + a
\mathsf{log1p}\left(\mathsf{expm1}\left(\left(e + d\right) + \left(c + \left(b + a\right)\right)\right)\right)

Error

Bits error versus a

Bits error versus b

Bits error versus c

Bits error versus d

Bits error versus e

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0.4
Target0.2
Herbie0.3
\[\left(d + \left(c + \left(a + b\right)\right)\right) + e \]

Derivation

  1. Initial program 0.4

    \[\left(\left(\left(e + d\right) + c\right) + b\right) + a \]
  2. Applied egg-rr0.3

    \[\leadsto \color{blue}{\mathsf{log1p}\left(\mathsf{expm1}\left(\left(e + d\right) + \left(c + \left(b + a\right)\right)\right)\right)} \]
  3. Final simplification0.3

    \[\leadsto \mathsf{log1p}\left(\mathsf{expm1}\left(\left(e + d\right) + \left(c + \left(b + a\right)\right)\right)\right) \]

Reproduce

herbie shell --seed 2022150 
(FPCore (a b c d e)
  :name "Expression 1, p15"
  :precision binary64
  :pre (and (and (and (and (and (and (and (and (and (<= 1.0 a) (<= a 2.0)) (<= 2.0 b)) (<= b 4.0)) (<= 4.0 c)) (<= c 8.0)) (<= 8.0 d)) (<= d 16.0)) (<= 16.0 e)) (<= e 32.0))

  :herbie-target
  (+ (+ d (+ c (+ a b))) e)

  (+ (+ (+ (+ e d) c) b) a))