Average Error: 0.0 → 0.0
Time: 13.3s
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 r8619845 = x;
        double r8619846 = y;
        double r8619847 = r8619845 * r8619846;
        double r8619848 = z;
        double r8619849 = t;
        double r8619850 = r8619848 * r8619849;
        double r8619851 = r8619847 + r8619850;
        double r8619852 = a;
        double r8619853 = b;
        double r8619854 = r8619852 * r8619853;
        double r8619855 = r8619851 + r8619854;
        return r8619855;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r8619856 = z;
        double r8619857 = t;
        double r8619858 = r8619856 * r8619857;
        double r8619859 = x;
        double r8619860 = y;
        double r8619861 = r8619859 * r8619860;
        double r8619862 = r8619858 + r8619861;
        double r8619863 = a;
        double r8619864 = b;
        double r8619865 = r8619863 * r8619864;
        double r8619866 = r8619862 + r8619865;
        return r8619866;
}

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