Average Error: 0.0 → 0.0
Time: 2.7s
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 r222781 = d1;
        double r222782 = d2;
        double r222783 = r222781 * r222782;
        double r222784 = d3;
        double r222785 = r222781 * r222784;
        double r222786 = r222783 + r222785;
        return r222786;
}
↓
double f(double d1, double d2, double d3) {
        double r222787 = d1;
        double r222788 = d2;
        double r222789 = d3;
        double r222790 = r222788 + r222789;
        double r222791 = r222787 * r222790;
        return r222791;
}

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. Simplified0.0

    \[\leadsto \color{blue}{d1 \cdot \left(d2 + d3\right)}\]

  3. Final simplification0.0

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

Reproduce

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

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

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