Average Error: 0.3 → 0
Time: 679.0ms
Precision: 64
\[d \cdot 10 + d \cdot 20\]
↓
\[30 \cdot d\]
d \cdot 10 + d \cdot 20
↓
30 \cdot d
double f(double d) {
        double r229052 = d;
        double r229053 = 10.0;
        double r229054 = r229052 * r229053;
        double r229055 = 20.0;
        double r229056 = r229052 * r229055;
        double r229057 = r229054 + r229056;
        return r229057;
}
↓
double f(double d) {
        double r229058 = 30.0;
        double r229059 = d;
        double r229060 = r229058 * r229059;
        return r229060;
}

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.1

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

  3. Taylor expanded around 0 0

    \[\leadsto \color{blue}{30 \cdot d}\]

  4. Final simplification0

    \[\leadsto 30 \cdot d\]

Reproduce

herbie shell --seed 2020039 +o rules:numerics
(FPCore (d)
  :name "FastMath test1"
  :precision binary64

  :herbie-target
  (* d 30)

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