Average Error: 0.1 → 0.1
Time: 36.0s
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 r6965584 = x;
        double r6965585 = y;
        double r6965586 = r6965584 * r6965585;
        double r6965587 = z;
        double r6965588 = r6965586 + r6965587;
        double r6965589 = r6965588 * r6965585;
        double r6965590 = t;
        double r6965591 = r6965589 + r6965590;
        return r6965591;
}

double f(double x, double y, double z, double t) {
        double r6965592 = y;
        double r6965593 = z;
        double r6965594 = x;
        double r6965595 = r6965594 * r6965592;
        double r6965596 = r6965593 + r6965595;
        double r6965597 = r6965592 * r6965596;
        double r6965598 = t;
        double r6965599 = r6965597 + r6965598;
        return r6965599;
}

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))