Average Error: 0.0 → 0.0
Time: 1.5s
Precision: 64
\[\left(x + y\right) \cdot z\]
↓
\[\left(x + y\right) \cdot z\]
\left(x + y\right) \cdot z
↓
\left(x + y\right) \cdot z
double f(double x, double y, double z) {
        double r2686 = x;
        double r2687 = y;
        double r2688 = r2686 + r2687;
        double r2689 = z;
        double r2690 = r2688 * r2689;
        return r2690;
}
↓
double f(double x, double y, double z) {
        double r2691 = x;
        double r2692 = y;
        double r2693 = r2691 + r2692;
        double r2694 = z;
        double r2695 = r2693 * r2694;
        return r2695;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\left(x + y\right) \cdot z\]

  2. Final simplification0.0

    \[\leadsto \left(x + y\right) \cdot z\]

Reproduce

herbie shell --seed 2020065 +o rules:numerics
(FPCore (x y z)
  :name "Text.Parsec.Token:makeTokenParser from parsec-3.1.9, B"
  :precision binary64
  (* (+ x y) z))