Average Error: 0.3 → 0
Time: 299.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 r592570 = d;
        double r592571 = 10.0;
        double r592572 = r592570 * r592571;
        double r592573 = 20.0;
        double r592574 = r592570 * r592573;
        double r592575 = r592572 + r592574;
        return r592575;
}
↓
double f(double d) {
        double r592576 = d;
        double r592577 = 10.0;
        double r592578 = 20.0;
        double r592579 = r592577 + r592578;
        double r592580 = r592576 * r592579;
        return r592580;
}

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

  :herbie-target
  (* d 30)

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