Average Error: 0.0 → 0.0
Time: 1.2s
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 r94169 = x;
        double r94170 = y;
        double r94171 = r94169 * r94170;
        double r94172 = z;
        double r94173 = t;
        double r94174 = r94172 * r94173;
        double r94175 = r94171 + r94174;
        return r94175;
}
↓
double f(double x, double y, double z, double t) {
        double r94176 = x;
        double r94177 = y;
        double r94178 = r94176 * r94177;
        double r94179 = z;
        double r94180 = t;
        double r94181 = r94179 * r94180;
        double r94182 = r94178 + r94181;
        return r94182;
}

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