Average Error: 0.1 → 0.1
Time: 4.4s
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 r195883 = x;
        double r195884 = y;
        double r195885 = r195883 * r195884;
        double r195886 = z;
        double r195887 = r195885 + r195886;
        double r195888 = r195887 * r195884;
        double r195889 = t;
        double r195890 = r195888 + r195889;
        return r195890;
}
↓
double f(double x, double y, double z, double t) {
        double r195891 = x;
        double r195892 = y;
        double r195893 = r195891 * r195892;
        double r195894 = z;
        double r195895 = r195893 + r195894;
        double r195896 = r195895 * r195892;
        double r195897 = t;
        double r195898 = r195896 + r195897;
        return r195898;
}

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 2019356 
(FPCore (x y z t)
  :name "Language.Haskell.HsColour.ColourHighlight:unbase from hscolour-1.23"
  :precision binary64
  (+ (* (+ (* x y) z) y) t))