Average Error: 0.0 → 0.0
Time: 5.6s
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 r508046 = x;
        double r508047 = y;
        double r508048 = r508046 + r508047;
        double r508049 = z;
        double r508050 = r508048 * r508049;
        return r508050;
}

double f(double x, double y, double z) {
        double r508051 = y;
        double r508052 = x;
        double r508053 = r508051 + r508052;
        double r508054 = z;
        double r508055 = r508053 * r508054;
        return r508055;
}

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