Average Error: 0.0 → 0.0
Time: 14.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 r13828 = x;
        double r13829 = y;
        double r13830 = r13828 + r13829;
        double r13831 = z;
        double r13832 = r13830 * r13831;
        return r13832;
}
↓
double f(double x, double y, double z) {
        double r13833 = x;
        double r13834 = y;
        double r13835 = r13833 + r13834;
        double r13836 = z;
        double r13837 = r13835 * r13836;
        return r13837;
}

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