Average Error: 0.2 → 0.0
Time: 15.8s
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 r238983 = d1;
        double r238984 = 10.0;
        double r238985 = r238983 * r238984;
        double r238986 = d2;
        double r238987 = r238983 * r238986;
        double r238988 = r238985 + r238987;
        double r238989 = 20.0;
        double r238990 = r238983 * r238989;
        double r238991 = r238988 + r238990;
        return r238991;
}
↓
double f(double d1, double d2) {
        double r238992 = d1;
        double r238993 = d2;
        double r238994 = 30.0;
        double r238995 = r238993 + r238994;
        double r238996 = r238992 * r238995;
        return r238996;
}

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(\left(10 + d2\right) + 20\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 2019325 
(FPCore (d1 d2)
  :name "FastMath test2"
  :precision binary64

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

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