Average Error: 0.1 → 0.1
Time: 9.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 r88873 = x;
        double r88874 = y;
        double r88875 = r88873 * r88874;
        double r88876 = z;
        double r88877 = r88875 + r88876;
        double r88878 = r88877 * r88874;
        double r88879 = t;
        double r88880 = r88878 + r88879;
        return r88880;
}
↓
double f(double x, double y, double z, double t) {
        double r88881 = x;
        double r88882 = y;
        double r88883 = r88881 * r88882;
        double r88884 = z;
        double r88885 = r88883 + r88884;
        double r88886 = r88885 * r88882;
        double r88887 = t;
        double r88888 = r88886 + r88887;
        return r88888;
}

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