Average Error: 0.1 → 0.1
Time: 6.7s
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 r163654 = x;
        double r163655 = y;
        double r163656 = r163654 * r163655;
        double r163657 = z;
        double r163658 = r163656 + r163657;
        double r163659 = r163658 * r163655;
        double r163660 = t;
        double r163661 = r163659 + r163660;
        return r163661;
}
↓
double f(double x, double y, double z, double t) {
        double r163662 = x;
        double r163663 = y;
        double r163664 = r163662 * r163663;
        double r163665 = z;
        double r163666 = r163664 + r163665;
        double r163667 = r163666 * r163663;
        double r163668 = t;
        double r163669 = r163667 + r163668;
        return r163669;
}

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 2020047 +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))