Average Error: 0.0 → 0.0
Time: 10.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 r968320 = x;
        double r968321 = y;
        double r968322 = r968320 + r968321;
        double r968323 = z;
        double r968324 = r968322 * r968323;
        return r968324;
}

double f(double x, double y, double z) {
        double r968325 = y;
        double r968326 = x;
        double r968327 = r968325 + r968326;
        double r968328 = z;
        double r968329 = r968327 * r968328;
        return r968329;
}

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