Average Error: 0.0 → 0.0
Time: 10.0s
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 r19793 = x;
        double r19794 = y;
        double r19795 = r19793 + r19794;
        double r19796 = z;
        double r19797 = r19795 * r19796;
        return r19797;
}
↓
double f(double x, double y, double z) {
        double r19798 = x;
        double r19799 = y;
        double r19800 = r19798 + r19799;
        double r19801 = z;
        double r19802 = r19800 * r19801;
        return r19802;
}

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