Average Error: 0.3 → 0
Time: 313.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 r349638 = d;
        double r349639 = 10.0;
        double r349640 = r349638 * r349639;
        double r349641 = 20.0;
        double r349642 = r349638 * r349641;
        double r349643 = r349640 + r349642;
        return r349643;
}
↓
double f(double d) {
        double r349644 = d;
        double r349645 = 10.0;
        double r349646 = 20.0;
        double r349647 = r349645 + r349646;
        double r349648 = r349644 * r349647;
        return r349648;
}

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

  :herbie-target
  (* d 30)

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