Average Error: 0.1 → 0.1
Time: 4.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 r160806 = x;
        double r160807 = y;
        double r160808 = r160806 * r160807;
        double r160809 = z;
        double r160810 = r160808 + r160809;
        double r160811 = r160810 * r160807;
        double r160812 = t;
        double r160813 = r160811 + r160812;
        return r160813;
}
↓
double f(double x, double y, double z, double t) {
        double r160814 = x;
        double r160815 = y;
        double r160816 = r160814 * r160815;
        double r160817 = z;
        double r160818 = r160816 + r160817;
        double r160819 = r160818 * r160815;
        double r160820 = t;
        double r160821 = r160819 + r160820;
        return r160821;
}

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