Average Error: 0.0 → 0.0
Time: 3.8s
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 r3717 = x;
        double r3718 = y;
        double r3719 = r3717 + r3718;
        double r3720 = z;
        double r3721 = r3719 * r3720;
        return r3721;
}
↓
double f(double x, double y, double z) {
        double r3722 = x;
        double r3723 = y;
        double r3724 = r3722 + r3723;
        double r3725 = z;
        double r3726 = r3724 * r3725;
        return r3726;
}

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