Average Error: 0.0 → 0.0
Time: 1.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 r1513 = x;
        double r1514 = y;
        double r1515 = r1513 + r1514;
        double r1516 = z;
        double r1517 = r1515 * r1516;
        return r1517;
}
↓
double f(double x, double y, double z) {
        double r1518 = x;
        double r1519 = y;
        double r1520 = r1518 + r1519;
        double r1521 = z;
        double r1522 = r1520 * r1521;
        return r1522;
}

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