Average Error: 0.0 → 0.0
Time: 14.8s
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 r6268813 = x;
        double r6268814 = y;
        double r6268815 = r6268813 * r6268814;
        double r6268816 = z;
        double r6268817 = t;
        double r6268818 = r6268816 * r6268817;
        double r6268819 = r6268815 + r6268818;
        return r6268819;
}
↓
double f(double x, double y, double z, double t) {
        double r6268820 = z;
        double r6268821 = t;
        double r6268822 = r6268820 * r6268821;
        double r6268823 = x;
        double r6268824 = y;
        double r6268825 = r6268823 * r6268824;
        double r6268826 = r6268822 + r6268825;
        return r6268826;
}

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