Average Error: 0.0 → 0.0
Time: 4.6s
Precision: 64
\[d1 \cdot d2 + d1 \cdot d3\]
↓
\[d1 \cdot d2 + d3 \cdot d1\]
d1 \cdot d2 + d1 \cdot d3
↓
d1 \cdot d2 + d3 \cdot d1
double f(double d1, double d2, double d3) {
        double r5990572 = d1;
        double r5990573 = d2;
        double r5990574 = r5990572 * r5990573;
        double r5990575 = d3;
        double r5990576 = r5990572 * r5990575;
        double r5990577 = r5990574 + r5990576;
        return r5990577;
}
↓
double f(double d1, double d2, double d3) {
        double r5990578 = d1;
        double r5990579 = d2;
        double r5990580 = r5990578 * r5990579;
        double r5990581 = d3;
        double r5990582 = r5990581 * r5990578;
        double r5990583 = r5990580 + r5990582;
        return r5990583;
}

Error

Bits error versus d1

Bits error versus d2

Bits error versus d3

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0.0
Target0.0
Herbie0.0
\[d1 \cdot \left(d2 + d3\right)\]

Derivation

  1. Initial program 0.0

    \[d1 \cdot d2 + d1 \cdot d3\]

  2. Final simplification0.0

    \[\leadsto d1 \cdot d2 + d3 \cdot d1\]

Reproduce

herbie shell --seed 2019155 
(FPCore (d1 d2 d3)
  :name "FastMath dist"

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

  (+ (* d1 d2) (* d1 d3)))