Average Error: 0.0 → 0.0
Time: 7.3s
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 r12931 = x;
        double r12932 = y;
        double r12933 = r12931 + r12932;
        double r12934 = z;
        double r12935 = r12933 * r12934;
        return r12935;
}
↓
double f(double x, double y, double z) {
        double r12936 = x;
        double r12937 = y;
        double r12938 = r12936 + r12937;
        double r12939 = z;
        double r12940 = r12938 * r12939;
        return r12940;
}

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