Average Error: 0.3 → 0
Time: 672.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 r151889 = d;
        double r151890 = 10.0;
        double r151891 = r151889 * r151890;
        double r151892 = 20.0;
        double r151893 = r151889 * r151892;
        double r151894 = r151891 + r151893;
        return r151894;
}
↓
double f(double d) {
        double r151895 = d;
        double r151896 = 10.0;
        double r151897 = 20.0;
        double r151898 = r151896 + r151897;
        double r151899 = r151895 * r151898;
        return r151899;
}

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

  :herbie-target
  (* d 30)

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