Average Error: 0.0 → 0.0
Time: 7.3s
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 r90533 = x;
        double r90534 = y;
        double r90535 = r90533 * r90534;
        double r90536 = z;
        double r90537 = t;
        double r90538 = r90536 * r90537;
        double r90539 = r90535 + r90538;
        return r90539;
}
↓
double f(double x, double y, double z, double t) {
        double r90540 = z;
        double r90541 = t;
        double r90542 = r90540 * r90541;
        double r90543 = x;
        double r90544 = y;
        double r90545 = r90543 * r90544;
        double r90546 = r90542 + r90545;
        return r90546;
}

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