Average Error: 0.0 → 0.0
Time: 4.3s
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 r109485 = x;
        double r109486 = y;
        double r109487 = r109485 * r109486;
        double r109488 = z;
        double r109489 = t;
        double r109490 = r109488 * r109489;
        double r109491 = r109487 + r109490;
        double r109492 = a;
        double r109493 = b;
        double r109494 = r109492 * r109493;
        double r109495 = r109491 + r109494;
        return r109495;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r109496 = x;
        double r109497 = y;
        double r109498 = r109496 * r109497;
        double r109499 = z;
        double r109500 = t;
        double r109501 = r109499 * r109500;
        double r109502 = r109498 + r109501;
        double r109503 = a;
        double r109504 = b;
        double r109505 = r109503 * r109504;
        double r109506 = r109502 + r109505;
        return r109506;
}

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