Average Error: 0.0 → 0.0
Time: 8.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 r157558 = x;
        double r157559 = y;
        double r157560 = r157558 * r157559;
        double r157561 = z;
        double r157562 = t;
        double r157563 = r157561 * r157562;
        double r157564 = r157560 + r157563;
        double r157565 = a;
        double r157566 = b;
        double r157567 = r157565 * r157566;
        double r157568 = r157564 + r157567;
        return r157568;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r157569 = x;
        double r157570 = y;
        double r157571 = r157569 * r157570;
        double r157572 = z;
        double r157573 = t;
        double r157574 = r157572 * r157573;
        double r157575 = r157571 + r157574;
        double r157576 = a;
        double r157577 = b;
        double r157578 = r157576 * r157577;
        double r157579 = r157575 + r157578;
        return r157579;
}

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