Average Error: 0.1 → 0.1
Time: 20.7s
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 r91756 = x;
        double r91757 = y;
        double r91758 = r91756 * r91757;
        double r91759 = z;
        double r91760 = r91758 + r91759;
        double r91761 = r91760 * r91757;
        double r91762 = t;
        double r91763 = r91761 + r91762;
        return r91763;
}
↓
double f(double x, double y, double z, double t) {
        double r91764 = x;
        double r91765 = y;
        double r91766 = r91764 * r91765;
        double r91767 = z;
        double r91768 = r91766 + r91767;
        double r91769 = r91768 * r91765;
        double r91770 = t;
        double r91771 = r91769 + r91770;
        return r91771;
}

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