Average Error: 0.0 → 0.0
Time: 8.2s
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 r120686 = x;
        double r120687 = y;
        double r120688 = r120686 * r120687;
        double r120689 = z;
        double r120690 = t;
        double r120691 = r120689 * r120690;
        double r120692 = r120688 + r120691;
        double r120693 = a;
        double r120694 = b;
        double r120695 = r120693 * r120694;
        double r120696 = r120692 + r120695;
        return r120696;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r120697 = x;
        double r120698 = y;
        double r120699 = r120697 * r120698;
        double r120700 = z;
        double r120701 = t;
        double r120702 = r120700 * r120701;
        double r120703 = r120699 + r120702;
        double r120704 = a;
        double r120705 = b;
        double r120706 = r120704 * r120705;
        double r120707 = r120703 + r120706;
        return r120707;
}

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