Average Error: 0.0 → 0.0
Time: 4.5s
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 r110729 = x;
        double r110730 = y;
        double r110731 = r110729 * r110730;
        double r110732 = z;
        double r110733 = t;
        double r110734 = r110732 * r110733;
        double r110735 = r110731 + r110734;
        double r110736 = a;
        double r110737 = b;
        double r110738 = r110736 * r110737;
        double r110739 = r110735 + r110738;
        return r110739;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r110740 = x;
        double r110741 = y;
        double r110742 = r110740 * r110741;
        double r110743 = z;
        double r110744 = t;
        double r110745 = r110743 * r110744;
        double r110746 = r110742 + r110745;
        double r110747 = a;
        double r110748 = b;
        double r110749 = r110747 * r110748;
        double r110750 = r110746 + r110749;
        return r110750;
}

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