Average Error: 0.0 → 0.0
Time: 5.9s
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 r432119 = x;
        double r432120 = y;
        double r432121 = r432119 + r432120;
        double r432122 = z;
        double r432123 = r432121 * r432122;
        return r432123;
}

double f(double x, double y, double z) {
        double r432124 = y;
        double r432125 = x;
        double r432126 = r432124 + r432125;
        double r432127 = z;
        double r432128 = r432126 * r432127;
        return r432128;
}

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