Average Error: 0.0 → 0.0
Time: 4.1s
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 r3975907 = x;
        double r3975908 = y;
        double r3975909 = r3975907 * r3975908;
        double r3975910 = z;
        double r3975911 = t;
        double r3975912 = r3975910 * r3975911;
        double r3975913 = r3975909 - r3975912;
        return r3975913;
}
↓
double f(double x, double y, double z, double t) {
        double r3975914 = x;
        double r3975915 = y;
        double r3975916 = r3975914 * r3975915;
        double r3975917 = z;
        double r3975918 = t;
        double r3975919 = r3975917 * r3975918;
        double r3975920 = r3975916 - r3975919;
        return r3975920;
}

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