Average Error: 0.0 → 0.0
Time: 6.8s
Precision: 64
\[\left(x \cdot y + z \cdot t\right) + a \cdot b\]
↓
\[\left(x \cdot y + z \cdot t\right) + a \cdot b\]
\left(x \cdot y + z \cdot t\right) + a \cdot b
↓
\left(x \cdot y + z \cdot t\right) + a \cdot b
double f(double x, double y, double z, double t, double a, double b) {
        double r146751 = x;
        double r146752 = y;
        double r146753 = r146751 * r146752;
        double r146754 = z;
        double r146755 = t;
        double r146756 = r146754 * r146755;
        double r146757 = r146753 + r146756;
        double r146758 = a;
        double r146759 = b;
        double r146760 = r146758 * r146759;
        double r146761 = r146757 + r146760;
        return r146761;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r146762 = x;
        double r146763 = y;
        double r146764 = r146762 * r146763;
        double r146765 = z;
        double r146766 = t;
        double r146767 = r146765 * r146766;
        double r146768 = r146764 + r146767;
        double r146769 = a;
        double r146770 = b;
        double r146771 = r146769 * r146770;
        double r146772 = r146768 + r146771;
        return r146772;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Bits error versus t

Bits error versus a

Bits error versus b

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\left(x \cdot y + z \cdot t\right) + a \cdot b\]

  2. Final simplification0.0

    \[\leadsto \left(x \cdot y + z \cdot t\right) + a \cdot b\]

Reproduce

herbie shell --seed 2019347 
(FPCore (x y z t a b)
  :name "Linear.V3:$cdot from linear-1.19.1.3, B"
  :precision binary64
  (+ (+ (* x y) (* z t)) (* a b)))