Average Error: 0.3 → 0
Time: 1.4s
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 r192267 = d;
        double r192268 = 10.0;
        double r192269 = r192267 * r192268;
        double r192270 = 20.0;
        double r192271 = r192267 * r192270;
        double r192272 = r192269 + r192271;
        return r192272;
}
↓
double f(double d) {
        double r192273 = 20.0;
        double r192274 = 10.0;
        double r192275 = r192273 + r192274;
        double r192276 = d;
        double r192277 = r192275 * r192276;
        return r192277;
}

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

  :herbie-target
  (* d 30.0)

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