Average Error: 0.3 → 0
Time: 616.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 r191021 = d;
        double r191022 = 10.0;
        double r191023 = r191021 * r191022;
        double r191024 = 20.0;
        double r191025 = r191021 * r191024;
        double r191026 = r191023 + r191025;
        return r191026;
}
↓
double f(double d) {
        double r191027 = d;
        double r191028 = 10.0;
        double r191029 = 20.0;
        double r191030 = r191028 + r191029;
        double r191031 = r191027 * r191030;
        return r191031;
}

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

  :herbie-target
  (* d 30)

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