Average Error: 0.3 → 0
Time: 348.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 r393692 = d;
        double r393693 = 10.0;
        double r393694 = r393692 * r393693;
        double r393695 = 20.0;
        double r393696 = r393692 * r393695;
        double r393697 = r393694 + r393696;
        return r393697;
}
↓
double f(double d) {
        double r393698 = d;
        double r393699 = 10.0;
        double r393700 = 20.0;
        double r393701 = r393699 + r393700;
        double r393702 = r393698 * r393701;
        return r393702;
}

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

  :herbie-target
  (* d 30)

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