Average Error: 0.1 → 0.1
Time: 17.2s
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 r96755 = x;
        double r96756 = y;
        double r96757 = r96755 * r96756;
        double r96758 = z;
        double r96759 = r96757 + r96758;
        double r96760 = r96759 * r96756;
        double r96761 = t;
        double r96762 = r96760 + r96761;
        return r96762;
}
↓
double f(double x, double y, double z, double t) {
        double r96763 = x;
        double r96764 = y;
        double r96765 = r96763 * r96764;
        double r96766 = z;
        double r96767 = r96765 + r96766;
        double r96768 = r96767 * r96764;
        double r96769 = t;
        double r96770 = r96768 + r96769;
        return r96770;
}

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