Average Error: 0.3 → 0
Time: 964.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 r140835 = d;
        double r140836 = 10.0;
        double r140837 = r140835 * r140836;
        double r140838 = 20.0;
        double r140839 = r140835 * r140838;
        double r140840 = r140837 + r140839;
        return r140840;
}
↓
double f(double d) {
        double r140841 = d;
        double r140842 = 10.0;
        double r140843 = 20.0;
        double r140844 = r140842 + r140843;
        double r140845 = r140841 * r140844;
        return r140845;
}

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

  :herbie-target
  (* d 30)

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