Average Error: 0.0 → 0.0
Time: 2.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 r9269 = x;
        double r9270 = y;
        double r9271 = r9269 + r9270;
        double r9272 = z;
        double r9273 = r9271 * r9272;
        return r9273;
}
↓
double f(double x, double y, double z) {
        double r9274 = x;
        double r9275 = y;
        double r9276 = r9274 + r9275;
        double r9277 = z;
        double r9278 = r9276 * r9277;
        return r9278;
}

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