Average Error: 0.0 → 0.0
Time: 6.7s
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 r585359 = x;
        double r585360 = y;
        double r585361 = r585359 + r585360;
        double r585362 = z;
        double r585363 = r585361 * r585362;
        return r585363;
}

double f(double x, double y, double z) {
        double r585364 = y;
        double r585365 = x;
        double r585366 = r585364 + r585365;
        double r585367 = z;
        double r585368 = r585366 * r585367;
        return r585368;
}

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