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

Percentage Accurate: 70.3% → 99.9%

Time: 6.1s

Alternatives: 9

Speedup: 1.3×

• 41.3% 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: 70.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: 99.9% accurate, 1.3× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \mathsf{fma}\left(\frac{x\_m - z}{y}, z + x\_m, y\right) \cdot 0.5 \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m y z)
 :precision binary64
 (* (fma (/ (- x_m z) y) (+ z x_m) y) 0.5))

C

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

Julia

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

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_, y_, z_] := N[(N[(N[(N[(x$95$m - z), $MachinePrecision] / y), $MachinePrecision] * N[(z + x$95$m), $MachinePrecision] + y), $MachinePrecision] * 0.5), $MachinePrecision]

Derivation

1. Initial program 68.9%

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

3. Taylor expanded in x around 0

   \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{{y}^{2} - {z}^{2}}{y} + \frac{1}{2} \cdot \frac{{x}^{2}}{y}} \]

5. Applied rewrites 99.9%

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

Alternative 2: 39.8% accurate, 0.3× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} t_0 := \left(-0.5 \cdot z\right) \cdot \frac{z}{y}\\ t_1 := \frac{\left(x\_m \cdot x\_m + y \cdot y\right) - z \cdot z}{y \cdot 2}\\ \mathbf{if}\;t\_1 \leq 0:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;t\_1 \leq 10^{+146}:\\ \;\;\;\;0.5 \cdot y\\ \mathbf{elif}\;t\_1 \leq \infty:\\ \;\;\;\;\frac{x\_m}{y} \cdot \left(x\_m \cdot 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m y z)
 :precision binary64
 (let* ((t_0 (* (* -0.5 z) (/ z y)))
        (t_1 (/ (- (+ (* x_m x_m) (* y y)) (* z z)) (* y 2.0))))
   (if (<= t_1 0.0)
     t_0
     (if (<= t_1 1e+146)
       (* 0.5 y)
       (if (<= t_1 INFINITY) (* (/ x_m y) (* x_m 0.5)) t_0)))))

C

x_m = fabs(x);
double code(double x_m, double y, double z) {
	double t_0 = (-0.5 * z) * (z / y);
	double t_1 = (((x_m * x_m) + (y * y)) - (z * z)) / (y * 2.0);
	double tmp;
	if (t_1 <= 0.0) {
		tmp = t_0;
	} else if (t_1 <= 1e+146) {
		tmp = 0.5 * y;
	} else if (t_1 <= ((double) INFINITY)) {
		tmp = (x_m / y) * (x_m * 0.5);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Java

x_m = Math.abs(x);
public static double code(double x_m, double y, double z) {
	double t_0 = (-0.5 * z) * (z / y);
	double t_1 = (((x_m * x_m) + (y * y)) - (z * z)) / (y * 2.0);
	double tmp;
	if (t_1 <= 0.0) {
		tmp = t_0;
	} else if (t_1 <= 1e+146) {
		tmp = 0.5 * y;
	} else if (t_1 <= Double.POSITIVE_INFINITY) {
		tmp = (x_m / y) * (x_m * 0.5);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

x_m = math.fabs(x)
def code(x_m, y, z):
	t_0 = (-0.5 * z) * (z / y)
	t_1 = (((x_m * x_m) + (y * y)) - (z * z)) / (y * 2.0)
	tmp = 0
	if t_1 <= 0.0:
		tmp = t_0
	elif t_1 <= 1e+146:
		tmp = 0.5 * y
	elif t_1 <= math.inf:
		tmp = (x_m / y) * (x_m * 0.5)
	else:
		tmp = t_0
	return tmp

Julia

x_m = abs(x)
function code(x_m, y, z)
	t_0 = Float64(Float64(-0.5 * z) * Float64(z / y))
	t_1 = Float64(Float64(Float64(Float64(x_m * x_m) + Float64(y * y)) - Float64(z * z)) / Float64(y * 2.0))
	tmp = 0.0
	if (t_1 <= 0.0)
		tmp = t_0;
	elseif (t_1 <= 1e+146)
		tmp = Float64(0.5 * y);
	elseif (t_1 <= Inf)
		tmp = Float64(Float64(x_m / y) * Float64(x_m * 0.5));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

x_m = abs(x);
function tmp_2 = code(x_m, y, z)
	t_0 = (-0.5 * z) * (z / y);
	t_1 = (((x_m * x_m) + (y * y)) - (z * z)) / (y * 2.0);
	tmp = 0.0;
	if (t_1 <= 0.0)
		tmp = t_0;
	elseif (t_1 <= 1e+146)
		tmp = 0.5 * y;
	elseif (t_1 <= Inf)
		tmp = (x_m / y) * (x_m * 0.5);
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_, y_, z_] := Block[{t$95$0 = N[(N[(-0.5 * z), $MachinePrecision] * N[(z / y), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(N[(x$95$m * x$95$m), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision] - N[(z * z), $MachinePrecision]), $MachinePrecision] / N[(y * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, 0.0], t$95$0, If[LessEqual[t$95$1, 1e+146], N[(0.5 * y), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(N[(x$95$m / y), $MachinePrecision] * N[(x$95$m * 0.5), $MachinePrecision]), $MachinePrecision], t$95$0]]]]]

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 or +inf.0 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64)))

   1. Initial program 58.6%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 33.1

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

   5. Applied rewrites 33.1%

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

   7. Applied rewrites 37.6%

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

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

   1. Initial program 99.9%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\frac{1}{2} \cdot y} \]
   4. Step-by-step derivation

      1. lower-*.f64 72.0

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

   5. Applied rewrites 72.0%

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

   if 9.99999999999999934e145 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < +inf.0

   1. Initial program 74.3%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{\frac{{x}^{2}}{y} \cdot \frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{{x}^{2}}{y} \cdot \frac{1}{2}} \]

      3. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{{x}^{2}}{y}} \cdot \frac{1}{2} \]

      4. unpow2 N/A

         \[\leadsto \frac{\color{blue}{x \cdot x}}{y} \cdot \frac{1}{2} \]

      5. lower-*.f64 44.5

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

   5. Applied rewrites 44.5%

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

   7. Applied rewrites 47.5%

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

