Average Error: 0.0 → 0.0
Time: 15.0s
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 r145174 = x;
        double r145175 = y;
        double r145176 = r145174 * r145175;
        double r145177 = z;
        double r145178 = t;
        double r145179 = r145177 * r145178;
        double r145180 = r145176 + r145179;
        double r145181 = a;
        double r145182 = b;
        double r145183 = r145181 * r145182;
        double r145184 = r145180 + r145183;
        return r145184;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r145185 = x;
        double r145186 = y;
        double r145187 = r145185 * r145186;
        double r145188 = z;
        double r145189 = t;
        double r145190 = r145188 * r145189;
        double r145191 = r145187 + r145190;
        double r145192 = a;
        double r145193 = b;
        double r145194 = r145192 * r145193;
        double r145195 = r145191 + r145194;
        return r145195;
}

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