Average Error: 0.0 → 0.0
Time: 16.2s
Precision: 64
\[\left(x + y\right) \cdot z\]
↓
\[\left(x + y\right) \cdot z\]
\left(x + y\right) \cdot z
↓
\left(x + y\right) \cdot z
double f(double x, double y, double z) {
        double r2037546 = x;
        double r2037547 = y;
        double r2037548 = r2037546 + r2037547;
        double r2037549 = z;
        double r2037550 = r2037548 * r2037549;
        return r2037550;
}
↓
double f(double x, double y, double z) {
        double r2037551 = x;
        double r2037552 = y;
        double r2037553 = r2037551 + r2037552;
        double r2037554 = z;
        double r2037555 = r2037553 * r2037554;
        return r2037555;
}

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(x + y\right) \cdot z\]

Reproduce

herbie shell --seed 2019173 +o rules:numerics
(FPCore (x y z)
  :name "Text.Parsec.Token:makeTokenParser from parsec-3.1.9, B"
  (* (+ x y) z))