Average Error: 0.4 → 0.2
Time: 2.3s
Precision: 64
\[1 \le a \le 2 \le b \le 4 \le c \le 8 \le d \le 16 \le e \le 32\]
\[\left(\left(\left(e + d\right) + c\right) + b\right) + a\]
↓
\[e + \left(\left(d + a\right) + \left(b + c\right)\right)\]
\left(\left(\left(e + d\right) + c\right) + b\right) + a
↓
e + \left(\left(d + a\right) + \left(b + c\right)\right)
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 (e + ((d + a) + (b + c)));
}

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.2
\[\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. Using strategy rm

  3. Applied associate-+l+0.3

    \[\leadsto \color{blue}{\left(\left(e + d\right) + c\right) + \left(b + a\right)}\]
  4. Using strategy rm

  5. Applied associate-+l+0.3

    \[\leadsto \color{blue}{\left(e + d\right) + \left(c + \left(b + a\right)\right)}\]

  6. Simplified0.3

    \[\leadsto \left(e + d\right) + \color{blue}{\left(a + \left(b + c\right)\right)}\]
  7. Using strategy rm

  8. Applied associate-+l+0.2

    \[\leadsto \color{blue}{e + \left(d + \left(a + \left(b + c\right)\right)\right)}\]
  9. Using strategy rm

  10. Applied associate-+r+0.2

    \[\leadsto e + \color{blue}{\left(\left(d + a\right) + \left(b + c\right)\right)}\]

  11. Final simplification0.2

    \[\leadsto e + \left(\left(d + a\right) + \left(b + c\right)\right)\]

Reproduce

herbie shell --seed 2020106 +o rules:numerics
(FPCore (a b c d e)
  :name "Expression 1, p15"
  :precision binary64
  :pre (<= 1 a 2 b 4 c 8 d 16 e 32)

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

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