Average Error: 0.0 → 0.0
Time: 10.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 r8439796 = x;
        double r8439797 = y;
        double r8439798 = r8439796 * r8439797;
        double r8439799 = z;
        double r8439800 = t;
        double r8439801 = r8439799 * r8439800;
        double r8439802 = r8439798 + r8439801;
        return r8439802;
}
↓
double f(double x, double y, double z, double t) {
        double r8439803 = z;
        double r8439804 = t;
        double r8439805 = r8439803 * r8439804;
        double r8439806 = x;
        double r8439807 = y;
        double r8439808 = r8439806 * r8439807;
        double r8439809 = r8439805 + r8439808;
        return r8439809;
}

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