Average Error: 0.0 → 0.0
Time: 20.3s
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 r7376005 = x;
        double r7376006 = r7376005 * r7376005;
        double r7376007 = y;
        double r7376008 = r7376007 * r7376007;
        double r7376009 = r7376006 + r7376008;
        return r7376009;
}
↓
double f(double x, double y) {
        double r7376010 = x;
        double r7376011 = r7376010 * r7376010;
        double r7376012 = y;
        double r7376013 = r7376012 * r7376012;
        double r7376014 = r7376011 + r7376013;
        return r7376014;
}

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 2019165 
(FPCore (x y)
  :name "Graphics.Rasterific.Linear:$cquadrance from Rasterific-0.6.1"
  (+ (* x x) (* y y)))