Average Error: 0.1 → 0.1
Time: 8.7s
Precision: 64
\[\left(x \cdot y + z\right) \cdot y + t\]
↓
\[y \cdot \left(z + x \cdot y\right) + t\]
\left(x \cdot y + z\right) \cdot y + t
↓
y \cdot \left(z + x \cdot y\right) + t
double f(double x, double y, double z, double t) {
        double r110744 = x;
        double r110745 = y;
        double r110746 = r110744 * r110745;
        double r110747 = z;
        double r110748 = r110746 + r110747;
        double r110749 = r110748 * r110745;
        double r110750 = t;
        double r110751 = r110749 + r110750;
        return r110751;
}
↓
double f(double x, double y, double z, double t) {
        double r110752 = y;
        double r110753 = z;
        double r110754 = x;
        double r110755 = r110754 * r110752;
        double r110756 = r110753 + r110755;
        double r110757 = r110752 * r110756;
        double r110758 = t;
        double r110759 = r110757 + r110758;
        return r110759;
}

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 y \cdot \left(z + x \cdot y\right) + t\]

Reproduce

herbie shell --seed 2019195 
(FPCore (x y z t)
  :name "Language.Haskell.HsColour.ColourHighlight:unbase from hscolour-1.23"
  (+ (* (+ (* x y) z) y) t))