Average Error: 0.0 → 0.0
Time: 8.3s
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 r736637 = x;
        double r736638 = y;
        double r736639 = r736637 + r736638;
        double r736640 = z;
        double r736641 = r736639 * r736640;
        return r736641;
}

double f(double x, double y, double z) {
        double r736642 = y;
        double r736643 = x;
        double r736644 = r736642 + r736643;
        double r736645 = z;
        double r736646 = r736644 * r736645;
        return r736646;
}

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