Average Error: 0.2 → 0.0
Time: 10.1s
Precision: 64
\[\left(d1 \cdot 10 + d1 \cdot d2\right) + d1 \cdot 20\]
↓
\[d1 \cdot \left(d2 + 30\right)\]
\left(d1 \cdot 10 + d1 \cdot d2\right) + d1 \cdot 20
↓
d1 \cdot \left(d2 + 30\right)
double f(double d1, double d2) {
        double r278906 = d1;
        double r278907 = 10.0;
        double r278908 = r278906 * r278907;
        double r278909 = d2;
        double r278910 = r278906 * r278909;
        double r278911 = r278908 + r278910;
        double r278912 = 20.0;
        double r278913 = r278906 * r278912;
        double r278914 = r278911 + r278913;
        return r278914;
}
↓
double f(double d1, double d2) {
        double r278915 = d1;
        double r278916 = d2;
        double r278917 = 30.0;
        double r278918 = r278916 + r278917;
        double r278919 = r278915 * r278918;
        return r278919;
}

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. Taylor expanded around 0 0.0

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

  4. Final simplification0.0

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

Reproduce

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

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

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