Average Error: 0.3 → 0
Time: 727.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 r111731 = d;
        double r111732 = 10.0;
        double r111733 = r111731 * r111732;
        double r111734 = 20.0;
        double r111735 = r111731 * r111734;
        double r111736 = r111733 + r111735;
        return r111736;
}
↓
double f(double d) {
        double r111737 = d;
        double r111738 = 10.0;
        double r111739 = 20.0;
        double r111740 = r111738 + r111739;
        double r111741 = r111737 * r111740;
        return r111741;
}

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

  :herbie-target
  (* d 30)

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