Alternative 3: 39.8% accurate, 0.3× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} t_0 := \left(-0.5 \cdot z\right) \cdot \frac{z}{y}\\ t_1 := \frac{\left(x\_m \cdot x\_m + y \cdot y\right) - z \cdot z}{y \cdot 2}\\ \mathbf{if}\;t\_1 \leq 0:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;t\_1 \leq 10^{+146}:\\ \;\;\;\;0.5 \cdot y\\ \mathbf{elif}\;t\_1 \leq \infty:\\ \;\;\;\;\left(\frac{0.5}{y} \cdot x\_m\right) \cdot x\_m\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m y z)
 :precision binary64
 (let* ((t_0 (* (* -0.5 z) (/ z y)))
        (t_1 (/ (- (+ (* x_m x_m) (* y y)) (* z z)) (* y 2.0))))
   (if (<= t_1 0.0)
     t_0
     (if (<= t_1 1e+146)
       (* 0.5 y)
       (if (<= t_1 INFINITY) (* (* (/ 0.5 y) x_m) x_m) t_0)))))

C

x_m = fabs(x);
double code(double x_m, double y, double z) {
	double t_0 = (-0.5 * z) * (z / y);
	double t_1 = (((x_m * x_m) + (y * y)) - (z * z)) / (y * 2.0);
	double tmp;
	if (t_1 <= 0.0) {
		tmp = t_0;
	} else if (t_1 <= 1e+146) {
		tmp = 0.5 * y;
	} else if (t_1 <= ((double) INFINITY)) {
		tmp = ((0.5 / y) * x_m) * x_m;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Java

x_m = Math.abs(x);
public static double code(double x_m, double y, double z) {
	double t_0 = (-0.5 * z) * (z / y);
	double t_1 = (((x_m * x_m) + (y * y)) - (z * z)) / (y * 2.0);
	double tmp;
	if (t_1 <= 0.0) {
		tmp = t_0;
	} else if (t_1 <= 1e+146) {
		tmp = 0.5 * y;
	} else if (t_1 <= Double.POSITIVE_INFINITY) {
		tmp = ((0.5 / y) * x_m) * x_m;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

x_m = math.fabs(x)
def code(x_m, y, z):
	t_0 = (-0.5 * z) * (z / y)
	t_1 = (((x_m * x_m) + (y * y)) - (z * z)) / (y * 2.0)
	tmp = 0
	if t_1 <= 0.0:
		tmp = t_0
	elif t_1 <= 1e+146:
		tmp = 0.5 * y
	elif t_1 <= math.inf:
		tmp = ((0.5 / y) * x_m) * x_m
	else:
		tmp = t_0
	return tmp

Julia

x_m = abs(x)
function code(x_m, y, z)
	t_0 = Float64(Float64(-0.5 * z) * Float64(z / y))
	t_1 = Float64(Float64(Float64(Float64(x_m * x_m) + Float64(y * y)) - Float64(z * z)) / Float64(y * 2.0))
	tmp = 0.0
	if (t_1 <= 0.0)
		tmp = t_0;
	elseif (t_1 <= 1e+146)
		tmp = Float64(0.5 * y);
	elseif (t_1 <= Inf)
		tmp = Float64(Float64(Float64(0.5 / y) * x_m) * x_m);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

x_m = abs(x);
function tmp_2 = code(x_m, y, z)
	t_0 = (-0.5 * z) * (z / y);
	t_1 = (((x_m * x_m) + (y * y)) - (z * z)) / (y * 2.0);
	tmp = 0.0;
	if (t_1 <= 0.0)
		tmp = t_0;
	elseif (t_1 <= 1e+146)
		tmp = 0.5 * y;
	elseif (t_1 <= Inf)
		tmp = ((0.5 / y) * x_m) * x_m;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_, y_, z_] := Block[{t$95$0 = N[(N[(-0.5 * z), $MachinePrecision] * N[(z / y), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(N[(x$95$m * x$95$m), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision] - N[(z * z), $MachinePrecision]), $MachinePrecision] / N[(y * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, 0.0], t$95$0, If[LessEqual[t$95$1, 1e+146], N[(0.5 * y), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(N[(N[(0.5 / y), $MachinePrecision] * x$95$m), $MachinePrecision] * x$95$m), $MachinePrecision], t$95$0]]]]]

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 or +inf.0 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64)))

   1. Initial program 58.6%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 33.1

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

   5. Applied rewrites 33.1%

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

   7. Applied rewrites 37.6%

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

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

   1. Initial program 99.9%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\frac{1}{2} \cdot y} \]
   4. Step-by-step derivation

      1. lower-*.f64 72.0

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

   5. Applied rewrites 72.0%

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

   if 9.99999999999999934e145 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < +inf.0

   1. Initial program 74.3%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{\frac{{x}^{2}}{y} \cdot \frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{{x}^{2}}{y} \cdot \frac{1}{2}} \]

      3. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{{x}^{2}}{y}} \cdot \frac{1}{2} \]

      4. unpow2 N/A

         \[\leadsto \frac{\color{blue}{x \cdot x}}{y} \cdot \frac{1}{2} \]

      5. lower-*.f64 44.5

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

   5. Applied rewrites 44.5%

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

   7. Applied rewrites 44.5%

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

   9. Applied rewrites 47.4%

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

