Average Error: 0.2 → 0.0
Time: 7.5s
Precision: 64
\[\left(d1 \cdot 10 + d1 \cdot d2\right) + d1 \cdot 20\]
↓
\[d1 \cdot \left(\left(10 + d2\right) + 20\right)\]
\left(d1 \cdot 10 + d1 \cdot d2\right) + d1 \cdot 20
↓
d1 \cdot \left(\left(10 + d2\right) + 20\right)
double f(double d1, double d2) {
        double r162337 = d1;
        double r162338 = 10.0;
        double r162339 = r162337 * r162338;
        double r162340 = d2;
        double r162341 = r162337 * r162340;
        double r162342 = r162339 + r162341;
        double r162343 = 20.0;
        double r162344 = r162337 * r162343;
        double r162345 = r162342 + r162344;
        return r162345;
}
↓
double f(double d1, double d2) {
        double r162346 = d1;
        double r162347 = 10.0;
        double r162348 = d2;
        double r162349 = r162347 + r162348;
        double r162350 = 20.0;
        double r162351 = r162349 + r162350;
        double r162352 = r162346 * r162351;
        return r162352;
}

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. Final simplification0.0

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

Reproduce

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

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

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