Average Error: 0.2 → 0.0
Time: 468.0ms
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 r286802 = d1;
        double r286803 = 10.0;
        double r286804 = r286802 * r286803;
        double r286805 = d2;
        double r286806 = r286802 * r286805;
        double r286807 = r286804 + r286806;
        double r286808 = 20.0;
        double r286809 = r286802 * r286808;
        double r286810 = r286807 + r286809;
        return r286810;
}
↓
double f(double d1, double d2) {
        double r286811 = d1;
        double r286812 = 10.0;
        double r286813 = d2;
        double r286814 = r286812 + r286813;
        double r286815 = 20.0;
        double r286816 = r286814 + r286815;
        double r286817 = r286811 * r286816;
        return r286817;
}

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

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

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