Average Error: 0.0 → 0.0
Time: 13.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 r111919 = x;
        double r111920 = y;
        double r111921 = r111919 * r111920;
        double r111922 = z;
        double r111923 = t;
        double r111924 = r111922 * r111923;
        double r111925 = r111921 + r111924;
        double r111926 = a;
        double r111927 = b;
        double r111928 = r111926 * r111927;
        double r111929 = r111925 + r111928;
        return r111929;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r111930 = x;
        double r111931 = y;
        double r111932 = r111930 * r111931;
        double r111933 = z;
        double r111934 = t;
        double r111935 = r111933 * r111934;
        double r111936 = r111932 + r111935;
        double r111937 = a;
        double r111938 = b;
        double r111939 = r111937 * r111938;
        double r111940 = r111936 + r111939;
        return r111940;
}

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