Average Error: 0.0 → 0.0
Time: 4.2s
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 r61550 = x;
        double r61551 = y;
        double r61552 = r61550 * r61551;
        double r61553 = z;
        double r61554 = t;
        double r61555 = r61553 * r61554;
        double r61556 = r61552 + r61555;
        double r61557 = a;
        double r61558 = b;
        double r61559 = r61557 * r61558;
        double r61560 = r61556 + r61559;
        return r61560;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r61561 = x;
        double r61562 = y;
        double r61563 = r61561 * r61562;
        double r61564 = z;
        double r61565 = t;
        double r61566 = r61564 * r61565;
        double r61567 = r61563 + r61566;
        double r61568 = a;
        double r61569 = b;
        double r61570 = r61568 * r61569;
        double r61571 = r61567 + r61570;
        return r61571;
}

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