Average Error: 0.1 → 0.1
Time: 7.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 r158887 = x;
        double r158888 = y;
        double r158889 = r158887 * r158888;
        double r158890 = z;
        double r158891 = r158889 + r158890;
        double r158892 = r158891 * r158888;
        double r158893 = t;
        double r158894 = r158892 + r158893;
        return r158894;
}
↓
double f(double x, double y, double z, double t) {
        double r158895 = x;
        double r158896 = y;
        double r158897 = r158895 * r158896;
        double r158898 = z;
        double r158899 = r158897 + r158898;
        double r158900 = r158899 * r158896;
        double r158901 = t;
        double r158902 = r158900 + r158901;
        return r158902;
}

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