Average Error: 0.0 → 0.0
Time: 659.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 r160182 = x;
        double r160183 = r160182 * r160182;
        double r160184 = y;
        double r160185 = r160184 * r160184;
        double r160186 = r160183 - r160185;
        return r160186;
}
↓
double f(double x, double y) {
        double r160187 = x;
        double r160188 = r160187 * r160187;
        double r160189 = y;
        double r160190 = r160189 * r160189;
        double r160191 = r160188 - r160190;
        return r160191;
}

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)))