Diagrams.TwoD.Arc:arcBetween from diagrams-lib-1.3.0.3

Percentage Accurate: 50.3% → 81.1%
Time: 6.9s
Alternatives: 5
Speedup: 48.0×

Specification

?
\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(y \cdot 4\right) \cdot y\\ \frac{x \cdot x - t\_0}{x \cdot x + t\_0} \end{array} \end{array} \]
(FPCore (x y)
 :precision binary64
 (let* ((t_0 (* (* y 4.0) y))) (/ (- (* x x) t_0) (+ (* x x) t_0))))
double code(double x, double y) {
	double t_0 = (y * 4.0) * y;
	return ((x * x) - t_0) / ((x * x) + t_0);
}
real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: t_0
    t_0 = (y * 4.0d0) * y
    code = ((x * x) - t_0) / ((x * x) + t_0)
end function
public static double code(double x, double y) {
	double t_0 = (y * 4.0) * y;
	return ((x * x) - t_0) / ((x * x) + t_0);
}
def code(x, y):
	t_0 = (y * 4.0) * y
	return ((x * x) - t_0) / ((x * x) + t_0)
function code(x, y)
	t_0 = Float64(Float64(y * 4.0) * y)
	return Float64(Float64(Float64(x * x) - t_0) / Float64(Float64(x * x) + t_0))
end
function tmp = code(x, y)
	t_0 = (y * 4.0) * y;
	tmp = ((x * x) - t_0) / ((x * x) + t_0);
