Average Error: 0.0 → 0.0
Time: 7.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 r109587 = x;
        double r109588 = y;
        double r109589 = r109587 * r109588;
        double r109590 = z;
        double r109591 = t;
        double r109592 = r109590 * r109591;
        double r109593 = r109589 + r109592;
        double r109594 = a;
        double r109595 = b;
        double r109596 = r109594 * r109595;
        double r109597 = r109593 + r109596;
        return r109597;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r109598 = x;
        double r109599 = y;
        double r109600 = r109598 * r109599;
        double r109601 = z;
        double r109602 = t;
        double r109603 = r109601 * r109602;
        double r109604 = r109600 + r109603;
        double r109605 = a;
        double r109606 = b;
        double r109607 = r109605 * r109606;
        double r109608 = r109604 + r109607;
        return r109608;
}

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. Simplified0.0

    \[\leadsto \color{blue}{\left(z \cdot t + x \cdot y\right) + a \cdot b}\]

  3. Final simplification0.0

    \[\leadsto \left(x \cdot y + z \cdot t\right) + a \cdot b\]

Reproduce

herbie shell --seed 2019194 
(FPCore (x y z t a b)
  :name "Linear.V3:$cdot from linear-1.19.1.3, B"
  (+ (+ (* x y) (* z t)) (* a b)))