Average Error: 0.3 → 0
Time: 339.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 r164296 = d;
        double r164297 = 10.0;
        double r164298 = r164296 * r164297;
        double r164299 = 20.0;
        double r164300 = r164296 * r164299;
        double r164301 = r164298 + r164300;
        return r164301;
}
↓
double f(double d) {
        double r164302 = d;
        double r164303 = 10.0;
        double r164304 = 20.0;
        double r164305 = r164303 + r164304;
        double r164306 = r164302 * r164305;
        return r164306;
}

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

  :herbie-target
  (* d 30)

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