end
code[x_, y_] := Block[{t$95$0 = N[(N[(y * 4.0), $MachinePrecision] * y), $MachinePrecision]}, N[(N[(N[(x * x), $MachinePrecision] - t$95$0), $MachinePrecision] / N[(N[(x * x), $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}

\\
\begin{array}{l}
t_0 := \left(y \cdot 4\right) \cdot y\\
\frac{x \cdot x - t\_0}{x \cdot x + t\_0}
\end{array}
\end{array}

Sampling outcomes in binary64 precision:

Local Percentage Accuracy vs ?

The average percentage accuracy by input value. Horizontal axis shows value of an input variable; the variable is choosen in the title. Vertical axis is accuracy; higher is better. Red represent the original program, while blue represents Herbie's suggestion. These can be toggled with buttons below the plot. The line is an average while dots represent individual samples.

Accuracy vs Speed?

Herbie found 5 alternatives:

AlternativeAccuracySpeedup
The accuracy (vertical axis) and speed (horizontal axis) of each alternatives. Up and to the right is better. The red square shows the initial program, and each blue circle shows an alternative.The line shows the best available speed-accuracy tradeoffs.

Initial Program: 50.3% accurate, 1.0× speedup?

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(y \cdot 4\right) \cdot y\\ \frac{x \cdot x - t\_0}{x \cdot x + t\_0} \end{array} \end{array} \]
(FPCore (x y)
 :precision binary64
 (let* ((t_0 (* (* y 4.0) y))) (/ (- (* x x) t_0) (+ (* x x) t_0))))
double code(double x, double y) {
	double t_0 = (y * 4.0) * y;
	return ((x * x) - t_0) / ((x * x) + t_0);
}
real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: t_0
    t_0 = (y * 4.0d0) * y
    code = ((x * x) - t_0) / ((x * x) + t_0)
end function
public static double code(double x, double y) {
	double t_0 = (y * 4.0) * y;
	return ((x * x) - t_0) / ((x * x) + t_0);
}
def code(x, y):
	t_0 = (y * 4.0) * y
	return ((x * x) - t_0) / ((x * x) + t_0)
function code(x, y)
	t_0 = Float64(Float64(y * 4.0) * y)
	return Float64(Float64(Float64(x * x) - t_0) / Float64(Float64(x * x) + t_0))
end
function tmp = code(x, y)
	t_0 = (y * 4.0) * y;
	tmp = ((x * x) - t_0) / ((x * x) + t_0);
end
code[x_, y_] := Block[{t$95$0 = N[(N[(y * 4.0), $MachinePrecision] * y), $MachinePrecision]}, N[(N[(N[(x * x), $MachinePrecision] - t$95$0), $MachinePrecision] / N[(N[(x * x), $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}

\\
\begin{array}{l}
t_0 := \left(y \cdot 4\right) \cdot y\\
\frac{x \cdot x - t\_0}{x \cdot x + t\_0}
\end{array}
\end{array}

Alternative 1: 81.1% accurate, 0.6× speedup?

\[\begin{array}{l} \\ \begin{array}{l} t_0 := y \cdot \left(y \cdot 4\right)\\ \mathbf{if}\;t\_0 \leq 0:\\ \;\;\;\;1\\ \mathbf{elif}\;t\_0 \leq 5 \cdot 10^{+235}:\\ \;\;\;\;\frac{\mathsf{fma}\left(y \cdot -4, y, x \cdot x\right)}{\mathsf{fma}\left(y, y \cdot 4, x \cdot x\right)}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{y}, \frac{x \cdot 0.5}{y}, -1\right)\\ \end{array} \end{array} \]
(FPCore (x y)
 :precision binary64
 (let* ((t_0 (* y (* y 4.0))))
   (if (<= t_0 0.0)
     1.0
     (if (<= t_0 5e+235)
       (/ (fma (* y -4.0) y (* x x)) (fma y (* y 4.0) (* x x)))
       (fma (/ x y) (/ (* x 0.5) y) -1.0)))))
double code(double x, double y) {
	double t_0 = y * (y * 4.0);
	double tmp;
	if (t_0 <= 0.0) {
		tmp = 1.0;
	} else if (t_0 <= 5e+235) {
		tmp = fma((y * -4.0), y, (x * x)) / fma(y, (y * 4.0), (x * x));
	} else {
		tmp = fma((x / y), ((x * 0.5) / y), -1.0);
	}
	return tmp;
}
function code(x, y)
	t_0 = Float64(y * Float64(y * 4.0))
	tmp = 0.0
	if (t_0 <= 0.0)
		tmp = 1.0;
	elseif (t_0 <= 5e+235)
		tmp = Float64(fma(Float64(y * -4.0), y, Float64(x * x)) / fma(y, Float64(y * 4.0), Float64(x * x)));
	else
		tmp = fma(Float64(x / y), Float64(Float64(x * 0.5) / y), -1.0);
	end
	return tmp
end
code[x_, y_] := Block[{t$95$0 = N[(y * N[(y * 4.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 0.0], 1.0, If[LessEqual[t$95$0, 5e+235], N[(N[(N[(y * -4.0), $MachinePrecision] * y + N[(x * x), $MachinePrecision]), $MachinePrecision] / N[(y * N[(y * 4.0), $MachinePrecision] + N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / y), $MachinePrecision] * N[(N[(x * 0.5), $MachinePrecision] / y), $MachinePrecision] + -1.0), $MachinePrecision]]]]
\begin{array}{l}

\\
\begin{array}{l}
t_0 := y \cdot \left(y \cdot 4\right)\\
\mathbf{if}\;t\_0 \leq 0:\\
\;\;\;\;1\\

\mathbf{elif}\;t\_0 \leq 5 \cdot 10^{+235}:\\
\;\;\;\;\frac{\mathsf{fma}\left(y \cdot -4, y, x \cdot x\right)}{\mathsf{fma}\left(y, y \cdot 4, x \cdot x\right)}\\

\mathbf{else}:\\
\;\;\;\;\mathsf{fma}\left(\frac{x}{y}, \frac{x \cdot 0.5}{y}, -1\right)\\


\end{array}
\end{array}
Derivation
  1. Split input into 3 regimes
  2. if (*.f64 (*.f64 y #s(literal 4 binary64)) y) < 0.0

    1. Initial program 62.3%

      \[\frac{x \cdot x - \left(y \cdot 4\right) \cdot y}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]
    2. Add Preprocessing
    3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{1} \]
    4. Step-by-step derivation
      1. Applied rewrites95.2%

        \[\leadsto \color{blue}{1} \]

      if 0.0 < (*.f64 (*.f64 y #s(literal 4 binary64)) y) < 5.00000000000000027e235

      1. Initial program 78.0%

        \[\frac{x \cdot x - \left(y \cdot 4\right) \cdot y}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]
      2. Add Preprocessing
      3. Step-by-step derivation
        1. lift--.f64N/A

          \[\leadsto \frac{\color{blue}{x \cdot x - \left(y \cdot 4\right) \cdot y}}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]
        2. sub-negN/A

          \[\leadsto \frac{\color{blue}{x \cdot x + \left(\mathsf{neg}\left(\left(y \cdot 4\right) \cdot y\right)\right)}}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]
        3. lift-*.f64N/A

          \[\leadsto \frac{\color{blue}{x \cdot x} + \left(\mathsf{neg}\left(\left(y \cdot 4\right) \cdot y\right)\right)}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]
        4. lower-fma.f64N/A

          \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(x, x, \mathsf{neg}\left(\left(y \cdot 4\right) \cdot y\right)\right)}}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]
        5. lift-*.f64N/A

          \[\leadsto \frac{\mathsf{fma}\left(x, x, \mathsf{neg}\left(\color{blue}{\left(y \cdot 4\right) \cdot y}\right)\right)}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]
        6. *-commutativeN/A

          \[\leadsto \frac{\mathsf{fma}\left(x, x, \mathsf{neg}\left(\color{blue}{y \cdot \left(y \cdot 4\right)}\right)\right)}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]
        7. lift-*.f64N/A

          \[\leadsto \frac{\mathsf{fma}\left(x, x, \mathsf{neg}\left(y \cdot \color{blue}{\left(y \cdot 4\right)}\right)\right)}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]
        8. associate-*r*N/A

          \[\leadsto \frac{\mathsf{fma}\left(x, x, \mathsf{neg}\left(\color{blue}{\left(y \cdot y\right) \cdot 4}\right)\right)}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]
        9. distribute-rgt-neg-inN/A

          \[\leadsto \frac{\mathsf{fma}\left(x, x, \color{blue}{\left(y \cdot y\right) \cdot \left(\mathsf{neg}\left(4\right)\right)}\right)}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]
        10. lower-*.f64N/A

          \[\leadsto \frac{\mathsf{fma}\left(x, x, \color{blue}{\left(y \cdot y\right) \cdot \left(\mathsf{neg}\left(4\right)\right)}\right)}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]
        11. lower-*.f64N/A

          \[\leadsto \frac{\mathsf{fma}\left(x, x, \color{blue}{\left(y \cdot y\right)} \cdot \left(\mathsf{neg}\left(4\right)\right)\right)}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]
        12. metadata-eval78.0

          \[\leadsto \frac{\mathsf{fma}\left(x, x, \left(y \cdot y\right) \cdot \color{blue}{-4}\right)}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]
        13. lift-+.f64N/A

          \[\leadsto \frac{\mathsf{fma}\left(x, x, \left(y \cdot y\right) \cdot -4\right)}{\color{blue}{x \cdot x + \left(y \cdot 4\right) \cdot y}} \]
        14. +-commutativeN/A

          \[\leadsto \frac{\mathsf{fma}\left(x, x, \left(y \cdot y\right) \cdot -4\right)}{\color{blue}{\left(y \cdot 4\right) \cdot y + x \cdot x}} \]
        15. lift-*.f64N/A

          \[\leadsto \frac{\mathsf{fma}\left(x, x, \left(y \cdot y\right) \cdot -4\right)}{\color{blue}{\left(y \cdot 4\right) \cdot y} + x \cdot x} \]
        16. *-commutativeN/A

          \[\leadsto \frac{\mathsf{fma}\left(x, x, \left(y \cdot y\right) \cdot -4\right)}{\color{blue}{y \cdot \left(y \cdot 4\right)} + x \cdot x} \]
        17. lower-fma.f6478.0

          \[\leadsto \frac{\mathsf{fma}\left(x, x, \left(y \cdot y\right) \cdot -4\right)}{\color{blue}{\mathsf{fma}\left(y, y \cdot 4, x \cdot x\right)}} \]
      4. Applied rewrites78.0%

        \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(x, x, \left(y \cdot y\right) \cdot -4\right)}{\mathsf{fma}\left(y, y \cdot 4, x \cdot x\right)}} \]
      5. Step-by-step derivation
        1. lift-fma.f64N/A

          \[\leadsto \frac{\color{blue}{x \cdot x + \left(y \cdot y\right) \cdot -4}}{\mathsf{fma}\left(y, y \cdot 4, x \cdot x\right)} \]
        2. lift-*.f64N/A

          \[\leadsto \frac{\color{blue}{x \cdot x} + \left(y \cdot y\right) \cdot -4}{\mathsf{fma}\left(y, y \cdot 4, x \cdot x\right)} \]
        3. +-commutativeN/A

          \[\leadsto \frac{\color{blue}{\left(y \cdot y\right) \cdot -4 + x \cdot x}}{\mathsf{fma}\left(y, y \cdot 4, x \cdot x\right)} \]
        4. lift-*.f64N/A

          \[\leadsto \frac{\color{blue}{\left(y \cdot y\right) \cdot -4} + x \cdot x}{\mathsf{fma}\left(y, y \cdot 4, x \cdot x\right)} \]
        5. lift-*.f64N/A

          \[\leadsto \frac{\color{blue}{\left(y \cdot y\right)} \cdot -4 + x \cdot x}{\mathsf{fma}\left(y, y \cdot 4, x \cdot x\right)} \]
        6. associate-*l*N/A

          \[\leadsto \frac{\color{blue}{y \cdot \left(y \cdot -4\right)} + x \cdot x}{\mathsf{fma}\left(y, y \cdot 4, x \cdot x\right)} \]
        7. *-commutativeN/A

          \[\leadsto \frac{\color{blue}{\left(y \cdot -4\right) \cdot y} + x \cdot x}{\mathsf{fma}\left(y, y \cdot 4, x \cdot x\right)} \]
        8. lower-fma.f64N/A

          \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(y \cdot -4, y, x \cdot x\right)}}{\mathsf{fma}\left(y, y \cdot 4, x \cdot x\right)} \]
        9. lower-*.f6478.1

          \[\leadsto \frac{\mathsf{fma}\left(\color{blue}{y \cdot -4}, y, x \cdot x\right)}{\mathsf{fma}\left(y, y \cdot 4, x \cdot x\right)} \]
      6. Applied rewrites78.1%

        \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(y \cdot -4, y, x \cdot x\right)}}{\mathsf{fma}\left(y, y \cdot 4, x \cdot x\right)} \]

      if 5.00000000000000027e235 < (*.f64 (*.f64 y #s(literal 4 binary64)) y)

      1. Initial program 17.8%

        \[\frac{x \cdot x - \left(y \cdot 4\right) \cdot y}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]
      2. Add Preprocessing
      3. Taylor expanded in x around 0

        \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{{x}^{2}}{{y}^{2}} - 1} \]
      4. Step-by-step derivation
        1. sub-negN/A

          \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{{x}^{2}}{{y}^{2}} + \left(\mathsf{neg}\left(1\right)\right)} \]
        2. *-lft-identityN/A

          \[\leadsto \frac{1}{2} \cdot \frac{\color{blue}{1 \cdot {x}^{2}}}{{y}^{2}} + \left(\mathsf{neg}\left(1\right)\right) \]
        3. associate-*l/N/A

          \[\leadsto \frac{1}{2} \cdot \color{blue}{\left(\frac{1}{{y}^{2}} \cdot {x}^{2}\right)} + \left(\mathsf{neg}\left(1\right)\right) \]
        4. associate-*l*N/A

          \[\leadsto \color{blue}{\left(\frac{1}{2} \cdot \frac{1}{{y}^{2}}\right) \cdot {x}^{2}} + \left(\mathsf{neg}\left(1\right)\right) \]
        5. *-commutativeN/A

          \[\leadsto \color{blue}{{x}^{2} \cdot \left(\frac{1}{2} \cdot \frac{1}{{y}^{2}}\right)} + \left(\mathsf{neg}\left(1\right)\right) \]
        6. lower-fma.f64N/A

          \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{2}, \frac{1}{2} \cdot \frac{1}{{y}^{2}}, \mathsf{neg}\left(1\right)\right)} \]
        7. unpow2N/A

          \[\leadsto \mathsf{fma}\left(\color{blue}{x \cdot x}, \frac{1}{2} \cdot \frac{1}{{y}^{2}}, \mathsf{neg}\left(1\right)\right) \]
        8. lower-*.f64N/A

          \[\leadsto \mathsf{fma}\left(\color{blue}{x \cdot x}, \frac{1}{2} \cdot \frac{1}{{y}^{2}}, \mathsf{neg}\left(1\right)\right) \]
        9. associate-*r/N/A

          \[\leadsto \mathsf{fma}\left(x \cdot x, \color{blue}{\frac{\frac{1}{2} \cdot 1}{{y}^{2}}}, \mathsf{neg}\left(1\right)\right) \]
        10. metadata-evalN/A

          \[\leadsto \mathsf{fma}\left(x \cdot x, \frac{\color{blue}{\frac{1}{2}}}{{y}^{2}}, \mathsf{neg}\left(1\right)\right) \]
        11. lower-/.f64N/A

          \[\leadsto \mathsf{fma}\left(x \cdot x, \color{blue}{\frac{\frac{1}{2}}{{y}^{2}}}, \mathsf{neg}\left(1\right)\right) \]
        12. unpow2N/A

          \[\leadsto \mathsf{fma}\left(x \cdot x, \frac{\frac{1}{2}}{\color{blue}{y \cdot y}}, \mathsf{neg}\left(1\right)\right) \]
        13. lower-*.f64N/A

          \[\leadsto \mathsf{fma}\left(x \cdot x, \frac{\frac{1}{2}}{\color{blue}{y \cdot y}}, \mathsf{neg}\left(1\right)\right) \]
        14. metadata-eval74.5

          \[\leadsto \mathsf{fma}\left(x \cdot x, \frac{0.5}{y \cdot y}, \color{blue}{-1}\right) \]
      5. Applied rewrites74.5%

        \[\leadsto \color{blue}{\mathsf{fma}\left(x \cdot x, \frac{0.5}{y \cdot y}, -1\right)} \]
      6. Step-by-step derivation
        1. Applied rewrites90.5%

          \[\leadsto \mathsf{fma}\left(\frac{x}{y}, \color{blue}{\frac{x \cdot 0.5}{y}}, -1\right) \]
      7. Recombined 3 regimes into one program.
      8. Final simplification86.5%

        \[\leadsto \begin{array}{l} \mathbf{if}\;y \cdot \left(y \cdot 4\right) \leq 0:\\ \;\;\;\;1\\ \mathbf{elif}\;y \cdot \left(y \cdot 4\right) \leq 5 \cdot 10^{+235}:\\ \;\;\;\;\frac{\mathsf{fma}\left(y \cdot -4, y, x \cdot x\right)}{\mathsf{fma}\left(y, y \cdot 4, x \cdot x\right)}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{y}, \frac{x \cdot 0.5}{y}, -1\right)\\ \end{array} \]
      9. Add Preprocessing

      Alternative 2: 81.0% accurate, 0.6× speedup?

      \[\begin{array}{l} \\ \begin{array}{l} t_0 := y \cdot \left(y \cdot 4\right)\\ \mathbf{if}\;t\_0 \leq 0:\\ \;\;\;\;1\\ \mathbf{elif}\;t\_0 \leq 5 \cdot 10^{+235}:\\ \;\;\;\;\frac{\mathsf{fma}\left(x, x, -4 \cdot \left(y \cdot y\right)\right)}{\mathsf{fma}\left(y, y \cdot 4, x \cdot x\right)}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{y}, \frac{x \cdot 0.5}{y}, -1\right)\\ \end{array} \end{array} \]
      (FPCore (x y)
       :precision binary64
       (let* ((t_0 (* y (* y 4.0))))
         (if (<= t_0 0.0)
           1.0
           (if (<= t_0 5e+235)
             (/ (fma x x (* -4.0 (* y y))) (fma y (* y 4.0) (* x x)))
             (fma (/ x y) (/ (* x 0.5) y) -1.0)))))
      double code(double x, double y) {
      	double t_0 = y * (y * 4.0);
      	double tmp;
      	if (t_0 <= 0.0) {
      		tmp = 1.0;
      	} else if (t_0 <= 5e+235) {
      		tmp = fma(x, x, (-4.0 * (y * y))) / fma(y, (y * 4.0), (x * x));
      	} else {
      		tmp = fma((x / y), ((x * 0.5) / y), -1.0);
      	}
      	return tmp;
      }
      
      function code(x, y)
      	t_0 = Float64(y * Float64(y * 4.0))
      	tmp = 0.0
      	if (t_0 <= 0.0)
      		tmp = 1.0;
      	elseif (t_0 <= 5e+235)
      		tmp = Float64(fma(x, x, Float64(-4.0 * Float64(y * y))) / fma(y, Float64(y * 4.0), Float64(x * x)));
      	else
      		tmp = fma(Float64(x / y), Float64(Float64(x * 0.5) / y), -1.0);
      	end
      	return tmp
      end
      
      code[x_, y_] := Block[{t$95$0 = N[(y * N[(y * 4.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 0.0], 1.0, If[LessEqual[t$95$0, 5e+235], N[(N[(x * x + N[(-4.0 * N[(y * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(y * N[(y * 4.0), $MachinePrecision] + N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / y), $MachinePrecision] * N[(N[(x * 0.5), $MachinePrecision] / y), $MachinePrecision] + -1.0), $MachinePrecision]]]]
      
      \begin{array}{l}
      
      \\
      \begin{array}{l}
      t_0 := y \cdot \left(y \cdot 4\right)\\
      \mathbf{if}\;t\_0 \leq 0:\\
      \;\;\;\;1\\
      
      \mathbf{elif}\;t\_0 \leq 5 \cdot 10^{+235}:\\
      \;\;\;\;\frac{\mathsf{fma}\left(x, x, -4 \cdot \left(y \cdot y\right)\right)}{\mathsf{fma}\left(y, y \cdot 4, x \cdot x\right)}\\
      
      \mathbf{else}:\\
      \;\;\;\;\mathsf{fma}\left(\frac{x}{y}, \frac{x \cdot 0.5}{y}, -1\right)\\
      
      
      \end{array}
      \end{array}
      
      Derivation
      1. Split input into 3 regimes
      2. if (*.f64 (*.f64 y #s(literal 4 binary64)) y) < 0.0

        1. Initial program 62.3%

          \[\frac{x \cdot x - \left(y \cdot 4\right) \cdot y}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]
        2. Add Preprocessing
        3. Taylor expanded in x around inf

          \[\leadsto \color{blue}{1} \]
        4. Step-by-step derivation
          1. Applied rewrites95.2%

            \[\leadsto \color{blue}{1} \]

          if 0.0 < (*.f64 (*.f64 y #s(literal 4 binary64)) y) < 5.00000000000000027e235

          1. Initial program 78.0%

            \[\frac{x \cdot x - \left(y \cdot 4\right) \cdot y}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]
          2. Add Preprocessing
          3. Step-by-step derivation
            1. lift--.f64N/A

              \[\leadsto \frac{\color{blue}{x \cdot x - \left(y \cdot 4\right) \cdot y}}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]
            2. sub-negN/A

              \[\leadsto \frac{\color{blue}{x \cdot x + \left(\mathsf{neg}\left(\left(y \cdot 4\right) \cdot y\right)\right)}}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]
            3. lift-*.f64N/A

              \[\leadsto \frac{\color{blue}{x \cdot x} + \left(\mathsf{neg}\left(\left(y \cdot 4\right) \cdot y\right)\right)}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]
            4. lower-fma.f64N/A

              \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(x, x, \mathsf{neg}\left(\left(y \cdot 4\right) \cdot y\right)\right)}}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]
            5. lift-*.f64N/A

              \[\leadsto \frac{\mathsf{fma}\left(x, x, \mathsf{neg}\left(\color{blue}{\left(y \cdot 4\right) \cdot y}\right)\right)}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]
            6. *-commutativeN/A

              \[\leadsto \frac{\mathsf{fma}\left(x, x, \mathsf{neg}\left(\color{blue}{y \cdot \left(y \cdot 4\right)}\right)\right)}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]
            7. lift-*.f64N/A

              \[\leadsto \frac{\mathsf{fma}\left(x, x, \mathsf{neg}\left(y \cdot \color{blue}{\left(y \cdot 4\right)}\right)\right)}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]
            8. associate-*r*N/A

              \[\leadsto \frac{\mathsf{fma}\left(x, x, \mathsf{neg}\left(\color{blue}{\left(y \cdot y\right) \cdot 4}\right)\right)}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]
            9. distribute-rgt-neg-inN/A

              \[\leadsto \frac{\mathsf{fma}\left(x, x, \color{blue}{\left(y \cdot y\right) \cdot \left(\mathsf{neg}\left(4\right)\right)}\right)}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]
            10. lower-*.f64N/A

              \[\leadsto \frac{\mathsf{fma}\left(x, x, \color{blue}{\left(y \cdot y\right) \cdot \left(\mathsf{neg}\left(4\right)\right)}\right)}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]
            11. lower-*.f64N/A

              \[\leadsto \frac{\mathsf{fma}\left(x, x, \color{blue}{\left(y \cdot y\right)} \cdot \left(\mathsf{neg}\left(4\right)\right)\right)}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]
            12. metadata-eval78.0

              \[\leadsto \frac{\mathsf{fma}\left(x, x, \left(y \cdot y\right) \cdot \color{blue}{-4}\right)}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]
            13. lift-+.f64N/A

              \[\leadsto \frac{\mathsf{fma}\left(x, x, \left(y \cdot y\right) \cdot -4\right)}{\color{blue}{x \cdot x + \left(y \cdot 4\right) \cdot y}} \]
            14. +-commutativeN/A

              \[\leadsto \frac{\mathsf{fma}\left(x, x, \left(y \cdot y\right) \cdot -4\right)}{\color{blue}{\left(y \cdot 4\right) \cdot y + x \cdot x}} \]
            15. lift-*.f64N/A

              \[\leadsto \frac{\mathsf{fma}\left(x, x, \left(y \cdot y\right) \cdot -4\right)}{\color{blue}{\left(y \cdot 4\right) \cdot y} + x \cdot x} \]
            16. *-commutativeN/A

              \[\leadsto \frac{\mathsf{fma}\left(x, x, \left(y \cdot y\right) \cdot -4\right)}{\color{blue}{y \cdot \left(y \cdot 4\right)} + x \cdot x} \]
            17. lower-fma.f6478.0

              \[\leadsto \frac{\mathsf{fma}\left(x, x, \left(y \cdot y\right) \cdot -4\right)}{\color{blue}{\mathsf{fma}\left(y, y \cdot 4, x \cdot x\right)}} \]
          4. Applied rewrites78.0%

            \[\leadsto \color{blue}{\frac{\mathsf{fma}\left(x, x, \left(y \cdot y\right) \cdot -4\right)}{\mathsf{fma}\left(y, y \cdot 4, x \cdot x\right)}} \]

          if 5.00000000000000027e235 < (*.f64 (*.f64 y #s(literal 4 binary64)) y)

          1. Initial program 17.8%

            \[\frac{x \cdot x - \left(y \cdot 4\right) \cdot y}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]
          2. Add Preprocessing
          3. Taylor expanded in x around 0

            \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{{x}^{2}}{{y}^{2}} - 1} \]
          4. Step-by-step derivation
            1. sub-negN/A

              \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{{x}^{2}}{{y}^{2}} + \left(\mathsf{neg}\left(1\right)\right)} \]
            2. *-lft-identityN/A

              \[\leadsto \frac{1}{2} \cdot \frac{\color{blue}{1 \cdot {x}^{2}}}{{y}^{2}} + \left(\mathsf{neg}\left(1\right)\right) \]
            3. associate-*l/N/A

              \[\leadsto \frac{1}{2} \cdot \color{blue}{\left(\frac{1}{{y}^{2}} \cdot {x}^{2}\right)} + \left(\mathsf{neg}\left(1\right)\right) \]
            4. associate-*l*N/A

              \[\leadsto \color{blue}{\left(\frac{1}{2} \cdot \frac{1}{{y}^{2}}\right) \cdot {x}^{2}} + \left(\mathsf{neg}\left(1\right)\right) \]
            5. *-commutativeN/A

              \[\leadsto \color{blue}{{x}^{2} \cdot \left(\frac{1}{2} \cdot \frac{1}{{y}^{2}}\right)} + \left(\mathsf{neg}\left(1\right)\right) \]
            6. lower-fma.f64N/A

              \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{2}, \frac{1}{2} \cdot \frac{1}{{y}^{2}}, \mathsf{neg}\left(1\right)\right)} \]
            7. unpow2N/A

              \[\leadsto \mathsf{fma}\left(\color{blue}{x \cdot x}, \frac{1}{2} \cdot \frac{1}{{y}^{2}}, \mathsf{neg}\left(1\right)\right) \]
            8. lower-*.f64N/A

              \[\leadsto \mathsf{fma}\left(\color{blue}{x \cdot x}, \frac{1}{2} \cdot \frac{1}{{y}^{2}}, \mathsf{neg}\left(1\right)\right) \]
            9. associate-*r/N/A

              \[\leadsto \mathsf{fma}\left(x \cdot x, \color{blue}{\frac{\frac{1}{2} \cdot 1}{{y}^{2}}}, \mathsf{neg}\left(1\right)\right) \]
            10. metadata-evalN/A

              \[\leadsto \mathsf{fma}\left(x \cdot x, \frac{\color{blue}{\frac{1}{2}}}{{y}^{2}}, \mathsf{neg}\left(1\right)\right) \]
            11. lower-/.f64N/A

              \[\leadsto \mathsf{fma}\left(x \cdot x, \color{blue}{\frac{\frac{1}{2}}{{y}^{2}}}, \mathsf{neg}\left(1\right)\right) \]
            12. unpow2N/A

              \[\leadsto \mathsf{fma}\left(x \cdot x, \frac{\frac{1}{2}}{\color{blue}{y \cdot y}}, \mathsf{neg}\left(1\right)\right) \]
            13. lower-*.f64N/A

              \[\leadsto \mathsf{fma}\left(x \cdot x, \frac{\frac{1}{2}}{\color{blue}{y \cdot y}}, \mathsf{neg}\left(1\right)\right) \]
            14. metadata-eval74.5

              \[\leadsto \mathsf{fma}\left(x \cdot x, \frac{0.5}{y \cdot y}, \color{blue}{-1}\right) \]
          5. Applied rewrites74.5%

            \[\leadsto \color{blue}{\mathsf{fma}\left(x \cdot x, \frac{0.5}{y \cdot y}, -1\right)} \]
          6. Step-by-step derivation
            1. Applied rewrites90.5%

              \[\leadsto \mathsf{fma}\left(\frac{x}{y}, \color{blue}{\frac{x \cdot 0.5}{y}}, -1\right) \]
          7. Recombined 3 regimes into one program.
          8. Final simplification86.5%

            \[\leadsto \begin{array}{l} \mathbf{if}\;y \cdot \left(y \cdot 4\right) \leq 0:\\ \;\;\;\;1\\ \mathbf{elif}\;y \cdot \left(y \cdot 4\right) \leq 5 \cdot 10^{+235}:\\ \;\;\;\;\frac{\mathsf{fma}\left(x, x, -4 \cdot \left(y \cdot y\right)\right)}{\mathsf{fma}\left(y, y \cdot 4, x \cdot x\right)}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{y}, \frac{x \cdot 0.5}{y}, -1\right)\\ \end{array} \]
          9. Add Preprocessing

          Alternative 3: 73.1% accurate, 1.0× speedup?

          \[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \cdot \left(y \cdot 4\right) \leq 5 \cdot 10^{-202}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{y}, \frac{x \cdot 0.5}{y}, -1\right)\\ \end{array} \end{array} \]
          (FPCore (x y)
           :precision binary64
           (if (<= (* y (* y 4.0)) 5e-202) 1.0 (fma (/ x y) (/ (* x 0.5) y) -1.0)))
          double code(double x, double y) {
          	double tmp;
          	if ((y * (y * 4.0)) <= 5e-202) {
          		tmp = 1.0;
          	} else {
          		tmp = fma((x / y), ((x * 0.5) / y), -1.0);
          	}
          	return tmp;
          }
          
          function code(x, y)
          	tmp = 0.0
          	if (Float64(y * Float64(y * 4.0)) <= 5e-202)
          		tmp = 1.0;
          	else
          		tmp = fma(Float64(x / y), Float64(Float64(x * 0.5) / y), -1.0);
          	end
          	return tmp
          end
          
          code[x_, y_] := If[LessEqual[N[(y * N[(y * 4.0), $MachinePrecision]), $MachinePrecision], 5e-202], 1.0, N[(N[(x / y), $MachinePrecision] * N[(N[(x * 0.5), $MachinePrecision] / y), $MachinePrecision] + -1.0), $MachinePrecision]]
          
          \begin{array}{l}
          
          \\
          \begin{array}{l}
          \mathbf{if}\;y \cdot \left(y \cdot 4\right) \leq 5 \cdot 10^{-202}:\\
          \;\;\;\;1\\
          
          \mathbf{else}:\\
          \;\;\;\;\mathsf{fma}\left(\frac{x}{y}, \frac{x \cdot 0.5}{y}, -1\right)\\
          
          
          \end{array}
          \end{array}
          
          Derivation
          1. Split input into 2 regimes
          2. if (*.f64 (*.f64 y #s(literal 4 binary64)) y) < 4.99999999999999973e-202

            1. Initial program 67.9%

              \[\frac{x \cdot x - \left(y \cdot 4\right) \cdot y}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]
            2. Add Preprocessing
            3. Taylor expanded in x around inf

              \[\leadsto \color{blue}{1} \]
            4. Step-by-step derivation
              1. Applied rewrites89.1%

                \[\leadsto \color{blue}{1} \]

              if 4.99999999999999973e-202 < (*.f64 (*.f64 y #s(literal 4 binary64)) y)

              1. Initial program 46.2%

                \[\frac{x \cdot x - \left(y \cdot 4\right) \cdot y}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]
              2. Add Preprocessing
              3. Taylor expanded in x around 0

                \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{{x}^{2}}{{y}^{2}} - 1} \]
              4. Step-by-step derivation
                1. sub-negN/A

                  \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{{x}^{2}}{{y}^{2}} + \left(\mathsf{neg}\left(1\right)\right)} \]
                2. *-lft-identityN/A

                  \[\leadsto \frac{1}{2} \cdot \frac{\color{blue}{1 \cdot {x}^{2}}}{{y}^{2}} + \left(\mathsf{neg}\left(1\right)\right) \]
                3. associate-*l/N/A

                  \[\leadsto \frac{1}{2} \cdot \color{blue}{\left(\frac{1}{{y}^{2}} \cdot {x}^{2}\right)} + \left(\mathsf{neg}\left(1\right)\right) \]
                4. associate-*l*N/A

                  \[\leadsto \color{blue}{\left(\frac{1}{2} \cdot \frac{1}{{y}^{2}}\right) \cdot {x}^{2}} + \left(\mathsf{neg}\left(1\right)\right) \]
                5. *-commutativeN/A

                  \[\leadsto \color{blue}{{x}^{2} \cdot \left(\frac{1}{2} \cdot \frac{1}{{y}^{2}}\right)} + \left(\mathsf{neg}\left(1\right)\right) \]
                6. lower-fma.f64N/A

                  \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{2}, \frac{1}{2} \cdot \frac{1}{{y}^{2}}, \mathsf{neg}\left(1\right)\right)} \]
                7. unpow2N/A

                  \[\leadsto \mathsf{fma}\left(\color{blue}{x \cdot x}, \frac{1}{2} \cdot \frac{1}{{y}^{2}}, \mathsf{neg}\left(1\right)\right) \]
                8. lower-*.f64N/A

                  \[\leadsto \mathsf{fma}\left(\color{blue}{x \cdot x}, \frac{1}{2} \cdot \frac{1}{{y}^{2}}, \mathsf{neg}\left(1\right)\right) \]
                9. associate-*r/N/A

                  \[\leadsto \mathsf{fma}\left(x \cdot x, \color{blue}{\frac{\frac{1}{2} \cdot 1}{{y}^{2}}}, \mathsf{neg}\left(1\right)\right) \]
                10. metadata-evalN/A

                  \[\leadsto \mathsf{fma}\left(x \cdot x, \frac{\color{blue}{\frac{1}{2}}}{{y}^{2}}, \mathsf{neg}\left(1\right)\right) \]
                11. lower-/.f64N/A

                  \[\leadsto \mathsf{fma}\left(x \cdot x, \color{blue}{\frac{\frac{1}{2}}{{y}^{2}}}, \mathsf{neg}\left(1\right)\right) \]
                12. unpow2N/A

                  \[\leadsto \mathsf{fma}\left(x \cdot x, \frac{\frac{1}{2}}{\color{blue}{y \cdot y}}, \mathsf{neg}\left(1\right)\right) \]
                13. lower-*.f64N/A

                  \[\leadsto \mathsf{fma}\left(x \cdot x, \frac{\frac{1}{2}}{\color{blue}{y \cdot y}}, \mathsf{neg}\left(1\right)\right) \]
                14. metadata-eval67.1

                  \[\leadsto \mathsf{fma}\left(x \cdot x, \frac{0.5}{y \cdot y}, \color{blue}{-1}\right) \]
              5. Applied rewrites67.1%

                \[\leadsto \color{blue}{\mathsf{fma}\left(x \cdot x, \frac{0.5}{y \cdot y}, -1\right)} \]
              6. Step-by-step derivation
                1. Applied rewrites75.4%

                  \[\leadsto \mathsf{fma}\left(\frac{x}{y}, \color{blue}{\frac{x \cdot 0.5}{y}}, -1\right) \]
              7. Recombined 2 regimes into one program.
              8. Final simplification79.7%

                \[\leadsto \begin{array}{l} \mathbf{if}\;y \cdot \left(y \cdot 4\right) \leq 5 \cdot 10^{-202}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{y}, \frac{x \cdot 0.5}{y}, -1\right)\\ \end{array} \]
              9. Add Preprocessing

              Alternative 4: 72.2% accurate, 2.8× speedup?

              \[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \cdot \left(y \cdot 4\right) \leq 5 \cdot 10^{-202}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \end{array} \]
              (FPCore (x y) :precision binary64 (if (<= (* y (* y 4.0)) 5e-202) 1.0 -1.0))
              double code(double x, double y) {
              	double tmp;
              	if ((y * (y * 4.0)) <= 5e-202) {
              		tmp = 1.0;
              	} else {
              		tmp = -1.0;
              	}
              	return tmp;
              }
              
              real(8) function code(x, y)
                  real(8), intent (in) :: x
                  real(8), intent (in) :: y
                  real(8) :: tmp
                  if ((y * (y * 4.0d0)) <= 5d-202) then
                      tmp = 1.0d0
                  else
                      tmp = -1.0d0
                  end if
                  code = tmp
              end function
              
              public static double code(double x, double y) {
              	double tmp;
              	if ((y * (y * 4.0)) <= 5e-202) {
              		tmp = 1.0;
              	} else {
              		tmp = -1.0;
              	}
              	return tmp;
              }
              
              def code(x, y):
              	tmp = 0
              	if (y * (y * 4.0)) <= 5e-202:
              		tmp = 1.0
              	else:
              		tmp = -1.0
              	return tmp
              
              function code(x, y)
              	tmp = 0.0
              	if (Float64(y * Float64(y * 4.0)) <= 5e-202)
              		tmp = 1.0;
              	else
              		tmp = -1.0;
              	end
              	return tmp
              end
              
              function tmp_2 = code(x, y)
              	tmp = 0.0;
              	if ((y * (y * 4.0)) <= 5e-202)
              		tmp = 1.0;
              	else
              		tmp = -1.0;
              	end
              	tmp_2 = tmp;
              end
              
              code[x_, y_] := If[LessEqual[N[(y * N[(y * 4.0), $MachinePrecision]), $MachinePrecision], 5e-202], 1.0, -1.0]
              
              \begin{array}{l}
              
              \\
              \begin{array}{l}
              \mathbf{if}\;y \cdot \left(y \cdot 4\right) \leq 5 \cdot 10^{-202}:\\
              \;\;\;\;1\\
              
              \mathbf{else}:\\
              \;\;\;\;-1\\
              
              
              \end{array}
              \end{array}
              
              Derivation
              1. Split input into 2 regimes
              2. if (*.f64 (*.f64 y #s(literal 4 binary64)) y) < 4.99999999999999973e-202

                1. Initial program 67.9%

                  \[\frac{x \cdot x - \left(y \cdot 4\right) \cdot y}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]
                2. Add Preprocessing
                3. Taylor expanded in x around inf

                  \[\leadsto \color{blue}{1} \]
                4. Step-by-step derivation
                  1. Applied rewrites89.1%

                    \[\leadsto \color{blue}{1} \]

                  if 4.99999999999999973e-202 < (*.f64 (*.f64 y #s(literal 4 binary64)) y)

                  1. Initial program 46.2%

                    \[\frac{x \cdot x - \left(y \cdot 4\right) \cdot y}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]
                  2. Add Preprocessing
                  3. Taylor expanded in x around 0

                    \[\leadsto \color{blue}{-1} \]
                  4. Step-by-step derivation
                    1. Applied rewrites74.2%

                      \[\leadsto \color{blue}{-1} \]
                  5. Recombined 2 regimes into one program.
                  6. Final simplification78.9%

                    \[\leadsto \begin{array}{l} \mathbf{if}\;y \cdot \left(y \cdot 4\right) \leq 5 \cdot 10^{-202}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \]
                  7. Add Preprocessing

                  Alternative 5: 50.9% accurate, 48.0× speedup?

                  \[\begin{array}{l} \\ -1 \end{array} \]
                  (FPCore (x y) :precision binary64 -1.0)
                  double code(double x, double y) {
                  	return -1.0;
                  }
                  
                  real(8) function code(x, y)
                      real(8), intent (in) :: x
                      real(8), intent (in) :: y
                      code = -1.0d0
                  end function
                  
                  public static double code(double x, double y) {
                  	return -1.0;
                  }
                  
                  def code(x, y):
                  	return -1.0
                  
                  function code(x, y)
                  	return -1.0
                  end
                  
                  function tmp = code(x, y)
                  	tmp = -1.0;
                  end
                  
                  code[x_, y_] := -1.0
                  
                  \begin{array}{l}
                  
                  \\
                  -1
                  \end{array}
                  
                  Derivation
                  1. Initial program 53.1%

                    \[\frac{x \cdot x - \left(y \cdot 4\right) \cdot y}{x \cdot x + \left(y \cdot 4\right) \cdot y} \]
                  2. Add Preprocessing
                  3. Taylor expanded in x around 0

                    \[\leadsto \color{blue}{-1} \]
                  4. Step-by-step derivation
                    1. Applied rewrites54.7%

                      \[\leadsto \color{blue}{-1} \]
                    2. Add Preprocessing

                    Developer Target 1: 50.7% accurate, 0.2× speedup?

                    \[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(y \cdot y\right) \cdot 4\\ t_1 := x \cdot x + t\_0\\ t_2 := \frac{t\_0}{t\_1}\\ t_3 := \left(y \cdot 4\right) \cdot y\\ \mathbf{if}\;\frac{x \cdot x - t\_3}{x \cdot x + t\_3} < 0.9743233849626781:\\ \;\;\;\;\frac{x \cdot x}{t\_1} - t\_2\\ \mathbf{else}:\\ \;\;\;\;{\left(\frac{x}{\sqrt{t\_1}}\right)}^{2} - t\_2\\ \end{array} \end{array} \]
                    (FPCore (x y)
                     :precision binary64
                     (let* ((t_0 (* (* y y) 4.0))
                            (t_1 (+ (* x x) t_0))
                            (t_2 (/ t_0 t_1))
                            (t_3 (* (* y 4.0) y)))
                       (if (< (/ (- (* x x) t_3) (+ (* x x) t_3)) 0.9743233849626781)
                         (- (/ (* x x) t_1) t_2)
                         (- (pow (/ x (sqrt t_1)) 2.0) t_2))))
                    double code(double x, double y) {
                    	double t_0 = (y * y) * 4.0;
                    	double t_1 = (x * x) + t_0;
                    	double t_2 = t_0 / t_1;
                    	double t_3 = (y * 4.0) * y;
                    	double tmp;
                    	if ((((x * x) - t_3) / ((x * x) + t_3)) < 0.9743233849626781) {
                    		tmp = ((x * x) / t_1) - t_2;
                    	} else {
                    		tmp = pow((x / sqrt(t_1)), 2.0) - t_2;
                    	}
                    	return tmp;
                    }
                    
                    real(8) function code(x, y)
                        real(8), intent (in) :: x
                        real(8), intent (in) :: y
                        real(8) :: t_0
                        real(8) :: t_1
                        real(8) :: t_2
                        real(8) :: t_3
                        real(8) :: tmp
                        t_0 = (y * y) * 4.0d0
                        t_1 = (x * x) + t_0
                        t_2 = t_0 / t_1
                        t_3 = (y * 4.0d0) * y
                        if ((((x * x) - t_3) / ((x * x) + t_3)) < 0.9743233849626781d0) then
                            tmp = ((x * x) / t_1) - t_2
                        else
                            tmp = ((x / sqrt(t_1)) ** 2.0d0) - t_2
                        end if
                        code = tmp
                    end function
                    
                    public static double code(double x, double y) {
                    	double t_0 = (y * y) * 4.0;
                    	double t_1 = (x * x) + t_0;
                    	double t_2 = t_0 / t_1;
                    	double t_3 = (y * 4.0) * y;
                    	double tmp;
                    	if ((((x * x) - t_3) / ((x * x) + t_3)) < 0.9743233849626781) {
                    		tmp = ((x * x) / t_1) - t_2;
                    	} else {
                    		tmp = Math.pow((x / Math.sqrt(t_1)), 2.0) - t_2;
                    	}
                    	return tmp;
                    }
                    
                    def code(x, y):
                    	t_0 = (y * y) * 4.0
                    	t_1 = (x * x) + t_0
                    	t_2 = t_0 / t_1
                    	t_3 = (y * 4.0) * y
                    	tmp = 0
                    	if (((x * x) - t_3) / ((x * x) + t_3)) < 0.9743233849626781:
                    		tmp = ((x * x) / t_1) - t_2
                    	else:
                    		tmp = math.pow((x / math.sqrt(t_1)), 2.0) - t_2
                    	return tmp
                    
                    function code(x, y)
                    	t_0 = Float64(Float64(y * y) * 4.0)
                    	t_1 = Float64(Float64(x * x) + t_0)
                    	t_2 = Float64(t_0 / t_1)
                    	t_3 = Float64(Float64(y * 4.0) * y)
                    	tmp = 0.0
                    	if (Float64(Float64(Float64(x * x) - t_3) / Float64(Float64(x * x) + t_3)) < 0.9743233849626781)
                    		tmp = Float64(Float64(Float64(x * x) / t_1) - t_2);
                    	else
                    		tmp = Float64((Float64(x / sqrt(t_1)) ^ 2.0) - t_2);
                    	end
                    	return tmp
                    end
                    
                    function tmp_2 = code(x, y)
                    	t_0 = (y * y) * 4.0;
                    	t_1 = (x * x) + t_0;
                    	t_2 = t_0 / t_1;
                    	t_3 = (y * 4.0) * y;
                    	tmp = 0.0;
                    	if ((((x * x) - t_3) / ((x * x) + t_3)) < 0.9743233849626781)
                    		tmp = ((x * x) / t_1) - t_2;
                    	else
                    		tmp = ((x / sqrt(t_1)) ^ 2.0) - t_2;
                    	end
                    	tmp_2 = tmp;
                    end
                    
                    code[x_, y_] := Block[{t$95$0 = N[(N[(y * y), $MachinePrecision] * 4.0), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x * x), $MachinePrecision] + t$95$0), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$0 / t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(N[(y * 4.0), $MachinePrecision] * y), $MachinePrecision]}, If[Less[N[(N[(N[(x * x), $MachinePrecision] - t$95$3), $MachinePrecision] / N[(N[(x * x), $MachinePrecision] + t$95$3), $MachinePrecision]), $MachinePrecision], 0.9743233849626781], N[(N[(N[(x * x), $MachinePrecision] / t$95$1), $MachinePrecision] - t$95$2), $MachinePrecision], N[(N[Power[N[(x / N[Sqrt[t$95$1], $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] - t$95$2), $MachinePrecision]]]]]]
                    
                    \begin{array}{l}
                    
                    \\
                    \begin{array}{l}
                    t_0 := \left(y \cdot y\right) \cdot 4\\
                    t_1 := x \cdot x + t\_0\\
                    t_2 := \frac{t\_0}{t\_1}\\
                    t_3 := \left(y \cdot 4\right) \cdot y\\
                    \mathbf{if}\;\frac{x \cdot x - t\_3}{x \cdot x + t\_3} < 0.9743233849626781:\\
                    \;\;\;\;\frac{x \cdot x}{t\_1} - t\_2\\
                    
                    \mathbf{else}:\\
                    \;\;\;\;{\left(\frac{x}{\sqrt{t\_1}}\right)}^{2} - t\_2\\
                    
                    
                    \end{array}
                    \end{array}
                    

                    Reproduce

                    ?
                    herbie shell --seed 2024238 
                    (FPCore (x y)
                      :name "Diagrams.TwoD.Arc:arcBetween from diagrams-lib-1.3.0.3"
                      :precision binary64
                    
                      :alt
                      (! :herbie-platform default (if (< (/ (- (* x x) (* (* y 4) y)) (+ (* x x) (* (* y 4) y))) 9743233849626781/10000000000000000) (- (/ (* x x) (+ (* x x) (* (* y y) 4))) (/ (* (* y y) 4) (+ (* x x) (* (* y y) 4)))) (- (pow (/ x (sqrt (+ (* x x) (* (* y y) 4)))) 2) (/ (* (* y y) 4) (+ (* x x) (* (* y y) 4))))))
                    
                      (/ (- (* x x) (* (* y 4.0) y)) (+ (* x x) (* (* y 4.0) y))))