Average Error: 0.2 → 0.0
Time: 8.4s
Precision: 64
\[\left(d1 \cdot 10 + d1 \cdot d2\right) + d1 \cdot 20\]
↓
\[d1 \cdot \left(20 + \left(10 + d2\right)\right)\]
\left(d1 \cdot 10 + d1 \cdot d2\right) + d1 \cdot 20
↓
d1 \cdot \left(20 + \left(10 + d2\right)\right)
double f(double d1, double d2) {
        double r124405 = d1;
        double r124406 = 10.0;
        double r124407 = r124405 * r124406;
        double r124408 = d2;
        double r124409 = r124405 * r124408;
        double r124410 = r124407 + r124409;
        double r124411 = 20.0;
        double r124412 = r124405 * r124411;
        double r124413 = r124410 + r124412;
        return r124413;
}
↓
double f(double d1, double d2) {
        double r124414 = d1;
        double r124415 = 20.0;
        double r124416 = 10.0;
        double r124417 = d2;
        double r124418 = r124416 + r124417;
        double r124419 = r124415 + r124418;
        double r124420 = r124414 * r124419;
        return r124420;
}

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

  3. Final simplification0.0

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

Reproduce

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

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

  (+ (+ (* d1 10) (* d1 d2)) (* d1 20)))