Average Error: 0.1 → 0.1
Time: 4.5s
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 r179097 = x;
        double r179098 = y;
        double r179099 = r179097 * r179098;
        double r179100 = z;
        double r179101 = r179099 + r179100;
        double r179102 = r179101 * r179098;
        double r179103 = t;
        double r179104 = r179102 + r179103;
        return r179104;
}
↓
double f(double x, double y, double z, double t) {
        double r179105 = x;
        double r179106 = y;
        double r179107 = r179105 * r179106;
        double r179108 = z;
        double r179109 = r179107 + r179108;
        double r179110 = r179109 * r179106;
        double r179111 = t;
        double r179112 = r179110 + r179111;
        return r179112;
}

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