Average Error: 0.3 → 0
Time: 306.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 r472925 = d;
        double r472926 = 10.0;
        double r472927 = r472925 * r472926;
        double r472928 = 20.0;
        double r472929 = r472925 * r472928;
        double r472930 = r472927 + r472929;
        return r472930;
}
↓
double f(double d) {
        double r472931 = d;
        double r472932 = 10.0;
        double r472933 = 20.0;
        double r472934 = r472932 + r472933;
        double r472935 = r472931 * r472934;
        return r472935;
}

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

  :herbie-target
  (* d 30)

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