Average Error: 0.0 → 0.0
Time: 629.0ms
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 r252473 = x;
        double r252474 = r252473 * r252473;
        double r252475 = y;
        double r252476 = r252475 * r252475;
        double r252477 = r252474 - r252476;
        return r252477;
}
↓
double f(double x, double y) {
        double r252478 = x;
        double r252479 = r252478 * r252478;
        double r252480 = y;
        double r252481 = r252480 * r252480;
        double r252482 = r252479 - r252481;
        return r252482;
}

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 2020062 
(FPCore (x y)
  :name "Examples.Basics.BasicTests:f2 from sbv-4.4"
  :precision binary64
  (- (* x x) (* y y)))