Average Error: 0.0 → 0.0
Time: 13.9s
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 r8169105 = x;
        double r8169106 = y;
        double r8169107 = r8169105 * r8169106;
        double r8169108 = z;
        double r8169109 = t;
        double r8169110 = r8169108 * r8169109;
        double r8169111 = r8169107 + r8169110;
        double r8169112 = a;
        double r8169113 = b;
        double r8169114 = r8169112 * r8169113;
        double r8169115 = r8169111 + r8169114;
        return r8169115;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r8169116 = z;
        double r8169117 = t;
        double r8169118 = r8169116 * r8169117;
        double r8169119 = x;
        double r8169120 = y;
        double r8169121 = r8169119 * r8169120;
        double r8169122 = r8169118 + r8169121;
        double r8169123 = a;
        double r8169124 = b;
        double r8169125 = r8169123 * r8169124;
        double r8169126 = r8169122 + r8169125;
        return r8169126;
}

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