Average Error: 0.3 → 0
Time: 292.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 r146267 = d;
        double r146268 = 10.0;
        double r146269 = r146267 * r146268;
        double r146270 = 20.0;
        double r146271 = r146267 * r146270;
        double r146272 = r146269 + r146271;
        return r146272;
}
↓
double f(double d) {
        double r146273 = d;
        double r146274 = 10.0;
        double r146275 = 20.0;
        double r146276 = r146274 + r146275;
        double r146277 = r146273 * r146276;
        return r146277;
}

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

  :herbie-target
  (* d 30)

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