Average Error: 0.0 → 0.0
Time: 15.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 r107205 = x;
        double r107206 = y;
        double r107207 = r107205 * r107206;
        double r107208 = z;
        double r107209 = t;
        double r107210 = r107208 * r107209;
        double r107211 = r107207 + r107210;
        double r107212 = a;
        double r107213 = b;
        double r107214 = r107212 * r107213;
        double r107215 = r107211 + r107214;
        return r107215;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r107216 = x;
        double r107217 = y;
        double r107218 = r107216 * r107217;
        double r107219 = z;
        double r107220 = t;
        double r107221 = r107219 * r107220;
        double r107222 = r107218 + r107221;
        double r107223 = a;
        double r107224 = b;
        double r107225 = r107223 * r107224;
        double r107226 = r107222 + r107225;
        return r107226;
}

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. Simplified0.0

    \[\leadsto \color{blue}{\left(z \cdot t + x \cdot y\right) + a \cdot b}\]

  3. Final simplification0.0

    \[\leadsto \left(x \cdot y + z \cdot t\right) + a \cdot b\]

Reproduce

herbie shell --seed 2019196 
(FPCore (x y z t a b)
  :name "Linear.V3:$cdot from linear-1.19.1.3, B"
  (+ (+ (* x y) (* z t)) (* a b)))