Average Error: 0.0 → 0.0
Time: 11.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 r13329 = x;
        double r13330 = y;
        double r13331 = r13329 + r13330;
        double r13332 = z;
        double r13333 = r13331 * r13332;
        return r13333;
}
↓
double f(double x, double y, double z) {
        double r13334 = x;
        double r13335 = y;
        double r13336 = r13334 + r13335;
        double r13337 = z;
        double r13338 = r13336 * r13337;
        return r13338;
}

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