Average Error: 0.3 → 0
Time: 643.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 r173430 = d;
        double r173431 = 10.0;
        double r173432 = r173430 * r173431;
        double r173433 = 20.0;
        double r173434 = r173430 * r173433;
        double r173435 = r173432 + r173434;
        return r173435;
}
↓
double f(double d) {
        double r173436 = d;
        double r173437 = 10.0;
        double r173438 = 20.0;
        double r173439 = r173437 + r173438;
        double r173440 = r173436 * r173439;
        return r173440;
}

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

  :herbie-target
  (* d 30)

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