Average Error: 0.1 → 0.1
Time: 4.4s
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 r161817 = x;
        double r161818 = y;
        double r161819 = r161817 * r161818;
        double r161820 = z;
        double r161821 = r161819 + r161820;
        double r161822 = r161821 * r161818;
        double r161823 = t;
        double r161824 = r161822 + r161823;
        return r161824;
}

double f(double x, double y, double z, double t) {
        double r161825 = x;
        double r161826 = y;
        double r161827 = r161825 * r161826;
        double r161828 = z;
        double r161829 = r161827 + r161828;
        double r161830 = r161829 * r161826;
        double r161831 = t;
        double r161832 = r161830 + r161831;
        return r161832;
}

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