Average Error: 0.3 → 0
Time: 819.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 r178073 = d;
        double r178074 = 10.0;
        double r178075 = r178073 * r178074;
        double r178076 = 20.0;
        double r178077 = r178073 * r178076;
        double r178078 = r178075 + r178077;
        return r178078;
}
↓
double f(double d) {
        double r178079 = 20.0;
        double r178080 = 10.0;
        double r178081 = r178079 + r178080;
        double r178082 = d;
        double r178083 = r178081 * r178082;
        return r178083;
}

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

  :herbie-target
  (* d 30.0)

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