Alternative 4: 38.9% accurate, 0.3× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} t_0 := \left(-0.5 \cdot z\right) \cdot \frac{z}{y}\\ t_1 := \frac{\left(x\_m \cdot x\_m + y \cdot y\right) - z \cdot z}{y \cdot 2}\\ \mathbf{if}\;t\_1 \leq 0:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;t\_1 \leq 10^{+146}:\\ \;\;\;\;0.5 \cdot y\\ \mathbf{elif}\;t\_1 \leq \infty:\\ \;\;\;\;\left(x\_m \cdot x\_m\right) \cdot \frac{0.5}{y}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m y z)
 :precision binary64
 (let* ((t_0 (* (* -0.5 z) (/ z y)))
        (t_1 (/ (- (+ (* x_m x_m) (* y y)) (* z z)) (* y 2.0))))
   (if (<= t_1 0.0)
     t_0
     (if (<= t_1 1e+146)
       (* 0.5 y)
       (if (<= t_1 INFINITY) (* (* x_m x_m) (/ 0.5 y)) t_0)))))

C

x_m = fabs(x);
double code(double x_m, double y, double z) {
	double t_0 = (-0.5 * z) * (z / y);
	double t_1 = (((x_m * x_m) + (y * y)) - (z * z)) / (y * 2.0);
	double tmp;
	if (t_1 <= 0.0) {
		tmp = t_0;
	} else if (t_1 <= 1e+146) {
		tmp = 0.5 * y;
	} else if (t_1 <= ((double) INFINITY)) {
		tmp = (x_m * x_m) * (0.5 / y);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Java

x_m = Math.abs(x);
public static double code(double x_m, double y, double z) {
	double t_0 = (-0.5 * z) * (z / y);
	double t_1 = (((x_m * x_m) + (y * y)) - (z * z)) / (y * 2.0);
	double tmp;
	if (t_1 <= 0.0) {
		tmp = t_0;
	} else if (t_1 <= 1e+146) {
		tmp = 0.5 * y;
	} else if (t_1 <= Double.POSITIVE_INFINITY) {
		tmp = (x_m * x_m) * (0.5 / y);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

x_m = math.fabs(x)
def code(x_m, y, z):
	t_0 = (-0.5 * z) * (z / y)
	t_1 = (((x_m * x_m) + (y * y)) - (z * z)) / (y * 2.0)
	tmp = 0
	if t_1 <= 0.0:
		tmp = t_0
	elif t_1 <= 1e+146:
		tmp = 0.5 * y
	elif t_1 <= math.inf:
		tmp = (x_m * x_m) * (0.5 / y)
	else:
		tmp = t_0
	return tmp

Julia

x_m = abs(x)
function code(x_m, y, z)
	t_0 = Float64(Float64(-0.5 * z) * Float64(z / y))
	t_1 = Float64(Float64(Float64(Float64(x_m * x_m) + Float64(y * y)) - Float64(z * z)) / Float64(y * 2.0))
	tmp = 0.0
	if (t_1 <= 0.0)
		tmp = t_0;
	elseif (t_1 <= 1e+146)
		tmp = Float64(0.5 * y);
	elseif (t_1 <= Inf)
		tmp = Float64(Float64(x_m * x_m) * Float64(0.5 / y));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

x_m = abs(x);
function tmp_2 = code(x_m, y, z)
	t_0 = (-0.5 * z) * (z / y);
	t_1 = (((x_m * x_m) + (y * y)) - (z * z)) / (y * 2.0);
	tmp = 0.0;
	if (t_1 <= 0.0)
		tmp = t_0;
	elseif (t_1 <= 1e+146)
		tmp = 0.5 * y;
	elseif (t_1 <= Inf)
		tmp = (x_m * x_m) * (0.5 / y);
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_, y_, z_] := Block[{t$95$0 = N[(N[(-0.5 * z), $MachinePrecision] * N[(z / y), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(N[(x$95$m * x$95$m), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision] - N[(z * z), $MachinePrecision]), $MachinePrecision] / N[(y * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, 0.0], t$95$0, If[LessEqual[t$95$1, 1e+146], N[(0.5 * y), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(N[(x$95$m * x$95$m), $MachinePrecision] * N[(0.5 / y), $MachinePrecision]), $MachinePrecision], t$95$0]]]]]

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 or +inf.0 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64)))

   1. Initial program 58.6%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 33.1

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

   5. Applied rewrites 33.1%

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

   7. Applied rewrites 37.6%

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

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

   1. Initial program 99.9%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\frac{1}{2} \cdot y} \]
   4. Step-by-step derivation

      1. lower-*.f64 72.0

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

   5. Applied rewrites 72.0%

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

   if 9.99999999999999934e145 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < +inf.0

   1. Initial program 74.3%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{\frac{{x}^{2}}{y} \cdot \frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{{x}^{2}}{y} \cdot \frac{1}{2}} \]

      3. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{{x}^{2}}{y}} \cdot \frac{1}{2} \]

      4. unpow2 N/A

         \[\leadsto \frac{\color{blue}{x \cdot x}}{y} \cdot \frac{1}{2} \]

      5. lower-*.f64 44.5

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

   5. Applied rewrites 44.5%

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

   7. Applied rewrites 44.5%

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

