Average Error: 0.0 → 0.0
Time: 10.3s
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 r19803 = x;
        double r19804 = y;
        double r19805 = r19803 + r19804;
        double r19806 = z;
        double r19807 = r19805 * r19806;
        return r19807;
}
↓
double f(double x, double y, double z) {
        double r19808 = x;
        double r19809 = y;
        double r19810 = r19808 + r19809;
        double r19811 = z;
        double r19812 = r19810 * r19811;
        return r19812;
}

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