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

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