Average Error: 0.0 → 0.0
Time: 7.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 r8111782 = x;
        double r8111783 = y;
        double r8111784 = r8111782 * r8111783;
        double r8111785 = z;
        double r8111786 = t;
        double r8111787 = r8111785 * r8111786;
        double r8111788 = r8111784 + r8111787;
        return r8111788;
}
↓
double f(double x, double y, double z, double t) {
        double r8111789 = z;
        double r8111790 = t;
        double r8111791 = r8111789 * r8111790;
        double r8111792 = x;
        double r8111793 = y;
        double r8111794 = r8111792 * r8111793;
        double r8111795 = r8111791 + r8111794;
        return r8111795;
}

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