Average Error: 0.4 → 0.3
Time: 3.0s
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\]
↓
\[\left(\left(e + d\right) + \left(c + b\right)\right) + a\]
\left(\left(\left(e + d\right) + c\right) + b\right) + a
↓
\left(\left(e + d\right) + \left(c + b\right)\right) + a
double f(double a, double b, double c, double d, double e) {
        double r130500 = e;
        double r130501 = d;
        double r130502 = r130500 + r130501;
        double r130503 = c;
        double r130504 = r130502 + r130503;
        double r130505 = b;
        double r130506 = r130504 + r130505;
        double r130507 = a;
        double r130508 = r130506 + r130507;
        return r130508;
}
↓
double f(double a, double b, double c, double d, double e) {
        double r130509 = e;
        double r130510 = d;
        double r130511 = r130509 + r130510;
        double r130512 = c;
        double r130513 = b;
        double r130514 = r130512 + r130513;
        double r130515 = r130511 + r130514;
        double r130516 = a;
        double r130517 = r130515 + r130516;
        return r130517;
}

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

  3. Applied associate-+l+0.3

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

  4. Final simplification0.3

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

Reproduce

herbie shell --seed 2020047 
(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))