Average Error: 0.0 → 0.0
Time: 11.7s
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 r89535 = x;
        double r89536 = y;
        double r89537 = r89535 * r89536;
        double r89538 = z;
        double r89539 = t;
        double r89540 = r89538 * r89539;
        double r89541 = r89537 + r89540;
        double r89542 = a;
        double r89543 = b;
        double r89544 = r89542 * r89543;
        double r89545 = r89541 + r89544;
        return r89545;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r89546 = x;
        double r89547 = y;
        double r89548 = r89546 * r89547;
        double r89549 = z;
        double r89550 = t;
        double r89551 = r89549 * r89550;
        double r89552 = r89548 + r89551;
        double r89553 = a;
        double r89554 = b;
        double r89555 = r89553 * r89554;
        double r89556 = r89552 + r89555;
        return r89556;
}

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