Average Error: 0.0 → 0.0
Time: 3.9s
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 r279020 = d1;
        double r279021 = d2;
        double r279022 = r279020 * r279021;
        double r279023 = d3;
        double r279024 = r279020 * r279023;
        double r279025 = r279022 + r279024;
        return r279025;
}
↓
double f(double d1, double d2, double d3) {
        double r279026 = d1;
        double r279027 = d2;
        double r279028 = d3;
        double r279029 = r279027 + r279028;
        double r279030 = r279026 * r279029;
        return r279030;
}

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 2020045 +o rules:numerics
(FPCore (d1 d2 d3)
  :name "FastMath dist"
  :precision binary64

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

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