Average Error: 0.0 → 0.0
Time: 2.6s
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 r90675 = x;
        double r90676 = y;
        double r90677 = r90675 * r90676;
        double r90678 = z;
        double r90679 = t;
        double r90680 = r90678 * r90679;
        double r90681 = r90677 + r90680;
        double r90682 = a;
        double r90683 = b;
        double r90684 = r90682 * r90683;
        double r90685 = r90681 + r90684;
        return r90685;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r90686 = x;
        double r90687 = y;
        double r90688 = r90686 * r90687;
        double r90689 = z;
        double r90690 = t;
        double r90691 = r90689 * r90690;
        double r90692 = r90688 + r90691;
        double r90693 = a;
        double r90694 = b;
        double r90695 = r90693 * r90694;
        double r90696 = r90692 + r90695;
        return r90696;
}

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 2020060 
(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)))