Average Error: 0.0 → 0.0
Time: 14.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 r8540671 = x;
        double r8540672 = y;
        double r8540673 = r8540671 * r8540672;
        double r8540674 = z;
        double r8540675 = t;
        double r8540676 = r8540674 * r8540675;
        double r8540677 = r8540673 + r8540676;
        return r8540677;
}
↓
double f(double x, double y, double z, double t) {
        double r8540678 = z;
        double r8540679 = t;
        double r8540680 = r8540678 * r8540679;
        double r8540681 = x;
        double r8540682 = y;
        double r8540683 = r8540681 * r8540682;
        double r8540684 = r8540680 + r8540683;
        return r8540684;
}

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