Diagrams.TwoD.Apollonian:initialConfig from diagrams-contrib-1.3.0.5, A

Percentage Accurate: 69.3% → 93.1%

Time: 9.6s

Alternatives: 5

Speedup: 0.7×

• 41.9% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[\begin{array}{l} \\ \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y \cdot 2} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (/ (- (+ (* x x) (* y y)) (* z z)) (* y 2.0)))

C

double code(double x, double y, double z) {
	return (((x * x) + (y * y)) - (z * z)) / (y * 2.0);
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (((x * x) + (y * y)) - (z * z)) / (y * 2.0d0)
end function

Java

public static double code(double x, double y, double z) {
	return (((x * x) + (y * y)) - (z * z)) / (y * 2.0);
}

Python

def code(x, y, z):
	return (((x * x) + (y * y)) - (z * z)) / (y * 2.0)

Julia

function code(x, y, z)
	return Float64(Float64(Float64(Float64(x * x) + Float64(y * y)) - Float64(z * z)) / Float64(y * 2.0))
end

MATLAB

function tmp = code(x, y, z)
	tmp = (((x * x) + (y * y)) - (z * z)) / (y * 2.0);
end

Wolfram

code[x_, y_, z_] := N[(N[(N[(N[(x * x), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision] - N[(z * z), $MachinePrecision]), $MachinePrecision] / N[(y * 2.0), $MachinePrecision]), $MachinePrecision]

Initial Program: 69.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y \cdot 2} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (/ (- (+ (* x x) (* y y)) (* z z)) (* y 2.0)))

C

double code(double x, double y, double z) {
	return (((x * x) + (y * y)) - (z * z)) / (y * 2.0);
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (((x * x) + (y * y)) - (z * z)) / (y * 2.0d0)
end function

Java

public static double code(double x, double y, double z) {
	return (((x * x) + (y * y)) - (z * z)) / (y * 2.0);
}

Python

def code(x, y, z):
	return (((x * x) + (y * y)) - (z * z)) / (y * 2.0)

Julia

function code(x, y, z)
	return Float64(Float64(Float64(Float64(x * x) + Float64(y * y)) - Float64(z * z)) / Float64(y * 2.0))
end

MATLAB

function tmp = code(x, y, z)
	tmp = (((x * x) + (y * y)) - (z * z)) / (y * 2.0);
end

Wolfram

code[x_, y_, z_] := N[(N[(N[(N[(x * x), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision] - N[(z * z), $MachinePrecision]), $MachinePrecision] / N[(y * 2.0), $MachinePrecision]), $MachinePrecision]

Alternative 1: 93.1% accurate, 0.1× speedup

Math

\[\begin{array}{l} y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ \begin{array}{l} t_0 := \frac{\left(x \cdot x + y\_m \cdot y\_m\right) - z \cdot z}{y\_m \cdot 2}\\ y\_s \cdot \begin{array}{l} \mathbf{if}\;t\_0 \leq 0:\\ \;\;\;\;z \cdot \left(z \cdot \frac{-0.5}{y\_m}\right)\\ \mathbf{elif}\;t\_0 \leq 5 \cdot 10^{+307}:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;y\_m \cdot \left(0.5 + 0.5 \cdot {\left(\frac{x}{y\_m}\right)}^{2}\right)\\ \end{array} \end{array} \end{array} \]

FPCore

y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
(FPCore (y_s x y_m z)
 :precision binary64
 (let* ((t_0 (/ (- (+ (* x x) (* y_m y_m)) (* z z)) (* y_m 2.0))))
   (*
    y_s
    (if (<= t_0 0.0)
      (* z (* z (/ -0.5 y_m)))
      (if (<= t_0 5e+307) t_0 (* y_m (+ 0.5 (* 0.5 (pow (/ x y_m) 2.0)))))))))

C

y\_m = fabs(y);
y\_s = copysign(1.0, y);
double code(double y_s, double x, double y_m, double z) {
	double t_0 = (((x * x) + (y_m * y_m)) - (z * z)) / (y_m * 2.0);
	double tmp;
	if (t_0 <= 0.0) {
		tmp = z * (z * (-0.5 / y_m));
	} else if (t_0 <= 5e+307) {
		tmp = t_0;
	} else {
		tmp = y_m * (0.5 + (0.5 * pow((x / y_m), 2.0)));
	}
	return y_s * tmp;
}

Fortran

y\_m = abs(y)
y\_s = copysign(1.0d0, y)
real(8) function code(y_s, x, y_m, z)
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (((x * x) + (y_m * y_m)) - (z * z)) / (y_m * 2.0d0)
    if (t_0 <= 0.0d0) then
        tmp = z * (z * ((-0.5d0) / y_m))
    else if (t_0 <= 5d+307) then
        tmp = t_0
    else
        tmp = y_m * (0.5d0 + (0.5d0 * ((x / y_m) ** 2.0d0)))
    end if
    code = y_s * tmp
end function

Java

y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
public static double code(double y_s, double x, double y_m, double z) {
	double t_0 = (((x * x) + (y_m * y_m)) - (z * z)) / (y_m * 2.0);
	double tmp;
	if (t_0 <= 0.0) {
		tmp = z * (z * (-0.5 / y_m));
	} else if (t_0 <= 5e+307) {
		tmp = t_0;
	} else {
		tmp = y_m * (0.5 + (0.5 * Math.pow((x / y_m), 2.0)));
	}
	return y_s * tmp;
}

Python

y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
def code(y_s, x, y_m, z):
	t_0 = (((x * x) + (y_m * y_m)) - (z * z)) / (y_m * 2.0)
	tmp = 0
	if t_0 <= 0.0:
		tmp = z * (z * (-0.5 / y_m))
	elif t_0 <= 5e+307:
		tmp = t_0
	else:
		tmp = y_m * (0.5 + (0.5 * math.pow((x / y_m), 2.0)))
	return y_s * tmp

Julia

y\_m = abs(y)
y\_s = copysign(1.0, y)
function code(y_s, x, y_m, z)
	t_0 = Float64(Float64(Float64(Float64(x * x) + Float64(y_m * y_m)) - Float64(z * z)) / Float64(y_m * 2.0))
	tmp = 0.0
	if (t_0 <= 0.0)
		tmp = Float64(z * Float64(z * Float64(-0.5 / y_m)));
	elseif (t_0 <= 5e+307)
		tmp = t_0;
	else
		tmp = Float64(y_m * Float64(0.5 + Float64(0.5 * (Float64(x / y_m) ^ 2.0))));
	end
	return Float64(y_s * tmp)
end

MATLAB

y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
function tmp_2 = code(y_s, x, y_m, z)
	t_0 = (((x * x) + (y_m * y_m)) - (z * z)) / (y_m * 2.0);
	tmp = 0.0;
	if (t_0 <= 0.0)
		tmp = z * (z * (-0.5 / y_m));
	elseif (t_0 <= 5e+307)
		tmp = t_0;
	else
		tmp = y_m * (0.5 + (0.5 * ((x / y_m) ^ 2.0)));
	end
	tmp_2 = y_s * tmp;
end

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[y$95$s_, x_, y$95$m_, z_] := Block[{t$95$0 = N[(N[(N[(N[(x * x), $MachinePrecision] + N[(y$95$m * y$95$m), $MachinePrecision]), $MachinePrecision] - N[(z * z), $MachinePrecision]), $MachinePrecision] / N[(y$95$m * 2.0), $MachinePrecision]), $MachinePrecision]}, N[(y$95$s * If[LessEqual[t$95$0, 0.0], N[(z * N[(z * N[(-0.5 / y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 5e+307], t$95$0, N[(y$95$m * N[(0.5 + N[(0.5 * N[Power[N[(x / y$95$m), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < 0.0

   1. Initial program 78.7%

      \[\frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y \cdot 2} \]
   2. Step-by-step derivation

      1. remove-double-neg 78.7%

         \[\leadsto \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{\color{blue}{-\left(-y \cdot 2\right)}} \]

      2. distribute-lft-neg-out 78.7%

         \[\leadsto \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{-\color{blue}{\left(-y\right) \cdot 2}} \]

      3. distribute-frac-neg2 78.7%

         \[\leadsto \color{blue}{-\frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{\left(-y\right) \cdot 2}} \]

      4. distribute-frac-neg 78.7%

         \[\leadsto \color{blue}{\frac{-\left(\left(x \cdot x + y \cdot y\right) - z \cdot z\right)}{\left(-y\right) \cdot 2}} \]

      5. neg-mul-1 78.7%

         \[\leadsto \frac{\color{blue}{-1 \cdot \left(\left(x \cdot x + y \cdot y\right) - z \cdot z\right)}}{\left(-y\right) \cdot 2} \]

      6. distribute-lft-neg-out 78.7%

         \[\leadsto \frac{-1 \cdot \left(\left(x \cdot x + y \cdot y\right) - z \cdot z\right)}{\color{blue}{-y \cdot 2}} \]

      7. *-commutative 78.7%

         \[\leadsto \frac{-1 \cdot \left(\left(x \cdot x + y \cdot y\right) - z \cdot z\right)}{-\color{blue}{2 \cdot y}} \]

      8. distribute-lft-neg-in 78.7%

         \[\leadsto \frac{-1 \cdot \left(\left(x \cdot x + y \cdot y\right) - z \cdot z\right)}{\color{blue}{\left(-2\right) \cdot y}} \]

      9. times-frac 78.7%

         \[\leadsto \color{blue}{\frac{-1}{-2} \cdot \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y}} \]

      10. metadata-eval 78.7%

          \[\leadsto \frac{-1}{\color{blue}{-2}} \cdot \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y} \]

      11. metadata-eval 78.7%

          \[\leadsto \color{blue}{0.5} \cdot \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y} \]

      12. associate--l+ 78.7%

          \[\leadsto 0.5 \cdot \frac{\color{blue}{x \cdot x + \left(y \cdot y - z \cdot z\right)}}{y} \]

      13. fma-define 78.7%

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

   3. Simplified 78.7%

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

   5. Taylor expanded in z around inf 29.6%

      \[\leadsto \color{blue}{-0.5 \cdot \frac{{z}^{2}}{y}} \]
   6. Step-by-step derivation

      1. *-commutative 29.6%

         \[\leadsto \color{blue}{\frac{{z}^{2}}{y} \cdot -0.5} \]

      2. associate-*l/ 29.6%

         \[\leadsto \color{blue}{\frac{{z}^{2} \cdot -0.5}{y}} \]

   7. Simplified 29.6%

      \[\leadsto \color{blue}{\frac{{z}^{2} \cdot -0.5}{y}} \]
   8. Step-by-step derivation

      1. add-cube-cbrt 29.4%

         \[\leadsto \color{blue}{\left(\sqrt[3]{\frac{{z}^{2} \cdot -0.5}{y}} \cdot \sqrt[3]{\frac{{z}^{2} \cdot -0.5}{y}}\right) \cdot \sqrt[3]{\frac{{z}^{2} \cdot -0.5}{y}}} \]

      2. pow3 29.4%

         \[\leadsto \color{blue}{{\left(\sqrt[3]{\frac{{z}^{2} \cdot -0.5}{y}}\right)}^{3}} \]

      3. associate-/l* 29.4%

         \[\leadsto {\left(\sqrt[3]{\color{blue}{{z}^{2} \cdot \frac{-0.5}{y}}}\right)}^{3} \]

   9. Applied egg-rr 29.4%

      \[\leadsto \color{blue}{{\left(\sqrt[3]{{z}^{2} \cdot \frac{-0.5}{y}}\right)}^{3}} \]
   10. Step-by-step derivation

       1. rem-cube-cbrt 29.5%

          \[\leadsto \color{blue}{{z}^{2} \cdot \frac{-0.5}{y}} \]

       2. pow2 29.5%

          \[\leadsto \color{blue}{\left(z \cdot z\right)} \cdot \frac{-0.5}{y} \]

       3. *-commutative 29.5%

          \[\leadsto \color{blue}{\frac{-0.5}{y} \cdot \left(z \cdot z\right)} \]

       4. associate-*r* 32.6%

          \[\leadsto \color{blue}{\left(\frac{-0.5}{y} \cdot z\right) \cdot z} \]

   11. Applied egg-rr 32.6%

       \[\leadsto \color{blue}{\left(\frac{-0.5}{y} \cdot z\right) \cdot z} \]

   if 0.0 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < 5e307

   1. Initial program 99.7%

      \[\frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y \cdot 2} \]
   2. Add Preprocessing

   if 5e307 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64)))

   1. Initial program 47.4%

      \[\frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y \cdot 2} \]
   2. Step-by-step derivation

      1. remove-double-neg 47.4%

         \[\leadsto \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{\color{blue}{-\left(-y \cdot 2\right)}} \]

      2. distribute-lft-neg-out 47.4%

         \[\leadsto \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{-\color{blue}{\left(-y\right) \cdot 2}} \]

      3. distribute-frac-neg2 47.4%

         \[\leadsto \color{blue}{-\frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{\left(-y\right) \cdot 2}} \]

      4. distribute-frac-neg 47.4%

         \[\leadsto \color{blue}{\frac{-\left(\left(x \cdot x + y \cdot y\right) - z \cdot z\right)}{\left(-y\right) \cdot 2}} \]

      5. neg-mul-1 47.4%

         \[\leadsto \frac{\color{blue}{-1 \cdot \left(\left(x \cdot x + y \cdot y\right) - z \cdot z\right)}}{\left(-y\right) \cdot 2} \]

      6. distribute-lft-neg-out 47.4%

         \[\leadsto \frac{-1 \cdot \left(\left(x \cdot x + y \cdot y\right) - z \cdot z\right)}{\color{blue}{-y \cdot 2}} \]

      7. *-commutative 47.4%

         \[\leadsto \frac{-1 \cdot \left(\left(x \cdot x + y \cdot y\right) - z \cdot z\right)}{-\color{blue}{2 \cdot y}} \]

      8. distribute-lft-neg-in 47.4%

         \[\leadsto \frac{-1 \cdot \left(\left(x \cdot x + y \cdot y\right) - z \cdot z\right)}{\color{blue}{\left(-2\right) \cdot y}} \]

      9. times-frac 47.4%

         \[\leadsto \color{blue}{\frac{-1}{-2} \cdot \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y}} \]

      10. metadata-eval 47.4%

          \[\leadsto \frac{-1}{\color{blue}{-2}} \cdot \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y} \]

      11. metadata-eval 47.4%

          \[\leadsto \color{blue}{0.5} \cdot \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y} \]

      12. associate--l+ 47.4%

          \[\leadsto 0.5 \cdot \frac{\color{blue}{x \cdot x + \left(y \cdot y - z \cdot z\right)}}{y} \]

      13. fma-define 51.7%

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

   3. Simplified 51.7%

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

   5. Taylor expanded in y around inf 57.9%

      \[\leadsto \color{blue}{y \cdot \left(0.5 + 0.5 \cdot \frac{{x}^{2} - {z}^{2}}{{y}^{2}}\right)} \]
   6. Step-by-step derivation

      1. *-commutative 57.9%

         \[\leadsto y \cdot \left(0.5 + \color{blue}{\frac{{x}^{2} - {z}^{2}}{{y}^{2}} \cdot 0.5}\right) \]

   7. Simplified 57.9%

      \[\leadsto \color{blue}{y \cdot \left(0.5 + \frac{{x}^{2} - {z}^{2}}{{y}^{2}} \cdot 0.5\right)} \]

   8. Taylor expanded in x around inf 47.6%

      \[\leadsto y \cdot \left(0.5 + \color{blue}{\frac{{x}^{2}}{{y}^{2}}} \cdot 0.5\right) \]
   9. Step-by-step derivation

      1. unpow2 47.6%

         \[\leadsto y \cdot \left(0.5 + \frac{\color{blue}{x \cdot x}}{{y}^{2}} \cdot 0.5\right) \]

      2. unpow2 47.6%

         \[\leadsto y \cdot \left(0.5 + \frac{x \cdot x}{\color{blue}{y \cdot y}} \cdot 0.5\right) \]

      3. times-frac 59.6%

         \[\leadsto y \cdot \left(0.5 + \color{blue}{\left(\frac{x}{y} \cdot \frac{x}{y}\right)} \cdot 0.5\right) \]

      4. unpow2 59.6%

         \[\leadsto y \cdot \left(0.5 + \color{blue}{{\left(\frac{x}{y}\right)}^{2}} \cdot 0.5\right) \]

   10. Simplified 59.6%

       \[\leadsto y \cdot \left(0.5 + \color{blue}{{\left(\frac{x}{y}\right)}^{2}} \cdot 0.5\right) \]
3. Recombined 3 regimes into one program.

4. Final simplification 54.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y \cdot 2} \leq 0:\\ \;\;\;\;z \cdot \left(z \cdot \frac{-0.5}{y}\right)\\ \mathbf{elif}\;\frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y \cdot 2} \leq 5 \cdot 10^{+307}:\\ \;\;\;\;\frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(0.5 + 0.5 \cdot {\left(\frac{x}{y}\right)}^{2}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 85.7% accurate, 0.7× speedup

Math

\[\begin{array}{l} y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ y\_s \cdot \begin{array}{l} \mathbf{if}\;y\_m \leq 4 \cdot 10^{+135}:\\ \;\;\;\;\frac{\left(x \cdot x + y\_m \cdot y\_m\right) - z \cdot z}{y\_m \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;y\_m \cdot 0.5\\ \end{array} \end{array} \]

FPCore

y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
(FPCore (y_s x y_m z)
 :precision binary64
 (*
  y_s
  (if (<= y_m 4e+135)
    (/ (- (+ (* x x) (* y_m y_m)) (* z z)) (* y_m 2.0))
    (* y_m 0.5))))

C

y\_m = fabs(y);
y\_s = copysign(1.0, y);
double code(double y_s, double x, double y_m, double z) {
	double tmp;
	if (y_m <= 4e+135) {
		tmp = (((x * x) + (y_m * y_m)) - (z * z)) / (y_m * 2.0);
	} else {
		tmp = y_m * 0.5;
	}
	return y_s * tmp;
}

Fortran

y\_m = abs(y)
y\_s = copysign(1.0d0, y)
real(8) function code(y_s, x, y_m, z)
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: tmp
    if (y_m <= 4d+135) then
        tmp = (((x * x) + (y_m * y_m)) - (z * z)) / (y_m * 2.0d0)
    else
        tmp = y_m * 0.5d0
    end if
    code = y_s * tmp
end function

Java

y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
public static double code(double y_s, double x, double y_m, double z) {
	double tmp;
	if (y_m <= 4e+135) {
		tmp = (((x * x) + (y_m * y_m)) - (z * z)) / (y_m * 2.0);
	} else {
		tmp = y_m * 0.5;
	}
	return y_s * tmp;
}

Python

y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
def code(y_s, x, y_m, z):
	tmp = 0
	if y_m <= 4e+135:
		tmp = (((x * x) + (y_m * y_m)) - (z * z)) / (y_m * 2.0)
	else:
		tmp = y_m * 0.5
	return y_s * tmp

Julia

y\_m = abs(y)
y\_s = copysign(1.0, y)
function code(y_s, x, y_m, z)
	tmp = 0.0
	if (y_m <= 4e+135)
		tmp = Float64(Float64(Float64(Float64(x * x) + Float64(y_m * y_m)) - Float64(z * z)) / Float64(y_m * 2.0));
	else
		tmp = Float64(y_m * 0.5);
	end
	return Float64(y_s * tmp)
end

MATLAB

y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
function tmp_2 = code(y_s, x, y_m, z)
	tmp = 0.0;
	if (y_m <= 4e+135)
		tmp = (((x * x) + (y_m * y_m)) - (z * z)) / (y_m * 2.0);
	else
		tmp = y_m * 0.5;
	end
	tmp_2 = y_s * tmp;
end

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[y$95$s_, x_, y$95$m_, z_] := N[(y$95$s * If[LessEqual[y$95$m, 4e+135], N[(N[(N[(N[(x * x), $MachinePrecision] + N[(y$95$m * y$95$m), $MachinePrecision]), $MachinePrecision] - N[(z * z), $MachinePrecision]), $MachinePrecision] / N[(y$95$m * 2.0), $MachinePrecision]), $MachinePrecision], N[(y$95$m * 0.5), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if y < 3.99999999999999985e135

   1. Initial program 80.3%

      \[\frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y \cdot 2} \]
   2. Add Preprocessing

   if 3.99999999999999985e135 < y

   1. Initial program 14.9%

      \[\frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y \cdot 2} \]
   2. Step-by-step derivation

      1. remove-double-neg 14.9%

         \[\leadsto \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{\color{blue}{-\left(-y \cdot 2\right)}} \]

      2. distribute-lft-neg-out 14.9%

         \[\leadsto \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{-\color{blue}{\left(-y\right) \cdot 2}} \]

      3. distribute-frac-neg2 14.9%

         \[\leadsto \color{blue}{-\frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{\left(-y\right) \cdot 2}} \]

      4. distribute-frac-neg 14.9%

         \[\leadsto \color{blue}{\frac{-\left(\left(x \cdot x + y \cdot y\right) - z \cdot z\right)}{\left(-y\right) \cdot 2}} \]

      5. neg-mul-1 14.9%

         \[\leadsto \frac{\color{blue}{-1 \cdot \left(\left(x \cdot x + y \cdot y\right) - z \cdot z\right)}}{\left(-y\right) \cdot 2} \]

      6. distribute-lft-neg-out 14.9%

         \[\leadsto \frac{-1 \cdot \left(\left(x \cdot x + y \cdot y\right) - z \cdot z\right)}{\color{blue}{-y \cdot 2}} \]

      7. *-commutative 14.9%

         \[\leadsto \frac{-1 \cdot \left(\left(x \cdot x + y \cdot y\right) - z \cdot z\right)}{-\color{blue}{2 \cdot y}} \]

      8. distribute-lft-neg-in 14.9%

         \[\leadsto \frac{-1 \cdot \left(\left(x \cdot x + y \cdot y\right) - z \cdot z\right)}{\color{blue}{\left(-2\right) \cdot y}} \]

      9. times-frac 14.9%

         \[\leadsto \color{blue}{\frac{-1}{-2} \cdot \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y}} \]

      10. metadata-eval 14.9%

          \[\leadsto \frac{-1}{\color{blue}{-2}} \cdot \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y} \]

      11. metadata-eval 14.9%

          \[\leadsto \color{blue}{0.5} \cdot \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y} \]

      12. associate--l+ 14.9%

          \[\leadsto 0.5 \cdot \frac{\color{blue}{x \cdot x + \left(y \cdot y - z \cdot z\right)}}{y} \]

      13. fma-define 14.9%

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

   3. Simplified 14.9%

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

   5. Taylor expanded in y around inf 62.5%

      \[\leadsto \color{blue}{0.5 \cdot y} \]
   6. Step-by-step derivation

      1. *-commutative 62.5%

         \[\leadsto \color{blue}{y \cdot 0.5} \]

   7. Simplified 62.5%

      \[\leadsto \color{blue}{y \cdot 0.5} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 53.1% accurate, 1.1× speedup

Math

\[\begin{array}{l} y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ y\_s \cdot \begin{array}{l} \mathbf{if}\;z \cdot z \leq 10^{+118}:\\ \;\;\;\;y\_m \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;z \cdot \left(z \cdot \frac{-0.5}{y\_m}\right)\\ \end{array} \end{array} \]

FPCore

y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
(FPCore (y_s x y_m z)
 :precision binary64
 (* y_s (if (<= (* z z) 1e+118) (* y_m 0.5) (* z (* z (/ -0.5 y_m))))))

C

y\_m = fabs(y);
y\_s = copysign(1.0, y);
double code(double y_s, double x, double y_m, double z) {
	double tmp;
	if ((z * z) <= 1e+118) {
		tmp = y_m * 0.5;
	} else {
		tmp = z * (z * (-0.5 / y_m));
	}
	return y_s * tmp;
}

Fortran

y\_m = abs(y)
y\_s = copysign(1.0d0, y)
real(8) function code(y_s, x, y_m, z)
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((z * z) <= 1d+118) then
        tmp = y_m * 0.5d0
    else
        tmp = z * (z * ((-0.5d0) / y_m))
    end if
    code = y_s * tmp
end function

Java

y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
public static double code(double y_s, double x, double y_m, double z) {
	double tmp;
	if ((z * z) <= 1e+118) {
		tmp = y_m * 0.5;
	} else {
		tmp = z * (z * (-0.5 / y_m));
	}
	return y_s * tmp;
}

Python

y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
def code(y_s, x, y_m, z):
	tmp = 0
	if (z * z) <= 1e+118:
		tmp = y_m * 0.5
	else:
		tmp = z * (z * (-0.5 / y_m))
	return y_s * tmp

Julia

y\_m = abs(y)
y\_s = copysign(1.0, y)
function code(y_s, x, y_m, z)
	tmp = 0.0
	if (Float64(z * z) <= 1e+118)
		tmp = Float64(y_m * 0.5);
	else
		tmp = Float64(z * Float64(z * Float64(-0.5 / y_m)));
	end
	return Float64(y_s * tmp)
end

MATLAB

y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
function tmp_2 = code(y_s, x, y_m, z)
	tmp = 0.0;
	if ((z * z) <= 1e+118)
		tmp = y_m * 0.5;
	else
		tmp = z * (z * (-0.5 / y_m));
	end
	tmp_2 = y_s * tmp;
end

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[y$95$s_, x_, y$95$m_, z_] := N[(y$95$s * If[LessEqual[N[(z * z), $MachinePrecision], 1e+118], N[(y$95$m * 0.5), $MachinePrecision], N[(z * N[(z * N[(-0.5 / y$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 z z) < 9.99999999999999967e117

   1. Initial program 76.7%

      \[\frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y \cdot 2} \]
   2. Step-by-step derivation

      1. remove-double-neg 76.7%

         \[\leadsto \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{\color{blue}{-\left(-y \cdot 2\right)}} \]

      2. distribute-lft-neg-out 76.7%

         \[\leadsto \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{-\color{blue}{\left(-y\right) \cdot 2}} \]

      3. distribute-frac-neg2 76.7%

         \[\leadsto \color{blue}{-\frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{\left(-y\right) \cdot 2}} \]

      4. distribute-frac-neg 76.7%

         \[\leadsto \color{blue}{\frac{-\left(\left(x \cdot x + y \cdot y\right) - z \cdot z\right)}{\left(-y\right) \cdot 2}} \]

      5. neg-mul-1 76.7%

         \[\leadsto \frac{\color{blue}{-1 \cdot \left(\left(x \cdot x + y \cdot y\right) - z \cdot z\right)}}{\left(-y\right) \cdot 2} \]

      6. distribute-lft-neg-out 76.7%

         \[\leadsto \frac{-1 \cdot \left(\left(x \cdot x + y \cdot y\right) - z \cdot z\right)}{\color{blue}{-y \cdot 2}} \]

      7. *-commutative 76.7%

         \[\leadsto \frac{-1 \cdot \left(\left(x \cdot x + y \cdot y\right) - z \cdot z\right)}{-\color{blue}{2 \cdot y}} \]

      8. distribute-lft-neg-in 76.7%

         \[\leadsto \frac{-1 \cdot \left(\left(x \cdot x + y \cdot y\right) - z \cdot z\right)}{\color{blue}{\left(-2\right) \cdot y}} \]

      9. times-frac 76.7%

         \[\leadsto \color{blue}{\frac{-1}{-2} \cdot \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y}} \]

      10. metadata-eval 76.7%

          \[\leadsto \frac{-1}{\color{blue}{-2}} \cdot \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y} \]

      11. metadata-eval 76.7%

          \[\leadsto \color{blue}{0.5} \cdot \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y} \]

      12. associate--l+ 76.7%

          \[\leadsto 0.5 \cdot \frac{\color{blue}{x \cdot x + \left(y \cdot y - z \cdot z\right)}}{y} \]

      13. fma-define 76.7%

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

   3. Simplified 76.7%

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

   5. Taylor expanded in y around inf 42.0%

      \[\leadsto \color{blue}{0.5 \cdot y} \]
   6. Step-by-step derivation

      1. *-commutative 42.0%

         \[\leadsto \color{blue}{y \cdot 0.5} \]

   7. Simplified 42.0%

      \[\leadsto \color{blue}{y \cdot 0.5} \]

   if 9.99999999999999967e117 < (*.f64 z z)

   1. Initial program 62.3%

      \[\frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y \cdot 2} \]
   2. Step-by-step derivation

      1. remove-double-neg 62.3%

         \[\leadsto \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{\color{blue}{-\left(-y \cdot 2\right)}} \]

      2. distribute-lft-neg-out 62.3%

         \[\leadsto \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{-\color{blue}{\left(-y\right) \cdot 2}} \]

      3. distribute-frac-neg2 62.3%

         \[\leadsto \color{blue}{-\frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{\left(-y\right) \cdot 2}} \]

      4. distribute-frac-neg 62.3%

         \[\leadsto \color{blue}{\frac{-\left(\left(x \cdot x + y \cdot y\right) - z \cdot z\right)}{\left(-y\right) \cdot 2}} \]

      5. neg-mul-1 62.3%

         \[\leadsto \frac{\color{blue}{-1 \cdot \left(\left(x \cdot x + y \cdot y\right) - z \cdot z\right)}}{\left(-y\right) \cdot 2} \]

      6. distribute-lft-neg-out 62.3%

         \[\leadsto \frac{-1 \cdot \left(\left(x \cdot x + y \cdot y\right) - z \cdot z\right)}{\color{blue}{-y \cdot 2}} \]

      7. *-commutative 62.3%

         \[\leadsto \frac{-1 \cdot \left(\left(x \cdot x + y \cdot y\right) - z \cdot z\right)}{-\color{blue}{2 \cdot y}} \]

      8. distribute-lft-neg-in 62.3%

         \[\leadsto \frac{-1 \cdot \left(\left(x \cdot x + y \cdot y\right) - z \cdot z\right)}{\color{blue}{\left(-2\right) \cdot y}} \]

      9. times-frac 62.3%

         \[\leadsto \color{blue}{\frac{-1}{-2} \cdot \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y}} \]

      10. metadata-eval 62.3%

          \[\leadsto \frac{-1}{\color{blue}{-2}} \cdot \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y} \]

      11. metadata-eval 62.3%

          \[\leadsto \color{blue}{0.5} \cdot \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y} \]

      12. associate--l+ 62.3%

          \[\leadsto 0.5 \cdot \frac{\color{blue}{x \cdot x + \left(y \cdot y - z \cdot z\right)}}{y} \]

      13. fma-define 66.4%

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

   3. Simplified 66.4%

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

   5. Taylor expanded in z around inf 62.3%

      \[\leadsto \color{blue}{-0.5 \cdot \frac{{z}^{2}}{y}} \]
   6. Step-by-step derivation

      1. *-commutative 62.3%

         \[\leadsto \color{blue}{\frac{{z}^{2}}{y} \cdot -0.5} \]

      2. associate-*l/ 62.3%

         \[\leadsto \color{blue}{\frac{{z}^{2} \cdot -0.5}{y}} \]

   7. Simplified 62.3%

      \[\leadsto \color{blue}{\frac{{z}^{2} \cdot -0.5}{y}} \]
   8. Step-by-step derivation

      1. add-cube-cbrt 62.0%

         \[\leadsto \color{blue}{\left(\sqrt[3]{\frac{{z}^{2} \cdot -0.5}{y}} \cdot \sqrt[3]{\frac{{z}^{2} \cdot -0.5}{y}}\right) \cdot \sqrt[3]{\frac{{z}^{2} \cdot -0.5}{y}}} \]

      2. pow3 62.0%

         \[\leadsto \color{blue}{{\left(\sqrt[3]{\frac{{z}^{2} \cdot -0.5}{y}}\right)}^{3}} \]

      3. associate-/l* 62.0%

         \[\leadsto {\left(\sqrt[3]{\color{blue}{{z}^{2} \cdot \frac{-0.5}{y}}}\right)}^{3} \]

   9. Applied egg-rr 62.0%

      \[\leadsto \color{blue}{{\left(\sqrt[3]{{z}^{2} \cdot \frac{-0.5}{y}}\right)}^{3}} \]
   10. Step-by-step derivation

       1. rem-cube-cbrt 62.2%

          \[\leadsto \color{blue}{{z}^{2} \cdot \frac{-0.5}{y}} \]

       2. pow2 62.2%

          \[\leadsto \color{blue}{\left(z \cdot z\right)} \cdot \frac{-0.5}{y} \]

       3. *-commutative 62.2%

          \[\leadsto \color{blue}{\frac{-0.5}{y} \cdot \left(z \cdot z\right)} \]

       4. associate-*r* 69.7%

          \[\leadsto \color{blue}{\left(\frac{-0.5}{y} \cdot z\right) \cdot z} \]

   11. Applied egg-rr 69.7%

       \[\leadsto \color{blue}{\left(\frac{-0.5}{y} \cdot z\right) \cdot z} \]
3. Recombined 2 regimes into one program.

4. Final simplification 52.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \cdot z \leq 10^{+118}:\\ \;\;\;\;y \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;z \cdot \left(z \cdot \frac{-0.5}{y}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 34.6% accurate, 5.0× speedup

Math

\[\begin{array}{l} y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ y\_s \cdot \left(y\_m \cdot 0.5\right) \end{array} \]

FPCore

y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
(FPCore (y_s x y_m z) :precision binary64 (* y_s (* y_m 0.5)))

C

y\_m = fabs(y);
y\_s = copysign(1.0, y);
double code(double y_s, double x, double y_m, double z) {
	return y_s * (y_m * 0.5);
}

Fortran

y\_m = abs(y)
y\_s = copysign(1.0d0, y)
real(8) function code(y_s, x, y_m, z)
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    code = y_s * (y_m * 0.5d0)
end function

Java

y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
public static double code(double y_s, double x, double y_m, double z) {
	return y_s * (y_m * 0.5);
}

Python

y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
def code(y_s, x, y_m, z):
	return y_s * (y_m * 0.5)

Julia

y\_m = abs(y)
y\_s = copysign(1.0, y)
function code(y_s, x, y_m, z)
	return Float64(y_s * Float64(y_m * 0.5))
end

MATLAB

y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
function tmp = code(y_s, x, y_m, z)
	tmp = y_s * (y_m * 0.5);
end

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[y$95$s_, x_, y$95$m_, z_] := N[(y$95$s * N[(y$95$m * 0.5), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 71.1%

   \[\frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y \cdot 2} \]
2. Step-by-step derivation

   1. remove-double-neg 71.1%

      \[\leadsto \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{\color{blue}{-\left(-y \cdot 2\right)}} \]

   2. distribute-lft-neg-out 71.1%

      \[\leadsto \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{-\color{blue}{\left(-y\right) \cdot 2}} \]

   3. distribute-frac-neg2 71.1%

      \[\leadsto \color{blue}{-\frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{\left(-y\right) \cdot 2}} \]

   4. distribute-frac-neg 71.1%

      \[\leadsto \color{blue}{\frac{-\left(\left(x \cdot x + y \cdot y\right) - z \cdot z\right)}{\left(-y\right) \cdot 2}} \]

   5. neg-mul-1 71.1%

      \[\leadsto \frac{\color{blue}{-1 \cdot \left(\left(x \cdot x + y \cdot y\right) - z \cdot z\right)}}{\left(-y\right) \cdot 2} \]

   6. distribute-lft-neg-out 71.1%

      \[\leadsto \frac{-1 \cdot \left(\left(x \cdot x + y \cdot y\right) - z \cdot z\right)}{\color{blue}{-y \cdot 2}} \]

   7. *-commutative 71.1%

      \[\leadsto \frac{-1 \cdot \left(\left(x \cdot x + y \cdot y\right) - z \cdot z\right)}{-\color{blue}{2 \cdot y}} \]

   8. distribute-lft-neg-in 71.1%

      \[\leadsto \frac{-1 \cdot \left(\left(x \cdot x + y \cdot y\right) - z \cdot z\right)}{\color{blue}{\left(-2\right) \cdot y}} \]

   9. times-frac 71.1%

      \[\leadsto \color{blue}{\frac{-1}{-2} \cdot \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y}} \]

   10. metadata-eval 71.1%

       \[\leadsto \frac{-1}{\color{blue}{-2}} \cdot \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y} \]

   11. metadata-eval 71.1%

       \[\leadsto \color{blue}{0.5} \cdot \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y} \]

   12. associate--l+ 71.1%

       \[\leadsto 0.5 \cdot \frac{\color{blue}{x \cdot x + \left(y \cdot y - z \cdot z\right)}}{y} \]

   13. fma-define 72.7%

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

3. Simplified 72.7%

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

5. Taylor expanded in y around inf 30.4%

   \[\leadsto \color{blue}{0.5 \cdot y} \]
6. Step-by-step derivation

   1. *-commutative 30.4%

      \[\leadsto \color{blue}{y \cdot 0.5} \]

7. Simplified 30.4%

   \[\leadsto \color{blue}{y \cdot 0.5} \]
8. Add Preprocessing

Alternative 5: 1.8% accurate, 5.0× speedup

Math

\[\begin{array}{l} y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ y\_s \cdot \left(y\_m \cdot -0.5\right) \end{array} \]

FPCore

y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
(FPCore (y_s x y_m z) :precision binary64 (* y_s (* y_m -0.5)))

C

y\_m = fabs(y);
y\_s = copysign(1.0, y);
double code(double y_s, double x, double y_m, double z) {
	return y_s * (y_m * -0.5);
}

Fortran

y\_m = abs(y)
y\_s = copysign(1.0d0, y)
real(8) function code(y_s, x, y_m, z)
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    code = y_s * (y_m * (-0.5d0))
end function

Java

y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
public static double code(double y_s, double x, double y_m, double z) {
	return y_s * (y_m * -0.5);
}

Python

y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
def code(y_s, x, y_m, z):
	return y_s * (y_m * -0.5)

Julia

y\_m = abs(y)
y\_s = copysign(1.0, y)
function code(y_s, x, y_m, z)
	return Float64(y_s * Float64(y_m * -0.5))
end

MATLAB

y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
function tmp = code(y_s, x, y_m, z)
	tmp = y_s * (y_m * -0.5);
end

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[y$95$s_, x_, y$95$m_, z_] := N[(y$95$s * N[(y$95$m * -0.5), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 71.1%

   \[\frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y \cdot 2} \]
2. Step-by-step derivation

   1. remove-double-neg 71.1%

      \[\leadsto \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{\color{blue}{-\left(-y \cdot 2\right)}} \]

   2. distribute-lft-neg-out 71.1%

      \[\leadsto \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{-\color{blue}{\left(-y\right) \cdot 2}} \]

   3. distribute-frac-neg2 71.1%

      \[\leadsto \color{blue}{-\frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{\left(-y\right) \cdot 2}} \]

   4. distribute-frac-neg 71.1%

      \[\leadsto \color{blue}{\frac{-\left(\left(x \cdot x + y \cdot y\right) - z \cdot z\right)}{\left(-y\right) \cdot 2}} \]

   5. neg-mul-1 71.1%

      \[\leadsto \frac{\color{blue}{-1 \cdot \left(\left(x \cdot x + y \cdot y\right) - z \cdot z\right)}}{\left(-y\right) \cdot 2} \]

   6. distribute-lft-neg-out 71.1%

      \[\leadsto \frac{-1 \cdot \left(\left(x \cdot x + y \cdot y\right) - z \cdot z\right)}{\color{blue}{-y \cdot 2}} \]

   7. *-commutative 71.1%

      \[\leadsto \frac{-1 \cdot \left(\left(x \cdot x + y \cdot y\right) - z \cdot z\right)}{-\color{blue}{2 \cdot y}} \]

   8. distribute-lft-neg-in 71.1%

      \[\leadsto \frac{-1 \cdot \left(\left(x \cdot x + y \cdot y\right) - z \cdot z\right)}{\color{blue}{\left(-2\right) \cdot y}} \]

   9. times-frac 71.1%

      \[\leadsto \color{blue}{\frac{-1}{-2} \cdot \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y}} \]

   10. metadata-eval 71.1%

       \[\leadsto \frac{-1}{\color{blue}{-2}} \cdot \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y} \]

   11. metadata-eval 71.1%

       \[\leadsto \color{blue}{0.5} \cdot \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y} \]

   12. associate--l+ 71.1%

       \[\leadsto 0.5 \cdot \frac{\color{blue}{x \cdot x + \left(y \cdot y - z \cdot z\right)}}{y} \]

   13. fma-define 72.7%

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

3. Simplified 72.7%

   \[\leadsto \color{blue}{0.5 \cdot \frac{\mathsf{fma}\left(x, x, y \cdot y - z \cdot z\right)}{y}} \]
4. Add Preprocessing
5. Step-by-step derivation

   1. clear-num 72.6%

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

   2. un-div-inv 72.6%

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

   3. fma-undefine 71.0%

      \[\leadsto \frac{0.5}{\frac{y}{\color{blue}{x \cdot x + \left(y \cdot y - z \cdot z\right)}}} \]

   4. associate--l+ 71.0%

      \[\leadsto \frac{0.5}{\frac{y}{\color{blue}{\left(x \cdot x + y \cdot y\right) - z \cdot z}}} \]

   5. add-sqr-sqrt 71.0%

      \[\leadsto \frac{0.5}{\frac{y}{\color{blue}{\sqrt{x \cdot x + y \cdot y} \cdot \sqrt{x \cdot x + y \cdot y}} - z \cdot z}} \]

   6. pow2 71.0%

      \[\leadsto \frac{0.5}{\frac{y}{\color{blue}{{\left(\sqrt{x \cdot x + y \cdot y}\right)}^{2}} - z \cdot z}} \]

   7. hypot-define 71.0%

      \[\leadsto \frac{0.5}{\frac{y}{{\color{blue}{\left(\mathsf{hypot}\left(x, y\right)\right)}}^{2} - z \cdot z}} \]

   8. pow2 71.0%

      \[\leadsto \frac{0.5}{\frac{y}{{\left(\mathsf{hypot}\left(x, y\right)\right)}^{2} - \color{blue}{{z}^{2}}}} \]

6. Applied egg-rr 71.0%

   \[\leadsto \color{blue}{\frac{0.5}{\frac{y}{{\left(\mathsf{hypot}\left(x, y\right)\right)}^{2} - {z}^{2}}}} \]

7. Taylor expanded in y around inf 30.4%

   \[\leadsto \frac{0.5}{\color{blue}{\frac{1}{y}}} \]
8. Step-by-step derivation

   1. frac-2neg 30.4%

      \[\leadsto \color{blue}{\frac{-0.5}{-\frac{1}{y}}} \]

   2. metadata-eval 30.4%

      \[\leadsto \frac{\color{blue}{-0.5}}{-\frac{1}{y}} \]

   3. div-inv 30.4%

      \[\leadsto \color{blue}{-0.5 \cdot \frac{1}{-\frac{1}{y}}} \]

   4. neg-mul-1 30.4%

      \[\leadsto -0.5 \cdot \frac{1}{\color{blue}{-1 \cdot \frac{1}{y}}} \]

   5. div-inv 30.4%

      \[\leadsto -0.5 \cdot \frac{1}{\color{blue}{\frac{-1}{y}}} \]

   6. add-sqr-sqrt 14.3%

      \[\leadsto -0.5 \cdot \frac{1}{\color{blue}{\sqrt{\frac{-1}{y}} \cdot \sqrt{\frac{-1}{y}}}} \]

   7. sqrt-unprod 8.5%

      \[\leadsto -0.5 \cdot \frac{1}{\color{blue}{\sqrt{\frac{-1}{y} \cdot \frac{-1}{y}}}} \]

   8. frac-times 8.2%

      \[\leadsto -0.5 \cdot \frac{1}{\sqrt{\color{blue}{\frac{-1 \cdot -1}{y \cdot y}}}} \]

   9. metadata-eval 8.2%

      \[\leadsto -0.5 \cdot \frac{1}{\sqrt{\frac{\color{blue}{1}}{y \cdot y}}} \]

   10. metadata-eval 8.2%

       \[\leadsto -0.5 \cdot \frac{1}{\sqrt{\frac{\color{blue}{1 \cdot 1}}{y \cdot y}}} \]

   11. frac-times 8.5%

       \[\leadsto -0.5 \cdot \frac{1}{\sqrt{\color{blue}{\frac{1}{y} \cdot \frac{1}{y}}}} \]

   12. sqrt-unprod 1.0%

       \[\leadsto -0.5 \cdot \frac{1}{\color{blue}{\sqrt{\frac{1}{y}} \cdot \sqrt{\frac{1}{y}}}} \]

   13. add-sqr-sqrt 2.0%

       \[\leadsto -0.5 \cdot \frac{1}{\color{blue}{\frac{1}{y}}} \]

   14. remove-double-div 2.0%

       \[\leadsto -0.5 \cdot \color{blue}{y} \]

9. Applied egg-rr 2.0%

   \[\leadsto \color{blue}{-0.5 \cdot y} \]
10. Step-by-step derivation

    1. *-commutative 2.0%

       \[\leadsto \color{blue}{y \cdot -0.5} \]

11. Simplified 2.0%

    \[\leadsto \color{blue}{y \cdot -0.5} \]
12. Add Preprocessing

Developer Target 1: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ y \cdot 0.5 - \left(\frac{0.5}{y} \cdot \left(z + x\right)\right) \cdot \left(z - x\right) \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (- (* y 0.5) (* (* (/ 0.5 y) (+ z x)) (- z x))))

C

double code(double x, double y, double z) {
	return (y * 0.5) - (((0.5 / y) * (z + x)) * (z - x));
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (y * 0.5d0) - (((0.5d0 / y) * (z + x)) * (z - x))
end function

Java

public static double code(double x, double y, double z) {
	return (y * 0.5) - (((0.5 / y) * (z + x)) * (z - x));
}

Python

def code(x, y, z):
	return (y * 0.5) - (((0.5 / y) * (z + x)) * (z - x))

Julia

function code(x, y, z)
	return Float64(Float64(y * 0.5) - Float64(Float64(Float64(0.5 / y) * Float64(z + x)) * Float64(z - x)))
end

MATLAB

function tmp = code(x, y, z)
	tmp = (y * 0.5) - (((0.5 / y) * (z + x)) * (z - x));
end

Wolfram

code[x_, y_, z_] := N[(N[(y * 0.5), $MachinePrecision] - N[(N[(N[(0.5 / y), $MachinePrecision] * N[(z + x), $MachinePrecision]), $MachinePrecision] * N[(z - x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Reproduce

herbie shell --seed 2024131 
(FPCore (x y z)
  :name "Diagrams.TwoD.Apollonian:initialConfig from diagrams-contrib-1.3.0.5, A"
  :precision binary64

  :alt
  (! :herbie-platform default (- (* y 1/2) (* (* (/ 1/2 y) (+ z x)) (- z x))))

  (/ (- (+ (* x x) (* y y)) (* z z)) (* y 2.0)))