Average Error: 0.0 → 0.0
Time: 5.8s
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 r14594 = x;
        double r14595 = y;
        double r14596 = r14594 + r14595;
        double r14597 = z;
        double r14598 = r14596 * r14597;
        return r14598;
}
↓
double f(double x, double y, double z) {
        double r14599 = y;
        double r14600 = x;
        double r14601 = r14599 + r14600;
        double r14602 = z;
        double r14603 = r14601 * r14602;
        return r14603;
}

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