Average Error: 0.3 → 0
Time: 639.0ms
Precision: 64
\[d \cdot 10 + d \cdot 20\]
↓
\[\left(10 + 20\right) \cdot d\]
d \cdot 10 + d \cdot 20
↓
\left(10 + 20\right) \cdot d
double f(double d) {
        double r372215 = d;
        double r372216 = 10.0;
        double r372217 = r372215 * r372216;
        double r372218 = 20.0;
        double r372219 = r372215 * r372218;
        double r372220 = r372217 + r372219;
        return r372220;
}
↓
double f(double d) {
        double r372221 = 10.0;
        double r372222 = 20.0;
        double r372223 = r372221 + r372222;
        double r372224 = d;
        double r372225 = r372223 * r372224;
        return r372225;
}

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}{\left(10 + 20\right) \cdot d}\]

  3. Final simplification0

    \[\leadsto \left(10 + 20\right) \cdot d\]

Reproduce

herbie shell --seed 2019323 
(FPCore (d)
  :name "FastMath test1"
  :precision binary64

  :herbie-target
  (* d 30)

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