Average Error: 0.3 → 0
Time: 311.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 r301612 = d;
        double r301613 = 10.0;
        double r301614 = r301612 * r301613;
        double r301615 = 20.0;
        double r301616 = r301612 * r301615;
        double r301617 = r301614 + r301616;
        return r301617;
}
↓
double f(double d) {
        double r301618 = d;
        double r301619 = 10.0;
        double r301620 = 20.0;
        double r301621 = r301619 + r301620;
        double r301622 = r301618 * r301621;
        return r301622;
}

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 2020062 
(FPCore (d)
  :name "FastMath test1"
  :precision binary64

  :herbie-target
  (* d 30)

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