Average Error: 0.0 → 0.0
Time: 9.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 r129596 = x;
        double r129597 = y;
        double r129598 = r129596 * r129597;
        double r129599 = z;
        double r129600 = t;
        double r129601 = r129599 * r129600;
        double r129602 = r129598 + r129601;
        double r129603 = a;
        double r129604 = b;
        double r129605 = r129603 * r129604;
        double r129606 = r129602 + r129605;
        return r129606;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r129607 = x;
        double r129608 = y;
        double r129609 = r129607 * r129608;
        double r129610 = z;
        double r129611 = t;
        double r129612 = r129610 * r129611;
        double r129613 = r129609 + r129612;
        double r129614 = a;
        double r129615 = b;
        double r129616 = r129614 * r129615;
        double r129617 = r129613 + r129616;
        return r129617;
}

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