Average Error: 0.3 → 0
Time: 1.2s
Precision: 64
\[d \cdot 10 + d \cdot 20\]
↓
\[\left(20 + 10\right) \cdot d\]
d \cdot 10 + d \cdot 20
↓
\left(20 + 10\right) \cdot d
double f(double d) {
        double r7720564 = d;
        double r7720565 = 10.0;
        double r7720566 = r7720564 * r7720565;
        double r7720567 = 20.0;
        double r7720568 = r7720564 * r7720567;
        double r7720569 = r7720566 + r7720568;
        return r7720569;
}
↓
double f(double d) {
        double r7720570 = 20.0;
        double r7720571 = 10.0;
        double r7720572 = r7720570 + r7720571;
        double r7720573 = d;
        double r7720574 = r7720572 * r7720573;
        return r7720574;
}

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}{\left(20 + 10\right) \cdot d}\]

  3. Final simplification0

    \[\leadsto \left(20 + 10\right) \cdot d\]

Reproduce

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

  :herbie-target
  (* d 30.0)

  (+ (* d 10.0) (* d 20.0)))