Average Error: 0.3 → 0
Time: 292.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 r180724 = d;
        double r180725 = 10.0;
        double r180726 = r180724 * r180725;
        double r180727 = 20.0;
        double r180728 = r180724 * r180727;
        double r180729 = r180726 + r180728;
        return r180729;
}
↓
double f(double d) {
        double r180730 = d;
        double r180731 = 10.0;
        double r180732 = 20.0;
        double r180733 = r180731 + r180732;
        double r180734 = r180730 * r180733;
        return r180734;
}

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

  :herbie-target
  (* d 30)

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