Average Error: 0.1 → 0.1
Time: 4.6s
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 r221098 = x;
        double r221099 = y;
        double r221100 = r221098 * r221099;
        double r221101 = z;
        double r221102 = r221100 + r221101;
        double r221103 = r221102 * r221099;
        double r221104 = t;
        double r221105 = r221103 + r221104;
        return r221105;
}

double f(double x, double y, double z, double t) {
        double r221106 = x;
        double r221107 = y;
        double r221108 = r221106 * r221107;
        double r221109 = z;
        double r221110 = r221108 + r221109;
        double r221111 = r221110 * r221107;
        double r221112 = t;
        double r221113 = r221111 + r221112;
        return r221113;
}

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