Average Error: 0.0 → 0.0
Time: 4.3s
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 r170042 = x;
        double r170043 = y;
        double r170044 = r170042 * r170043;
        double r170045 = z;
        double r170046 = t;
        double r170047 = r170045 * r170046;
        double r170048 = r170044 + r170047;
        double r170049 = a;
        double r170050 = b;
        double r170051 = r170049 * r170050;
        double r170052 = r170048 + r170051;
        return r170052;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r170053 = x;
        double r170054 = y;
        double r170055 = r170053 * r170054;
        double r170056 = z;
        double r170057 = t;
        double r170058 = r170056 * r170057;
        double r170059 = r170055 + r170058;
        double r170060 = a;
        double r170061 = b;
        double r170062 = r170060 * r170061;
        double r170063 = r170059 + r170062;
        return r170063;
}

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