Average Error: 0.0 → 0.0
Time: 26.2s
Precision: 64
\[x \cdot y + z \cdot t\]
↓
\[y \cdot x + t \cdot z\]
x \cdot y + z \cdot t
↓
y \cdot x + t \cdot z
double f(double x, double y, double z, double t) {
        double r6662773 = x;
        double r6662774 = y;
        double r6662775 = r6662773 * r6662774;
        double r6662776 = z;
        double r6662777 = t;
        double r6662778 = r6662776 * r6662777;
        double r6662779 = r6662775 + r6662778;
        return r6662779;
}
↓
double f(double x, double y, double z, double t) {
        double r6662780 = y;
        double r6662781 = x;
        double r6662782 = r6662780 * r6662781;
        double r6662783 = t;
        double r6662784 = z;
        double r6662785 = r6662783 * r6662784;
        double r6662786 = r6662782 + r6662785;
        return r6662786;
}

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 y \cdot x + t \cdot z\]

Reproduce

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