Average Error: 0.2 → 0.0
Time: 2.0s
Precision: 64
\[\left(d1 \cdot 10 + d1 \cdot d2\right) + d1 \cdot 20\]
↓
\[d1 \cdot \left(10 + \left(d2 + 20\right)\right)\]
\left(d1 \cdot 10 + d1 \cdot d2\right) + d1 \cdot 20
↓
d1 \cdot \left(10 + \left(d2 + 20\right)\right)
double f(double d1, double d2) {
        double r182027 = d1;
        double r182028 = 10.0;
        double r182029 = r182027 * r182028;
        double r182030 = d2;
        double r182031 = r182027 * r182030;
        double r182032 = r182029 + r182031;
        double r182033 = 20.0;
        double r182034 = r182027 * r182033;
        double r182035 = r182032 + r182034;
        return r182035;
}
↓
double f(double d1, double d2) {
        double r182036 = d1;
        double r182037 = 10.0;
        double r182038 = d2;
        double r182039 = 20.0;
        double r182040 = r182038 + r182039;
        double r182041 = r182037 + r182040;
        double r182042 = r182036 * r182041;
        return r182042;
}

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. Using strategy rm

  4. Applied associate-+l+0.0

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

  5. Final simplification0.0

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

Reproduce

herbie shell --seed 2020002 
(FPCore (d1 d2)
  :name "FastMath test2"
  :precision binary64

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

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