Average Error: 0.0 → 0.0
Time: 15.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 r903109 = x;
        double r903110 = y;
        double r903111 = r903109 + r903110;
        double r903112 = z;
        double r903113 = r903111 * r903112;
        return r903113;
}

double f(double x, double y, double z) {
        double r903114 = y;
        double r903115 = x;
        double r903116 = r903114 + r903115;
        double r903117 = z;
        double r903118 = r903116 * r903117;
        return r903118;
}

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