Average Error: 0.0 → 0.0
Time: 16.2s
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 r34880 = x;
        double r34881 = y;
        double r34882 = r34880 + r34881;
        double r34883 = z;
        double r34884 = r34882 * r34883;
        return r34884;
}
↓
double f(double x, double y, double z) {
        double r34885 = x;
        double r34886 = y;
        double r34887 = r34885 + r34886;
        double r34888 = z;
        double r34889 = r34887 * r34888;
        return r34889;
}

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