Average Error: 0.0 → 0.0
Time: 5.8s
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 r14757 = x;
        double r14758 = y;
        double r14759 = r14757 + r14758;
        double r14760 = z;
        double r14761 = r14759 * r14760;
        return r14761;
}
↓
double f(double x, double y, double z) {
        double r14762 = x;
        double r14763 = y;
        double r14764 = r14762 + r14763;
        double r14765 = z;
        double r14766 = r14764 * r14765;
        return r14766;
}

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

    \[\leadsto \color{blue}{\left(y + x\right) \cdot z}\]

  3. Final simplification0.0

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

Reproduce

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