Average Error: 0.3 → 0
Time: 285.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 r302959 = d;
        double r302960 = 10.0;
        double r302961 = r302959 * r302960;
        double r302962 = 20.0;
        double r302963 = r302959 * r302962;
        double r302964 = r302961 + r302963;
        return r302964;
}
↓
double f(double d) {
        double r302965 = d;
        double r302966 = 10.0;
        double r302967 = 20.0;
        double r302968 = r302966 + r302967;
        double r302969 = r302965 * r302968;
        return r302969;
}

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

  :herbie-target
  (* d 30)

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