Average Error: 0.0 → 0.0
Time: 6.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 r284764 = x;
        double r284765 = y;
        double r284766 = r284764 + r284765;
        double r284767 = z;
        double r284768 = r284766 * r284767;
        return r284768;
}

double f(double x, double y, double z) {
        double r284769 = y;
        double r284770 = x;
        double r284771 = r284769 + r284770;
        double r284772 = z;
        double r284773 = r284771 * r284772;
        return r284773;
}

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