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

Percentage Accurate: 69.2% → 99.9%

Time: 6.7s

Alternatives: 8

Speedup: 1.3×

• 40.8% 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.2% 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} \\ \mathsf{fma}\left(z + x, \frac{x - z}{y}, y\right) \cdot 0.5 \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 69.7%

   \[\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}} \]
4. Step-by-step derivation

   1. distribute-lft-out N/A

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

   2. *-commutative N/A

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

   3. lower-*.f64 N/A

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

5. Applied rewrites 99.9%

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

Alternative 2: 37.9% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(-0.5 \cdot \frac{z}{y}\right) \cdot z\\ t_1 := \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y \cdot 2}\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{-25}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+152}:\\ \;\;\;\;0.5 \cdot y\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+290}:\\ \;\;\;\;\left(x \cdot \frac{x}{y}\right) \cdot 0.5\\ \mathbf{elif}\;t\_1 \leq \infty:\\ \;\;\;\;0.5 \cdot y\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (* -0.5 (/ z y)) z))
        (t_1 (/ (- (+ (* x x) (* y y)) (* z z)) (* y 2.0))))
   (if (<= t_1 -1e-25)
     t_0
     (if (<= t_1 5e+152)
       (* 0.5 y)
       (if (<= t_1 2e+290)
         (* (* x (/ x y)) 0.5)
         (if (<= t_1 INFINITY) (* 0.5 y) t_0))))))

C

double code(double x, double y, double z) {
	double t_0 = (-0.5 * (z / y)) * z;
	double t_1 = (((x * x) + (y * y)) - (z * z)) / (y * 2.0);
	double tmp;
	if (t_1 <= -1e-25) {
		tmp = t_0;
	} else if (t_1 <= 5e+152) {
		tmp = 0.5 * y;
	} else if (t_1 <= 2e+290) {
		tmp = (x * (x / y)) * 0.5;
	} else if (t_1 <= ((double) INFINITY)) {
		tmp = 0.5 * y;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Java

public static double code(double x, double y, double z) {
	double t_0 = (-0.5 * (z / y)) * z;
	double t_1 = (((x * x) + (y * y)) - (z * z)) / (y * 2.0);
	double tmp;
	if (t_1 <= -1e-25) {
		tmp = t_0;
	} else if (t_1 <= 5e+152) {
		tmp = 0.5 * y;
	} else if (t_1 <= 2e+290) {
		tmp = (x * (x / y)) * 0.5;
	} else if (t_1 <= Double.POSITIVE_INFINITY) {
		tmp = 0.5 * y;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = (-0.5 * (z / y)) * z
	t_1 = (((x * x) + (y * y)) - (z * z)) / (y * 2.0)
	tmp = 0
	if t_1 <= -1e-25:
		tmp = t_0
	elif t_1 <= 5e+152:
		tmp = 0.5 * y
	elif t_1 <= 2e+290:
		tmp = (x * (x / y)) * 0.5
	elif t_1 <= math.inf:
		tmp = 0.5 * y
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(-0.5 * Float64(z / y)) * z)
	t_1 = Float64(Float64(Float64(Float64(x * x) + Float64(y * y)) - Float64(z * z)) / Float64(y * 2.0))
	tmp = 0.0
	if (t_1 <= -1e-25)
		tmp = t_0;
	elseif (t_1 <= 5e+152)
		tmp = Float64(0.5 * y);
	elseif (t_1 <= 2e+290)
		tmp = Float64(Float64(x * Float64(x / y)) * 0.5);
	elseif (t_1 <= Inf)
		tmp = Float64(0.5 * y);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (-0.5 * (z / y)) * z;
	t_1 = (((x * x) + (y * y)) - (z * z)) / (y * 2.0);
	tmp = 0.0;
	if (t_1 <= -1e-25)
		tmp = t_0;
	elseif (t_1 <= 5e+152)
		tmp = 0.5 * y;
	elseif (t_1 <= 2e+290)
		tmp = (x * (x / y)) * 0.5;
	elseif (t_1 <= Inf)
		tmp = 0.5 * y;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(-0.5 * N[(z / y), $MachinePrecision]), $MachinePrecision] * z), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(N[(x * x), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision] - N[(z * z), $MachinePrecision]), $MachinePrecision] / N[(y * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1e-25], t$95$0, If[LessEqual[t$95$1, 5e+152], N[(0.5 * y), $MachinePrecision], If[LessEqual[t$95$1, 2e+290], N[(N[(x * N[(x / y), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(0.5 * y), $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))) < -1.00000000000000004e-25 or +inf.0 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64)))

   1. Initial program 62.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 0

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

      1. distribute-lft-out N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. unpow2 N/A

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

      3. associate-/l* N/A

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

      4. associate-*r* N/A

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

      5. *-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 37.7

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

   8. Applied rewrites 37.7%

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

   if -1.00000000000000004e-25 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < 5e152 or 2.00000000000000012e290 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < +inf.0

   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 y around inf

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

      1. lower-*.f64 41.8

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

   5. Applied rewrites 41.8%

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

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

   1. Initial program 99.4%

      \[\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}} \]
   4. Step-by-step derivation

      1. distribute-lft-out N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

   5. Applied rewrites 99.5%

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

   7. Applied rewrites 99.5%

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

   8. Taylor expanded in x around inf

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

   10. Applied rewrites 60.4%

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

