Average Error: 0.2 → 0.0
Time: 7.5s
Precision: 64
\[\left(d1 \cdot 10 + d1 \cdot d2\right) + d1 \cdot 20\]
↓
\[\left(d2 + \left(20 + 10\right)\right) \cdot d1\]
\left(d1 \cdot 10 + d1 \cdot d2\right) + d1 \cdot 20
↓
\left(d2 + \left(20 + 10\right)\right) \cdot d1
double f(double d1, double d2) {
        double r9965301 = d1;
        double r9965302 = 10.0;
        double r9965303 = r9965301 * r9965302;
        double r9965304 = d2;
        double r9965305 = r9965301 * r9965304;
        double r9965306 = r9965303 + r9965305;
        double r9965307 = 20.0;
        double r9965308 = r9965301 * r9965307;
        double r9965309 = r9965306 + r9965308;
        return r9965309;
}
↓
double f(double d1, double d2) {
        double r9965310 = d2;
        double r9965311 = 20.0;
        double r9965312 = 10.0;
        double r9965313 = r9965311 + r9965312;
        double r9965314 = r9965310 + r9965313;
        double r9965315 = d1;
        double r9965316 = r9965314 * r9965315;
        return r9965316;
}

Error

Bits error versus d1

Bits error versus d2

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0.2
Target0.0
Herbie0.0
\[d1 \cdot \left(30 + d2\right)\]

Derivation

  1. Initial program 0.2

    \[\left(d1 \cdot 10 + d1 \cdot d2\right) + d1 \cdot 20\]

  2. Simplified0.0

    \[\leadsto \color{blue}{\left(\left(10 + 20\right) + d2\right) \cdot d1}\]

  3. Final simplification0.0

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

Reproduce

herbie shell --seed 2019174 +o rules:numerics
(FPCore (d1 d2)
  :name "FastMath test2"

  :herbie-target
  (* d1 (+ 30.0 d2))

  (+ (+ (* d1 10.0) (* d1 d2)) (* d1 20.0)))