Average Error: 0.1 → 0.1
Time: 16.3s
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 r9519423 = x;
        double r9519424 = y;
        double r9519425 = r9519423 * r9519424;
        double r9519426 = z;
        double r9519427 = r9519425 + r9519426;
        double r9519428 = r9519427 * r9519424;
        double r9519429 = t;
        double r9519430 = r9519428 + r9519429;
        return r9519430;
}

double f(double x, double y, double z, double t) {
        double r9519431 = y;
        double r9519432 = z;
        double r9519433 = x;
        double r9519434 = r9519433 * r9519431;
        double r9519435 = r9519432 + r9519434;
        double r9519436 = r9519431 * r9519435;
        double r9519437 = t;
        double r9519438 = r9519436 + r9519437;
        return r9519438;
}

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