Average Error: 0.0 → 0.0
Time: 3.0s
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 r170944 = x;
        double r170945 = y;
        double r170946 = r170944 + r170945;
        double r170947 = z;
        double r170948 = r170946 * r170947;
        return r170948;
}

double f(double x, double y, double z) {
        double r170949 = y;
        double r170950 = x;
        double r170951 = r170949 + r170950;
        double r170952 = z;
        double r170953 = r170951 * r170952;
        return r170953;
}

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