Average Error: 0.0 → 0.0
Time: 7.2s
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 r478492 = x;
        double r478493 = y;
        double r478494 = r478492 + r478493;
        double r478495 = z;
        double r478496 = r478494 * r478495;
        return r478496;
}

double f(double x, double y, double z) {
        double r478497 = y;
        double r478498 = x;
        double r478499 = r478497 + r478498;
        double r478500 = z;
        double r478501 = r478499 * r478500;
        return r478501;
}

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