Average Error: 0.0 → 0.0
Time: 12.1s
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 r930267 = x;
        double r930268 = y;
        double r930269 = r930267 + r930268;
        double r930270 = z;
        double r930271 = r930269 * r930270;
        return r930271;
}

double f(double x, double y, double z) {
        double r930272 = y;
        double r930273 = x;
        double r930274 = r930272 + r930273;
        double r930275 = z;
        double r930276 = r930274 * r930275;
        return r930276;
}

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