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 r134674 = x;
        double r134675 = y;
        double r134676 = r134674 * r134675;
        double r134677 = z;
        double r134678 = r134676 + r134677;
        double r134679 = r134678 * r134675;
        double r134680 = t;
        double r134681 = r134679 + r134680;
        return r134681;
}
↓
double f(double x, double y, double z, double t) {
        double r134682 = x;
        double r134683 = y;
        double r134684 = r134682 * r134683;
        double r134685 = z;
        double r134686 = r134684 + r134685;
        double r134687 = r134686 * r134683;
        double r134688 = t;
        double r134689 = r134687 + r134688;
        return r134689;
}

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