Average Error: 0.0 → 0.0
Time: 23.0s
Precision: 64
\[x \cdot x + y \cdot y\]
↓
\[y \cdot y + x \cdot x\]
x \cdot x + y \cdot y
↓
y \cdot y + x \cdot x
double f(double x, double y) {
        double r8097440 = x;
        double r8097441 = r8097440 * r8097440;
        double r8097442 = y;
        double r8097443 = r8097442 * r8097442;
        double r8097444 = r8097441 + r8097443;
        return r8097444;
}
↓
double f(double x, double y) {
        double r8097445 = y;
        double r8097446 = r8097445 * r8097445;
        double r8097447 = x;
        double r8097448 = r8097447 * r8097447;
        double r8097449 = r8097446 + r8097448;
        return r8097449;
}

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 y \cdot y + x \cdot x\]

Reproduce

herbie shell --seed 2019200 
(FPCore (x y)
  :name "Graphics.Rasterific.Linear:$cquadrance from Rasterific-0.6.1"
  (+ (* x x) (* y y)))