Average Error: 0.3 → 0
Time: 537.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 r211898 = d;
        double r211899 = 10.0;
        double r211900 = r211898 * r211899;
        double r211901 = 20.0;
        double r211902 = r211898 * r211901;
        double r211903 = r211900 + r211902;
        return r211903;
}
↓
double f(double d) {
        double r211904 = 30.0;
        double r211905 = d;
        double r211906 = r211904 * r211905;
        return r211906;
}

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 2020034 +o rules:numerics
(FPCore (d)
  :name "FastMath test1"
  :precision binary64

  :herbie-target
  (* d 30)

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