Average Error: 0.2 → 0.0
Time: 1.5s
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 r270259 = d1;
        double r270260 = 10.0;
        double r270261 = r270259 * r270260;
        double r270262 = d2;
        double r270263 = r270259 * r270262;
        double r270264 = r270261 + r270263;
        double r270265 = 20.0;
        double r270266 = r270259 * r270265;
        double r270267 = r270264 + r270266;
        return r270267;
}
↓
double f(double d1, double d2) {
        double r270268 = d1;
        double r270269 = 10.0;
        double r270270 = d2;
        double r270271 = r270269 + r270270;
        double r270272 = 20.0;
        double r270273 = r270271 + r270272;
        double r270274 = r270268 * r270273;
        return r270274;
}

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

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

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