Average Error: 0.0 → 0.0
Time: 11.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 r13589 = x;
        double r13590 = y;
        double r13591 = r13589 + r13590;
        double r13592 = z;
        double r13593 = r13591 * r13592;
        return r13593;
}
↓
double f(double x, double y, double z) {
        double r13594 = x;
        double r13595 = y;
        double r13596 = r13594 + r13595;
        double r13597 = z;
        double r13598 = r13596 * r13597;
        return r13598;
}

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