Average Error: 0.0 → 0.0
Time: 1.5s
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 r3257 = x;
        double r3258 = y;
        double r3259 = r3257 + r3258;
        double r3260 = z;
        double r3261 = r3259 * r3260;
        return r3261;
}
↓
double f(double x, double y, double z) {
        double r3262 = x;
        double r3263 = y;
        double r3264 = r3262 + r3263;
        double r3265 = z;
        double r3266 = r3264 * r3265;
        return r3266;
}

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