Average Error: 0.0 → 0.0
Time: 13.1s
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 r115094 = x;
        double r115095 = r115094 * r115094;
        double r115096 = y;
        double r115097 = r115096 * r115096;
        double r115098 = r115095 - r115097;
        return r115098;
}
↓
double f(double x, double y) {
        double r115099 = x;
        double r115100 = r115099 * r115099;
        double r115101 = y;
        double r115102 = r115101 * r115101;
        double r115103 = r115100 - r115102;
        return r115103;
}

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