Average Error: 0.0 → 0.0
Time: 11.6s
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 r15687 = x;
        double r15688 = y;
        double r15689 = r15687 + r15688;
        double r15690 = z;
        double r15691 = r15689 * r15690;
        return r15691;
}
↓
double f(double x, double y, double z) {
        double r15692 = x;
        double r15693 = y;
        double r15694 = r15692 + r15693;
        double r15695 = z;
        double r15696 = r15694 * r15695;
        return r15696;
}

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