Average Error: 0.0 → 0.0
Time: 7.7s
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 r18803 = x;
        double r18804 = y;
        double r18805 = r18803 + r18804;
        double r18806 = z;
        double r18807 = r18805 * r18806;
        return r18807;
}
↓
double f(double x, double y, double z) {
        double r18808 = x;
        double r18809 = y;
        double r18810 = r18808 + r18809;
        double r18811 = z;
        double r18812 = r18810 * r18811;
        return r18812;
}

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