Average Error: 0.1 → 0.1
Time: 4.6s
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 r150825 = x;
        double r150826 = y;
        double r150827 = r150825 * r150826;
        double r150828 = z;
        double r150829 = r150827 + r150828;
        double r150830 = r150829 * r150826;
        double r150831 = t;
        double r150832 = r150830 + r150831;
        return r150832;
}
↓
double f(double x, double y, double z, double t) {
        double r150833 = x;
        double r150834 = y;
        double r150835 = r150833 * r150834;
        double r150836 = z;
        double r150837 = r150835 + r150836;
        double r150838 = r150837 * r150834;
        double r150839 = t;
        double r150840 = r150838 + r150839;
        return r150840;
}

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