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 r190775 = x;
        double r190776 = y;
        double r190777 = r190775 * r190776;
        double r190778 = z;
        double r190779 = t;
        double r190780 = r190778 * r190779;
        double r190781 = r190777 + r190780;
        double r190782 = a;
        double r190783 = b;
        double r190784 = r190782 * r190783;
        double r190785 = r190781 + r190784;
        return r190785;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r190786 = x;
        double r190787 = y;
        double r190788 = r190786 * r190787;
        double r190789 = z;
        double r190790 = t;
        double r190791 = r190789 * r190790;
        double r190792 = r190788 + r190791;
        double r190793 = a;
        double r190794 = b;
        double r190795 = r190793 * r190794;
        double r190796 = r190792 + r190795;
        return r190796;
}

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