Average Error: 0.1 → 0.1
Time: 34.9s
Precision: 64
\[\left(x \cdot y + z\right) \cdot y + t\]
\[y \cdot \left(z + x \cdot y\right) + t\]
\left(x \cdot y + z\right) \cdot y + t
y \cdot \left(z + x \cdot y\right) + t
double f(double x, double y, double z, double t) {
        double r6764901 = x;
        double r6764902 = y;
        double r6764903 = r6764901 * r6764902;
        double r6764904 = z;
        double r6764905 = r6764903 + r6764904;
        double r6764906 = r6764905 * r6764902;
        double r6764907 = t;
        double r6764908 = r6764906 + r6764907;
        return r6764908;
}

double f(double x, double y, double z, double t) {
        double r6764909 = y;
        double r6764910 = z;
        double r6764911 = x;
        double r6764912 = r6764911 * r6764909;
        double r6764913 = r6764910 + r6764912;
        double r6764914 = r6764909 * r6764913;
        double r6764915 = t;
        double r6764916 = r6764914 + r6764915;
        return r6764916;
}

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 y \cdot \left(z + x \cdot y\right) + t\]

Reproduce

herbie shell --seed 2019172 
(FPCore (x y z t)
  :name "Language.Haskell.HsColour.ColourHighlight:unbase from hscolour-1.23"
  (+ (* (+ (* x y) z) y) t))