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

Percentage Accurate: 70.5% → 94.9%

Time: 8.5s

Alternatives: 8

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.5% 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.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} t_0 := 2 \cdot e^{\left(\log \left(\left(-y\right) - z\right) - \log \left(\frac{-1}{x}\right)\right) \cdot 0.5}\\ \mathbf{if}\;y \leq -3.15 \cdot 10^{+22}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;y \leq -5.2 \cdot 10^{-212}:\\ \;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\ \mathbf{elif}\;y \leq 2.6 \cdot 10^{-278}:\\ \;\;\;\;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 (exp (* (- (log (- (- y) z)) (log (/ -1.0 x))) 0.5)))))
   (if (<= y -3.15e+22)
     t_0
     (if (<= y -5.2e-212)
       (* 2.0 (sqrt (* x (+ y z))))
       (if (<= y 2.6e-278) 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 * exp(((log((-y - z)) - log((-1.0 / x))) * 0.5));
	double tmp;
	if (y <= -3.15e+22) {
		tmp = t_0;
	} else if (y <= -5.2e-212) {
		tmp = 2.0 * sqrt((x * (y + z)));
	} else if (y <= 2.6e-278) {
		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(((log((-y - z)) - log(((-1.0d0) / x))) * 0.5d0))
    if (y <= (-3.15d+22)) then
        tmp = t_0
    else if (y <= (-5.2d-212)) then
        tmp = 2.0d0 * sqrt((x * (y + z)))
    else if (y <= 2.6d-278) 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.exp(((Math.log((-y - z)) - Math.log((-1.0 / x))) * 0.5));
	double tmp;
	if (y <= -3.15e+22) {
		tmp = t_0;
	} else if (y <= -5.2e-212) {
		tmp = 2.0 * Math.sqrt((x * (y + z)));
	} else if (y <= 2.6e-278) {
		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.exp(((math.log((-y - z)) - math.log((-1.0 / x))) * 0.5))
	tmp = 0
	if y <= -3.15e+22:
		tmp = t_0
	elif y <= -5.2e-212:
		tmp = 2.0 * math.sqrt((x * (y + z)))
	elif y <= 2.6e-278:
		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(Float64(log(Float64(Float64(-y) - z)) - log(Float64(-1.0 / x))) * 0.5)))
	tmp = 0.0
	if (y <= -3.15e+22)
		tmp = t_0;
	elseif (y <= -5.2e-212)
		tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z))));
	elseif (y <= 2.6e-278)
		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(((log((-y - z)) - log((-1.0 / x))) * 0.5));
	tmp = 0.0;
	if (y <= -3.15e+22)
		tmp = t_0;
	elseif (y <= -5.2e-212)
		tmp = 2.0 * sqrt((x * (y + z)));
	elseif (y <= 2.6e-278)
		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[Exp[N[(N[(N[Log[N[((-y) - z), $MachinePrecision]], $MachinePrecision] - N[Log[N[(-1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -3.15e+22], t$95$0, If[LessEqual[y, -5.2e-212], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 2.6e-278], 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.1500000000000001e22 or -5.2e-212 < y < 2.5999999999999999e-278

   1. Initial program 62.5%

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

      1. +-commutative 62.5%

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

      2. associate-+r+ 62.5%

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

      3. *-commutative 62.5%

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

      4. +-commutative 62.5%

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

      5. associate-+l+ 62.5%

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

      6. *-commutative 62.5%

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

      7. *-commutative 62.5%

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

      8. *-commutative 62.5%

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

      9. distribute-lft-out 62.6%

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

   3. Simplified 62.6%

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

   4. Taylor expanded in x around inf 40.7%

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

      1. pow1/2 40.8%

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

      2. metadata-eval 40.8%

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

      3. pow-to-exp 37.8%

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

      4. *-commutative 37.8%

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

      5. +-commutative 37.8%

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

      6. metadata-eval 37.8%

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

   6. Applied egg-rr 37.8%

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

   7. Taylor expanded in x around -inf 42.9%

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

      1. +-commutative 42.9%

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

      2. mul-1-neg 42.9%

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

      3. unsub-neg 42.9%

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

      4. distribute-lft-in 42.9%

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

      5. neg-mul-1 42.9%

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

      6. unsub-neg 42.9%

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

      7. neg-mul-1 42.9%

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

   9. Simplified 42.9%

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

   if -3.1500000000000001e22 < y < -5.2e-212

   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 58.1%

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

   if 2.5999999999999999e-278 < y

   1. Initial program 69.8%

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

      1. +-commutative 69.8%

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

      2. associate-+r+ 69.8%

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

      3. *-commutative 69.8%

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

      4. +-commutative 69.8%

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

      5. associate-+l+ 69.8%

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

      6. *-commutative 69.8%

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

      7. *-commutative 69.8%

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

      8. *-commutative 69.8%

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

      9. distribute-lft-out 69.8%

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

   3. Simplified 69.8%

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

   4. Taylor expanded in x around 0 26.1%

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

      1. *-commutative 26.1%

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

      2. sqrt-prod 35.6%

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

   6. Applied egg-rr 35.6%

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

4. Final simplification 41.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -3.15 \cdot 10^{+22}:\\ \;\;\;\;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 -5.2 \cdot 10^{-212}:\\ \;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\ \mathbf{elif}\;y \leq 2.6 \cdot 10^{-278}:\\ \;\;\;\;2 \cdot e^{\left(\log \left(\left(-y\right) - z\right) - \log \left(\frac{-1}{x}\right)\right) \cdot 0.5}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y}\right)\\ \end{array} \]

Alternative 2: 94.5% accurate, 0.4× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} t_0 := 2 \cdot e^{0.5 \cdot \left(\log \left(-x\right) - \log \left(\frac{-1}{y}\right)\right)}\\ \mathbf{if}\;y \leq -1.65 \cdot 10^{+22}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;y \leq -5.2 \cdot 10^{-212}:\\ \;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\ \mathbf{elif}\;y \leq -4 \cdot 10^{-310}:\\ \;\;\;\;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 (exp (* 0.5 (- (log (- x)) (log (/ -1.0 y))))))))
   (if (<= y -1.65e+22)
     t_0
     (if (<= y -5.2e-212)
       (* 2.0 (sqrt (* x (+ y z))))
       (if (<= y -4e-310) 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 * exp((0.5 * (log(-x) - log((-1.0 / y)))));
	double tmp;
	if (y <= -1.65e+22) {
		tmp = t_0;
	} else if (y <= -5.2e-212) {
		tmp = 2.0 * sqrt((x * (y + z)));
	} else if (y <= -4e-310) {
		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.5d0 * (log(-x) - log(((-1.0d0) / y)))))
    if (y <= (-1.65d+22)) then
        tmp = t_0
    else if (y <= (-5.2d-212)) then
        tmp = 2.0d0 * sqrt((x * (y + z)))
    else if (y <= (-4d-310)) 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.exp((0.5 * (Math.log(-x) - Math.log((-1.0 / y)))));
	double tmp;
	if (y <= -1.65e+22) {
		tmp = t_0;
	} else if (y <= -5.2e-212) {
		tmp = 2.0 * Math.sqrt((x * (y + z)));
	} else if (y <= -4e-310) {
		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.exp((0.5 * (math.log(-x) - math.log((-1.0 / y)))))
	tmp = 0
	if y <= -1.65e+22:
		tmp = t_0
	elif y <= -5.2e-212:
		tmp = 2.0 * math.sqrt((x * (y + z)))
	elif y <= -4e-310:
		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.5 * Float64(log(Float64(-x)) - log(Float64(-1.0 / y))))))
	tmp = 0.0
	if (y <= -1.65e+22)
		tmp = t_0;
	elseif (y <= -5.2e-212)
		tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z))));
	elseif (y <= -4e-310)
		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.5 * (log(-x) - log((-1.0 / y)))));
	tmp = 0.0;
	if (y <= -1.65e+22)
		tmp = t_0;
	elseif (y <= -5.2e-212)
		tmp = 2.0 * sqrt((x * (y + z)));
	elseif (y <= -4e-310)
		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[Exp[N[(0.5 * N[(N[Log[(-x)], $MachinePrecision] - N[Log[N[(-1.0 / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -1.65e+22], t$95$0, If[LessEqual[y, -5.2e-212], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, -4e-310], 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 < -1.6499999999999999e22 or -5.2e-212 < y < -3.999999999999988e-310

   1. Initial program 61.9%

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

      1. +-commutative 61.9%

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

      2. associate-+r+ 61.9%

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

      3. *-commutative 61.9%

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

      4. +-commutative 61.9%

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

      5. associate-+l+ 61.9%

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

      6. *-commutative 61.9%

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

      7. *-commutative 61.9%

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

      8. *-commutative 61.9%

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

      9. distribute-lft-out 62.0%

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

   3. Simplified 62.0%

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

   4. Taylor expanded in x around inf 39.5%

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

      1. pow1/2 39.7%

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

      2. metadata-eval 39.7%

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

      3. pow-to-exp 36.8%

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

      4. *-commutative 36.8%

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

      5. +-commutative 36.8%

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

      6. metadata-eval 36.8%

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

   6. Applied egg-rr 36.8%

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

   7. Taylor expanded in y around -inf 34.3%

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

      1. +-commutative 34.3%

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

      2. mul-1-neg 34.3%

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

      3. unsub-neg 34.3%

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

      4. mul-1-neg 34.3%

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

   9. Simplified 34.3%

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

   if -1.6499999999999999e22 < y < -5.2e-212

   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 58.1%

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

   if -3.999999999999988e-310 < y

   1. Initial program 70.0%

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

      1. +-commutative 70.0%

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

      2. associate-+r+ 70.0%

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

      3. *-commutative 70.0%

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

      4. +-commutative 70.0%

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

      5. associate-+l+ 70.0%

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

      6. *-commutative 70.0%

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

      7. *-commutative 70.0%

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

      8. *-commutative 70.0%

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

      9. distribute-lft-out 70.0%

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

   3. Simplified 70.0%

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

   4. Taylor expanded in x around 0 25.5%

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

      1. *-commutative 25.5%

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

      2. sqrt-prod 34.6%

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

   6. Applied egg-rr 34.6%

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

4. Final simplification 37.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.65 \cdot 10^{+22}:\\ \;\;\;\;2 \cdot e^{0.5 \cdot \left(\log \left(-x\right) - \log \left(\frac{-1}{y}\right)\right)}\\ \mathbf{elif}\;y \leq -5.2 \cdot 10^{-212}:\\ \;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\ \mathbf{elif}\;y \leq -4 \cdot 10^{-310}:\\ \;\;\;\;2 \cdot e^{0.5 \cdot \left(\log \left(-x\right) - \log \left(\frac{-1}{y}\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{y}\right)\\ \end{array} \]

Alternative 3: 83.6% accurate, 0.5× speedup

Math

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

2. if y < 9.49999999999999939e-247

   1. Initial program 69.7%

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

      1. +-commutative 69.7%

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

      2. associate-+r+ 69.7%

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

      3. *-commutative 69.7%

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

      4. +-commutative 69.7%

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

      5. associate-+l+ 69.7%

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

      6. *-commutative 69.7%

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

      7. *-commutative 69.7%

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

      8. *-commutative 69.7%

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

      9. distribute-lft-out 69.7%

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

   3. Simplified 69.7%

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

   if 9.49999999999999939e-247 < y

   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 26.7%

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

      1. *-commutative 26.7%

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

      2. sqrt-prod 36.4%

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

   6. Applied egg-rr 36.4%

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

4. Final simplification 54.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 9.5 \cdot 10^{-247}:\\ \;\;\;\;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} \]

Alternative 4: 70.5% 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.8%

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

   1. +-commutative 69.8%

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

   2. associate-+r+ 69.8%

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

   3. *-commutative 69.8%

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

   4. +-commutative 69.8%

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

   5. associate-+l+ 69.8%

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

   6. *-commutative 69.8%

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

   7. *-commutative 69.8%

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

   8. *-commutative 69.8%

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

   9. distribute-lft-out 69.8%

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

3. Simplified 69.8%

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

4. Final simplification 69.8%

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

Alternative 5: 68.8% accurate, 1.0× speedup

Math

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

   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 28.7%

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

   if -7.99999999999999982e-256 < 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.2%

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

   3. Simplified 70.2%

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

   4. Taylor expanded in z around inf 44.1%

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

4. Final simplification 36.9%

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

Alternative 6: 70.2% 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^{-261}:\\ \;\;\;\;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-261) (* 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-261) {
		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-261)) 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-261) {
		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-261:
		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-261)
		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-261)
		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-261], 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.99999999999999984e-262

   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 42.6%

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

   if -9.99999999999999984e-262 < 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.2%

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

   3. Simplified 70.2%

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

   4. Taylor expanded in z around inf 44.1%

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

4. Final simplification 43.4%

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

Alternative 7: 68.0% accurate, 1.1× speedup

Math

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

   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 28.7%

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

   if -2.24999999999999999e-262 < 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.2%

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

   3. Simplified 70.2%

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

   4. Taylor expanded in x around 0 24.0%

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

4. Final simplification 26.2%

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

Alternative 8: 35.6% 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.8%

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

   1. +-commutative 69.8%

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

   2. associate-+r+ 69.8%

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

   3. *-commutative 69.8%

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

   4. +-commutative 69.8%

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

   5. associate-+l+ 69.8%

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

   6. *-commutative 69.8%

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

   7. *-commutative 69.8%

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

   8. *-commutative 69.8%

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

   9. distribute-lft-out 69.8%

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

3. Simplified 69.8%

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

4. Taylor expanded in z around 0 29.1%

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

5. Final simplification 29.1%

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

Developer target: 83.3% 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 2023268 
(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)))))