Average Error: 0.0 → 0.0
Time: 4.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 r3677 = x;
        double r3678 = y;
        double r3679 = r3677 + r3678;
        double r3680 = z;
        double r3681 = r3679 * r3680;
        return r3681;
}
↓
double f(double x, double y, double z) {
        double r3682 = x;
        double r3683 = y;
        double r3684 = r3682 + r3683;
        double r3685 = z;
        double r3686 = r3684 * r3685;
        return r3686;
}

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