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 r187516 = d;
        double r187517 = 10.0;
        double r187518 = r187516 * r187517;
        double r187519 = 20.0;
        double r187520 = r187516 * r187519;
        double r187521 = r187518 + r187520;
        return r187521;
}
↓
double f(double d) {
        double r187522 = d;
        double r187523 = 10.0;
        double r187524 = 20.0;
        double r187525 = r187523 + r187524;
        double r187526 = r187522 * r187525;
        return r187526;
}

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

  :herbie-target
  (* d 30)

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