Average Error: 0.0 → 0.0
Time: 8.0s
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 r592228 = x;
        double r592229 = y;
        double r592230 = r592228 + r592229;
        double r592231 = z;
        double r592232 = r592230 * r592231;
        return r592232;
}

double f(double x, double y, double z) {
        double r592233 = y;
        double r592234 = x;
        double r592235 = r592233 + r592234;
        double r592236 = z;
        double r592237 = r592235 * r592236;
        return r592237;
}

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