Average Error: 0.1 → 0.1
Time: 15.8s
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 r142988 = x;
        double r142989 = y;
        double r142990 = r142988 * r142989;
        double r142991 = z;
        double r142992 = r142990 + r142991;
        double r142993 = r142992 * r142989;
        double r142994 = t;
        double r142995 = r142993 + r142994;
        return r142995;
}
↓
double f(double x, double y, double z, double t) {
        double r142996 = x;
        double r142997 = y;
        double r142998 = r142996 * r142997;
        double r142999 = z;
        double r143000 = r142998 + r142999;
        double r143001 = r143000 * r142997;
        double r143002 = t;
        double r143003 = r143001 + r143002;
        return r143003;
}

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