Average Error: 0.1 → 0.1
Time: 8.7s
Precision: 64
\[\left(x \cdot y + z\right) \cdot y + t\]
↓
\[\left(x \cdot y + z\right) \cdot y + t\]
\left(x \cdot y + z\right) \cdot y + t
↓
\left(x \cdot y + z\right) \cdot y + t
double f(double x, double y, double z, double t) {
        double r164977 = x;
        double r164978 = y;
        double r164979 = r164977 * r164978;
        double r164980 = z;
        double r164981 = r164979 + r164980;
        double r164982 = r164981 * r164978;
        double r164983 = t;
        double r164984 = r164982 + r164983;
        return r164984;
}
↓
double f(double x, double y, double z, double t) {
        double r164985 = x;
        double r164986 = y;
        double r164987 = r164985 * r164986;
        double r164988 = z;
        double r164989 = r164987 + r164988;
        double r164990 = r164989 * r164986;
        double r164991 = t;
        double r164992 = r164990 + r164991;
        return r164992;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Bits error versus t

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.1

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

  2. Final simplification0.1

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

Reproduce

herbie shell --seed 2020046 
(FPCore (x y z t)
  :name "Language.Haskell.HsColour.ColourHighlight:unbase from hscolour-1.23"
  :precision binary64
  (+ (* (+ (* x y) z) y) t))