Average Error: 0.1 → 0.1
Time: 11.6s
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 r145579 = x;
        double r145580 = y;
        double r145581 = r145579 * r145580;
        double r145582 = z;
        double r145583 = r145581 + r145582;
        double r145584 = r145583 * r145580;
        double r145585 = t;
        double r145586 = r145584 + r145585;
        return r145586;
}
↓
double f(double x, double y, double z, double t) {
        double r145587 = x;
        double r145588 = y;
        double r145589 = r145587 * r145588;
        double r145590 = z;
        double r145591 = r145589 + r145590;
        double r145592 = r145591 * r145588;
        double r145593 = t;
        double r145594 = r145592 + r145593;
        return r145594;
}

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