Average Error: 0.0 → 0.0
Time: 6.6s
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 r82306 = x;
        double r82307 = y;
        double r82308 = r82306 * r82307;
        double r82309 = z;
        double r82310 = t;
        double r82311 = r82309 * r82310;
        double r82312 = r82308 + r82311;
        return r82312;
}
↓
double f(double x, double y, double z, double t) {
        double r82313 = x;
        double r82314 = y;
        double r82315 = r82313 * r82314;
        double r82316 = z;
        double r82317 = t;
        double r82318 = r82316 * r82317;
        double r82319 = r82315 + r82318;
        return r82319;
}

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