Average Error: 0.0 → 0.0
Time: 2.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 r218725 = x;
        double r218726 = y;
        double r218727 = r218725 + r218726;
        double r218728 = z;
        double r218729 = r218727 * r218728;
        return r218729;
}

double f(double x, double y, double z) {
        double r218730 = y;
        double r218731 = x;
        double r218732 = r218730 + r218731;
        double r218733 = z;
        double r218734 = r218732 * r218733;
        return r218734;
}

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