Average Error: 0.0 → 0.0
Time: 9.4s
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 r17434 = x;
        double r17435 = y;
        double r17436 = r17434 + r17435;
        double r17437 = z;
        double r17438 = r17436 * r17437;
        return r17438;
}
↓
double f(double x, double y, double z) {
        double r17439 = x;
        double r17440 = y;
        double r17441 = r17439 + r17440;
        double r17442 = z;
        double r17443 = r17441 * r17442;
        return r17443;
}

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