Average Error: 0.0 → 0.0
Time: 9.1s
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 r9066820 = x;
        double r9066821 = y;
        double r9066822 = r9066820 * r9066821;
        double r9066823 = z;
        double r9066824 = t;
        double r9066825 = r9066823 * r9066824;
        double r9066826 = r9066822 + r9066825;
        return r9066826;
}
↓
double f(double x, double y, double z, double t) {
        double r9066827 = z;
        double r9066828 = t;
        double r9066829 = r9066827 * r9066828;
        double r9066830 = x;
        double r9066831 = y;
        double r9066832 = r9066830 * r9066831;
        double r9066833 = r9066829 + r9066832;
        return r9066833;
}

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