Average Error: 0.0 → 0.0
Time: 11.2s
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 r109026 = x;
        double r109027 = y;
        double r109028 = r109026 * r109027;
        double r109029 = z;
        double r109030 = t;
        double r109031 = r109029 * r109030;
        double r109032 = r109028 + r109031;
        double r109033 = a;
        double r109034 = b;
        double r109035 = r109033 * r109034;
        double r109036 = r109032 + r109035;
        return r109036;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r109037 = x;
        double r109038 = y;
        double r109039 = r109037 * r109038;
        double r109040 = z;
        double r109041 = t;
        double r109042 = r109040 * r109041;
        double r109043 = r109039 + r109042;
        double r109044 = a;
        double r109045 = b;
        double r109046 = r109044 * r109045;
        double r109047 = r109043 + r109046;
        return r109047;
}

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