Average Error: 0.0 → 0.0
Time: 11.1s
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 r98815 = x;
        double r98816 = y;
        double r98817 = r98815 * r98816;
        double r98818 = z;
        double r98819 = t;
        double r98820 = r98818 * r98819;
        double r98821 = r98817 + r98820;
        double r98822 = a;
        double r98823 = b;
        double r98824 = r98822 * r98823;
        double r98825 = r98821 + r98824;
        return r98825;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r98826 = x;
        double r98827 = y;
        double r98828 = r98826 * r98827;
        double r98829 = z;
        double r98830 = t;
        double r98831 = r98829 * r98830;
        double r98832 = r98828 + r98831;
        double r98833 = a;
        double r98834 = b;
        double r98835 = r98833 * r98834;
        double r98836 = r98832 + r98835;
        return r98836;
}

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