Average Error: 0.0 → 0.0
Time: 20.8s
Precision: 64
\[d1 \cdot d2 + d1 \cdot d3\]
↓
\[\left(d2 + d3\right) \cdot d1\]
d1 \cdot d2 + d1 \cdot d3
↓
\left(d2 + d3\right) \cdot d1
double f(double d1, double d2, double d3) {
        double r8267107 = d1;
        double r8267108 = d2;
        double r8267109 = r8267107 * r8267108;
        double r8267110 = d3;
        double r8267111 = r8267107 * r8267110;
        double r8267112 = r8267109 + r8267111;
        return r8267112;
}
↓
double f(double d1, double d2, double d3) {
        double r8267113 = d2;
        double r8267114 = d3;
        double r8267115 = r8267113 + r8267114;
        double r8267116 = d1;
        double r8267117 = r8267115 * r8267116;
        return r8267117;
}

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

Reproduce

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

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

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