Average Error: 0.0 → 0.0
Time: 9.5s
Precision: 64
\[\left(x \cdot y + z \cdot t\right) + a \cdot b\]
↓
\[\left(z \cdot t + x \cdot y\right) + a \cdot b\]
\left(x \cdot y + z \cdot t\right) + a \cdot b
↓
\left(z \cdot t + x \cdot y\right) + a \cdot b
double f(double x, double y, double z, double t, double a, double b) {
        double r9492021 = x;
        double r9492022 = y;
        double r9492023 = r9492021 * r9492022;
        double r9492024 = z;
        double r9492025 = t;
        double r9492026 = r9492024 * r9492025;
        double r9492027 = r9492023 + r9492026;
        double r9492028 = a;
        double r9492029 = b;
        double r9492030 = r9492028 * r9492029;
        double r9492031 = r9492027 + r9492030;
        return r9492031;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r9492032 = z;
        double r9492033 = t;
        double r9492034 = r9492032 * r9492033;
        double r9492035 = x;
        double r9492036 = y;
        double r9492037 = r9492035 * r9492036;
        double r9492038 = r9492034 + r9492037;
        double r9492039 = a;
        double r9492040 = b;
        double r9492041 = r9492039 * r9492040;
        double r9492042 = r9492038 + r9492041;
        return r9492042;
}

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(z \cdot t + x \cdot y\right) + a \cdot b\]

Reproduce

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