Average Error: 0.1 → 0.1
Time: 4.4s
Precision: 64
\[\left(x \cdot y + z\right) \cdot y + t\]
↓
\[\left(x \cdot y + z\right) \cdot y + t\]
\left(x \cdot y + z\right) \cdot y + t
↓
\left(x \cdot y + z\right) \cdot y + t
double f(double x, double y, double z, double t) {
        double r128638 = x;
        double r128639 = y;
        double r128640 = r128638 * r128639;
        double r128641 = z;
        double r128642 = r128640 + r128641;
        double r128643 = r128642 * r128639;
        double r128644 = t;
        double r128645 = r128643 + r128644;
        return r128645;
}
↓
double f(double x, double y, double z, double t) {
        double r128646 = x;
        double r128647 = y;
        double r128648 = r128646 * r128647;
        double r128649 = z;
        double r128650 = r128648 + r128649;
        double r128651 = r128650 * r128647;
        double r128652 = t;
        double r128653 = r128651 + r128652;
        return r128653;
}

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

Reproduce

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