Average Error: 0.0 → 0.0
Time: 2.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 r7504 = x;
        double r7505 = y;
        double r7506 = r7504 + r7505;
        double r7507 = z;
        double r7508 = r7506 * r7507;
        return r7508;
}
↓
double f(double x, double y, double z) {
        double r7509 = x;
        double r7510 = y;
        double r7511 = r7509 + r7510;
        double r7512 = z;
        double r7513 = r7511 * r7512;
        return r7513;
}

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