Average Error: 0.1 → 0.1
Time: 20.0s
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 r114553 = x;
        double r114554 = y;
        double r114555 = r114553 * r114554;
        double r114556 = z;
        double r114557 = r114555 + r114556;
        double r114558 = r114557 * r114554;
        double r114559 = t;
        double r114560 = r114558 + r114559;
        return r114560;
}
↓
double f(double x, double y, double z, double t) {
        double r114561 = x;
        double r114562 = y;
        double r114563 = r114561 * r114562;
        double r114564 = z;
        double r114565 = r114563 + r114564;
        double r114566 = r114565 * r114562;
        double r114567 = t;
        double r114568 = r114566 + r114567;
        return r114568;
}

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