Average Error: 0.0 → 0.0
Time: 8.5s
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 r113350 = x;
        double r113351 = y;
        double r113352 = r113350 * r113351;
        double r113353 = z;
        double r113354 = t;
        double r113355 = r113353 * r113354;
        double r113356 = r113352 + r113355;
        double r113357 = a;
        double r113358 = b;
        double r113359 = r113357 * r113358;
        double r113360 = r113356 + r113359;
        return r113360;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r113361 = x;
        double r113362 = y;
        double r113363 = r113361 * r113362;
        double r113364 = z;
        double r113365 = t;
        double r113366 = r113364 * r113365;
        double r113367 = r113363 + r113366;
        double r113368 = a;
        double r113369 = b;
        double r113370 = r113368 * r113369;
        double r113371 = r113367 + r113370;
        return r113371;
}

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