Average Error: 0.0 → 0.0
Time: 1.8s
Precision: 64
\[d1 \cdot d2 + d1 \cdot d3\]
↓
\[d1 \cdot \left(d2 + d3\right)\]
d1 \cdot d2 + d1 \cdot d3
↓
d1 \cdot \left(d2 + d3\right)
double f(double d1, double d2, double d3) {
        double r129605 = d1;
        double r129606 = d2;
        double r129607 = r129605 * r129606;
        double r129608 = d3;
        double r129609 = r129605 * r129608;
        double r129610 = r129607 + r129609;
        return r129610;
}
↓
double f(double d1, double d2, double d3) {
        double r129611 = d1;
        double r129612 = d2;
        double r129613 = d3;
        double r129614 = r129612 + r129613;
        double r129615 = r129611 * r129614;
        return r129615;
}

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 \left(d2 + d3\right)\]

Reproduce

herbie shell --seed 2019304 
(FPCore (d1 d2 d3)
  :name "FastMath dist"
  :precision binary64

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

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