Diagrams.TwoD.Apollonian:descartes from diagrams-contrib-1.3.0.5

Percentage Accurate: 70.0% → 94.2%

Time: 16.1s

Alternatives: 9

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

public static double code(double x, double y, double z) {
	return 2.0 * Math.sqrt((((x * y) + (x * z)) + (y * z)));
}

Python

def code(x, y, z):
	return 2.0 * math.sqrt((((x * y) + (x * z)) + (y * z)))

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 70.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

public static double code(double x, double y, double z) {
	return 2.0 * Math.sqrt((((x * y) + (x * z)) + (y * z)));
}

Python

def code(x, y, z):
	return 2.0 * math.sqrt((((x * y) + (x * z)) + (y * z)))

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 94.2% accurate, 0.3× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq -4.8 \cdot 10^{+25}:\\ \;\;\;\;2 \cdot {\left(e^{0.25 \cdot \left(\log \left(\left(-z\right) - x\right) - \log \left(\frac{-1}{y}\right)\right)}\right)}^{2}\\ \mathbf{elif}\;y \leq 3 \cdot 10^{-298}:\\ \;\;\;\;2 \cdot \sqrt{y \cdot x + z \cdot \left(y + x\right)}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y}\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
 :precision binary64
 (if (<= y -4.8e+25)
   (* 2.0 (pow (exp (* 0.25 (- (log (- (- z) x)) (log (/ -1.0 y))))) 2.0))
   (if (<= y 3e-298)
     (* 2.0 (sqrt (+ (* y x) (* z (+ y x)))))
     (* 2.0 (* (sqrt z) (sqrt y))))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if (y <= -4.8e+25) {
		tmp = 2.0 * pow(exp((0.25 * (log((-z - x)) - log((-1.0 / y))))), 2.0);
	} else if (y <= 3e-298) {
		tmp = 2.0 * sqrt(((y * x) + (z * (y + x))));
	} else {
		tmp = 2.0 * (sqrt(z) * sqrt(y));
	}
	return tmp;
}

Fortran

NOTE: x, y, and z should be sorted in increasing order before calling this function.
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 <= (-4.8d+25)) then
        tmp = 2.0d0 * (exp((0.25d0 * (log((-z - x)) - log(((-1.0d0) / y))))) ** 2.0d0)
    else if (y <= 3d-298) then
        tmp = 2.0d0 * sqrt(((y * x) + (z * (y + x))))
    else
        tmp = 2.0d0 * (sqrt(z) * sqrt(y))
    end if
    code = tmp
end function

Java