Alternative 3: 37.9% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\frac{-0.5}{y} \cdot z\right) \cdot z\\ t_1 := \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y \cdot 2}\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{-25}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+152}:\\ \;\;\;\;0.5 \cdot y\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+290}:\\ \;\;\;\;\left(x \cdot \frac{x}{y}\right) \cdot 0.5\\ \mathbf{elif}\;t\_1 \leq \infty:\\ \;\;\;\;0.5 \cdot y\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (* (/ -0.5 y) z) z))
        (t_1 (/ (- (+ (* x x) (* y y)) (* z z)) (* y 2.0))))
   (if (<= t_1 -1e-25)
     t_0
     (if (<= t_1 5e+152)
       (* 0.5 y)
       (if (<= t_1 2e+290)
         (* (* x (/ x y)) 0.5)
         (if (<= t_1 INFINITY) (* 0.5 y) t_0))))))

C

double code(double x, double y, double z) {
	double t_0 = ((-0.5 / y) * z) * z;
	double t_1 = (((x * x) + (y * y)) - (z * z)) / (y * 2.0);
	double tmp;
	if (t_1 <= -1e-25) {
		tmp = t_0;
	} else if (t_1 <= 5e+152) {
		tmp = 0.5 * y;
	} else if (t_1 <= 2e+290) {
		tmp = (x * (x / y)) * 0.5;
	} else if (t_1 <= ((double) INFINITY)) {
		tmp = 0.5 * y;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Java

public static double code(double x, double y, double z) {
	double t_0 = ((-0.5 / y) * z) * z;
	double t_1 = (((x * x) + (y * y)) - (z * z)) / (y * 2.0);
	double tmp;
	if (t_1 <= -1e-25) {
		tmp = t_0;
	} else if (t_1 <= 5e+152) {
		tmp = 0.5 * y;
	} else if (t_1 <= 2e+290) {
		tmp = (x * (x / y)) * 0.5;
	} else if (t_1 <= Double.POSITIVE_INFINITY) {
		tmp = 0.5 * y;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = ((-0.5 / y) * z) * z
	t_1 = (((x * x) + (y * y)) - (z * z)) / (y * 2.0)
	tmp = 0
	if t_1 <= -1e-25:
		tmp = t_0
	elif t_1 <= 5e+152:
		tmp = 0.5 * y
	elif t_1 <= 2e+290:
		tmp = (x * (x / y)) * 0.5
	elif t_1 <= math.inf:
		tmp = 0.5 * y
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(Float64(-0.5 / y) * z) * z)
	t_1 = Float64(Float64(Float64(Float64(x * x) + Float64(y * y)) - Float64(z * z)) / Float64(y * 2.0))
	tmp = 0.0
	if (t_1 <= -1e-25)
		tmp = t_0;
	elseif (t_1 <= 5e+152)
		tmp = Float64(0.5 * y);
	elseif (t_1 <= 2e+290)
		tmp = Float64(Float64(x * Float64(x / y)) * 0.5);
	elseif (t_1 <= Inf)
		tmp = Float64(0.5 * y);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = ((-0.5 / y) * z) * z;
	t_1 = (((x * x) + (y * y)) - (z * z)) / (y * 2.0);
	tmp = 0.0;
	if (t_1 <= -1e-25)
		tmp = t_0;
	elseif (t_1 <= 5e+152)
		tmp = 0.5 * y;
	elseif (t_1 <= 2e+290)
		tmp = (x * (x / y)) * 0.5;
	elseif (t_1 <= Inf)
		tmp = 0.5 * y;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(N[(-0.5 / y), $MachinePrecision] * z), $MachinePrecision] * z), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(N[(x * x), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision] - N[(z * z), $MachinePrecision]), $MachinePrecision] / N[(y * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1e-25], t$95$0, If[LessEqual[t$95$1, 5e+152], N[(0.5 * y), $MachinePrecision], If[LessEqual[t$95$1, 2e+290], N[(N[(x * N[(x / y), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(0.5 * y), $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))) < -1.00000000000000004e-25 or +inf.0 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64)))

   1. Initial program 62.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 0

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

      1. distribute-lft-out N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

   5. Applied rewrites 99.9%

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

   7. Applied rewrites 99.9%

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

   8. Taylor expanded in z around inf

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

   10. Applied rewrites 37.7%

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

   12. Applied rewrites 37.7%

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

   if -1.00000000000000004e-25 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < 5e152 or 2.00000000000000012e290 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < +inf.0

   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 y around inf

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

      1. lower-*.f64 41.8

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

   5. Applied rewrites 41.8%

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

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

   1. Initial program 99.4%

      \[\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}} \]
   4. Step-by-step derivation

      1. distribute-lft-out N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

   5. Applied rewrites 99.5%

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

   7. Applied rewrites 99.5%

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

   8. Taylor expanded in x around inf

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

   10. Applied rewrites 60.4%

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

