Average Error: 0.3 → 0
Time: 332.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 r404348 = d;
        double r404349 = 10.0;
        double r404350 = r404348 * r404349;
        double r404351 = 20.0;
        double r404352 = r404348 * r404351;
        double r404353 = r404350 + r404352;
        return r404353;
}
↓
double f(double d) {
        double r404354 = d;
        double r404355 = 10.0;
        double r404356 = 20.0;
        double r404357 = r404355 + r404356;
        double r404358 = r404354 * r404357;
        return r404358;
}

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

  :herbie-target
  (* d 30)

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