Average Error: 0.0 → 0.0
Time: 4.8s
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 r3761 = x;
        double r3762 = y;
        double r3763 = r3761 + r3762;
        double r3764 = z;
        double r3765 = r3763 * r3764;
        return r3765;
}
↓
double f(double x, double y, double z) {
        double r3766 = x;
        double r3767 = y;
        double r3768 = r3766 + r3767;
        double r3769 = z;
        double r3770 = r3768 * r3769;
        return r3770;
}

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