Average Error: 0.0 → 0.0
Time: 10.9s
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 r113635 = x;
        double r113636 = y;
        double r113637 = r113635 * r113636;
        double r113638 = z;
        double r113639 = t;
        double r113640 = r113638 * r113639;
        double r113641 = r113637 + r113640;
        double r113642 = a;
        double r113643 = b;
        double r113644 = r113642 * r113643;
        double r113645 = r113641 + r113644;
        return r113645;
}

double f(double x, double y, double z, double t, double a, double b) {
        double r113646 = x;
        double r113647 = y;
        double r113648 = r113646 * r113647;
        double r113649 = z;
        double r113650 = t;
        double r113651 = r113649 * r113650;
        double r113652 = r113648 + r113651;
        double r113653 = a;
        double r113654 = b;
        double r113655 = r113653 * r113654;
        double r113656 = r113652 + r113655;
        return r113656;
}

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 2019198 
(FPCore (x y z t a b)
  :name "Linear.V3:$cdot from linear-1.19.1.3, B"
  (+ (+ (* x y) (* z t)) (* a b)))