Average Error: 0.0 → 0.0
Time: 12.5s
Precision: 64
\[\left(x + y\right) \cdot z\]
\[\left(y + x\right) \cdot z\]
\left(x + y\right) \cdot z
\left(y + x\right) \cdot z
double f(double x, double y, double z) {
        double r654865 = x;
        double r654866 = y;
        double r654867 = r654865 + r654866;
        double r654868 = z;
        double r654869 = r654867 * r654868;
        return r654869;
}

double f(double x, double y, double z) {
        double r654870 = y;
        double r654871 = x;
        double r654872 = r654870 + r654871;
        double r654873 = z;
        double r654874 = r654872 * r654873;
        return r654874;
}

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(y + x\right) \cdot z\]

Reproduce

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