Average Error: 0.3 → 0
Time: 686.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 r286607 = d;
        double r286608 = 10.0;
        double r286609 = r286607 * r286608;
        double r286610 = 20.0;
        double r286611 = r286607 * r286610;
        double r286612 = r286609 + r286611;
        return r286612;
}
↓
double f(double d) {
        double r286613 = d;
        double r286614 = 10.0;
        double r286615 = 20.0;
        double r286616 = r286614 + r286615;
        double r286617 = r286613 * r286616;
        return r286617;
}

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

  :herbie-target
  (* d 30)

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