Average Error: 0.0 → 0.0
Time: 35.2s
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 r5764628 = x;
        double r5764629 = y;
        double r5764630 = r5764628 * r5764629;
        double r5764631 = z;
        double r5764632 = t;
        double r5764633 = r5764631 * r5764632;
        double r5764634 = r5764630 + r5764633;
        return r5764634;
}
↓
double f(double x, double y, double z, double t) {
        double r5764635 = z;
        double r5764636 = t;
        double r5764637 = r5764635 * r5764636;
        double r5764638 = x;
        double r5764639 = y;
        double r5764640 = r5764638 * r5764639;
        double r5764641 = r5764637 + r5764640;
        return r5764641;
}

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