Average Error: 0.0 → 0.0
Time: 9.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 r149462 = x;
        double r149463 = y;
        double r149464 = r149462 * r149463;
        double r149465 = z;
        double r149466 = t;
        double r149467 = r149465 * r149466;
        double r149468 = r149464 + r149467;
        double r149469 = a;
        double r149470 = b;
        double r149471 = r149469 * r149470;
        double r149472 = r149468 + r149471;
        return r149472;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r149473 = x;
        double r149474 = y;
        double r149475 = r149473 * r149474;
        double r149476 = z;
        double r149477 = t;
        double r149478 = r149476 * r149477;
        double r149479 = r149475 + r149478;
        double r149480 = a;
        double r149481 = b;
        double r149482 = r149480 * r149481;
        double r149483 = r149479 + r149482;
        return r149483;
}

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