Average Error: 0.0 → 0.0
Time: 7.7s
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 r17810 = x;
        double r17811 = y;
        double r17812 = r17810 + r17811;
        double r17813 = z;
        double r17814 = r17812 * r17813;
        return r17814;
}
↓
double f(double x, double y, double z) {
        double r17815 = x;
        double r17816 = y;
        double r17817 = r17815 + r17816;
        double r17818 = z;
        double r17819 = r17817 * r17818;
        return r17819;
}

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 2019179 +o rules:numerics
(FPCore (x y z)
  :name "Text.Parsec.Token:makeTokenParser from parsec-3.1.9, B"
  (* (+ x y) z))