Average Error: 0.3 → 0
Time: 291.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 r243393 = d;
        double r243394 = 10.0;
        double r243395 = r243393 * r243394;
        double r243396 = 20.0;
        double r243397 = r243393 * r243396;
        double r243398 = r243395 + r243397;
        return r243398;
}
↓
double f(double d) {
        double r243399 = d;
        double r243400 = 10.0;
        double r243401 = 20.0;
        double r243402 = r243400 + r243401;
        double r243403 = r243399 * r243402;
        return r243403;
}

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

  :herbie-target
  (* d 30)

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