Average Error: 0.0 → 0.0
Time: 6.0s
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 r140275 = x;
        double r140276 = y;
        double r140277 = r140275 * r140276;
        double r140278 = z;
        double r140279 = t;
        double r140280 = r140278 * r140279;
        double r140281 = r140277 + r140280;
        double r140282 = a;
        double r140283 = b;
        double r140284 = r140282 * r140283;
        double r140285 = r140281 + r140284;
        return r140285;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r140286 = x;
        double r140287 = y;
        double r140288 = r140286 * r140287;
        double r140289 = z;
        double r140290 = t;
        double r140291 = r140289 * r140290;
        double r140292 = r140288 + r140291;
        double r140293 = a;
        double r140294 = b;
        double r140295 = r140293 * r140294;
        double r140296 = r140292 + r140295;
        return r140296;
}

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