Average Error: 0.3 → 0
Time: 300.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 r64705 = d;
        double r64706 = 10.0;
        double r64707 = r64705 * r64706;
        double r64708 = 20.0;
        double r64709 = r64705 * r64708;
        double r64710 = r64707 + r64709;
        return r64710;
}
↓
double f(double d) {
        double r64711 = d;
        double r64712 = 10.0;
        double r64713 = 20.0;
        double r64714 = r64712 + r64713;
        double r64715 = r64711 * r64714;
        return r64715;
}

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 2020045 
(FPCore (d)
  :name "FastMath test1"
  :precision binary64

  :herbie-target
  (* d 30)

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