Average Error: 0.0 → 0.0
Time: 5.1s
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 r117984 = x;
        double r117985 = r117984 * r117984;
        double r117986 = y;
        double r117987 = r117986 * r117986;
        double r117988 = r117985 - r117987;
        return r117988;
}
↓
double f(double x, double y) {
        double r117989 = x;
        double r117990 = r117989 * r117989;
        double r117991 = y;
        double r117992 = r117991 * r117991;
        double r117993 = r117990 - r117992;
        return r117993;
}

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