Average Error: 0.0 → 0.0
Time: 7.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 r141035 = x;
        double r141036 = y;
        double r141037 = r141035 * r141036;
        double r141038 = z;
        double r141039 = t;
        double r141040 = r141038 * r141039;
        double r141041 = r141037 + r141040;
        double r141042 = a;
        double r141043 = b;
        double r141044 = r141042 * r141043;
        double r141045 = r141041 + r141044;
        return r141045;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r141046 = x;
        double r141047 = y;
        double r141048 = r141046 * r141047;
        double r141049 = z;
        double r141050 = t;
        double r141051 = r141049 * r141050;
        double r141052 = r141048 + r141051;
        double r141053 = a;
        double r141054 = b;
        double r141055 = r141053 * r141054;
        double r141056 = r141052 + r141055;
        return r141056;
}

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