Average Error: 0.0 → 0.0
Time: 12.3s
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 r23537 = x;
        double r23538 = y;
        double r23539 = r23537 + r23538;
        double r23540 = z;
        double r23541 = r23539 * r23540;
        return r23541;
}
↓
double f(double x, double y, double z) {
        double r23542 = y;
        double r23543 = x;
        double r23544 = r23542 + r23543;
        double r23545 = z;
        double r23546 = r23544 * r23545;
        return r23546;
}

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