Average Error: 0.0 → 0.0
Time: 1.9s
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 r4730 = x;
        double r4731 = y;
        double r4732 = r4730 + r4731;
        double r4733 = z;
        double r4734 = r4732 * r4733;
        return r4734;
}
↓
double f(double x, double y, double z) {
        double r4735 = x;
        double r4736 = y;
        double r4737 = r4735 + r4736;
        double r4738 = z;
        double r4739 = r4737 * r4738;
        return r4739;
}

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