Average Error: 0.1 → 0.1
Time: 3.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 r124791 = x;
        double r124792 = y;
        double r124793 = r124791 * r124792;
        double r124794 = z;
        double r124795 = r124793 + r124794;
        double r124796 = r124795 * r124792;
        double r124797 = t;
        double r124798 = r124796 + r124797;
        return r124798;
}
↓
double f(double x, double y, double z, double t) {
        double r124799 = x;
        double r124800 = y;
        double r124801 = r124799 * r124800;
        double r124802 = z;
        double r124803 = r124801 + r124802;
        double r124804 = r124803 * r124800;
        double r124805 = t;
        double r124806 = r124804 + r124805;
        return r124806;
}

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