Average Error: 0.3 → 0
Time: 321.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 r508757 = d;
        double r508758 = 10.0;
        double r508759 = r508757 * r508758;
        double r508760 = 20.0;
        double r508761 = r508757 * r508760;
        double r508762 = r508759 + r508761;
        return r508762;
}
↓
double f(double d) {
        double r508763 = d;
        double r508764 = 10.0;
        double r508765 = 20.0;
        double r508766 = r508764 + r508765;
        double r508767 = r508763 * r508766;
        return r508767;
}

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

  :herbie-target
  (* d 30)

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