Average Error: 0.0 → 0.0
Time: 620.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 r154599 = x;
        double r154600 = r154599 * r154599;
        double r154601 = y;
        double r154602 = r154601 * r154601;
        double r154603 = r154600 - r154602;
        return r154603;
}
↓
double f(double x, double y) {
        double r154604 = x;
        double r154605 = r154604 * r154604;
        double r154606 = y;
        double r154607 = r154606 * r154606;
        double r154608 = r154605 - r154607;
        return r154608;
}

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