Average Error: 0.3 → 0
Time: 337.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 r247977 = d;
        double r247978 = 10.0;
        double r247979 = r247977 * r247978;
        double r247980 = 20.0;
        double r247981 = r247977 * r247980;
        double r247982 = r247979 + r247981;
        return r247982;
}
↓
double f(double d) {
        double r247983 = d;
        double r247984 = 10.0;
        double r247985 = 20.0;
        double r247986 = r247984 + r247985;
        double r247987 = r247983 * r247986;
        return r247987;
}

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

  :herbie-target
  (* d 30)

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