Average Error: 0.1 → 0.1
Time: 18.2s
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 r100659 = x;
        double r100660 = y;
        double r100661 = r100659 * r100660;
        double r100662 = z;
        double r100663 = r100661 + r100662;
        double r100664 = r100663 * r100660;
        double r100665 = t;
        double r100666 = r100664 + r100665;
        return r100666;
}
↓
double f(double x, double y, double z, double t) {
        double r100667 = x;
        double r100668 = y;
        double r100669 = r100667 * r100668;
        double r100670 = z;
        double r100671 = r100669 + r100670;
        double r100672 = r100671 * r100668;
        double r100673 = t;
        double r100674 = r100672 + r100673;
        return r100674;
}

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