Average Error: 0.0 → 0.0
Time: 8.2s
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 r30314332 = x;
        double r30314333 = r30314332 * r30314332;
        double r30314334 = y;
        double r30314335 = r30314334 * r30314334;
        double r30314336 = r30314333 - r30314335;
        return r30314336;
}
↓
double f(double x, double y) {
        double r30314337 = x;
        double r30314338 = r30314337 * r30314337;
        double r30314339 = y;
        double r30314340 = r30314339 * r30314339;
        double r30314341 = r30314338 - r30314340;
        return r30314341;
}

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