Average Error: 0.2 → 0.0
Time: 10.2s
Precision: 64
\[\left(d1 \cdot 10 + d1 \cdot d2\right) + d1 \cdot 20\]
↓
\[d1 \cdot d2 + 30 \cdot d1\]
\left(d1 \cdot 10 + d1 \cdot d2\right) + d1 \cdot 20
↓
d1 \cdot d2 + 30 \cdot d1
double f(double d1, double d2) {
        double r11294439 = d1;
        double r11294440 = 10.0;
        double r11294441 = r11294439 * r11294440;
        double r11294442 = d2;
        double r11294443 = r11294439 * r11294442;
        double r11294444 = r11294441 + r11294443;
        double r11294445 = 20.0;
        double r11294446 = r11294439 * r11294445;
        double r11294447 = r11294444 + r11294446;
        return r11294447;
}
↓
double f(double d1, double d2) {
        double r11294448 = d1;
        double r11294449 = d2;
        double r11294450 = r11294448 * r11294449;
        double r11294451 = 30.0;
        double r11294452 = r11294451 * r11294448;
        double r11294453 = r11294450 + r11294452;
        return r11294453;
}

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(d2 + 30\right)}\]
  3. Using strategy rm

  4. Applied distribute-lft-in0.0

    \[\leadsto \color{blue}{d1 \cdot d2 + d1 \cdot 30}\]

  5. Final simplification0.0

    \[\leadsto d1 \cdot d2 + 30 \cdot d1\]

Reproduce

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

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

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