assert x < y && y < z;
public static double code(double x, double y, double z) {
	double tmp;
	if (y <= -4.8e+25) {
		tmp = 2.0 * Math.pow(Math.exp((0.25 * (Math.log((-z - x)) - Math.log((-1.0 / y))))), 2.0);
	} else if (y <= 3e-298) {
		tmp = 2.0 * Math.sqrt(((y * x) + (z * (y + x))));
	} else {
		tmp = 2.0 * (Math.sqrt(z) * Math.sqrt(y));
	}
	return tmp;
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	tmp = 0
	if y <= -4.8e+25:
		tmp = 2.0 * math.pow(math.exp((0.25 * (math.log((-z - x)) - math.log((-1.0 / y))))), 2.0)
	elif y <= 3e-298:
		tmp = 2.0 * math.sqrt(((y * x) + (z * (y + x))))
	else:
		tmp = 2.0 * (math.sqrt(z) * math.sqrt(y))
	return tmp

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (y <= -4.8e+25)
		tmp = Float64(2.0 * (exp(Float64(0.25 * Float64(log(Float64(Float64(-z) - x)) - log(Float64(-1.0 / y))))) ^ 2.0));
	elseif (y <= 3e-298)
		tmp = Float64(2.0 * sqrt(Float64(Float64(y * x) + Float64(z * Float64(y + x)))));
	else
		tmp = Float64(2.0 * Float64(sqrt(z) * sqrt(y)));
	end
	return tmp
end

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= -4.8e+25)
		tmp = 2.0 * (exp((0.25 * (log((-z - x)) - log((-1.0 / y))))) ^ 2.0);
	elseif (y <= 3e-298)
		tmp = 2.0 * sqrt(((y * x) + (z * (y + x))));
	else
		tmp = 2.0 * (sqrt(z) * sqrt(y));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := If[LessEqual[y, -4.8e+25], N[(2.0 * N[Power[N[Exp[N[(0.25 * N[(N[Log[N[((-z) - x), $MachinePrecision]], $MachinePrecision] - N[Log[N[(-1.0 / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 3e-298], N[(2.0 * N[Sqrt[N[(N[(y * x), $MachinePrecision] + N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[z], $MachinePrecision] * N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -4.79999999999999992e25

   1. Initial program 64.6%

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

      1. +-commutative 64.6%

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

      2. associate-+r+ 64.6%

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

      3. *-commutative 64.6%

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

      4. +-commutative 64.6%

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

      5. associate-+l+ 64.6%

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

      6. *-commutative 64.6%

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

      7. *-commutative 64.6%

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

      8. +-commutative 64.6%

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

      9. +-commutative 64.6%

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

      10. *-commutative 64.6%

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

      11. *-commutative 64.6%

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

      12. associate-+l+ 64.6%

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

      13. +-commutative 64.6%

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

      14. fma-define 64.6%

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

      15. distribute-lft-out 64.9%

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

   3. Simplified 64.9%

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

      1. add-sqr-sqrt 64.4%

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

      2. pow2 64.4%

         \[\leadsto 2 \cdot \color{blue}{{\left(\sqrt{\sqrt{\mathsf{fma}\left(x, z, y \cdot \left(x + z\right)\right)}}\right)}^{2}} \]

      3. pow1/2 64.7%

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

      4. sqrt-pow1 64.7%

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

      5. metadata-eval 64.7%

         \[\leadsto 2 \cdot {\left({\left(\mathsf{fma}\left(x, z, y \cdot \left(x + z\right)\right)\right)}^{\color{blue}{0.25}}\right)}^{2} \]

   6. Applied egg-rr 64.7%

      \[\leadsto 2 \cdot \color{blue}{{\left({\left(\mathsf{fma}\left(x, z, y \cdot \left(x + z\right)\right)\right)}^{0.25}\right)}^{2}} \]

   7. Taylor expanded in y around -inf 82.0%

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

   if -4.79999999999999992e25 < y < 2.9999999999999999e-298

   1. Initial program 83.8%

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

      1. associate-+l+ 83.8%

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

      2. +-commutative 83.8%

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

      3. distribute-rgt-in 83.8%

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

   3. Simplified 83.8%

      \[\leadsto \color{blue}{2 \cdot \sqrt{x \cdot y + z \cdot \left(y + x\right)}} \]
   4. Add Preprocessing

   if 2.9999999999999999e-298 < y

   1. Initial program 67.3%

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

      1. associate-+l+ 67.3%

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

      2. +-commutative 67.3%

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

      3. distribute-rgt-in 67.3%

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

   3. Simplified 67.3%

      \[\leadsto \color{blue}{2 \cdot \sqrt{x \cdot y + z \cdot \left(y + x\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 25.3%

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

      1. *-commutative 25.3%

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

   7. Simplified 25.3%

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

      1. sqrt-prod 39.7%

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

   9. Applied egg-rr 39.7%

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

4. Final simplification 60.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -4.8 \cdot 10^{+25}:\\ \;\;\;\;2 \cdot {\left(e^{0.25 \cdot \left(\log \left(\left(-z\right) - x\right) - \log \left(\frac{-1}{y}\right)\right)}\right)}^{2}\\ \mathbf{elif}\;y \leq 3 \cdot 10^{-298}:\\ \;\;\;\;2 \cdot \sqrt{y \cdot x + z \cdot \left(y + x\right)}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 94.2% accurate, 0.4× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq -2.4 \cdot 10^{+28}:\\ \;\;\;\;2 \cdot e^{\left(\log \left(-x\right) + \log \left(-y\right)\right) \cdot 0.5}\\ \mathbf{elif}\;y \leq 3 \cdot 10^{-298}:\\ \;\;\;\;2 \cdot \sqrt{y \cdot x + z \cdot \left(y + x\right)}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y}\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
 :precision binary64
 (if (<= y -2.4e+28)
   (* 2.0 (exp (* (+ (log (- x)) (log (- y))) 0.5)))
   (if (<= y 3e-298)
     (* 2.0 (sqrt (+ (* y x) (* z (+ y x)))))
     (* 2.0 (* (sqrt z) (sqrt y))))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if (y <= -2.4e+28) {
		tmp = 2.0 * exp(((log(-x) + log(-y)) * 0.5));
	} else if (y <= 3e-298) {
		tmp = 2.0 * sqrt(((y * x) + (z * (y + x))));
	} else {
		tmp = 2.0 * (sqrt(z) * sqrt(y));
	}
	return tmp;
}

Fortran

NOTE: x, y, and z should be sorted in increasing order before calling this function.
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 <= (-2.4d+28)) then
        tmp = 2.0d0 * exp(((log(-x) + log(-y)) * 0.5d0))
    else if (y <= 3d-298) then
        tmp = 2.0d0 * sqrt(((y * x) + (z * (y + x))))
    else
        tmp = 2.0d0 * (sqrt(z) * sqrt(y))
    end if
    code = tmp
end function

Java

assert x < y && y < z;
public static double code(double x, double y, double z) {
	double tmp;
	if (y <= -2.4e+28) {
		tmp = 2.0 * Math.exp(((Math.log(-x) + Math.log(-y)) * 0.5));
	} else if (y <= 3e-298) {
		tmp = 2.0 * Math.sqrt(((y * x) + (z * (y + x))));
	} else {
		tmp = 2.0 * (Math.sqrt(z) * Math.sqrt(y));
	}
	return tmp;
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	tmp = 0
	if y <= -2.4e+28:
		tmp = 2.0 * math.exp(((math.log(-x) + math.log(-y)) * 0.5))
	elif y <= 3e-298:
		tmp = 2.0 * math.sqrt(((y * x) + (z * (y + x))))
	else:
		tmp = 2.0 * (math.sqrt(z) * math.sqrt(y))
	return tmp

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (y <= -2.4e+28)
		tmp = Float64(2.0 * exp(Float64(Float64(log(Float64(-x)) + log(Float64(-y))) * 0.5)));
	elseif (y <= 3e-298)
		tmp = Float64(2.0 * sqrt(Float64(Float64(y * x) + Float64(z * Float64(y + x)))));
	else
		tmp = Float64(2.0 * Float64(sqrt(z) * sqrt(y)));
	end
	return tmp
end

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= -2.4e+28)
		tmp = 2.0 * exp(((log(-x) + log(-y)) * 0.5));
	elseif (y <= 3e-298)
		tmp = 2.0 * sqrt(((y * x) + (z * (y + x))));
	else
		tmp = 2.0 * (sqrt(z) * sqrt(y));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := If[LessEqual[y, -2.4e+28], N[(2.0 * N[Exp[N[(N[(N[Log[(-x)], $MachinePrecision] + N[Log[(-y)], $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 3e-298], N[(2.0 * N[Sqrt[N[(N[(y * x), $MachinePrecision] + N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[z], $MachinePrecision] * N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -2.39999999999999981e28

   1. Initial program 64.6%

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

      1. +-commutative 64.6%

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

      2. associate-+r+ 64.6%

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

      3. *-commutative 64.6%

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

      4. +-commutative 64.6%

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

      5. associate-+l+ 64.6%

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

      6. *-commutative 64.6%

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

      7. *-commutative 64.6%

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

      8. +-commutative 64.6%

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

      9. +-commutative 64.6%

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

      10. *-commutative 64.6%

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

      11. *-commutative 64.6%

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

      12. associate-+l+ 64.6%

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

      13. +-commutative 64.6%

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

      14. fma-define 64.6%

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

      15. distribute-lft-out 64.9%

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

   3. Simplified 64.9%

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

      1. pow1/2 65.2%

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

      2. pow-to-exp 60.6%

         \[\leadsto 2 \cdot \color{blue}{e^{\log \left(\mathsf{fma}\left(x, z, y \cdot \left(x + z\right)\right)\right) \cdot 0.5}} \]

   6. Applied egg-rr 60.6%

      \[\leadsto 2 \cdot \color{blue}{e^{\log \left(\mathsf{fma}\left(x, z, y \cdot \left(x + z\right)\right)\right) \cdot 0.5}} \]

   7. Taylor expanded in y around -inf 82.0%

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

      1. neg-mul-1 82.0%

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

      2. +-commutative 82.0%

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

      3. mul-1-neg 82.0%

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

   9. Simplified 82.0%

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

   10. Taylor expanded in z around 0 34.9%

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

       1. sub-neg 34.9%

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

       2. log-rec 34.9%

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

       3. associate-/r/ 34.9%

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

       4. metadata-eval 34.9%

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

       5. neg-mul-1 34.9%

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

   12. Simplified 34.9%

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

   if -2.39999999999999981e28 < y < 2.9999999999999999e-298

   1. Initial program 83.8%

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

      1. associate-+l+ 83.8%

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

      2. +-commutative 83.8%

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

      3. distribute-rgt-in 83.8%

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

   3. Simplified 83.8%

      \[\leadsto \color{blue}{2 \cdot \sqrt{x \cdot y + z \cdot \left(y + x\right)}} \]
   4. Add Preprocessing

   if 2.9999999999999999e-298 < y

   1. Initial program 67.3%

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

      1. associate-+l+ 67.3%

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

      2. +-commutative 67.3%

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

      3. distribute-rgt-in 67.3%

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

   3. Simplified 67.3%

      \[\leadsto \color{blue}{2 \cdot \sqrt{x \cdot y + z \cdot \left(y + x\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 25.3%

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

      1. *-commutative 25.3%

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

   7. Simplified 25.3%

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

      1. sqrt-prod 39.7%

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

   9. Applied egg-rr 39.7%

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

4. Final simplification 51.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2.4 \cdot 10^{+28}:\\ \;\;\;\;2 \cdot e^{\left(\log \left(-x\right) + \log \left(-y\right)\right) \cdot 0.5}\\ \mathbf{elif}\;y \leq 3 \cdot 10^{-298}:\\ \;\;\;\;2 \cdot \sqrt{y \cdot x + z \cdot \left(y + x\right)}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 83.2% accurate, 0.5× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq 3 \cdot 10^{-298}:\\ \;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, z, y \cdot \left(x + z\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y}\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
 :precision binary64
 (if (<= y 3e-298)
   (* 2.0 (sqrt (fma x z (* y (+ x z)))))
   (* 2.0 (* (sqrt z) (sqrt y)))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if (y <= 3e-298) {
		tmp = 2.0 * sqrt(fma(x, z, (y * (x + z))));
	} else {
		tmp = 2.0 * (sqrt(z) * sqrt(y));
	}
	return tmp;
}

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (y <= 3e-298)
		tmp = Float64(2.0 * sqrt(fma(x, z, Float64(y * Float64(x + z)))));
	else
		tmp = Float64(2.0 * Float64(sqrt(z) * sqrt(y)));
	end
	return tmp
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := If[LessEqual[y, 3e-298], N[(2.0 * N[Sqrt[N[(x * z + N[(y * N[(x + z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[z], $MachinePrecision] * N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 2.9999999999999999e-298

   1. Initial program 76.1%

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

      1. +-commutative 76.1%

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

      2. associate-+r+ 76.1%

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

      3. *-commutative 76.1%

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

      4. +-commutative 76.1%

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

      5. associate-+l+ 76.1%

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

      6. *-commutative 76.1%

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

      7. *-commutative 76.1%

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

      8. +-commutative 76.1%

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

      9. +-commutative 76.1%

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

      10. *-commutative 76.1%

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

      11. *-commutative 76.1%

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

      12. associate-+l+ 76.1%

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

      13. +-commutative 76.1%

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

      14. fma-define 76.1%

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

      15. distribute-lft-out 76.2%

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

   3. Simplified 76.2%

      \[\leadsto \color{blue}{2 \cdot \sqrt{\mathsf{fma}\left(x, z, y \cdot \left(x + z\right)\right)}} \]
   4. Add Preprocessing

   if 2.9999999999999999e-298 < y

   1. Initial program 67.3%

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

      1. associate-+l+ 67.3%

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

      2. +-commutative 67.3%

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

      3. distribute-rgt-in 67.3%

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

   3. Simplified 67.3%

      \[\leadsto \color{blue}{2 \cdot \sqrt{x \cdot y + z \cdot \left(y + x\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 25.3%

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

      1. *-commutative 25.3%

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

   7. Simplified 25.3%

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

      1. sqrt-prod 39.7%

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

   9. Applied egg-rr 39.7%

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

Alternative 4: 83.2% accurate, 0.5× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq 3 \cdot 10^{-298}:\\ \;\;\;\;2 \cdot \sqrt{x \cdot \left(y + \left(z + y \cdot \frac{z}{x}\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y}\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
 :precision binary64
 (if (<= y 3e-298)
   (* 2.0 (sqrt (* x (+ y (+ z (* y (/ z x)))))))
   (* 2.0 (* (sqrt z) (sqrt y)))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if (y <= 3e-298) {
		tmp = 2.0 * sqrt((x * (y + (z + (y * (z / x))))));
	} else {
		tmp = 2.0 * (sqrt(z) * sqrt(y));
	}
	return tmp;
}

Fortran

NOTE: x, y, and z should be sorted in increasing order before calling this function.
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 <= 3d-298) then
        tmp = 2.0d0 * sqrt((x * (y + (z + (y * (z / x))))))
    else
        tmp = 2.0d0 * (sqrt(z) * sqrt(y))
    end if
    code = tmp
end function

Java

assert x < y && y < z;
public static double code(double x, double y, double z) {
	double tmp;
	if (y <= 3e-298) {
		tmp = 2.0 * Math.sqrt((x * (y + (z + (y * (z / x))))));
	} else {
		tmp = 2.0 * (Math.sqrt(z) * Math.sqrt(y));
	}
	return tmp;
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	tmp = 0
	if y <= 3e-298:
		tmp = 2.0 * math.sqrt((x * (y + (z + (y * (z / x))))))
	else:
		tmp = 2.0 * (math.sqrt(z) * math.sqrt(y))
	return tmp

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (y <= 3e-298)
		tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + Float64(z + Float64(y * Float64(z / x)))))));
	else
		tmp = Float64(2.0 * Float64(sqrt(z) * sqrt(y)));
	end
	return tmp
end

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= 3e-298)
		tmp = 2.0 * sqrt((x * (y + (z + (y * (z / x))))));
	else
		tmp = 2.0 * (sqrt(z) * sqrt(y));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := If[LessEqual[y, 3e-298], N[(2.0 * N[Sqrt[N[(x * N[(y + N[(z + N[(y * N[(z / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[z], $MachinePrecision] * N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 2.9999999999999999e-298

   1. Initial program 76.1%

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

      1. +-commutative 76.1%

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

      2. associate-+r+ 76.1%

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

      3. *-commutative 76.1%

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

      4. +-commutative 76.1%

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

      5. associate-+l+ 76.1%

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

      6. *-commutative 76.1%

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

      7. *-commutative 76.1%

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

      8. +-commutative 76.1%

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

      9. +-commutative 76.1%

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

      10. *-commutative 76.1%

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

      11. *-commutative 76.1%

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

      12. associate-+l+ 76.1%

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

      13. +-commutative 76.1%

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

      14. fma-define 76.1%

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

      15. distribute-lft-out 76.2%

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

   3. Simplified 76.2%

      \[\leadsto \color{blue}{2 \cdot \sqrt{\mathsf{fma}\left(x, z, y \cdot \left(x + z\right)\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 69.1%

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

      1. associate-/l* 66.0%

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

   7. Simplified 66.0%

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

   if 2.9999999999999999e-298 < y

   1. Initial program 67.3%

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

      1. associate-+l+ 67.3%

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

      2. +-commutative 67.3%

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

      3. distribute-rgt-in 67.3%

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

   3. Simplified 67.3%

      \[\leadsto \color{blue}{2 \cdot \sqrt{x \cdot y + z \cdot \left(y + x\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 25.3%

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

      1. *-commutative 25.3%

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

   7. Simplified 25.3%

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

      1. sqrt-prod 39.7%

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

   9. Applied egg-rr 39.7%

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

Alternative 5: 69.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq -1 \cdot 10^{-274}:\\ \;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \sqrt{z \cdot \left(y + x\right)}\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
 :precision binary64
 (if (<= y -1e-274) (* 2.0 (sqrt (* x (+ y z)))) (* 2.0 (sqrt (* z (+ y x))))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if (y <= -1e-274) {
		tmp = 2.0 * sqrt((x * (y + z)));
	} else {
		tmp = 2.0 * sqrt((z * (y + x)));
	}
	return tmp;
}

Fortran

NOTE: x, y, and z should be sorted in increasing order before calling this function.
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 <= (-1d-274)) then
        tmp = 2.0d0 * sqrt((x * (y + z)))
    else
        tmp = 2.0d0 * sqrt((z * (y + x)))
    end if
    code = tmp
end function

Java

assert x < y && y < z;
public static double code(double x, double y, double z) {
	double tmp;
	if (y <= -1e-274) {
		tmp = 2.0 * Math.sqrt((x * (y + z)));
	} else {
		tmp = 2.0 * Math.sqrt((z * (y + x)));
	}
	return tmp;
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	tmp = 0
	if y <= -1e-274:
		tmp = 2.0 * math.sqrt((x * (y + z)))
	else:
		tmp = 2.0 * math.sqrt((z * (y + x)))
	return tmp

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (y <= -1e-274)
		tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z))));
	else
		tmp = Float64(2.0 * sqrt(Float64(z * Float64(y + x))));
	end
	return tmp
end

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= -1e-274)
		tmp = 2.0 * sqrt((x * (y + z)));
	else
		tmp = 2.0 * sqrt((z * (y + x)));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := If[LessEqual[y, -1e-274], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[Sqrt[N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -9.99999999999999966e-275

   1. Initial program 74.4%

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

      1. associate-+l+ 74.4%

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

      2. +-commutative 74.4%

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

      3. distribute-rgt-in 74.4%

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

   3. Simplified 74.4%

      \[\leadsto \color{blue}{2 \cdot \sqrt{x \cdot y + z \cdot \left(y + x\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 45.6%

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

      1. +-commutative 45.6%

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

   7. Simplified 45.6%

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

   if -9.99999999999999966e-275 < y

   1. Initial program 69.3%

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

      1. associate-+l+ 69.3%

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

      2. +-commutative 69.3%

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

      3. distribute-rgt-in 69.3%

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

   3. Simplified 69.3%

      \[\leadsto \color{blue}{2 \cdot \sqrt{x \cdot y + z \cdot \left(y + x\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in z around inf 51.8%

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

4. Final simplification 49.1%

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

Alternative 6: 69.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq 3 \cdot 10^{-298}:\\ \;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \sqrt{y \cdot z}\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
 :precision binary64
 (if (<= y 3e-298) (* 2.0 (sqrt (* x (+ y z)))) (* 2.0 (sqrt (* y z)))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if (y <= 3e-298) {
		tmp = 2.0 * sqrt((x * (y + z)));
	} else {
		tmp = 2.0 * sqrt((y * z));
	}
	return tmp;
}

Fortran

NOTE: x, y, and z should be sorted in increasing order before calling this function.
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 <= 3d-298) then
        tmp = 2.0d0 * sqrt((x * (y + z)))
    else
        tmp = 2.0d0 * sqrt((y * z))
    end if
    code = tmp
end function

Java

assert x < y && y < z;
public static double code(double x, double y, double z) {
	double tmp;
	if (y <= 3e-298) {
		tmp = 2.0 * Math.sqrt((x * (y + z)));
	} else {
		tmp = 2.0 * Math.sqrt((y * z));
	}
	return tmp;
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	tmp = 0
	if y <= 3e-298:
		tmp = 2.0 * math.sqrt((x * (y + z)))
	else:
		tmp = 2.0 * math.sqrt((y * z))
	return tmp

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (y <= 3e-298)
		tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z))));
	else
		tmp = Float64(2.0 * sqrt(Float64(y * z)));
	end
	return tmp
end

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= 3e-298)
		tmp = 2.0 * sqrt((x * (y + z)));
	else
		tmp = 2.0 * sqrt((y * z));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := If[LessEqual[y, 3e-298], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[Sqrt[N[(y * z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 2.9999999999999999e-298

   1. Initial program 76.1%

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

      1. associate-+l+ 76.1%

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

      2. +-commutative 76.1%

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

      3. distribute-rgt-in 76.1%

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

   3. Simplified 76.1%

      \[\leadsto \color{blue}{2 \cdot \sqrt{x \cdot y + z \cdot \left(y + x\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 50.1%

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

      1. +-commutative 50.1%

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

   7. Simplified 50.1%

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

   if 2.9999999999999999e-298 < y

   1. Initial program 67.3%

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

      1. associate-+l+ 67.3%

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

      2. +-commutative 67.3%

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

      3. distribute-rgt-in 67.3%

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

   3. Simplified 67.3%

      \[\leadsto \color{blue}{2 \cdot \sqrt{x \cdot y + z \cdot \left(y + x\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 25.3%

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

      1. *-commutative 25.3%

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

   7. Simplified 25.3%

      \[\leadsto \color{blue}{2 \cdot \sqrt{z \cdot y}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 37.2%

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

Alternative 7: 70.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ 2 \cdot \sqrt{y \cdot x + z \cdot \left(y + x\right)} \end{array} \]

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z) :precision binary64 (* 2.0 (sqrt (+ (* y x) (* z (+ y x))))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	return 2.0 * sqrt(((y * x) + (z * (y + x))));
}

Fortran

NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = 2.0d0 * sqrt(((y * x) + (z * (y + x))))
end function

Java

assert x < y && y < z;
public static double code(double x, double y, double z) {
	return 2.0 * Math.sqrt(((y * x) + (z * (y + x))));
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	return 2.0 * math.sqrt(((y * x) + (z * (y + x))))

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	return Float64(2.0 * sqrt(Float64(Float64(y * x) + Float64(z * Float64(y + x)))))
end

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp = code(x, y, z)
	tmp = 2.0 * sqrt(((y * x) + (z * (y + x))));
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := N[(2.0 * N[Sqrt[N[(N[(y * x), $MachinePrecision] + N[(z * N[(y + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 71.5%

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

   1. associate-+l+ 71.5%

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

   2. +-commutative 71.5%

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

   3. distribute-rgt-in 71.5%

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

3. Simplified 71.5%

   \[\leadsto \color{blue}{2 \cdot \sqrt{x \cdot y + z \cdot \left(y + x\right)}} \]
4. Add Preprocessing

5. Final simplification 71.5%

   \[\leadsto 2 \cdot \sqrt{y \cdot x + z \cdot \left(y + x\right)} \]
6. Add Preprocessing

Alternative 8: 68.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq -5 \cdot 10^{-310}:\\ \;\;\;\;2 \cdot \sqrt{y \cdot x}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \sqrt{y \cdot z}\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
 :precision binary64
 (if (<= y -5e-310) (* 2.0 (sqrt (* y x))) (* 2.0 (sqrt (* y z)))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if (y <= -5e-310) {
		tmp = 2.0 * sqrt((y * x));
	} else {
		tmp = 2.0 * sqrt((y * z));
	}
	return tmp;
}

Fortran

NOTE: x, y, and z should be sorted in increasing order before calling this function.
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 <= (-5d-310)) then
        tmp = 2.0d0 * sqrt((y * x))
    else
        tmp = 2.0d0 * sqrt((y * z))
    end if
    code = tmp
end function

Java

assert x < y && y < z;
public static double code(double x, double y, double z) {
	double tmp;
	if (y <= -5e-310) {
		tmp = 2.0 * Math.sqrt((y * x));
	} else {
		tmp = 2.0 * Math.sqrt((y * z));
	}
	return tmp;
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	tmp = 0
	if y <= -5e-310:
		tmp = 2.0 * math.sqrt((y * x))
	else:
		tmp = 2.0 * math.sqrt((y * z))
	return tmp

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (y <= -5e-310)
		tmp = Float64(2.0 * sqrt(Float64(y * x)));
	else
		tmp = Float64(2.0 * sqrt(Float64(y * z)));
	end
	return tmp
end

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= -5e-310)
		tmp = 2.0 * sqrt((y * x));
	else
		tmp = 2.0 * sqrt((y * z));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := If[LessEqual[y, -5e-310], N[(2.0 * N[Sqrt[N[(y * x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[Sqrt[N[(y * z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -4.999999999999985e-310

   1. Initial program 75.7%

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

      1. associate-+l+ 75.7%

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

      2. +-commutative 75.7%

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

      3. distribute-rgt-in 75.7%

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

   3. Simplified 75.7%

      \[\leadsto \color{blue}{2 \cdot \sqrt{x \cdot y + z \cdot \left(y + x\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in z around 0 27.8%

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

   if -4.999999999999985e-310 < y

   1. Initial program 67.8%

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

      1. associate-+l+ 67.8%

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

      2. +-commutative 67.8%

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

      3. distribute-rgt-in 67.8%

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

   3. Simplified 67.8%

      \[\leadsto \color{blue}{2 \cdot \sqrt{x \cdot y + z \cdot \left(y + x\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 25.0%

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

      1. *-commutative 25.0%

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

   7. Simplified 25.0%

      \[\leadsto \color{blue}{2 \cdot \sqrt{z \cdot y}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 26.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -5 \cdot 10^{-310}:\\ \;\;\;\;2 \cdot \sqrt{y \cdot x}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \sqrt{y \cdot z}\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 35.5% accurate, 1.1× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ 2 \cdot \sqrt{y \cdot x} \end{array} \]

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z) :precision binary64 (* 2.0 (sqrt (* y x))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	return 2.0 * sqrt((y * x));
}

Fortran

NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = 2.0d0 * sqrt((y * x))
end function

Java

assert x < y && y < z;
public static double code(double x, double y, double z) {
	return 2.0 * Math.sqrt((y * x));
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	return 2.0 * math.sqrt((y * x))

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	return Float64(2.0 * sqrt(Float64(y * x)))
end

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp = code(x, y, z)
	tmp = 2.0 * sqrt((y * x));
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := N[(2.0 * N[Sqrt[N[(y * x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 71.5%

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

   1. associate-+l+ 71.5%

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

   2. +-commutative 71.5%

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

   3. distribute-rgt-in 71.5%

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

3. Simplified 71.5%

   \[\leadsto \color{blue}{2 \cdot \sqrt{x \cdot y + z \cdot \left(y + x\right)}} \]
4. Add Preprocessing

5. Taylor expanded in z around 0 24.6%

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

6. Final simplification 24.6%

   \[\leadsto 2 \cdot \sqrt{y \cdot x} \]
7. Add Preprocessing

Developer Target 1: 82.5% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 0.25 \cdot \left(\left({y}^{-0.75} \cdot \left({z}^{-0.75} \cdot x\right)\right) \cdot \left(y + z\right)\right) + {z}^{0.25} \cdot {y}^{0.25}\\ \mathbf{if}\;z < 7.636950090573675 \cdot 10^{+176}:\\ \;\;\;\;2 \cdot \sqrt{\left(x + y\right) \cdot z + x \cdot y}\\ \mathbf{else}:\\ \;\;\;\;\left(t\_0 \cdot t\_0\right) \cdot 2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0
         (+
          (* 0.25 (* (* (pow y -0.75) (* (pow z -0.75) x)) (+ y z)))
          (* (pow z 0.25) (pow y 0.25)))))
   (if (< z 7.636950090573675e+176)
     (* 2.0 (sqrt (+ (* (+ x y) z) (* x y))))
     (* (* t_0 t_0) 2.0))))

C

double code(double x, double y, double z) {
	double t_0 = (0.25 * ((pow(y, -0.75) * (pow(z, -0.75) * x)) * (y + z))) + (pow(z, 0.25) * pow(y, 0.25));
	double tmp;
	if (z < 7.636950090573675e+176) {
		tmp = 2.0 * sqrt((((x + y) * z) + (x * y)));
	} else {
		tmp = (t_0 * t_0) * 2.0;
	}
	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) :: t_0
    real(8) :: tmp
    t_0 = (0.25d0 * (((y ** (-0.75d0)) * ((z ** (-0.75d0)) * x)) * (y + z))) + ((z ** 0.25d0) * (y ** 0.25d0))
    if (z < 7.636950090573675d+176) then
        tmp = 2.0d0 * sqrt((((x + y) * z) + (x * y)))
    else
        tmp = (t_0 * t_0) * 2.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = (0.25 * ((Math.pow(y, -0.75) * (Math.pow(z, -0.75) * x)) * (y + z))) + (Math.pow(z, 0.25) * Math.pow(y, 0.25));
	double tmp;
	if (z < 7.636950090573675e+176) {
		tmp = 2.0 * Math.sqrt((((x + y) * z) + (x * y)));
	} else {
		tmp = (t_0 * t_0) * 2.0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = (0.25 * ((math.pow(y, -0.75) * (math.pow(z, -0.75) * x)) * (y + z))) + (math.pow(z, 0.25) * math.pow(y, 0.25))
	tmp = 0
	if z < 7.636950090573675e+176:
		tmp = 2.0 * math.sqrt((((x + y) * z) + (x * y)))
	else:
		tmp = (t_0 * t_0) * 2.0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(0.25 * Float64(Float64((y ^ -0.75) * Float64((z ^ -0.75) * x)) * Float64(y + z))) + Float64((z ^ 0.25) * (y ^ 0.25)))
	tmp = 0.0
	if (z < 7.636950090573675e+176)
		tmp = Float64(2.0 * sqrt(Float64(Float64(Float64(x + y) * z) + Float64(x * y))));
	else
		tmp = Float64(Float64(t_0 * t_0) * 2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (0.25 * (((y ^ -0.75) * ((z ^ -0.75) * x)) * (y + z))) + ((z ^ 0.25) * (y ^ 0.25));
	tmp = 0.0;
	if (z < 7.636950090573675e+176)
		tmp = 2.0 * sqrt((((x + y) * z) + (x * y)));
	else
		tmp = (t_0 * t_0) * 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(0.25 * N[(N[(N[Power[y, -0.75], $MachinePrecision] * N[(N[Power[z, -0.75], $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision] * N[(y + z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(N[Power[z, 0.25], $MachinePrecision] * N[Power[y, 0.25], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[Less[z, 7.636950090573675e+176], N[(2.0 * N[Sqrt[N[(N[(N[(x + y), $MachinePrecision] * z), $MachinePrecision] + N[(x * y), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(t$95$0 * t$95$0), $MachinePrecision] * 2.0), $MachinePrecision]]]

Reproduce

herbie shell --seed 2024148 
(FPCore (x y z)
  :name "Diagrams.TwoD.Apollonian:descartes from diagrams-contrib-1.3.0.5"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< z 763695009057367500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (* 2 (sqrt (+ (* (+ x y) z) (* x y)))) (* (* (+ (* 1/4 (* (* (pow y -3/4) (* (pow z -3/4) x)) (+ y z))) (* (pow z 1/4) (pow y 1/4))) (+ (* 1/4 (* (* (pow y -3/4) (* (pow z -3/4) x)) (+ y z))) (* (pow z 1/4) (pow y 1/4)))) 2)))

  (* 2.0 (sqrt (+ (+ (* x y) (* x z)) (* y z)))))