Average Error: 0.1 → 0.1
Time: 4.9s
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 r196649 = x;
        double r196650 = y;
        double r196651 = r196649 * r196650;
        double r196652 = z;
        double r196653 = r196651 + r196652;
        double r196654 = r196653 * r196650;
        double r196655 = t;
        double r196656 = r196654 + r196655;
        return r196656;
}
↓
double f(double x, double y, double z, double t) {
        double r196657 = x;
        double r196658 = y;
        double r196659 = r196657 * r196658;
        double r196660 = z;
        double r196661 = r196659 + r196660;
        double r196662 = r196661 * r196658;
        double r196663 = t;
        double r196664 = r196662 + r196663;
        return r196664;
}

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