Average Error: 0.2 → 0.0
Time: 6.5s
Precision: 64
\[\left(d1 \cdot 10 + d1 \cdot d2\right) + d1 \cdot 20\]
↓
\[\left(d2 + \left(20 + 10\right)\right) \cdot d1\]
\left(d1 \cdot 10 + d1 \cdot d2\right) + d1 \cdot 20
↓
\left(d2 + \left(20 + 10\right)\right) \cdot d1
double f(double d1, double d2) {
        double r146076 = d1;
        double r146077 = 10.0;
        double r146078 = r146076 * r146077;
        double r146079 = d2;
        double r146080 = r146076 * r146079;
        double r146081 = r146078 + r146080;
        double r146082 = 20.0;
        double r146083 = r146076 * r146082;
        double r146084 = r146081 + r146083;
        return r146084;
}
↓
double f(double d1, double d2) {
        double r146085 = d2;
        double r146086 = 20.0;
        double r146087 = 10.0;
        double r146088 = r146086 + r146087;
        double r146089 = r146085 + r146088;
        double r146090 = d1;
        double r146091 = r146089 * r146090;
        return r146091;
}

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

  3. Final simplification0.0

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

Reproduce

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

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

  (+ (+ (* d1 10.0) (* d1 d2)) (* d1 20.0)))