Average Error: 0.2 → 0.0
Time: 1.9s
Precision: 64
\[\left(d1 \cdot 10 + d1 \cdot d2\right) + d1 \cdot 20\]
↓
\[\left(d2 + 30\right) \cdot d1\]
\left(d1 \cdot 10 + d1 \cdot d2\right) + d1 \cdot 20
↓
\left(d2 + 30\right) \cdot d1
double f(double d1, double d2) {
        double r3380463 = d1;
        double r3380464 = 10.0;
        double r3380465 = r3380463 * r3380464;
        double r3380466 = d2;
        double r3380467 = r3380463 * r3380466;
        double r3380468 = r3380465 + r3380467;
        double r3380469 = 20.0;
        double r3380470 = r3380463 * r3380469;
        double r3380471 = r3380468 + r3380470;
        return r3380471;
}
↓
double f(double d1, double d2) {
        double r3380472 = d2;
        double r3380473 = 30.0;
        double r3380474 = r3380472 + r3380473;
        double r3380475 = d1;
        double r3380476 = r3380474 * r3380475;
        return r3380476;
}

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(30 + d2\right) \cdot d1}\]

  3. Final simplification0.0

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

Reproduce

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

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

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