Average Error: 0.0 → 0.0
Time: 3.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 r152353 = x;
        double r152354 = y;
        double r152355 = r152353 * r152354;
        double r152356 = z;
        double r152357 = t;
        double r152358 = r152356 * r152357;
        double r152359 = r152355 + r152358;
        double r152360 = a;
        double r152361 = b;
        double r152362 = r152360 * r152361;
        double r152363 = r152359 + r152362;
        return r152363;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r152364 = x;
        double r152365 = y;
        double r152366 = r152364 * r152365;
        double r152367 = z;
        double r152368 = t;
        double r152369 = r152367 * r152368;
        double r152370 = r152366 + r152369;
        double r152371 = a;
        double r152372 = b;
        double r152373 = r152371 * r152372;
        double r152374 = r152370 + r152373;
        return r152374;
}

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