Average Error: 0.2 → 0.0
Time: 13.4s
Precision: 64
\[\left(d1 \cdot 10 + d1 \cdot d2\right) + d1 \cdot 20\]
↓
\[\left(20 + \left(d2 + 10\right)\right) \cdot d1\]
\left(d1 \cdot 10 + d1 \cdot d2\right) + d1 \cdot 20
↓
\left(20 + \left(d2 + 10\right)\right) \cdot d1
double f(double d1, double d2) {
        double r7137971 = d1;
        double r7137972 = 10.0;
        double r7137973 = r7137971 * r7137972;
        double r7137974 = d2;
        double r7137975 = r7137971 * r7137974;
        double r7137976 = r7137973 + r7137975;
        double r7137977 = 20.0;
        double r7137978 = r7137971 * r7137977;
        double r7137979 = r7137976 + r7137978;
        return r7137979;
}
↓
double f(double d1, double d2) {
        double r7137980 = 20.0;
        double r7137981 = d2;
        double r7137982 = 10.0;
        double r7137983 = r7137981 + r7137982;
        double r7137984 = r7137980 + r7137983;
        double r7137985 = d1;
        double r7137986 = r7137984 * r7137985;
        return r7137986;
}

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

Reproduce

herbie shell --seed 2019134 
(FPCore (d1 d2)
  :name "FastMath test2"

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

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