Average Error: 0.0 → 0.0
Time: 8.2s
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 r6886535 = x;
        double r6886536 = y;
        double r6886537 = r6886535 * r6886536;
        double r6886538 = z;
        double r6886539 = t;
        double r6886540 = r6886538 * r6886539;
        double r6886541 = r6886537 - r6886540;
        return r6886541;
}
↓
double f(double x, double y, double z, double t) {
        double r6886542 = x;
        double r6886543 = y;
        double r6886544 = r6886542 * r6886543;
        double r6886545 = z;
        double r6886546 = t;
        double r6886547 = r6886545 * r6886546;
        double r6886548 = r6886544 - r6886547;
        return r6886548;
}

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