Average Error: 0.2 → 0.0
Time: 8.4s
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 r266520 = d1;
        double r266521 = 10.0;
        double r266522 = r266520 * r266521;
        double r266523 = d2;
        double r266524 = r266520 * r266523;
        double r266525 = r266522 + r266524;
        double r266526 = 20.0;
        double r266527 = r266520 * r266526;
        double r266528 = r266525 + r266527;
        return r266528;
}
↓
double f(double d1, double d2) {
        double r266529 = d1;
        double r266530 = 10.0;
        double r266531 = d2;
        double r266532 = r266530 + r266531;
        double r266533 = 20.0;
        double r266534 = r266532 + r266533;
        double r266535 = r266529 * r266534;
        return r266535;
}

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 2019212 
(FPCore (d1 d2)
  :name "FastMath test2"
  :precision binary64

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

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