Average Error: 0.0 → 0.0
Time: 36.8s
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 r879436 = x;
        double r879437 = y;
        double r879438 = r879436 + r879437;
        double r879439 = z;
        double r879440 = r879438 * r879439;
        return r879440;
}
↓
double f(double x, double y, double z) {
        double r879441 = x;
        double r879442 = y;
        double r879443 = r879441 + r879442;
        double r879444 = z;
        double r879445 = r879443 * r879444;
        return r879445;
}

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