Average Error: 0.0 → 0.0
Time: 10.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 r8459237 = x;
        double r8459238 = r8459237 * r8459237;
        double r8459239 = y;
        double r8459240 = r8459239 * r8459239;
        double r8459241 = r8459238 - r8459240;
        return r8459241;
}
↓
double f(double x, double y) {
        double r8459242 = x;
        double r8459243 = r8459242 * r8459242;
        double r8459244 = y;
        double r8459245 = r8459244 * r8459244;
        double r8459246 = r8459243 - r8459245;
        return r8459246;
}

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