Average Error: 0.0 → 0.0
Time: 11.1s
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 r901798 = x;
        double r901799 = y;
        double r901800 = r901798 + r901799;
        double r901801 = z;
        double r901802 = r901800 * r901801;
        return r901802;
}

double f(double x, double y, double z) {
        double r901803 = y;
        double r901804 = x;
        double r901805 = r901803 + r901804;
        double r901806 = z;
        double r901807 = r901805 * r901806;
        return r901807;
}

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