Alternative 5: 68.2% accurate, 0.3× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} t_0 := \frac{\left(x\_m \cdot x\_m + y \cdot y\right) - z \cdot z}{y \cdot 2}\\ \mathbf{if}\;t\_0 \leq 0 \lor \neg \left(t\_0 \leq \infty\right):\\ \;\;\;\;\mathsf{fma}\left(-z, \frac{z}{y}, y\right) \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x\_m}{y}, x\_m, y\right) \cdot 0.5\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m y z)
 :precision binary64
 (let* ((t_0 (/ (- (+ (* x_m x_m) (* y y)) (* z z)) (* y 2.0))))
   (if (or (<= t_0 0.0) (not (<= t_0 INFINITY)))
     (* (fma (- z) (/ z y) y) 0.5)
     (* (fma (/ x_m y) x_m y) 0.5))))

C

x_m = fabs(x);
double code(double x_m, double y, double z) {
	double t_0 = (((x_m * x_m) + (y * y)) - (z * z)) / (y * 2.0);
	double tmp;
	if ((t_0 <= 0.0) || !(t_0 <= ((double) INFINITY))) {
		tmp = fma(-z, (z / y), y) * 0.5;
	} else {
		tmp = fma((x_m / y), x_m, y) * 0.5;
	}
	return tmp;
}

