Average Error: 0.1 → 0.1
Time: 36.6s
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 r9507933 = x;
        double r9507934 = y;
        double r9507935 = r9507933 * r9507934;
        double r9507936 = z;
        double r9507937 = r9507935 + r9507936;
        double r9507938 = r9507937 * r9507934;
        double r9507939 = t;
        double r9507940 = r9507938 + r9507939;
        return r9507940;
}

double f(double x, double y, double z, double t) {
        double r9507941 = y;
        double r9507942 = z;
        double r9507943 = x;
        double r9507944 = r9507943 * r9507941;
        double r9507945 = r9507942 + r9507944;
        double r9507946 = r9507941 * r9507945;
        double r9507947 = t;
        double r9507948 = r9507946 + r9507947;
        return r9507948;
}

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