Average Error: 0.3 → 0
Time: 323.0ms
Precision: 64
\[d \cdot 10 + d \cdot 20\]
↓
\[d \cdot \left(10 + 20\right)\]
d \cdot 10 + d \cdot 20
↓
d \cdot \left(10 + 20\right)
double f(double d) {
        double r236363 = d;
        double r236364 = 10.0;
        double r236365 = r236363 * r236364;
        double r236366 = 20.0;
        double r236367 = r236363 * r236366;
        double r236368 = r236365 + r236367;
        return r236368;
}
↓
double f(double d) {
        double r236369 = d;
        double r236370 = 10.0;
        double r236371 = 20.0;
        double r236372 = r236370 + r236371;
        double r236373 = r236369 * r236372;
        return r236373;
}

Error

Bits error versus d

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0.3
Target0
Herbie0
\[d \cdot 30\]

Derivation

  1. Initial program 0.3

    \[d \cdot 10 + d \cdot 20\]

  2. Simplified0

    \[\leadsto \color{blue}{d \cdot \left(10 + 20\right)}\]

  3. Final simplification0

    \[\leadsto d \cdot \left(10 + 20\right)\]

Reproduce

herbie shell --seed 2020003 
(FPCore (d)
  :name "FastMath test1"
  :precision binary64

  :herbie-target
  (* d 30)

  (+ (* d 10) (* d 20)))