Average Error: 0.0 → 0.0
Time: 3.2s
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 r14883 = x;
        double r14884 = y;
        double r14885 = r14883 + r14884;
        double r14886 = z;
        double r14887 = r14885 * r14886;
        return r14887;
}
↓
double f(double x, double y, double z) {
        double r14888 = x;
        double r14889 = y;
        double r14890 = r14888 + r14889;
        double r14891 = z;
        double r14892 = r14890 * r14891;
        return r14892;
}

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