Average Error: 0.1 → 0.1
Time: 5.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 r177023 = x;
        double r177024 = y;
        double r177025 = r177023 * r177024;
        double r177026 = z;
        double r177027 = r177025 + r177026;
        double r177028 = r177027 * r177024;
        double r177029 = t;
        double r177030 = r177028 + r177029;
        return r177030;
}

double f(double x, double y, double z, double t) {
        double r177031 = x;
        double r177032 = y;
        double r177033 = r177031 * r177032;
        double r177034 = z;
        double r177035 = r177033 + r177034;
        double r177036 = r177035 * r177032;
        double r177037 = t;
        double r177038 = r177036 + r177037;
        return r177038;
}

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