Average Error: 0.0 → 0.0
Time: 10.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 r88340 = x;
        double r88341 = y;
        double r88342 = r88340 * r88341;
        double r88343 = z;
        double r88344 = t;
        double r88345 = r88343 * r88344;
        double r88346 = r88342 + r88345;
        double r88347 = a;
        double r88348 = b;
        double r88349 = r88347 * r88348;
        double r88350 = r88346 + r88349;
        return r88350;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r88351 = x;
        double r88352 = y;
        double r88353 = r88351 * r88352;
        double r88354 = z;
        double r88355 = t;
        double r88356 = r88354 * r88355;
        double r88357 = r88353 + r88356;
        double r88358 = a;
        double r88359 = b;
        double r88360 = r88358 * r88359;
        double r88361 = r88357 + r88360;
        return r88361;
}

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