Average Error: 0.3 → 0
Time: 315.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 r391665 = d;
        double r391666 = 10.0;
        double r391667 = r391665 * r391666;
        double r391668 = 20.0;
        double r391669 = r391665 * r391668;
        double r391670 = r391667 + r391669;
        return r391670;
}
↓
double f(double d) {
        double r391671 = d;
        double r391672 = 10.0;
        double r391673 = 20.0;
        double r391674 = r391672 + r391673;
        double r391675 = r391671 * r391674;
        return r391675;
}

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

  :herbie-target
  (* d 30)

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