Average Error: 0.0 → 0.0
Time: 14.7s
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 r114374 = x;
        double r114375 = r114374 * r114374;
        double r114376 = y;
        double r114377 = r114376 * r114376;
        double r114378 = r114375 - r114377;
        return r114378;
}
↓
double f(double x, double y) {
        double r114379 = x;
        double r114380 = r114379 * r114379;
        double r114381 = y;
        double r114382 = r114381 * r114381;
        double r114383 = r114380 - r114382;
        return r114383;
}

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