Julia

x_m = abs(x)
function code(x_m, y, z)
	t_0 = Float64(Float64(Float64(Float64(x_m * x_m) + Float64(y * y)) - Float64(z * z)) / Float64(y * 2.0))
	tmp = 0.0
	if ((t_0 <= 0.0) || !(t_0 <= Inf))
		tmp = Float64(fma(Float64(-z), Float64(z / y), y) * 0.5);
	else
		tmp = Float64(fma(Float64(x_m / y), x_m, y) * 0.5);
	end
	return tmp
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_, y_, z_] := Block[{t$95$0 = N[(N[(N[(N[(x$95$m * x$95$m), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision] - N[(z * z), $MachinePrecision]), $MachinePrecision] / N[(y * 2.0), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$0, 0.0], N[Not[LessEqual[t$95$0, Infinity]], $MachinePrecision]], N[(N[((-z) * N[(z / y), $MachinePrecision] + y), $MachinePrecision] * 0.5), $MachinePrecision], N[(N[(N[(x$95$m / y), $MachinePrecision] * x$95$m + y), $MachinePrecision] * 0.5), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 58.6%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{\frac{{x}^{2}}{y} \cdot \frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{{x}^{2}}{y} \cdot \frac{1}{2}} \]

      3. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{{x}^{2}}{y}} \cdot \frac{1}{2} \]

      4. unpow2 N/A

         \[\leadsto \frac{\color{blue}{x \cdot x}}{y} \cdot \frac{1}{2} \]

      5. lower-*.f64 20.8

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

   5. Applied rewrites 20.8%

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

   7. Applied rewrites 20.8%

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

   8. Taylor expanded in x around 0

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

      1. unpow2 N/A

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

      2. unpow2 N/A

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

      3. difference-of-squares N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

   10. Applied rewrites 79.5%

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

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

   1. Initial program 81.1%

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

   3. Taylor expanded in z around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{\frac{{x}^{2} + {y}^{2}}{y} \cdot \frac{1}{2}} \]

      2. *-lft-identity N/A

         \[\leadsto \frac{\color{blue}{1 \cdot {x}^{2}} + {y}^{2}}{y} \cdot \frac{1}{2} \]

      3. *-inverses N/A

         \[\leadsto \frac{\color{blue}{\frac{{y}^{2}}{{y}^{2}}} \cdot {x}^{2} + {y}^{2}}{y} \cdot \frac{1}{2} \]

      4. associate-*l/ N/A

         \[\leadsto \frac{\color{blue}{\frac{{y}^{2} \cdot {x}^{2}}{{y}^{2}}} + {y}^{2}}{y} \cdot \frac{1}{2} \]

      5. associate-*r/ N/A

         \[\leadsto \frac{\color{blue}{{y}^{2} \cdot \frac{{x}^{2}}{{y}^{2}}} + {y}^{2}}{y} \cdot \frac{1}{2} \]

      6. *-rgt-identity N/A

         \[\leadsto \frac{{y}^{2} \cdot \frac{{x}^{2}}{{y}^{2}} + \color{blue}{{y}^{2} \cdot 1}}{y} \cdot \frac{1}{2} \]

      7. distribute-lft-in N/A

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

      8. +-commutative N/A

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

      9. associate-*l/ N/A

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

      10. unpow2 N/A

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

      11. associate-/l* N/A

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

      12. *-inverses N/A

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

      13. *-rgt-identity N/A

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

   5. Applied rewrites 72.8%

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

4. Final simplification 76.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y \cdot 2} \leq 0 \lor \neg \left(\frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y \cdot 2} \leq \infty\right):\\ \;\;\;\;\mathsf{fma}\left(-z, \frac{z}{y}, y\right) \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{y}, x, y\right) \cdot 0.5\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 50.7% accurate, 0.6× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} \mathbf{if}\;\frac{\left(x\_m \cdot x\_m + y \cdot y\right) - z \cdot z}{y \cdot 2} \leq 0:\\ \;\;\;\;\left(-0.5 \cdot z\right) \cdot \frac{z}{y}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x\_m}{y}, x\_m, y\right) \cdot 0.5\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m y z)
 :precision binary64
 (if (<= (/ (- (+ (* x_m x_m) (* y y)) (* z z)) (* y 2.0)) 0.0)
   (* (* -0.5 z) (/ z y))
   (* (fma (/ x_m y) x_m y) 0.5)))

