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

Percentage Accurate: 71.0% → 95.1%

Time: 16.5s

Alternatives: 10

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: 71.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: 95.1% accurate, 0.3× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} t_0 := 2 \cdot {\left(e^{0.25 \cdot \left(\log \left(\left(-y\right) - z\right) - \log \left(\frac{-1}{x}\right)\right)}\right)}^{2}\\ \mathbf{if}\;y \leq -3.2 \cdot 10^{+36}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;y \leq -9.5 \cdot 10^{-221}:\\ \;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\ \mathbf{elif}\;y \leq 8.5 \cdot 10^{-305}:\\ \;\;\;\;t_0\\ \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
 (let* ((t_0
         (*
          2.0
          (pow (exp (* 0.25 (- (log (- (- y) z)) (log (/ -1.0 x))))) 2.0))))
   (if (<= y -3.2e+36)
     t_0
     (if (<= y -9.5e-221)
       (* 2.0 (sqrt (* x (+ y z))))
       (if (<= y 8.5e-305) t_0 (* 2.0 (* (sqrt z) (sqrt y))))))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double t_0 = 2.0 * pow(exp((0.25 * (log((-y - z)) - log((-1.0 / x))))), 2.0);
	double tmp;
	if (y <= -3.2e+36) {
		tmp = t_0;
	} else if (y <= -9.5e-221) {
		tmp = 2.0 * sqrt((x * (y + z)));
	} else if (y <= 8.5e-305) {
		tmp = t_0;
	} 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) :: t_0
    real(8) :: tmp
    t_0 = 2.0d0 * (exp((0.25d0 * (log((-y - z)) - log(((-1.0d0) / x))))) ** 2.0d0)
    if (y <= (-3.2d+36)) then
        tmp = t_0
    else if (y <= (-9.5d-221)) then
        tmp = 2.0d0 * sqrt((x * (y + z)))
    else if (y <= 8.5d-305) then
        tmp = t_0
    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 t_0 = 2.0 * Math.pow(Math.exp((0.25 * (Math.log((-y - z)) - Math.log((-1.0 / x))))), 2.0);
	double tmp;
	if (y <= -3.2e+36) {
		tmp = t_0;
	} else if (y <= -9.5e-221) {
		tmp = 2.0 * Math.sqrt((x * (y + z)));
	} else if (y <= 8.5e-305) {
		tmp = t_0;
	} 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):
	t_0 = 2.0 * math.pow(math.exp((0.25 * (math.log((-y - z)) - math.log((-1.0 / x))))), 2.0)
	tmp = 0
	if y <= -3.2e+36:
		tmp = t_0
	elif y <= -9.5e-221:
		tmp = 2.0 * math.sqrt((x * (y + z)))
	elif y <= 8.5e-305:
		tmp = t_0
	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)
	t_0 = Float64(2.0 * (exp(Float64(0.25 * Float64(log(Float64(Float64(-y) - z)) - log(Float64(-1.0 / x))))) ^ 2.0))
	tmp = 0.0
	if (y <= -3.2e+36)
		tmp = t_0;
	elseif (y <= -9.5e-221)
		tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z))));
	elseif (y <= 8.5e-305)
		tmp = t_0;
	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)
	t_0 = 2.0 * (exp((0.25 * (log((-y - z)) - log((-1.0 / x))))) ^ 2.0);
	tmp = 0.0;
	if (y <= -3.2e+36)
		tmp = t_0;
	elseif (y <= -9.5e-221)
		tmp = 2.0 * sqrt((x * (y + z)));
	elseif (y <= 8.5e-305)
		tmp = t_0;
	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_] := Block[{t$95$0 = N[(2.0 * N[Power[N[Exp[N[(0.25 * N[(N[Log[N[((-y) - z), $MachinePrecision]], $MachinePrecision] - N[Log[N[(-1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -3.2e+36], t$95$0, If[LessEqual[y, -9.5e-221], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 8.5e-305], t$95$0, N[(2.0 * N[(N[Sqrt[z], $MachinePrecision] * N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if y < -3.1999999999999999e36 or -9.50000000000000022e-221 < y < 8.4999999999999997e-305

   1. Initial program 55.5%

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

      1. +-commutative 55.5%

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

      2. associate-+r+ 55.5%

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

      3. *-commutative 55.5%

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

      4. +-commutative 55.5%

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

      5. associate-+l+ 55.5%

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

      6. *-commutative 55.5%

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

      7. *-commutative 55.5%

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

      8. *-commutative 55.5%

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

      9. distribute-lft-out 55.5%

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

   3. Simplified 55.5%

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

      1. +-commutative 55.5%

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

      2. distribute-rgt-in 55.5%

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

      3. associate-+l+ 55.5%

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

      4. add-sqr-sqrt 55.1%

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

      5. pow2 55.1%

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

      6. pow1/2 55.1%

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

      7. sqrt-pow1 55.1%

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

      8. distribute-lft-out 55.2%

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

      9. fma-def 55.4%

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

      10. metadata-eval 55.4%

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

   5. Applied egg-rr 55.4%

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

   6. Taylor expanded in x around -inf 45.7%

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

   if -3.1999999999999999e36 < y < -9.50000000000000022e-221

   1. Initial program 95.7%

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

      1. +-commutative 95.7%

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

      2. associate-+r+ 95.7%

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

      3. *-commutative 95.7%

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

      4. +-commutative 95.7%

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

      5. associate-+l+ 95.7%

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

      6. *-commutative 95.7%

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

      7. *-commutative 95.7%

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

      8. *-commutative 95.7%

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

      9. distribute-lft-out 95.7%

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

   3. Simplified 95.7%

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

   4. Taylor expanded in x around inf 70.4%

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

   if 8.4999999999999997e-305 < y

   1. Initial program 69.4%

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

      1. +-commutative 69.4%

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

      2. associate-+r+ 69.4%

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

      3. *-commutative 69.4%

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

      4. +-commutative 69.4%

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

      5. associate-+l+ 69.4%

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

      6. *-commutative 69.4%

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

      7. *-commutative 69.4%

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

      8. *-commutative 69.4%

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

      9. distribute-lft-out 69.5%

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

   3. Simplified 69.5%

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

   4. Taylor expanded in x around 0 69.5%

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

   5. Taylor expanded in x around 0 27.1%

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

      1. *-commutative 27.1%

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

   7. Simplified 27.1%

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

      1. sqrt-prod 32.7%

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

   9. Applied egg-rr 32.7%

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

4. Final simplification 43.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -3.2 \cdot 10^{+36}:\\ \;\;\;\;2 \cdot {\left(e^{0.25 \cdot \left(\log \left(\left(-y\right) - z\right) - \log \left(\frac{-1}{x}\right)\right)}\right)}^{2}\\ \mathbf{elif}\;y \leq -9.5 \cdot 10^{-221}:\\ \;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\ \mathbf{elif}\;y \leq 8.5 \cdot 10^{-305}:\\ \;\;\;\;2 \cdot {\left(e^{0.25 \cdot \left(\log \left(\left(-y\right) - z\right) - \log \left(\frac{-1}{x}\right)\right)}\right)}^{2}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y}\right)\\ \end{array} \]

Alternative 2: 94.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} t_0 := \log \left(\frac{-1}{x}\right)\\ \mathbf{if}\;y \leq -3.8 \cdot 10^{+36}:\\ \;\;\;\;2 \cdot e^{\left(\log \left(\left(-y\right) - z\right) - t_0\right) \cdot 0.5}\\ \mathbf{elif}\;y \leq -9.5 \cdot 10^{-221}:\\ \;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\ \mathbf{elif}\;y \leq -5 \cdot 10^{-310}:\\ \;\;\;\;2 \cdot e^{0.5 \cdot \left(\log \left(-y\right) - t_0\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
 (let* ((t_0 (log (/ -1.0 x))))
   (if (<= y -3.8e+36)
     (* 2.0 (exp (* (- (log (- (- y) z)) t_0) 0.5)))
     (if (<= y -9.5e-221)
       (* 2.0 (sqrt (* x (+ y z))))
       (if (<= y -5e-310)
         (* 2.0 (exp (* 0.5 (- (log (- y)) t_0))))
         (* 2.0 (* (sqrt z) (sqrt y))))))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double t_0 = log((-1.0 / x));
	double tmp;
	if (y <= -3.8e+36) {
		tmp = 2.0 * exp(((log((-y - z)) - t_0) * 0.5));
	} else if (y <= -9.5e-221) {
		tmp = 2.0 * sqrt((x * (y + z)));
	} else if (y <= -5e-310) {
		tmp = 2.0 * exp((0.5 * (log(-y) - t_0)));
	} 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) :: t_0
    real(8) :: tmp
    t_0 = log(((-1.0d0) / x))
    if (y <= (-3.8d+36)) then
        tmp = 2.0d0 * exp(((log((-y - z)) - t_0) * 0.5d0))
    else if (y <= (-9.5d-221)) then
        tmp = 2.0d0 * sqrt((x * (y + z)))
    else if (y <= (-5d-310)) then
        tmp = 2.0d0 * exp((0.5d0 * (log(-y) - t_0)))
    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 t_0 = Math.log((-1.0 / x));
	double tmp;
	if (y <= -3.8e+36) {
		tmp = 2.0 * Math.exp(((Math.log((-y - z)) - t_0) * 0.5));
	} else if (y <= -9.5e-221) {
		tmp = 2.0 * Math.sqrt((x * (y + z)));
	} else if (y <= -5e-310) {
		tmp = 2.0 * Math.exp((0.5 * (Math.log(-y) - t_0)));
	} 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):
	t_0 = math.log((-1.0 / x))
	tmp = 0
	if y <= -3.8e+36:
		tmp = 2.0 * math.exp(((math.log((-y - z)) - t_0) * 0.5))
	elif y <= -9.5e-221:
		tmp = 2.0 * math.sqrt((x * (y + z)))
	elif y <= -5e-310:
		tmp = 2.0 * math.exp((0.5 * (math.log(-y) - t_0)))
	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)
	t_0 = log(Float64(-1.0 / x))
	tmp = 0.0
	if (y <= -3.8e+36)
		tmp = Float64(2.0 * exp(Float64(Float64(log(Float64(Float64(-y) - z)) - t_0) * 0.5)));
	elseif (y <= -9.5e-221)
		tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z))));
	elseif (y <= -5e-310)
		tmp = Float64(2.0 * exp(Float64(0.5 * Float64(log(Float64(-y)) - t_0))));
	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)
	t_0 = log((-1.0 / x));
	tmp = 0.0;
	if (y <= -3.8e+36)
		tmp = 2.0 * exp(((log((-y - z)) - t_0) * 0.5));
	elseif (y <= -9.5e-221)
		tmp = 2.0 * sqrt((x * (y + z)));
	elseif (y <= -5e-310)
		tmp = 2.0 * exp((0.5 * (log(-y) - t_0)));
	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_] := Block[{t$95$0 = N[Log[N[(-1.0 / x), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[y, -3.8e+36], N[(2.0 * N[Exp[N[(N[(N[Log[N[((-y) - z), $MachinePrecision]], $MachinePrecision] - t$95$0), $MachinePrecision] * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, -9.5e-221], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, -5e-310], N[(2.0 * N[Exp[N[(0.5 * N[(N[Log[(-y)], $MachinePrecision] - t$95$0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[z], $MachinePrecision] * N[Sqrt[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if y < -3.80000000000000025e36

   1. Initial program 49.2%

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

      1. +-commutative 49.2%

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

      2. associate-+r+ 49.2%

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

      3. *-commutative 49.2%

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

      4. +-commutative 49.2%

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

      5. associate-+l+ 49.2%

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

      6. *-commutative 49.2%

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

      7. *-commutative 49.2%

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

      8. *-commutative 49.2%

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

      9. distribute-lft-out 49.2%

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

   3. Simplified 49.2%

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

      1. +-commutative 49.2%

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

      2. distribute-rgt-in 49.2%

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

      3. associate-+l+ 49.2%

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

      4. add-sqr-sqrt 48.8%

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

      5. pow2 48.8%

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

      6. pow1/2 48.8%

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

      7. sqrt-pow1 48.8%

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

      8. distribute-lft-out 49.0%

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

      9. fma-def 49.3%

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

      10. metadata-eval 49.3%

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

   5. Applied egg-rr 49.3%

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

   6. Taylor expanded in x around -inf 45.2%

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

      1. unpow2 45.2%

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

      2. exp-prod 43.9%

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

      3. exp-prod 43.0%

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

      4. pow-sqr 43.0%

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

      5. +-commutative 43.0%

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

      6. mul-1-neg 43.0%

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

      7. unsub-neg 43.0%

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

      8. distribute-lft-in 43.0%

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

      9. mul-1-neg 43.0%

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

      10. unsub-neg 43.0%

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

      11. mul-1-neg 43.0%

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

   8. Simplified 43.0%

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

   9. Taylor expanded in x around -inf 45.2%

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

   if -3.80000000000000025e36 < y < -9.50000000000000022e-221

   1. Initial program 95.7%

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

      1. +-commutative 95.7%

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

      2. associate-+r+ 95.7%

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

      3. *-commutative 95.7%

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

      4. +-commutative 95.7%

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

      5. associate-+l+ 95.7%

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

      6. *-commutative 95.7%

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

      7. *-commutative 95.7%

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

      8. *-commutative 95.7%

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

      9. distribute-lft-out 95.7%

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

   3. Simplified 95.7%

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

   4. Taylor expanded in x around inf 70.4%

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

   if -9.50000000000000022e-221 < y < -4.999999999999985e-310

   1. Initial program 72.9%

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

      1. +-commutative 72.9%

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

      2. associate-+r+ 72.9%

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

      3. *-commutative 72.9%

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

      4. +-commutative 72.9%

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

      5. associate-+l+ 72.9%

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

      6. *-commutative 72.9%

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

      7. *-commutative 72.9%

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

      8. *-commutative 72.9%

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

      9. distribute-lft-out 72.9%

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

   3. Simplified 72.9%

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

      1. +-commutative 72.9%

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

      2. distribute-rgt-in 72.9%

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

      3. associate-+l+ 72.9%

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

      4. add-sqr-sqrt 72.4%

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

      5. pow2 72.4%

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

      6. pow1/2 72.4%

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

      7. sqrt-pow1 72.4%

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

      8. distribute-lft-out 72.4%

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

      9. fma-def 72.4%

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

      10. metadata-eval 72.4%

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

   5. Applied egg-rr 72.4%

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

   6. Taylor expanded in x around -inf 47.2%

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

      1. unpow2 47.2%

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

      2. exp-prod 46.6%

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

      3. exp-prod 45.7%

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

      4. pow-sqr 45.7%

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

      5. +-commutative 45.7%

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

      6. mul-1-neg 45.7%

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

      7. unsub-neg 45.7%

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

      8. distribute-lft-in 45.7%

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

      9. mul-1-neg 45.7%

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

      10. unsub-neg 45.7%

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

      11. mul-1-neg 45.7%

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

   8. Simplified 45.7%

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

   9. Taylor expanded in z around 0 6.9%

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

   if -4.999999999999985e-310 < y

   1. Initial program 69.4%

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

      1. +-commutative 69.4%

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

      2. associate-+r+ 69.4%

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

      3. *-commutative 69.4%

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

      4. +-commutative 69.4%

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

      5. associate-+l+ 69.4%

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

      6. *-commutative 69.4%

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

      7. *-commutative 69.4%

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

      8. *-commutative 69.4%

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

      9. distribute-lft-out 69.5%

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

   3. Simplified 69.5%

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

   4. Taylor expanded in x around 0 69.5%

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

   5. Taylor expanded in x around 0 27.1%

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

      1. *-commutative 27.1%

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

   7. Simplified 27.1%

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

      1. sqrt-prod 32.7%

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

   9. Applied egg-rr 32.7%

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

4. Final simplification 40.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -3.8 \cdot 10^{+36}:\\ \;\;\;\;2 \cdot e^{\left(\log \left(\left(-y\right) - z\right) - \log \left(\frac{-1}{x}\right)\right) \cdot 0.5}\\ \mathbf{elif}\;y \leq -9.5 \cdot 10^{-221}:\\ \;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\ \mathbf{elif}\;y \leq -5 \cdot 10^{-310}:\\ \;\;\;\;2 \cdot e^{0.5 \cdot \left(\log \left(-y\right) - \log \left(\frac{-1}{x}\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y}\right)\\ \end{array} \]

Alternative 3: 94.3% accurate, 0.4× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq -5.4 \cdot 10^{+38}:\\ \;\;\;\;2 \cdot e^{0.5 \cdot \left(\log \left(-y\right) - \log \left(\frac{-1}{x}\right)\right)}\\ \mathbf{elif}\;y \leq 8.5 \cdot 10^{-305}:\\ \;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\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 -5.4e+38)
   (* 2.0 (exp (* 0.5 (- (log (- y)) (log (/ -1.0 x))))))
   (if (<= y 8.5e-305)
     (* 2.0 (sqrt (* x (+ y 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 <= -5.4e+38) {
		tmp = 2.0 * exp((0.5 * (log(-y) - log((-1.0 / x)))));
	} else if (y <= 8.5e-305) {
		tmp = 2.0 * sqrt((x * (y + z)));
	} 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 <= (-5.4d+38)) then
        tmp = 2.0d0 * exp((0.5d0 * (log(-y) - log(((-1.0d0) / x)))))
    else if (y <= 8.5d-305) then
        tmp = 2.0d0 * sqrt((x * (y + z)))
    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 <= -5.4e+38) {
		tmp = 2.0 * Math.exp((0.5 * (Math.log(-y) - Math.log((-1.0 / x)))));
	} else if (y <= 8.5e-305) {
		tmp = 2.0 * Math.sqrt((x * (y + z)));
	} 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 <= -5.4e+38:
		tmp = 2.0 * math.exp((0.5 * (math.log(-y) - math.log((-1.0 / x)))))
	elif y <= 8.5e-305:
		tmp = 2.0 * math.sqrt((x * (y + z)))
	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 <= -5.4e+38)
		tmp = Float64(2.0 * exp(Float64(0.5 * Float64(log(Float64(-y)) - log(Float64(-1.0 / x))))));
	elseif (y <= 8.5e-305)
		tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z))));
	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 <= -5.4e+38)
		tmp = 2.0 * exp((0.5 * (log(-y) - log((-1.0 / x)))));
	elseif (y <= 8.5e-305)
		tmp = 2.0 * sqrt((x * (y + z)));
	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, -5.4e+38], N[(2.0 * N[Exp[N[(0.5 * N[(N[Log[(-y)], $MachinePrecision] - N[Log[N[(-1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 8.5e-305], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $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 < -5.39999999999999992e38

   1. Initial program 49.2%

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

      1. +-commutative 49.2%

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

      2. associate-+r+ 49.2%

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

      3. *-commutative 49.2%

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

      4. +-commutative 49.2%

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

      5. associate-+l+ 49.2%

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

      6. *-commutative 49.2%

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

      7. *-commutative 49.2%

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

      8. *-commutative 49.2%

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

      9. distribute-lft-out 49.2%

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

   3. Simplified 49.2%

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

      1. +-commutative 49.2%

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

      2. distribute-rgt-in 49.2%

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

      3. associate-+l+ 49.2%

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

      4. add-sqr-sqrt 48.8%

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

      5. pow2 48.8%

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

      6. pow1/2 48.8%

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

      7. sqrt-pow1 48.8%

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

      8. distribute-lft-out 49.0%

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

      9. fma-def 49.3%

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

      10. metadata-eval 49.3%

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

   5. Applied egg-rr 49.3%

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

   6. Taylor expanded in x around -inf 45.2%

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

      1. unpow2 45.2%

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

      2. exp-prod 43.9%

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

      3. exp-prod 43.0%

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

      4. pow-sqr 43.0%

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

      5. +-commutative 43.0%

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

      6. mul-1-neg 43.0%

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

      7. unsub-neg 43.0%

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

      8. distribute-lft-in 43.0%

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

      9. mul-1-neg 43.0%

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

      10. unsub-neg 43.0%

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

      11. mul-1-neg 43.0%

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

   8. Simplified 43.0%

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

   9. Taylor expanded in z around 0 42.7%

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

   if -5.39999999999999992e38 < y < 8.4999999999999997e-305

   1. Initial program 88.6%

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

      1. +-commutative 88.6%

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

      2. associate-+r+ 88.6%

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

      3. *-commutative 88.6%

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

      4. +-commutative 88.6%

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

      5. associate-+l+ 88.6%

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

      6. *-commutative 88.6%

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

      7. *-commutative 88.6%

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

      8. *-commutative 88.6%

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

      9. distribute-lft-out 88.6%

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

   3. Simplified 88.6%

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

   4. Taylor expanded in x around inf 71.2%

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

   if 8.4999999999999997e-305 < y

   1. Initial program 69.4%

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

      1. +-commutative 69.4%

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

      2. associate-+r+ 69.4%

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

      3. *-commutative 69.4%

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

      4. +-commutative 69.4%

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

      5. associate-+l+ 69.4%

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

      6. *-commutative 69.4%

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

      7. *-commutative 69.4%

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

      8. *-commutative 69.4%

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

      9. distribute-lft-out 69.5%

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

   3. Simplified 69.5%

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

   4. Taylor expanded in x around 0 69.5%

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

   5. Taylor expanded in x around 0 27.1%

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

      1. *-commutative 27.1%

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

   7. Simplified 27.1%

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

      1. sqrt-prod 32.7%

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

   9. Applied egg-rr 32.7%

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

4. Final simplification 45.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -5.4 \cdot 10^{+38}:\\ \;\;\;\;2 \cdot e^{0.5 \cdot \left(\log \left(-y\right) - \log \left(\frac{-1}{x}\right)\right)}\\ \mathbf{elif}\;y \leq 8.5 \cdot 10^{-305}:\\ \;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y}\right)\\ \end{array} \]

Alternative 4: 83.5% accurate, 0.5× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq 2.3 \cdot 10^{+158}:\\ \;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right) + y \cdot z}\\ \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 (<= z 2.3e+158)
   (* 2.0 (sqrt (+ (* x (+ y z)) (* y z))))
   (* 2.0 (* (sqrt z) (sqrt y)))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if (z <= 2.3e+158) {
		tmp = 2.0 * sqrt(((x * (y + z)) + (y * z)));
	} 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 (z <= 2.3d+158) then
        tmp = 2.0d0 * sqrt(((x * (y + z)) + (y * z)))
    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 (z <= 2.3e+158) {
		tmp = 2.0 * Math.sqrt(((x * (y + z)) + (y * z)));
	} 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 z <= 2.3e+158:
		tmp = 2.0 * math.sqrt(((x * (y + z)) + (y * z)))
	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 (z <= 2.3e+158)
		tmp = Float64(2.0 * sqrt(Float64(Float64(x * Float64(y + z)) + Float64(y * z))));
	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 (z <= 2.3e+158)
		tmp = 2.0 * sqrt(((x * (y + z)) + (y * z)));
	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[z, 2.3e+158], N[(2.0 * N[Sqrt[N[(N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision] + N[(y * z), $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 z < 2.29999999999999986e158

   1. Initial program 71.9%

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

      1. +-commutative 71.9%

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

      2. associate-+r+ 71.9%

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

      3. *-commutative 71.9%

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

      4. +-commutative 71.9%

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

      5. associate-+l+ 71.9%

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

      6. *-commutative 71.9%

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

      7. *-commutative 71.9%

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

      8. *-commutative 71.9%

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

      9. distribute-lft-out 71.9%

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

   3. Simplified 71.9%

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

   4. Taylor expanded in x around 0 72.0%

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

   if 2.29999999999999986e158 < z

   1. Initial program 57.5%

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

      1. +-commutative 57.5%

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

      2. associate-+r+ 57.5%

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

      3. *-commutative 57.5%

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

      4. +-commutative 57.5%

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

      5. associate-+l+ 57.5%

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

      6. *-commutative 57.5%

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

      7. *-commutative 57.5%

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

      8. *-commutative 57.5%

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

      9. distribute-lft-out 57.5%

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

   3. Simplified 57.5%

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

   4. Taylor expanded in x around 0 57.5%

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

   5. Taylor expanded in x around 0 28.1%

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

      1. *-commutative 28.1%

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

   7. Simplified 28.1%

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

      1. sqrt-prod 46.4%

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

   9. Applied egg-rr 46.4%

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

4. Final simplification 68.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq 2.3 \cdot 10^{+158}:\\ \;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right) + y \cdot z}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y}\right)\\ \end{array} \]

Alternative 5: 71.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 69.9%

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

   1. +-commutative 69.9%

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

   2. associate-+r+ 69.9%

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

   3. *-commutative 69.9%

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

   4. +-commutative 69.9%

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

   5. associate-+l+ 69.9%

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

   6. *-commutative 69.9%

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

   7. *-commutative 69.9%

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

   8. *-commutative 69.9%

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

   9. distribute-lft-out 69.9%

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

3. Simplified 69.9%

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

4. Final simplification 69.9%

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

Alternative 6: 71.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ 2 \cdot \sqrt{x \cdot \left(y + z\right) + y \cdot z} \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 (+ (* x (+ y z)) (* y z)))))

C

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

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(((x * (y + z)) + (y * z)))
end function

Java

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

Python

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

Julia

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

MATLAB

x, y, z = num2cell(sort([x, y, z])){:}
function tmp = code(x, y, z)
	tmp = 2.0 * sqrt(((x * (y + z)) + (y * z)));
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[(x * N[(y + z), $MachinePrecision]), $MachinePrecision] + N[(y * z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 69.9%

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

   1. +-commutative 69.9%

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

   2. associate-+r+ 69.9%

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

   3. *-commutative 69.9%

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

   4. +-commutative 69.9%

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

   5. associate-+l+ 69.9%

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

   6. *-commutative 69.9%

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

   7. *-commutative 69.9%

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

   8. *-commutative 69.9%

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

   9. distribute-lft-out 69.9%

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

3. Simplified 69.9%

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

4. Taylor expanded in x around 0 69.9%

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

5. Final simplification 69.9%

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

Alternative 7: 69.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq -2.3 \cdot 10^{-250}:\\ \;\;\;\;2 \cdot \sqrt{y \cdot x}\\ \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 -2.3e-250) (* 2.0 (sqrt (* y x))) (* 2.0 (sqrt (* z (+ y x))))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if (y <= -2.3e-250) {
		tmp = 2.0 * sqrt((y * x));
	} 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 <= (-2.3d-250)) then
        tmp = 2.0d0 * sqrt((y * x))
    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 <= -2.3e-250) {
		tmp = 2.0 * Math.sqrt((y * x));
	} 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 <= -2.3e-250:
		tmp = 2.0 * math.sqrt((y * x))
	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 <= -2.3e-250)
		tmp = Float64(2.0 * sqrt(Float64(y * x)));
	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 <= -2.3e-250)
		tmp = 2.0 * sqrt((y * x));
	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, -2.3e-250], N[(2.0 * N[Sqrt[N[(y * x), $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 < -2.2999999999999999e-250

   1. Initial program 69.1%

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

      1. +-commutative 69.1%

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

      2. associate-+r+ 69.1%

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

      3. *-commutative 69.1%

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

      4. +-commutative 69.1%

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

      5. associate-+l+ 69.1%

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

      6. *-commutative 69.1%

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

      7. *-commutative 69.1%

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

      8. *-commutative 69.1%

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

      9. distribute-lft-out 69.1%

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

   3. Simplified 69.1%

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

   4. Taylor expanded in z around 0 25.7%

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

   if -2.2999999999999999e-250 < y

   1. Initial program 70.4%

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

      1. +-commutative 70.4%

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

      2. associate-+r+ 70.4%

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

      3. *-commutative 70.4%

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

      4. +-commutative 70.4%

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

      5. associate-+l+ 70.4%

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

      6. *-commutative 70.4%

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

      7. *-commutative 70.4%

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

      8. *-commutative 70.4%

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

      9. distribute-lft-out 70.5%

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

   3. Simplified 70.5%

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

   4. Taylor expanded in z around inf 48.9%

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

4. Final simplification 38.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2.3 \cdot 10^{-250}:\\ \;\;\;\;2 \cdot \sqrt{y \cdot x}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \sqrt{z \cdot \left(y + x\right)}\\ \end{array} \]

Alternative 8: 70.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq -7 \cdot 10^{-258}:\\ \;\;\;\;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 -7e-258) (* 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 <= -7e-258) {
		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 <= (-7d-258)) 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 <= -7e-258) {
		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 <= -7e-258:
		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 <= -7e-258)
		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 <= -7e-258)
		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, -7e-258], 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 < -7.00000000000000003e-258

   1. Initial program 69.4%

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

      1. +-commutative 69.4%

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

      2. associate-+r+ 69.4%

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

      3. *-commutative 69.4%

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

      4. +-commutative 69.4%

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

      5. associate-+l+ 69.4%

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

      6. *-commutative 69.4%

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

      7. *-commutative 69.4%

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

      8. *-commutative 69.4%

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

      9. distribute-lft-out 69.4%

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

   3. Simplified 69.4%

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

   4. Taylor expanded in x around inf 45.8%

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

   if -7.00000000000000003e-258 < y

   1. Initial program 70.2%

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

      1. +-commutative 70.2%

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

      2. associate-+r+ 70.2%

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

      3. *-commutative 70.2%

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

      4. +-commutative 70.2%

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

      5. associate-+l+ 70.2%

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

      6. *-commutative 70.2%

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

      7. *-commutative 70.2%

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

      8. *-commutative 70.2%

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

      9. distribute-lft-out 70.3%

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

   3. Simplified 70.3%

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

   4. Taylor expanded in z around inf 48.6%

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

4. Final simplification 47.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -7 \cdot 10^{-258}:\\ \;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \sqrt{z \cdot \left(y + x\right)}\\ \end{array} \]

Alternative 9: 68.6% accurate, 1.1× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq -7 \cdot 10^{-258}:\\ \;\;\;\;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 -7e-258) (* 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 <= -7e-258) {
		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 <= (-7d-258)) 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 <= -7e-258) {
		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 <= -7e-258:
		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 <= -7e-258)
		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 <= -7e-258)
		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, -7e-258], 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 < -7.00000000000000003e-258

   1. Initial program 69.4%

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

      1. +-commutative 69.4%

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

      2. associate-+r+ 69.4%

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

      3. *-commutative 69.4%

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

      4. +-commutative 69.4%

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

      5. associate-+l+ 69.4%

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

      6. *-commutative 69.4%

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

      7. *-commutative 69.4%

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

      8. *-commutative 69.4%

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

      9. distribute-lft-out 69.4%

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

   3. Simplified 69.4%

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

   4. Taylor expanded in z around 0 25.5%

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

   if -7.00000000000000003e-258 < y

   1. Initial program 70.2%

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

      1. +-commutative 70.2%

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

      2. associate-+r+ 70.2%

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

      3. *-commutative 70.2%

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

      4. +-commutative 70.2%

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

      5. associate-+l+ 70.2%

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

      6. *-commutative 70.2%

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

      7. *-commutative 70.2%

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

      8. *-commutative 70.2%

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

      9. distribute-lft-out 70.3%

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

   3. Simplified 70.3%

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

   4. Taylor expanded in x around 0 25.0%

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

4. Final simplification 25.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -7 \cdot 10^{-258}:\\ \;\;\;\;2 \cdot \sqrt{y \cdot x}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \sqrt{y \cdot z}\\ \end{array} \]

Alternative 10: 36.0% 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 69.9%

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

   1. +-commutative 69.9%

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

   2. associate-+r+ 69.9%

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

   3. *-commutative 69.9%

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

   4. +-commutative 69.9%

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

   5. associate-+l+ 69.9%

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

   6. *-commutative 69.9%

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

   7. *-commutative 69.9%

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

   8. *-commutative 69.9%

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

   9. distribute-lft-out 69.9%

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

3. Simplified 69.9%

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

4. Taylor expanded in z around 0 24.7%

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

5. Final simplification 24.7%

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

Developer target: 83.4% 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 2023275 
(FPCore (x y z)
  :name "Diagrams.TwoD.Apollonian:descartes from diagrams-contrib-1.3.0.5"
  :precision binary64

  :herbie-target
  (if (< z 7.636950090573675e+176) (* 2.0 (sqrt (+ (* (+ x y) z) (* x y)))) (* (* (+ (* 0.25 (* (* (pow y -0.75) (* (pow z -0.75) x)) (+ y z))) (* (pow z 0.25) (pow y 0.25))) (+ (* 0.25 (* (* (pow y -0.75) (* (pow z -0.75) x)) (+ y z))) (* (pow z 0.25) (pow y 0.25)))) 2.0))

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