Average Error: 0.0 → 0.0
Time: 2.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 r7265 = x;
        double r7266 = y;
        double r7267 = r7265 + r7266;
        double r7268 = z;
        double r7269 = r7267 * r7268;
        return r7269;
}
↓
double f(double x, double y, double z) {
        double r7270 = x;
        double r7271 = y;
        double r7272 = r7270 + r7271;
        double r7273 = z;
        double r7274 = r7272 * r7273;
        return r7274;
}

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