Average Error: 0.0 → 0.0
Time: 7.5s
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 r153660 = x;
        double r153661 = y;
        double r153662 = r153660 * r153661;
        double r153663 = z;
        double r153664 = t;
        double r153665 = r153663 * r153664;
        double r153666 = r153662 + r153665;
        return r153666;
}
↓
double f(double x, double y, double z, double t) {
        double r153667 = x;
        double r153668 = y;
        double r153669 = r153667 * r153668;
        double r153670 = z;
        double r153671 = t;
        double r153672 = r153670 * r153671;
        double r153673 = r153669 + r153672;
        return r153673;
}

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