Average Error: 0.3 → 0
Time: 340.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 r236897 = d;
        double r236898 = 10.0;
        double r236899 = r236897 * r236898;
        double r236900 = 20.0;
        double r236901 = r236897 * r236900;
        double r236902 = r236899 + r236901;
        return r236902;
}
↓
double f(double d) {
        double r236903 = d;
        double r236904 = 10.0;
        double r236905 = 20.0;
        double r236906 = r236904 + r236905;
        double r236907 = r236903 * r236906;
        return r236907;
}

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

  :herbie-target
  (* d 30)

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