Average Error: 0.3 → 0
Time: 407.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 r199580 = d;
        double r199581 = 10.0;
        double r199582 = r199580 * r199581;
        double r199583 = 20.0;
        double r199584 = r199580 * r199583;
        double r199585 = r199582 + r199584;
        return r199585;
}
↓
double f(double d) {
        double r199586 = d;
        double r199587 = 10.0;
        double r199588 = 20.0;
        double r199589 = r199587 + r199588;
        double r199590 = r199586 * r199589;
        return r199590;
}

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

  :herbie-target
  (* d 30)

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