Average Error: 0.0 → 0.0
Time: 9.3s
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 r125867 = x;
        double r125868 = y;
        double r125869 = r125867 * r125868;
        double r125870 = z;
        double r125871 = t;
        double r125872 = r125870 * r125871;
        double r125873 = r125869 + r125872;
        return r125873;
}
↓
double f(double x, double y, double z, double t) {
        double r125874 = x;
        double r125875 = y;
        double r125876 = r125874 * r125875;
        double r125877 = z;
        double r125878 = t;
        double r125879 = r125877 * r125878;
        double r125880 = r125876 + r125879;
        return r125880;
}

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