Average Error: 0.3 → 0
Time: 575.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 r124604 = d;
        double r124605 = 10.0;
        double r124606 = r124604 * r124605;
        double r124607 = 20.0;
        double r124608 = r124604 * r124607;
        double r124609 = r124606 + r124608;
        return r124609;
}
↓
double f(double d) {
        double r124610 = d;
        double r124611 = 10.0;
        double r124612 = 20.0;
        double r124613 = r124611 + r124612;
        double r124614 = r124610 * r124613;
        return r124614;
}

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 2019303 +o rules:numerics
(FPCore (d)
  :name "FastMath test1"
  :precision binary64

  :herbie-target
  (* d 30)

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