Average Error: 0.0 → 0.0
Time: 2.4s
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 r119391 = x;
        double r119392 = y;
        double r119393 = r119391 * r119392;
        double r119394 = z;
        double r119395 = t;
        double r119396 = r119394 * r119395;
        double r119397 = r119393 + r119396;
        double r119398 = a;
        double r119399 = b;
        double r119400 = r119398 * r119399;
        double r119401 = r119397 + r119400;
        return r119401;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r119402 = x;
        double r119403 = y;
        double r119404 = r119402 * r119403;
        double r119405 = z;
        double r119406 = t;
        double r119407 = r119405 * r119406;
        double r119408 = r119404 + r119407;
        double r119409 = a;
        double r119410 = b;
        double r119411 = r119409 * r119410;
        double r119412 = r119408 + r119411;
        return r119412;
}

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