Average Error: 0.3 → 0
Time: 665.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 r139874 = d;
        double r139875 = 10.0;
        double r139876 = r139874 * r139875;
        double r139877 = 20.0;
        double r139878 = r139874 * r139877;
        double r139879 = r139876 + r139878;
        return r139879;
}
↓
double f(double d) {
        double r139880 = d;
        double r139881 = 10.0;
        double r139882 = 20.0;
        double r139883 = r139881 + r139882;
        double r139884 = r139880 * r139883;
        return r139884;
}

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 2019209 +o rules:numerics
(FPCore (d)
  :name "FastMath test1"
  :precision binary64

  :herbie-target
  (* d 30)

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