Average Error: 0.0 → 0.0
Time: 2.3s
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 r5085 = x;
        double r5086 = y;
        double r5087 = r5085 + r5086;
        double r5088 = z;
        double r5089 = r5087 * r5088;
        return r5089;
}
↓
double f(double x, double y, double z) {
        double r5090 = x;
        double r5091 = y;
        double r5092 = r5090 + r5091;
        double r5093 = z;
        double r5094 = r5092 * r5093;
        return r5094;
}

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