Average Error: 0.3 → 0
Time: 587.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 r33386 = d;
        double r33387 = 10.0;
        double r33388 = r33386 * r33387;
        double r33389 = 20.0;
        double r33390 = r33386 * r33389;
        double r33391 = r33388 + r33390;
        return r33391;
}
↓
double f(double d) {
        double r33392 = d;
        double r33393 = 10.0;
        double r33394 = 20.0;
        double r33395 = r33393 + r33394;
        double r33396 = r33392 * r33395;
        return r33396;
}

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

  :herbie-target
  (* d 30)

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