Average Error: 0.0 → 0.0
Time: 5.1s
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 r163345 = x;
        double r163346 = y;
        double r163347 = r163345 * r163346;
        double r163348 = z;
        double r163349 = t;
        double r163350 = r163348 * r163349;
        double r163351 = r163347 + r163350;
        double r163352 = a;
        double r163353 = b;
        double r163354 = r163352 * r163353;
        double r163355 = r163351 + r163354;
        return r163355;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r163356 = x;
        double r163357 = y;
        double r163358 = r163356 * r163357;
        double r163359 = z;
        double r163360 = t;
        double r163361 = r163359 * r163360;
        double r163362 = r163358 + r163361;
        double r163363 = a;
        double r163364 = b;
        double r163365 = r163363 * r163364;
        double r163366 = r163362 + r163365;
        return r163366;
}

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