Average Error: 0.0 → 0.0
Time: 1.1s
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 r432153 = d1;
        double r432154 = d2;
        double r432155 = r432153 * r432154;
        double r432156 = d3;
        double r432157 = r432153 * r432156;
        double r432158 = r432155 + r432157;
        return r432158;
}
↓
double f(double d1, double d2, double d3) {
        double r432159 = d1;
        double r432160 = d2;
        double r432161 = d3;
        double r432162 = r432160 + r432161;
        double r432163 = r432159 * r432162;
        return r432163;
}

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 2020033 
(FPCore (d1 d2 d3)
  :name "FastMath dist"
  :precision binary64

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

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