Average Error: 0.1 → 0.1
Time: 17.9s
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 r122979 = x;
        double r122980 = y;
        double r122981 = r122979 * r122980;
        double r122982 = z;
        double r122983 = r122981 + r122982;
        double r122984 = r122983 * r122980;
        double r122985 = t;
        double r122986 = r122984 + r122985;
        return r122986;
}
↓
double f(double x, double y, double z, double t) {
        double r122987 = x;
        double r122988 = y;
        double r122989 = r122987 * r122988;
        double r122990 = z;
        double r122991 = r122989 + r122990;
        double r122992 = r122991 * r122988;
        double r122993 = t;
        double r122994 = r122992 + r122993;
        return r122994;
}

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