Average Error: 0.0 → 0.0
Time: 16.7s
Precision: 64
\[x \cdot y + z \cdot t\]
↓
\[z \cdot t + x \cdot y\]
x \cdot y + z \cdot t
↓
z \cdot t + x \cdot y
double f(double x, double y, double z, double t) {
        double r5195868 = x;
        double r5195869 = y;
        double r5195870 = r5195868 * r5195869;
        double r5195871 = z;
        double r5195872 = t;
        double r5195873 = r5195871 * r5195872;
        double r5195874 = r5195870 + r5195873;
        return r5195874;
}
↓
double f(double x, double y, double z, double t) {
        double r5195875 = z;
        double r5195876 = t;
        double r5195877 = r5195875 * r5195876;
        double r5195878 = x;
        double r5195879 = y;
        double r5195880 = r5195878 * r5195879;
        double r5195881 = r5195877 + r5195880;
        return r5195881;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Bits error versus t

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[x \cdot y + z \cdot t\]

  2. Final simplification0.0

    \[\leadsto z \cdot t + x \cdot y\]

Reproduce

herbie shell --seed 2019168 
(FPCore (x y z t)
  :name "Linear.V2:$cdot from linear-1.19.1.3, A"
  (+ (* x y) (* z t)))