Average Error: 0.0 → 0.0
Time: 13.9s
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 r96784 = x;
        double r96785 = y;
        double r96786 = r96784 * r96785;
        double r96787 = z;
        double r96788 = t;
        double r96789 = r96787 * r96788;
        double r96790 = r96786 + r96789;
        double r96791 = a;
        double r96792 = b;
        double r96793 = r96791 * r96792;
        double r96794 = r96790 + r96793;
        return r96794;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r96795 = x;
        double r96796 = y;
        double r96797 = r96795 * r96796;
        double r96798 = z;
        double r96799 = t;
        double r96800 = r96798 * r96799;
        double r96801 = r96797 + r96800;
        double r96802 = a;
        double r96803 = b;
        double r96804 = r96802 * r96803;
        double r96805 = r96801 + r96804;
        return r96805;
}

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