C

x_m = fabs(x);
double code(double x_m, double y, double z) {
	double tmp;
	if (((((x_m * x_m) + (y * y)) - (z * z)) / (y * 2.0)) <= 0.0) {
		tmp = (-0.5 * z) * (z / y);
	} else {
		tmp = fma((x_m / y), x_m, y) * 0.5;
	}
	return tmp;
}

Julia

x_m = abs(x)
function code(x_m, y, z)
	tmp = 0.0
	if (Float64(Float64(Float64(Float64(x_m * x_m) + Float64(y * y)) - Float64(z * z)) / Float64(y * 2.0)) <= 0.0)
		tmp = Float64(Float64(-0.5 * z) * Float64(z / y));
	else
		tmp = Float64(fma(Float64(x_m / y), x_m, y) * 0.5);
	end
	return tmp
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_, y_, z_] := If[LessEqual[N[(N[(N[(N[(x$95$m * x$95$m), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision] - N[(z * z), $MachinePrecision]), $MachinePrecision] / N[(y * 2.0), $MachinePrecision]), $MachinePrecision], 0.0], N[(N[(-0.5 * z), $MachinePrecision] * N[(z / y), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x$95$m / y), $MachinePrecision] * x$95$m + y), $MachinePrecision] * 0.5), $MachinePrecision]]

Derivation

1. Split input into 2 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 72.1%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 31.7

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

   5. Applied rewrites 31.7%

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

   7. Applied rewrites 35.6%

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

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

   1. Initial program 66.3%

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

   3. Taylor expanded in z around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{\frac{{x}^{2} + {y}^{2}}{y} \cdot \frac{1}{2}} \]

      2. *-lft-identity N/A

         \[\leadsto \frac{\color{blue}{1 \cdot {x}^{2}} + {y}^{2}}{y} \cdot \frac{1}{2} \]

      3. *-inverses N/A

         \[\leadsto \frac{\color{blue}{\frac{{y}^{2}}{{y}^{2}}} \cdot {x}^{2} + {y}^{2}}{y} \cdot \frac{1}{2} \]

      4. associate-*l/ N/A

         \[\leadsto \frac{\color{blue}{\frac{{y}^{2} \cdot {x}^{2}}{{y}^{2}}} + {y}^{2}}{y} \cdot \frac{1}{2} \]

      5. associate-*r/ N/A

         \[\leadsto \frac{\color{blue}{{y}^{2} \cdot \frac{{x}^{2}}{{y}^{2}}} + {y}^{2}}{y} \cdot \frac{1}{2} \]

      6. *-rgt-identity N/A

         \[\leadsto \frac{{y}^{2} \cdot \frac{{x}^{2}}{{y}^{2}} + \color{blue}{{y}^{2} \cdot 1}}{y} \cdot \frac{1}{2} \]

      7. distribute-lft-in N/A

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

      8. +-commutative N/A

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

      9. associate-*l/ N/A

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

      10. unpow2 N/A

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

      11. associate-/l* N/A

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

      12. *-inverses N/A

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

      13. *-rgt-identity N/A

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

   5. Applied rewrites 68.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{x}{y}, x, y\right) \cdot 0.5} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 7: 32.7% accurate, 0.6× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} \mathbf{if}\;\frac{\left(x\_m \cdot x\_m + y \cdot y\right) - z \cdot z}{y \cdot 2} \leq 0:\\ \;\;\;\;\left(-0.5 \cdot z\right) \cdot \frac{z}{y}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot y\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m y z)
 :precision binary64
 (if (<= (/ (- (+ (* x_m x_m) (* y y)) (* z z)) (* y 2.0)) 0.0)
   (* (* -0.5 z) (/ z y))
   (* 0.5 y)))

