Average Error: 0.0 → 0.0
Time: 11.4s
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 r13220 = x;
        double r13221 = y;
        double r13222 = r13220 + r13221;
        double r13223 = z;
        double r13224 = r13222 * r13223;
        return r13224;
}
↓
double f(double x, double y, double z) {
        double r13225 = x;
        double r13226 = y;
        double r13227 = r13225 + r13226;
        double r13228 = z;
        double r13229 = r13227 * r13228;
        return r13229;
}

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