Average Error: 0.0 → 0.0
Time: 8.9s
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 r13782192 = x;
        double r13782193 = r13782192 * r13782192;
        double r13782194 = y;
        double r13782195 = r13782194 * r13782194;
        double r13782196 = r13782193 - r13782195;
        return r13782196;
}
↓
double f(double x, double y) {
        double r13782197 = x;
        double r13782198 = r13782197 * r13782197;
        double r13782199 = y;
        double r13782200 = r13782199 * r13782199;
        double r13782201 = r13782198 - r13782200;
        return r13782201;
}

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