Average Error: 0.0 → 0.0
Time: 916.0ms
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 r453 = x;
        double r454 = y;
        double r455 = r453 + r454;
        double r456 = z;
        double r457 = r455 * r456;
        return r457;
}
↓
double f(double x, double y, double z) {
        double r458 = x;
        double r459 = y;
        double r460 = r458 + r459;
        double r461 = z;
        double r462 = r460 * r461;
        return r462;
}

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