C

x_m = fabs(x);
double code(double x_m, double y, double z) {
	double tmp;
	if (((((x_m * x_m) + (y * y)) - (z * z)) / (y * 2.0)) <= 0.0) {
		tmp = (-0.5 * z) * (z / y);
	} else {
		tmp = 0.5 * y;
	}
	return tmp;
}

Fortran

x_m = abs(x)
real(8) function code(x_m, y, z)
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (((((x_m * x_m) + (y * y)) - (z * z)) / (y * 2.0d0)) <= 0.0d0) then
        tmp = ((-0.5d0) * z) * (z / y)
    else
        tmp = 0.5d0 * y
    end if
    code = tmp
end function

Java

x_m = Math.abs(x);
public static double code(double x_m, double y, double z) {
	double tmp;
	if (((((x_m * x_m) + (y * y)) - (z * z)) / (y * 2.0)) <= 0.0) {
		tmp = (-0.5 * z) * (z / y);
	} else {
		tmp = 0.5 * y;
	}
	return tmp;
}

Python

x_m = math.fabs(x)
def code(x_m, y, z):
	tmp = 0
	if ((((x_m * x_m) + (y * y)) - (z * z)) / (y * 2.0)) <= 0.0:
		tmp = (-0.5 * z) * (z / y)
	else:
		tmp = 0.5 * y
	return tmp

Julia

x_m = abs(x)
function code(x_m, y, z)
	tmp = 0.0
	if (Float64(Float64(Float64(Float64(x_m * x_m) + Float64(y * y)) - Float64(z * z)) / Float64(y * 2.0)) <= 0.0)
		tmp = Float64(Float64(-0.5 * z) * Float64(z / y));
	else
		tmp = Float64(0.5 * y);
	end
	return tmp
end

MATLAB

x_m = abs(x);
function tmp_2 = code(x_m, y, z)
	tmp = 0.0;
	if (((((x_m * x_m) + (y * y)) - (z * z)) / (y * 2.0)) <= 0.0)
		tmp = (-0.5 * z) * (z / y);
	else
		tmp = 0.5 * y;
	end
	tmp_2 = tmp;
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_, y_, z_] := If[LessEqual[N[(N[(N[(N[(x$95$m * x$95$m), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision] - N[(z * z), $MachinePrecision]), $MachinePrecision] / N[(y * 2.0), $MachinePrecision]), $MachinePrecision], 0.0], N[(N[(-0.5 * z), $MachinePrecision] * N[(z / y), $MachinePrecision]), $MachinePrecision], N[(0.5 * y), $MachinePrecision]]

Derivation

1. Split input into 2 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 72.1%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 31.7

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

   5. Applied rewrites 31.7%

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

   7. Applied rewrites 35.6%

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

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

   1. Initial program 66.3%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\frac{1}{2} \cdot y} \]
   4. Step-by-step derivation

      1. lower-*.f64 35.1

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

   5. Applied rewrites 35.1%

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

Alternative 8: 32.8% accurate, 0.6× speedup

Math

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

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m y z)
 :precision binary64
 (if (<= (/ (- (+ (* x_m x_m) (* y y)) (* z z)) (* y 2.0)) -4e-84)
   (* -0.5 (/ (* z z) y))
   (* 0.5 y)))

