Average Error: 0.0 → 0.0
Time: 8.7s
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 r141413 = x;
        double r141414 = y;
        double r141415 = r141413 * r141414;
        double r141416 = z;
        double r141417 = t;
        double r141418 = r141416 * r141417;
        double r141419 = r141415 + r141418;
        double r141420 = a;
        double r141421 = b;
        double r141422 = r141420 * r141421;
        double r141423 = r141419 + r141422;
        return r141423;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r141424 = x;
        double r141425 = y;
        double r141426 = r141424 * r141425;
        double r141427 = z;
        double r141428 = t;
        double r141429 = r141427 * r141428;
        double r141430 = r141426 + r141429;
        double r141431 = a;
        double r141432 = b;
        double r141433 = r141431 * r141432;
        double r141434 = r141430 + r141433;
        return r141434;
}

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