Alternative 4: 37.9% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\frac{-0.5}{y} \cdot z\right) \cdot z\\ t_1 := \frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y \cdot 2}\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{-25}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+152}:\\ \;\;\;\;0.5 \cdot y\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+290}:\\ \;\;\;\;\frac{x \cdot x}{y + y}\\ \mathbf{elif}\;t\_1 \leq \infty:\\ \;\;\;\;0.5 \cdot y\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (* (/ -0.5 y) z) z))
        (t_1 (/ (- (+ (* x x) (* y y)) (* z z)) (* y 2.0))))
   (if (<= t_1 -1e-25)
     t_0
     (if (<= t_1 5e+152)
       (* 0.5 y)
       (if (<= t_1 2e+290)
         (/ (* x x) (+ y y))
         (if (<= t_1 INFINITY) (* 0.5 y) t_0))))))

C

double code(double x, double y, double z) {
	double t_0 = ((-0.5 / y) * z) * z;
	double t_1 = (((x * x) + (y * y)) - (z * z)) / (y * 2.0);
	double tmp;
	if (t_1 <= -1e-25) {
		tmp = t_0;
	} else if (t_1 <= 5e+152) {
		tmp = 0.5 * y;
	} else if (t_1 <= 2e+290) {
		tmp = (x * x) / (y + y);
	} else if (t_1 <= ((double) INFINITY)) {
		tmp = 0.5 * y;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Java

public static double code(double x, double y, double z) {
	double t_0 = ((-0.5 / y) * z) * z;
	double t_1 = (((x * x) + (y * y)) - (z * z)) / (y * 2.0);
	double tmp;
	if (t_1 <= -1e-25) {
		tmp = t_0;
	} else if (t_1 <= 5e+152) {
		tmp = 0.5 * y;
	} else if (t_1 <= 2e+290) {
		tmp = (x * x) / (y + y);
	} else if (t_1 <= Double.POSITIVE_INFINITY) {
		tmp = 0.5 * y;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = ((-0.5 / y) * z) * z
	t_1 = (((x * x) + (y * y)) - (z * z)) / (y * 2.0)
	tmp = 0
	if t_1 <= -1e-25:
		tmp = t_0
	elif t_1 <= 5e+152:
		tmp = 0.5 * y
	elif t_1 <= 2e+290:
		tmp = (x * x) / (y + y)
	elif t_1 <= math.inf:
		tmp = 0.5 * y
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(Float64(-0.5 / y) * z) * z)
	t_1 = Float64(Float64(Float64(Float64(x * x) + Float64(y * y)) - Float64(z * z)) / Float64(y * 2.0))
	tmp = 0.0
	if (t_1 <= -1e-25)
		tmp = t_0;
	elseif (t_1 <= 5e+152)
		tmp = Float64(0.5 * y);
	elseif (t_1 <= 2e+290)
		tmp = Float64(Float64(x * x) / Float64(y + y));
	elseif (t_1 <= Inf)
		tmp = Float64(0.5 * y);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = ((-0.5 / y) * z) * z;
	t_1 = (((x * x) + (y * y)) - (z * z)) / (y * 2.0);
	tmp = 0.0;
	if (t_1 <= -1e-25)
		tmp = t_0;
	elseif (t_1 <= 5e+152)
		tmp = 0.5 * y;
	elseif (t_1 <= 2e+290)
		tmp = (x * x) / (y + y);
	elseif (t_1 <= Inf)
		tmp = 0.5 * y;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(N[(-0.5 / y), $MachinePrecision] * z), $MachinePrecision] * z), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(N[(x * x), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision] - N[(z * z), $MachinePrecision]), $MachinePrecision] / N[(y * 2.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -1e-25], t$95$0, If[LessEqual[t$95$1, 5e+152], N[(0.5 * y), $MachinePrecision], If[LessEqual[t$95$1, 2e+290], N[(N[(x * x), $MachinePrecision] / N[(y + y), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, Infinity], N[(0.5 * y), $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))) < -1.00000000000000004e-25 or +inf.0 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64)))

   1. Initial program 62.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 0

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

      1. distribute-lft-out N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

   5. Applied rewrites 99.9%

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

   7. Applied rewrites 99.9%

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

   8. Taylor expanded in z around inf

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

   10. Applied rewrites 37.7%

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

   12. Applied rewrites 37.7%

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

   if -1.00000000000000004e-25 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < 5e152 or 2.00000000000000012e290 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64))) < +inf.0

   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 y around inf

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

      1. lower-*.f64 41.8

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

   5. Applied rewrites 41.8%

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

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

   1. Initial program 99.4%

      \[\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 \frac{\color{blue}{{y}^{2} - {z}^{2}}}{y \cdot 2} \]
   4. Step-by-step derivation

      1. unpow2 N/A

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

      2. unpow2 N/A

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

      3. difference-of-squares N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower--.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 41.2

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

   5. Applied rewrites 41.2%

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

   6. Taylor expanded in x around inf

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

      1. unpow2 N/A

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

      2. lower-*.f64 60.2

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

   8. Applied rewrites 60.2%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. count-2-rev N/A

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

      4. lower-+.f64 60.2

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

   10. Applied rewrites 60.2%

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

