Average Error: 0.0 → 0.0
Time: 722.0ms
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 r161 = x;
        double r162 = y;
        double r163 = r161 + r162;
        double r164 = z;
        double r165 = r163 * r164;
        return r165;
}
↓
double f(double x, double y, double z) {
        double r166 = x;
        double r167 = y;
        double r168 = r166 + r167;
        double r169 = z;
        double r170 = r168 * r169;
        return r170;
}

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