Average Error: 0.0 → 0.0
Time: 7.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 r121983 = x;
        double r121984 = y;
        double r121985 = r121983 * r121984;
        double r121986 = z;
        double r121987 = t;
        double r121988 = r121986 * r121987;
        double r121989 = r121985 + r121988;
        double r121990 = a;
        double r121991 = b;
        double r121992 = r121990 * r121991;
        double r121993 = r121989 + r121992;
        return r121993;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r121994 = x;
        double r121995 = y;
        double r121996 = r121994 * r121995;
        double r121997 = z;
        double r121998 = t;
        double r121999 = r121997 * r121998;
        double r122000 = r121996 + r121999;
        double r122001 = a;
        double r122002 = b;
        double r122003 = r122001 * r122002;
        double r122004 = r122000 + r122003;
        return r122004;
}

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 2019174 
(FPCore (x y z t a b)
  :name "Linear.V3:$cdot from linear-1.19.1.3, B"
  (+ (+ (* x y) (* z t)) (* a b)))