Average Error: 0.1 → 0.1
Time: 14.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 r167152 = x;
        double r167153 = y;
        double r167154 = r167152 * r167153;
        double r167155 = z;
        double r167156 = r167154 + r167155;
        double r167157 = r167156 * r167153;
        double r167158 = t;
        double r167159 = r167157 + r167158;
        return r167159;
}
↓
double f(double x, double y, double z, double t) {
        double r167160 = x;
        double r167161 = y;
        double r167162 = r167160 * r167161;
        double r167163 = z;
        double r167164 = r167162 + r167163;
        double r167165 = r167164 * r167161;
        double r167166 = t;
        double r167167 = r167165 + r167166;
        return r167167;
}

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