Average Error: 0.3 → 0
Time: 318.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 r285848 = d;
        double r285849 = 10.0;
        double r285850 = r285848 * r285849;
        double r285851 = 20.0;
        double r285852 = r285848 * r285851;
        double r285853 = r285850 + r285852;
        return r285853;
}
↓
double f(double d) {
        double r285854 = d;
        double r285855 = 10.0;
        double r285856 = 20.0;
        double r285857 = r285855 + r285856;
        double r285858 = r285854 * r285857;
        return r285858;
}

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

  :herbie-target
  (* d 30)

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