Average Error: 0.0 → 0.0
Time: 14.9s
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 r1013942 = x;
        double r1013943 = y;
        double r1013944 = r1013942 + r1013943;
        double r1013945 = z;
        double r1013946 = r1013944 * r1013945;
        return r1013946;
}
↓
double f(double x, double y, double z) {
        double r1013947 = y;
        double r1013948 = x;
        double r1013949 = r1013947 + r1013948;
        double r1013950 = z;
        double r1013951 = r1013949 * r1013950;
        return r1013951;
}

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