Average Error: 0.0 → 0.0
Time: 1.7s
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 r85981 = x;
        double r85982 = y;
        double r85983 = r85981 * r85982;
        double r85984 = z;
        double r85985 = t;
        double r85986 = r85984 * r85985;
        double r85987 = r85983 + r85986;
        double r85988 = a;
        double r85989 = b;
        double r85990 = r85988 * r85989;
        double r85991 = r85987 + r85990;
        return r85991;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r85992 = x;
        double r85993 = y;
        double r85994 = r85992 * r85993;
        double r85995 = z;
        double r85996 = t;
        double r85997 = r85995 * r85996;
        double r85998 = r85994 + r85997;
        double r85999 = a;
        double r86000 = b;
        double r86001 = r85999 * r86000;
        double r86002 = r85998 + r86001;
        return r86002;
}

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