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 r395896 = d;
        double r395897 = 10.0;
        double r395898 = r395896 * r395897;
        double r395899 = 20.0;
        double r395900 = r395896 * r395899;
        double r395901 = r395898 + r395900;
        return r395901;
}
↓
double f(double d) {
        double r395902 = d;
        double r395903 = 10.0;
        double r395904 = 20.0;
        double r395905 = r395903 + r395904;
        double r395906 = r395902 * r395905;
        return r395906;
}

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

  :herbie-target
  (* d 30)

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