Average Error: 0.0 → 0.0
Time: 41.5s
Precision: 64
\[x \cdot y - z \cdot t\]
↓
\[y \cdot x - t \cdot z\]
x \cdot y - z \cdot t
↓
y \cdot x - t \cdot z
double f(double x, double y, double z, double t) {
        double r7204122 = x;
        double r7204123 = y;
        double r7204124 = r7204122 * r7204123;
        double r7204125 = z;
        double r7204126 = t;
        double r7204127 = r7204125 * r7204126;
        double r7204128 = r7204124 - r7204127;
        return r7204128;
}
↓
double f(double x, double y, double z, double t) {
        double r7204129 = y;
        double r7204130 = x;
        double r7204131 = r7204129 * r7204130;
        double r7204132 = t;
        double r7204133 = z;
        double r7204134 = r7204132 * r7204133;
        double r7204135 = r7204131 - r7204134;
        return r7204135;
}

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 y \cdot x - t \cdot z\]

Reproduce

herbie shell --seed 2019200 
(FPCore (x y z t)
  :name "Linear.V3:cross from linear-1.19.1.3"
  (- (* x y) (* z t)))