Average Error: 0.0 → 0.0
Time: 615.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 r142082 = x;
        double r142083 = r142082 * r142082;
        double r142084 = y;
        double r142085 = r142084 * r142084;
        double r142086 = r142083 - r142085;
        return r142086;
}
↓
double f(double x, double y) {
        double r142087 = x;
        double r142088 = r142087 * r142087;
        double r142089 = y;
        double r142090 = r142089 * r142089;
        double r142091 = r142088 - r142090;
        return r142091;
}

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