Average Error: 0.1 → 0.1
Time: 4.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 r153831 = x;
        double r153832 = y;
        double r153833 = r153831 * r153832;
        double r153834 = z;
        double r153835 = r153833 + r153834;
        double r153836 = r153835 * r153832;
        double r153837 = t;
        double r153838 = r153836 + r153837;
        return r153838;
}
↓
double f(double x, double y, double z, double t) {
        double r153839 = x;
        double r153840 = y;
        double r153841 = r153839 * r153840;
        double r153842 = z;
        double r153843 = r153841 + r153842;
        double r153844 = r153843 * r153840;
        double r153845 = t;
        double r153846 = r153844 + r153845;
        return r153846;
}

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