Average Error: 0.1 → 0.1
Time: 4.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 r163913 = x;
        double r163914 = y;
        double r163915 = r163913 * r163914;
        double r163916 = z;
        double r163917 = r163915 + r163916;
        double r163918 = r163917 * r163914;
        double r163919 = t;
        double r163920 = r163918 + r163919;
        return r163920;
}

double f(double x, double y, double z, double t) {
        double r163921 = x;
        double r163922 = y;
        double r163923 = r163921 * r163922;
        double r163924 = z;
        double r163925 = r163923 + r163924;
        double r163926 = r163925 * r163922;
        double r163927 = t;
        double r163928 = r163926 + r163927;
        return r163928;
}

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