Average Error: 0.3 → 0
Time: 644.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 r164820 = d;
        double r164821 = 10.0;
        double r164822 = r164820 * r164821;
        double r164823 = 20.0;
        double r164824 = r164820 * r164823;
        double r164825 = r164822 + r164824;
        return r164825;
}
↓
double f(double d) {
        double r164826 = d;
        double r164827 = 10.0;
        double r164828 = 20.0;
        double r164829 = r164827 + r164828;
        double r164830 = r164826 * r164829;
        return r164830;
}

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

  :herbie-target
  (* d 30)

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