Average Error: 0.0 → 0.0
Time: 6.0s
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 r3544 = x;
        double r3545 = y;
        double r3546 = r3544 + r3545;
        double r3547 = z;
        double r3548 = r3546 * r3547;
        return r3548;
}
↓
double f(double x, double y, double z) {
        double r3549 = x;
        double r3550 = y;
        double r3551 = r3549 + r3550;
        double r3552 = z;
        double r3553 = r3551 * r3552;
        return r3553;
}

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))