Average Error: 0.0 → 0.0
Time: 15.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 r900578 = x;
        double r900579 = y;
        double r900580 = r900578 + r900579;
        double r900581 = z;
        double r900582 = r900580 * r900581;
        return r900582;
}

double f(double x, double y, double z) {
        double r900583 = y;
        double r900584 = x;
        double r900585 = r900583 + r900584;
        double r900586 = z;
        double r900587 = r900585 * r900586;
        return r900587;
}

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