Average Error: 0.0 → 0.0
Time: 9.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 r17017 = x;
        double r17018 = y;
        double r17019 = r17017 + r17018;
        double r17020 = z;
        double r17021 = r17019 * r17020;
        return r17021;
}
↓
double f(double x, double y, double z) {
        double r17022 = x;
        double r17023 = y;
        double r17024 = r17022 + r17023;
        double r17025 = z;
        double r17026 = r17024 * r17025;
        return r17026;
}

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