Average Error: 0.0 → 0.0
Time: 8.1s
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 r111535 = x;
        double r111536 = y;
        double r111537 = r111535 * r111536;
        double r111538 = z;
        double r111539 = t;
        double r111540 = r111538 * r111539;
        double r111541 = r111537 + r111540;
        double r111542 = a;
        double r111543 = b;
        double r111544 = r111542 * r111543;
        double r111545 = r111541 + r111544;
        return r111545;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r111546 = x;
        double r111547 = y;
        double r111548 = r111546 * r111547;
        double r111549 = z;
        double r111550 = t;
        double r111551 = r111549 * r111550;
        double r111552 = r111548 + r111551;
        double r111553 = a;
        double r111554 = b;
        double r111555 = r111553 * r111554;
        double r111556 = r111552 + r111555;
        return r111556;
}

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