Average Error: 0.1 → 0.1
Time: 1.8m
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 r10217426 = x;
        double r10217427 = y;
        double r10217428 = r10217426 * r10217427;
        double r10217429 = z;
        double r10217430 = r10217428 + r10217429;
        double r10217431 = r10217430 * r10217427;
        double r10217432 = t;
        double r10217433 = r10217431 + r10217432;
        return r10217433;
}

double f(double x, double y, double z, double t) {
        double r10217434 = y;
        double r10217435 = z;
        double r10217436 = x;
        double r10217437 = r10217436 * r10217434;
        double r10217438 = r10217435 + r10217437;
        double r10217439 = r10217434 * r10217438;
        double r10217440 = t;
        double r10217441 = r10217439 + r10217440;
        return r10217441;
}

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