Average Error: 0.0 → 0.0
Time: 4.4s
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 r7256760 = x;
        double r7256761 = y;
        double r7256762 = r7256760 * r7256761;
        double r7256763 = z;
        double r7256764 = t;
        double r7256765 = r7256763 * r7256764;
        double r7256766 = r7256762 + r7256765;
        return r7256766;
}
↓
double f(double x, double y, double z, double t) {
        double r7256767 = z;
        double r7256768 = t;
        double r7256769 = r7256767 * r7256768;
        double r7256770 = x;
        double r7256771 = y;
        double r7256772 = r7256770 * r7256771;
        double r7256773 = r7256769 + r7256772;
        return r7256773;
}

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 2019164 
(FPCore (x y z t)
  :name "Linear.V2:$cdot from linear-1.19.1.3, A"
  (+ (* x y) (* z t)))