Average Error: 0.0 → 0.0
Time: 580.0ms
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 r170123 = x;
        double r170124 = y;
        double r170125 = r170123 * r170124;
        double r170126 = z;
        double r170127 = t;
        double r170128 = r170126 * r170127;
        double r170129 = r170125 - r170128;
        return r170129;
}
↓
double f(double x, double y, double z, double t) {
        double r170130 = x;
        double r170131 = y;
        double r170132 = r170130 * r170131;
        double r170133 = z;
        double r170134 = t;
        double r170135 = r170133 * r170134;
        double r170136 = r170132 - r170135;
        return r170136;
}

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 2020062 +o rules:numerics
(FPCore (x y z t)
  :name "Linear.V3:cross from linear-1.19.1.3"
  :precision binary64
  (- (* x y) (* z t)))