Average Error: 0.3 → 0
Time: 1.8s
Precision: 64
\[d \cdot 10 + d \cdot 20\]
↓
\[\left(10 + 20\right) \cdot d\]
d \cdot 10 + d \cdot 20
↓
\left(10 + 20\right) \cdot d
double f(double d) {
        double r9645751 = d;
        double r9645752 = 10.0;
        double r9645753 = r9645751 * r9645752;
        double r9645754 = 20.0;
        double r9645755 = r9645751 * r9645754;
        double r9645756 = r9645753 + r9645755;
        return r9645756;
}
↓
double f(double d) {
        double r9645757 = 10.0;
        double r9645758 = 20.0;
        double r9645759 = r9645757 + r9645758;
        double r9645760 = d;
        double r9645761 = r9645759 * r9645760;
        return r9645761;
}

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

Reproduce

herbie shell --seed 2019168 
(FPCore (d)
  :name "FastMath test1"

  :herbie-target
  (* d 30.0)

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