Average Error: 0.0 → 0.0
Time: 10.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 r15287 = x;
        double r15288 = y;
        double r15289 = r15287 + r15288;
        double r15290 = z;
        double r15291 = r15289 * r15290;
        return r15291;
}
↓
double f(double x, double y, double z) {
        double r15292 = x;
        double r15293 = y;
        double r15294 = r15292 + r15293;
        double r15295 = z;
        double r15296 = r15294 * r15295;
        return r15296;
}

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