Average Error: 0.0 → 0.0
Time: 12.6s
Precision: 64
\[x \cdot x - y \cdot y\]
↓
\[x \cdot x - y \cdot y\]
x \cdot x - y \cdot y
↓
x \cdot x - y \cdot y
double f(double x, double y) {
        double r21541419 = x;
        double r21541420 = r21541419 * r21541419;
        double r21541421 = y;
        double r21541422 = r21541421 * r21541421;
        double r21541423 = r21541420 - r21541422;
        return r21541423;
}
↓
double f(double x, double y) {
        double r21541424 = x;
        double r21541425 = r21541424 * r21541424;
        double r21541426 = y;
        double r21541427 = r21541426 * r21541426;
        double r21541428 = r21541425 - r21541427;
        return r21541428;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[x \cdot x - y \cdot y\]

  2. Final simplification0.0

    \[\leadsto x \cdot x - y \cdot y\]

Reproduce

herbie shell --seed 2019173 +o rules:numerics
(FPCore (x y)
  :name "Examples.Basics.BasicTests:f2 from sbv-4.4"
  (- (* x x) (* y y)))