Average Error: 0.0 → 0.0
Time: 3.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 r83351 = x;
        double r83352 = y;
        double r83353 = r83351 * r83352;
        double r83354 = z;
        double r83355 = t;
        double r83356 = r83354 * r83355;
        double r83357 = r83353 + r83356;
        double r83358 = a;
        double r83359 = b;
        double r83360 = r83358 * r83359;
        double r83361 = r83357 + r83360;
        return r83361;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r83362 = x;
        double r83363 = y;
        double r83364 = r83362 * r83363;
        double r83365 = z;
        double r83366 = t;
        double r83367 = r83365 * r83366;
        double r83368 = r83364 + r83367;
        double r83369 = a;
        double r83370 = b;
        double r83371 = r83369 * r83370;
        double r83372 = r83368 + r83371;
        return r83372;
}

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