Average Error: 0.0 → 0.0
Time: 4.9s
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 r3222 = x;
        double r3223 = y;
        double r3224 = r3222 + r3223;
        double r3225 = z;
        double r3226 = r3224 * r3225;
        return r3226;
}
↓
double f(double x, double y, double z) {
        double r3227 = x;
        double r3228 = y;
        double r3229 = r3227 + r3228;
        double r3230 = z;
        double r3231 = r3229 * r3230;
        return r3231;
}

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