Average Error: 0.0 → 0.0
Time: 638.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 r151858 = x;
        double r151859 = r151858 * r151858;
        double r151860 = y;
        double r151861 = r151860 * r151860;
        double r151862 = r151859 - r151861;
        return r151862;
}
↓
double f(double x, double y) {
        double r151863 = x;
        double r151864 = r151863 * r151863;
        double r151865 = y;
        double r151866 = r151865 * r151865;
        double r151867 = r151864 - r151866;
        return r151867;
}

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