Average Error: 0.2 → 0.0
Time: 10.6s
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 r8775204 = d1;
        double r8775205 = 10.0;
        double r8775206 = r8775204 * r8775205;
        double r8775207 = d2;
        double r8775208 = r8775204 * r8775207;
        double r8775209 = r8775206 + r8775208;
        double r8775210 = 20.0;
        double r8775211 = r8775204 * r8775210;
        double r8775212 = r8775209 + r8775211;
        return r8775212;
}
↓
double f(double d1, double d2) {
        double r8775213 = d1;
        double r8775214 = 10.0;
        double r8775215 = d2;
        double r8775216 = r8775214 + r8775215;
        double r8775217 = 20.0;
        double r8775218 = r8775216 + r8775217;
        double r8775219 = r8775213 * r8775218;
        return r8775219;
}

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 2019174 +o rules:numerics
(FPCore (d1 d2)
  :name "FastMath test2"

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

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