Average Error: 0.0 → 0.0
Time: 13.6s
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 r1202309 = x;
        double r1202310 = y;
        double r1202311 = r1202309 + r1202310;
        double r1202312 = z;
        double r1202313 = r1202311 * r1202312;
        return r1202313;
}

double f(double x, double y, double z) {
        double r1202314 = y;
        double r1202315 = x;
        double r1202316 = r1202314 + r1202315;
        double r1202317 = z;
        double r1202318 = r1202316 * r1202317;
        return r1202318;
}

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