Average Error: 0.0 → 0.0
Time: 8.0s
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 r105478 = x;
        double r105479 = r105478 * r105478;
        double r105480 = y;
        double r105481 = r105480 * r105480;
        double r105482 = r105479 - r105481;
        return r105482;
}
↓
double f(double x, double y) {
        double r105483 = x;
        double r105484 = r105483 * r105483;
        double r105485 = y;
        double r105486 = r105485 * r105485;
        double r105487 = r105484 - r105486;
        return r105487;
}

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)))