Average Error: 0.0 → 0.0
Time: 1.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 r8134 = x;
        double r8135 = y;
        double r8136 = r8134 + r8135;
        double r8137 = z;
        double r8138 = r8136 * r8137;
        return r8138;
}
↓
double f(double x, double y, double z) {
        double r8139 = x;
        double r8140 = y;
        double r8141 = r8139 + r8140;
        double r8142 = z;
        double r8143 = r8141 * r8142;
        return r8143;
}

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