Average Error: 0.1 → 0.1
Time: 6.0s
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 r93761 = x;
        double r93762 = y;
        double r93763 = r93761 * r93762;
        double r93764 = z;
        double r93765 = r93763 + r93764;
        double r93766 = r93765 * r93762;
        double r93767 = t;
        double r93768 = r93766 + r93767;
        return r93768;
}
↓
double f(double x, double y, double z, double t) {
        double r93769 = x;
        double r93770 = y;
        double r93771 = r93769 * r93770;
        double r93772 = z;
        double r93773 = r93771 + r93772;
        double r93774 = r93773 * r93770;
        double r93775 = t;
        double r93776 = r93774 + r93775;
        return r93776;
}

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