Average Error: 0.0 → 0.0
Time: 1.7s
Precision: 64
\[x \cdot y + z \cdot t\]
↓
\[x \cdot y + z \cdot t\]
x \cdot y + z \cdot t
↓
x \cdot y + z \cdot t
double f(double x, double y, double z, double t) {
        double r153669 = x;
        double r153670 = y;
        double r153671 = r153669 * r153670;
        double r153672 = z;
        double r153673 = t;
        double r153674 = r153672 * r153673;
        double r153675 = r153671 + r153674;
        return r153675;
}
↓
double f(double x, double y, double z, double t) {
        double r153676 = x;
        double r153677 = y;
        double r153678 = r153676 * r153677;
        double r153679 = z;
        double r153680 = t;
        double r153681 = r153679 * r153680;
        double r153682 = r153678 + r153681;
        return r153682;
}

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 x \cdot y + z \cdot t\]

Reproduce

herbie shell --seed 2020025 
(FPCore (x y z t)
  :name "Linear.V2:$cdot from linear-1.19.1.3, A"
  :precision binary64
  (+ (* x y) (* z t)))