Average Error: 0.3 → 0
Time: 661.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 r184289 = d;
        double r184290 = 10.0;
        double r184291 = r184289 * r184290;
        double r184292 = 20.0;
        double r184293 = r184289 * r184292;
        double r184294 = r184291 + r184293;
        return r184294;
}
↓
double f(double d) {
        double r184295 = d;
        double r184296 = 10.0;
        double r184297 = 20.0;
        double r184298 = r184296 + r184297;
        double r184299 = r184295 * r184298;
        return r184299;
}

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

  :herbie-target
  (* d 30)

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