Average Error: 0.0 → 0.0
Time: 637.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 r210569 = x;
        double r210570 = r210569 * r210569;
        double r210571 = y;
        double r210572 = r210571 * r210571;
        double r210573 = r210570 - r210572;
        return r210573;
}
↓
double f(double x, double y) {
        double r210574 = x;
        double r210575 = r210574 * r210574;
        double r210576 = y;
        double r210577 = r210576 * r210576;
        double r210578 = r210575 - r210577;
        return r210578;
}

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