Average Error: 0.0 → 0.0
Time: 9.1s
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 r968323 = x;
        double r968324 = y;
        double r968325 = r968323 + r968324;
        double r968326 = z;
        double r968327 = r968325 * r968326;
        return r968327;
}

double f(double x, double y, double z) {
        double r968328 = y;
        double r968329 = x;
        double r968330 = r968328 + r968329;
        double r968331 = z;
        double r968332 = r968330 * r968331;
        return r968332;
}

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))