Average Error: 0.1 → 0.1
Time: 17.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 r147749 = x;
        double r147750 = y;
        double r147751 = r147749 * r147750;
        double r147752 = z;
        double r147753 = r147751 + r147752;
        double r147754 = r147753 * r147750;
        double r147755 = t;
        double r147756 = r147754 + r147755;
        return r147756;
}
↓
double f(double x, double y, double z, double t) {
        double r147757 = x;
        double r147758 = y;
        double r147759 = r147757 * r147758;
        double r147760 = z;
        double r147761 = r147759 + r147760;
        double r147762 = r147761 * r147758;
        double r147763 = t;
        double r147764 = r147762 + r147763;
        return r147764;
}

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))