Average Error: 0.0 → 0.0
Time: 3.3s
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 r88029 = x;
        double r88030 = y;
        double r88031 = r88029 * r88030;
        double r88032 = z;
        double r88033 = t;
        double r88034 = r88032 * r88033;
        double r88035 = r88031 + r88034;
        double r88036 = a;
        double r88037 = b;
        double r88038 = r88036 * r88037;
        double r88039 = r88035 + r88038;
        return r88039;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r88040 = x;
        double r88041 = y;
        double r88042 = r88040 * r88041;
        double r88043 = z;
        double r88044 = t;
        double r88045 = r88043 * r88044;
        double r88046 = r88042 + r88045;
        double r88047 = a;
        double r88048 = b;
        double r88049 = r88047 * r88048;
        double r88050 = r88046 + r88049;
        return r88050;
}

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