Average Error: 0.1 → 0.1
Time: 4.3s
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 r170912 = x;
        double r170913 = y;
        double r170914 = r170912 * r170913;
        double r170915 = z;
        double r170916 = r170914 + r170915;
        double r170917 = r170916 * r170913;
        double r170918 = t;
        double r170919 = r170917 + r170918;
        return r170919;
}

double f(double x, double y, double z, double t) {
        double r170920 = x;
        double r170921 = y;
        double r170922 = r170920 * r170921;
        double r170923 = z;
        double r170924 = r170922 + r170923;
        double r170925 = r170924 * r170921;
        double r170926 = t;
        double r170927 = r170925 + r170926;
        return r170927;
}

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