Average Error: 0.3 → 0
Time: 675.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 r186741 = d;
        double r186742 = 10.0;
        double r186743 = r186741 * r186742;
        double r186744 = 20.0;
        double r186745 = r186741 * r186744;
        double r186746 = r186743 + r186745;
        return r186746;
}
↓
double f(double d) {
        double r186747 = d;
        double r186748 = 10.0;
        double r186749 = 20.0;
        double r186750 = r186748 + r186749;
        double r186751 = r186747 * r186750;
        return r186751;
}

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

  :herbie-target
  (* d 30)

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