Average Error: 0.3 → 0
Time: 906.0ms
Precision: 64
\[d \cdot 10 + d \cdot 20\]
↓
\[\left(20 + 10\right) \cdot d\]
d \cdot 10 + d \cdot 20
↓
\left(20 + 10\right) \cdot d
double f(double d) {
        double r7744389 = d;
        double r7744390 = 10.0;
        double r7744391 = r7744389 * r7744390;
        double r7744392 = 20.0;
        double r7744393 = r7744389 * r7744392;
        double r7744394 = r7744391 + r7744393;
        return r7744394;
}
↓
double f(double d) {
        double r7744395 = 20.0;
        double r7744396 = 10.0;
        double r7744397 = r7744395 + r7744396;
        double r7744398 = d;
        double r7744399 = r7744397 * r7744398;
        return r7744399;
}

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}{\left(10 + 20\right) \cdot d}\]

  3. Final simplification0

    \[\leadsto \left(20 + 10\right) \cdot d\]

Reproduce

herbie shell --seed 2019172 +o rules:numerics
(FPCore (d)
  :name "FastMath test1"

  :herbie-target
  (* d 30.0)

  (+ (* d 10.0) (* d 20.0)))