Average Error: 0.0 → 0.0
Time: 2.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 r12518 = x;
        double r12519 = y;
        double r12520 = r12518 + r12519;
        double r12521 = z;
        double r12522 = r12520 * r12521;
        return r12522;
}
↓
double f(double x, double y, double z) {
        double r12523 = x;
        double r12524 = y;
        double r12525 = r12523 + r12524;
        double r12526 = z;
        double r12527 = r12525 * r12526;
        return r12527;
}

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