Average Error: 0.0 → 0.0
Time: 7.0s
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 r19922 = x;
        double r19923 = y;
        double r19924 = r19922 + r19923;
        double r19925 = z;
        double r19926 = r19924 * r19925;
        return r19926;
}
↓
double f(double x, double y, double z) {
        double r19927 = x;
        double r19928 = y;
        double r19929 = r19927 + r19928;
        double r19930 = z;
        double r19931 = r19929 * r19930;
        return r19931;
}

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. Simplified0.0

    \[\leadsto \color{blue}{\left(y + x\right) \cdot z}\]

  3. Final simplification0.0

    \[\leadsto \left(x + y\right) \cdot z\]

Reproduce

herbie shell --seed 2019195 
(FPCore (x y z)
  :name "Text.Parsec.Token:makeTokenParser from parsec-3.1.9, B"
  (* (+ x y) z))