C

x_m = fabs(x);
double code(double x_m, double y, double z) {
	double tmp;
	if (((((x_m * x_m) + (y * y)) - (z * z)) / (y * 2.0)) <= -4e-84) {
		tmp = -0.5 * ((z * z) / y);
	} else {
		tmp = 0.5 * y;
	}
	return tmp;
}

Fortran

x_m = abs(x)
real(8) function code(x_m, y, z)
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (((((x_m * x_m) + (y * y)) - (z * z)) / (y * 2.0d0)) <= (-4d-84)) then
        tmp = (-0.5d0) * ((z * z) / y)
    else
        tmp = 0.5d0 * y
    end if
    code = tmp
end function

Java

x_m = Math.abs(x);
public static double code(double x_m, double y, double z) {
	double tmp;
	if (((((x_m * x_m) + (y * y)) - (z * z)) / (y * 2.0)) <= -4e-84) {
		tmp = -0.5 * ((z * z) / y);
	} else {
		tmp = 0.5 * y;
	}
	return tmp;
}

Python

x_m = math.fabs(x)
def code(x_m, y, z):
	tmp = 0
	if ((((x_m * x_m) + (y * y)) - (z * z)) / (y * 2.0)) <= -4e-84:
		tmp = -0.5 * ((z * z) / y)
	else:
		tmp = 0.5 * y
	return tmp

Julia

x_m = abs(x)
function code(x_m, y, z)
	tmp = 0.0
	if (Float64(Float64(Float64(Float64(x_m * x_m) + Float64(y * y)) - Float64(z * z)) / Float64(y * 2.0)) <= -4e-84)
		tmp = Float64(-0.5 * Float64(Float64(z * z) / y));
	else
		tmp = Float64(0.5 * y);
	end
	return tmp
end

MATLAB

x_m = abs(x);
function tmp_2 = code(x_m, y, z)
	tmp = 0.0;
	if (((((x_m * x_m) + (y * y)) - (z * z)) / (y * 2.0)) <= -4e-84)
		tmp = -0.5 * ((z * z) / y);
	else
		tmp = 0.5 * y;
	end
	tmp_2 = tmp;
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_, y_, z_] := If[LessEqual[N[(N[(N[(N[(x$95$m * x$95$m), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision] - N[(z * z), $MachinePrecision]), $MachinePrecision] / N[(y * 2.0), $MachinePrecision]), $MachinePrecision], -4e-84], N[(-0.5 * N[(N[(z * z), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], N[(0.5 * y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 74.6%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. unpow2 N/A

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

      4. lower-*.f64 32.7

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

   5. Applied rewrites 32.7%

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

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

   1. Initial program 64.7%

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

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{\frac{1}{2} \cdot y} \]
   4. Step-by-step derivation

      1. lower-*.f64 35.6

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

   5. Applied rewrites 35.6%

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

Alternative 9: 34.1% accurate, 6.3× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ 0.5 \cdot y \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m y z) :precision binary64 (* 0.5 y))

C

x_m = fabs(x);
double code(double x_m, double y, double z) {
	return 0.5 * y;
}

Fortran

x_m = abs(x)
real(8) function code(x_m, y, z)
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = 0.5d0 * y
end function

Java

x_m = Math.abs(x);
public static double code(double x_m, double y, double z) {
	return 0.5 * y;
}

Python

x_m = math.fabs(x)
def code(x_m, y, z):
	return 0.5 * y

Julia

x_m = abs(x)
function code(x_m, y, z)
	return Float64(0.5 * y)
end

MATLAB

x_m = abs(x);
function tmp = code(x_m, y, z)
	tmp = 0.5 * y;
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_, y_, z_] := N[(0.5 * y), $MachinePrecision]

Derivation

1. Initial program 68.9%

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

3. Taylor expanded in y around inf

   \[\leadsto \color{blue}{\frac{1}{2} \cdot y} \]
4. Step-by-step derivation

   1. lower-*.f64 39.7

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

5. Applied rewrites 39.7%

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

Developer Target 1: 99.9% accurate, 1.1× 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 2024313 
(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)))