Alternative 5: 68.2% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (/ (- (+ (* x x) (* y y)) (* z z)) (* y 2.0))))
   (if (or (<= t_0 -1e-25) (not (<= t_0 INFINITY)))
     (* (- y (* (/ z y) z)) 0.5)
     (* (fma (/ x y) x y) 0.5))))

C

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

Julia

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

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(N[(N[(x * x), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision] - N[(z * z), $MachinePrecision]), $MachinePrecision] / N[(y * 2.0), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$0, -1e-25], N[Not[LessEqual[t$95$0, Infinity]], $MachinePrecision]], N[(N[(y - N[(N[(z / y), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision], N[(N[(N[(x / y), $MachinePrecision] * x + 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))) < -1.00000000000000004e-25 or +inf.0 < (/.f64 (-.f64 (+.f64 (*.f64 x x) (*.f64 y y)) (*.f64 z z)) (*.f64 y #s(literal 2 binary64)))

   1. Initial program 62.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 0

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

      1. *-commutative N/A

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

      2. div-sub N/A

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

      3. unpow2 N/A

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

      4. associate-/l* N/A

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

      5. *-inverses N/A

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

      6. *-rgt-identity N/A

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

      7. lower-*.f64 N/A

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

      8. lower--.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-*.f64 60.2

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

   5. Applied rewrites 60.2%

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

   7. Applied rewrites 71.7%

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

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

   1. Initial program 76.5%

      \[\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. div-add N/A

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

      2. distribute-lft-in N/A

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

      3. unpow2 N/A

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

      4. associate-/l* N/A

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

      5. *-inverses N/A

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

      6. *-rgt-identity N/A

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

      7. distribute-lft-in N/A

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

      8. +-commutative N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. +-commutative N/A

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

      12. unpow2 N/A

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

      13. associate-/l* N/A

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

      14. *-commutative N/A

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

      15. lower-fma.f64 N/A

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

      16. lower-/.f64 68.2

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

   5. Applied rewrites 68.2%

      \[\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 69.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y \cdot 2} \leq -1 \cdot 10^{-25} \lor \neg \left(\frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y \cdot 2} \leq \infty\right):\\ \;\;\;\;\left(y - \frac{z}{y} \cdot z\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: 51.5% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{\left(x \cdot x + y \cdot y\right) - z \cdot z}{y \cdot 2} \leq -1 \cdot 10^{-25}:\\ \;\;\;\;\left(-0.5 \cdot \frac{z}{y}\right) \cdot z\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{y}, x, y\right) \cdot 0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (/ (- (+ (* x x) (* y y)) (* z z)) (* y 2.0)) -1e-25)
   (* (* -0.5 (/ z y)) z)
   (* (fma (/ x y) x y) 0.5)))

C

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

Julia

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

Wolfram

code[x_, y_, z_] := If[LessEqual[N[(N[(N[(N[(x * x), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision] - N[(z * z), $MachinePrecision]), $MachinePrecision] / N[(y * 2.0), $MachinePrecision]), $MachinePrecision], -1e-25], N[(N[(-0.5 * N[(z / y), $MachinePrecision]), $MachinePrecision] * z), $MachinePrecision], N[(N[(N[(x / y), $MachinePrecision] * x + 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))) < -1.00000000000000004e-25

   1. Initial program 79.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}} \]
   4. Step-by-step derivation

      1. distribute-lft-out N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. unpow2 N/A

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

      3. associate-/l* N/A

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

      4. associate-*r* N/A

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

      5. *-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 34.6

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

   8. Applied rewrites 34.6%

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

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

   1. Initial program 63.4%

      \[\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. div-add N/A

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

      2. distribute-lft-in N/A

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

      3. unpow2 N/A

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

      4. associate-/l* N/A

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

      5. *-inverses N/A

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

      6. *-rgt-identity N/A

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

      7. distribute-lft-in N/A

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

      8. +-commutative N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. +-commutative N/A

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

      12. unpow2 N/A

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

      13. associate-/l* N/A

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

      14. *-commutative N/A

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

      15. lower-fma.f64 N/A

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

      16. lower-/.f64 64.8

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

   5. Applied rewrites 64.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: 41.1% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 8 \cdot 10^{+77}:\\ \;\;\;\;\frac{x \cdot x}{y + y}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y 8e+77) (/ (* x x) (+ y y)) (* 0.5 y)))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= 8e+77) {
		tmp = (x * x) / (y + y);
	} else {
		tmp = 0.5 * y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (y <= 8d+77) then
        tmp = (x * x) / (y + y)
    else
        tmp = 0.5d0 * y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (y <= 8e+77) {
		tmp = (x * x) / (y + y);
	} else {
		tmp = 0.5 * y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if y <= 8e+77:
		tmp = (x * x) / (y + y)
	else:
		tmp = 0.5 * y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= 8e+77)
		tmp = Float64(Float64(x * x) / Float64(y + y));
	else
		tmp = Float64(0.5 * y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= 8e+77)
		tmp = (x * x) / (y + y);
	else
		tmp = 0.5 * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, 8e+77], N[(N[(x * x), $MachinePrecision] / N[(y + y), $MachinePrecision]), $MachinePrecision], N[(0.5 * y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 7.99999999999999986e77

   1. Initial program 79.4%

      \[\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 \frac{\color{blue}{{y}^{2} - {z}^{2}}}{y \cdot 2} \]
   4. Step-by-step derivation

      1. unpow2 N/A

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

      2. unpow2 N/A

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

      3. difference-of-squares N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower--.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 52.2

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

   5. Applied rewrites 52.2%

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

   6. Taylor expanded in x around inf

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

      1. unpow2 N/A

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

      2. lower-*.f64 35.9

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

   8. Applied rewrites 35.9%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. count-2-rev N/A

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

      4. lower-+.f64 35.9

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

   10. Applied rewrites 35.9%

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

   if 7.99999999999999986e77 < y

   1. Initial program 33.5%

      \[\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 75.2

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

   5. Applied rewrites 75.2%

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

Alternative 8: 34.7% accurate, 6.3× speedup

Math

\[\begin{array}{l} \\ 0.5 \cdot y \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (* 0.5 y))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := N[(0.5 * y), $MachinePrecision]

Derivation

1. Initial program 69.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 36.8

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

5. Applied rewrites 36.8%

   \[\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 2024337 
(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)))