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

Percentage Accurate: 71.8% → 96.2%

Time: 16.3s

Alternatives: 9

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 71.8% 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: 96.2% 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(-z\right) - y\right) - \log \left(\frac{-1}{x}\right)\right) \cdot 0.5}\\ \mathbf{if}\;y \leq -6.8 \cdot 10^{+32}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;y \leq -8.8 \cdot 10^{-264}:\\ \;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\ \mathbf{elif}\;y \leq -2.1 \cdot 10^{-302}:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(\sqrt{y + x} \cdot \sqrt{z}\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 (- (- z) y)) (log (/ -1.0 x))) 0.5)))))
   (if (<= y -6.8e+32)
     t_0
     (if (<= y -8.8e-264)
       (* 2.0 (sqrt (* x (+ y z))))
       (if (<= y -2.1e-302) t_0 (* 2.0 (* (sqrt (+ y x)) (sqrt z))))))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double t_0 = 2.0 * exp(((log((-z - y)) - log((-1.0 / x))) * 0.5));
	double tmp;
	if (y <= -6.8e+32) {
		tmp = t_0;
	} else if (y <= -8.8e-264) {
		tmp = 2.0 * sqrt((x * (y + z)));
	} else if (y <= -2.1e-302) {
		tmp = t_0;
	} else {
		tmp = 2.0 * (sqrt((y + x)) * sqrt(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) :: t_0
    real(8) :: tmp
    t_0 = 2.0d0 * exp(((log((-z - y)) - log(((-1.0d0) / x))) * 0.5d0))
    if (y <= (-6.8d+32)) then
        tmp = t_0
    else if (y <= (-8.8d-264)) then
        tmp = 2.0d0 * sqrt((x * (y + z)))
    else if (y <= (-2.1d-302)) then
        tmp = t_0
    else
        tmp = 2.0d0 * (sqrt((y + x)) * sqrt(z))
    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((-z - y)) - Math.log((-1.0 / x))) * 0.5));
	double tmp;
	if (y <= -6.8e+32) {
		tmp = t_0;
	} else if (y <= -8.8e-264) {
		tmp = 2.0 * Math.sqrt((x * (y + z)));
	} else if (y <= -2.1e-302) {
		tmp = t_0;
	} else {
		tmp = 2.0 * (Math.sqrt((y + x)) * Math.sqrt(z));
	}
	return tmp;
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	t_0 = 2.0 * math.exp(((math.log((-z - y)) - math.log((-1.0 / x))) * 0.5))
	tmp = 0
	if y <= -6.8e+32:
		tmp = t_0
	elif y <= -8.8e-264:
		tmp = 2.0 * math.sqrt((x * (y + z)))
	elif y <= -2.1e-302:
		tmp = t_0
	else:
		tmp = 2.0 * (math.sqrt((y + x)) * math.sqrt(z))
	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(-z) - y)) - log(Float64(-1.0 / x))) * 0.5)))
	tmp = 0.0
	if (y <= -6.8e+32)
		tmp = t_0;
	elseif (y <= -8.8e-264)
		tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z))));
	elseif (y <= -2.1e-302)
		tmp = t_0;
	else
		tmp = Float64(2.0 * Float64(sqrt(Float64(y + x)) * sqrt(z)));
	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((-z - y)) - log((-1.0 / x))) * 0.5));
	tmp = 0.0;
	if (y <= -6.8e+32)
		tmp = t_0;
	elseif (y <= -8.8e-264)
		tmp = 2.0 * sqrt((x * (y + z)));
	elseif (y <= -2.1e-302)
		tmp = t_0;
	else
		tmp = 2.0 * (sqrt((y + x)) * sqrt(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_] := Block[{t$95$0 = N[(2.0 * N[Exp[N[(N[(N[Log[N[((-z) - y), $MachinePrecision]], $MachinePrecision] - N[Log[N[(-1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -6.8e+32], t$95$0, If[LessEqual[y, -8.8e-264], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, -2.1e-302], t$95$0, N[(2.0 * N[(N[Sqrt[N[(y + x), $MachinePrecision]], $MachinePrecision] * N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if y < -6.79999999999999957e32 or -8.79999999999999975e-264 < y < -2.10000000000000013e-302

   1. Initial program 37.6%

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

      1. +-commutative 37.6%

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

      2. associate-+r+ 37.6%

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

      3. *-commutative 37.6%

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

      4. +-commutative 37.6%

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

      5. associate-+l+ 37.6%

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

      6. *-commutative 37.6%

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

      7. *-commutative 37.6%

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

      8. *-commutative 37.6%

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

      9. distribute-lft-out 37.6%

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

   3. Simplified 37.6%

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

      1. +-commutative 37.6%

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

      2. distribute-rgt-in 37.6%

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

      3. associate-+l+ 37.6%

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

      4. pow1/2 37.6%

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

      5. pow-to-exp 35.1%

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

      6. distribute-lft-out 35.2%

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

      7. fma-def 35.4%

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

   5. Applied egg-rr 35.4%

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

   6. Taylor expanded in x around -inf 45.7%

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

      1. mul-1-neg 45.7%

         \[\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} \]

      2. unsub-neg 45.7%

         \[\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} \]

      3. distribute-lft-in 45.7%

         \[\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} \]

      4. neg-mul-1 45.7%

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

      5. +-commutative 45.7%

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

      6. unsub-neg 45.7%

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

      7. mul-1-neg 45.7%

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

   8. Simplified 45.7%

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

   if -6.79999999999999957e32 < y < -8.79999999999999975e-264

   1. Initial program 85.0%

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

      1. +-commutative 85.0%

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

      2. associate-+r+ 85.0%

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

      3. *-commutative 85.0%

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

      4. +-commutative 85.0%

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

      5. associate-+l+ 85.0%

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

      6. *-commutative 85.0%

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

      7. *-commutative 85.0%

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

      8. *-commutative 85.0%

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

      9. distribute-lft-out 85.0%

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

   3. Simplified 85.0%

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

   4. Taylor expanded in x around inf 63.3%

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

   if -2.10000000000000013e-302 < y

   1. Initial program 67.4%

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

      1. +-commutative 67.4%

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

      2. associate-+r+ 67.4%

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

      3. *-commutative 67.4%

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

      4. +-commutative 67.4%

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

      5. associate-+l+ 67.4%

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

      6. *-commutative 67.4%

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

      7. *-commutative 67.4%

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

      8. *-commutative 67.4%

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

      9. distribute-lft-out 67.5%

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

   3. Simplified 67.5%

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

   4. Taylor expanded in z around inf 50.3%

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

      1. +-commutative 50.3%

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

   6. Simplified 50.3%

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

      1. *-commutative 50.3%

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

      2. sqrt-prod 66.4%

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

      3. +-commutative 66.4%

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

   8. Applied egg-rr 66.4%

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

      1. +-commutative 66.4%

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

   10. Simplified 66.4%

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

4. Final simplification 60.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -6.8 \cdot 10^{+32}:\\ \;\;\;\;2 \cdot e^{\left(\log \left(\left(-z\right) - y\right) - \log \left(\frac{-1}{x}\right)\right) \cdot 0.5}\\ \mathbf{elif}\;y \leq -8.8 \cdot 10^{-264}:\\ \;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\ \mathbf{elif}\;y \leq -2.1 \cdot 10^{-302}:\\ \;\;\;\;2 \cdot e^{\left(\log \left(\left(-z\right) - y\right) - \log \left(\frac{-1}{x}\right)\right) \cdot 0.5}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(\sqrt{y + x} \cdot \sqrt{z}\right)\\ \end{array} \]

Alternative 2: 95.8% accurate, 0.4× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq -8.4 \cdot 10^{+32}:\\ \;\;\;\;2 \cdot e^{0.5 \cdot \left(\log \left(-y\right) - \log \left(\frac{-1}{x}\right)\right)}\\ \mathbf{elif}\;y \leq 4.7 \cdot 10^{-287}:\\ \;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(\sqrt{y + x} \cdot \sqrt{z}\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 -8.4e+32)
   (* 2.0 (exp (* 0.5 (- (log (- y)) (log (/ -1.0 x))))))
   (if (<= y 4.7e-287)
     (* 2.0 (sqrt (* x (+ y z))))
     (* 2.0 (* (sqrt (+ y x)) (sqrt z))))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if (y <= -8.4e+32) {
		tmp = 2.0 * exp((0.5 * (log(-y) - log((-1.0 / x)))));
	} else if (y <= 4.7e-287) {
		tmp = 2.0 * sqrt((x * (y + z)));
	} else {
		tmp = 2.0 * (sqrt((y + x)) * sqrt(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 <= (-8.4d+32)) then
        tmp = 2.0d0 * exp((0.5d0 * (log(-y) - log(((-1.0d0) / x)))))
    else if (y <= 4.7d-287) then
        tmp = 2.0d0 * sqrt((x * (y + z)))
    else
        tmp = 2.0d0 * (sqrt((y + x)) * sqrt(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 <= -8.4e+32) {
		tmp = 2.0 * Math.exp((0.5 * (Math.log(-y) - Math.log((-1.0 / x)))));
	} else if (y <= 4.7e-287) {
		tmp = 2.0 * Math.sqrt((x * (y + z)));
	} else {
		tmp = 2.0 * (Math.sqrt((y + x)) * Math.sqrt(z));
	}
	return tmp;
}

Python

[x, y, z] = sort([x, y, z])
def code(x, y, z):
	tmp = 0
	if y <= -8.4e+32:
		tmp = 2.0 * math.exp((0.5 * (math.log(-y) - math.log((-1.0 / x)))))
	elif y <= 4.7e-287:
		tmp = 2.0 * math.sqrt((x * (y + z)))
	else:
		tmp = 2.0 * (math.sqrt((y + x)) * math.sqrt(z))
	return tmp

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (y <= -8.4e+32)
		tmp = Float64(2.0 * exp(Float64(0.5 * Float64(log(Float64(-y)) - log(Float64(-1.0 / x))))));
	elseif (y <= 4.7e-287)
		tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z))));
	else
		tmp = Float64(2.0 * Float64(sqrt(Float64(y + x)) * sqrt(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 <= -8.4e+32)
		tmp = 2.0 * exp((0.5 * (log(-y) - log((-1.0 / x)))));
	elseif (y <= 4.7e-287)
		tmp = 2.0 * sqrt((x * (y + z)));
	else
		tmp = 2.0 * (sqrt((y + x)) * sqrt(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, -8.4e+32], 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, 4.7e-287], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[N[(y + x), $MachinePrecision]], $MachinePrecision] * N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -8.4000000000000002e32

   1. Initial program 37.9%

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

      1. +-commutative 37.9%

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

      2. associate-+r+ 37.9%

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

      3. *-commutative 37.9%

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

      4. +-commutative 37.9%

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

      5. associate-+l+ 37.9%

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

      6. *-commutative 37.9%

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

      7. *-commutative 37.9%

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

      8. *-commutative 37.9%

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

      9. distribute-lft-out 38.0%

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

   3. Simplified 38.0%

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

      1. +-commutative 38.0%

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

      2. distribute-rgt-in 37.9%

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

      3. associate-+l+ 37.9%

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

      4. pow1/2 37.9%

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

      5. pow-to-exp 35.4%

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

      6. distribute-lft-out 35.6%

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

      7. fma-def 35.7%

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

   5. Applied egg-rr 35.7%

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

   6. Taylor expanded in z around 0 20.2%

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

      1. *-commutative 20.2%

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

   8. Simplified 20.2%

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

   9. Taylor expanded in x around -inf 42.5%

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

       1. mul-1-neg 42.5%

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

       2. unsub-neg 42.5%

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

       3. mul-1-neg 42.5%

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

   11. Simplified 42.5%

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

   if -8.4000000000000002e32 < y < 4.6999999999999999e-287

   1. Initial program 81.7%

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

      1. +-commutative 81.7%

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

      2. associate-+r+ 81.7%

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

      3. *-commutative 81.7%

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

      4. +-commutative 81.7%

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

      5. associate-+l+ 81.7%

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

      6. *-commutative 81.7%

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

      7. *-commutative 81.7%

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

      8. *-commutative 81.7%

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

      9. distribute-lft-out 81.7%

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

   3. Simplified 81.7%

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

   4. Taylor expanded in x around inf 63.5%

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

   if 4.6999999999999999e-287 < y

   1. Initial program 66.3%

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

      1. +-commutative 66.3%

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

      2. associate-+r+ 66.3%

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

      3. *-commutative 66.3%

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

      4. +-commutative 66.3%

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

      5. associate-+l+ 66.3%

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

      6. *-commutative 66.3%

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

      7. *-commutative 66.3%

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

      8. *-commutative 66.3%

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

      9. distribute-lft-out 66.4%

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

   3. Simplified 66.4%

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

   4. Taylor expanded in z around inf 48.2%

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

      1. +-commutative 48.2%

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

   6. Simplified 48.2%

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

      1. *-commutative 48.2%

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

      2. sqrt-prod 65.3%

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

      3. +-commutative 65.3%

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

   8. Applied egg-rr 65.3%

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

      1. +-commutative 65.3%

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

   10. Simplified 65.3%

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

4. Final simplification 59.4%

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

Alternative 3: 85.9% accurate, 0.5× speedup

Math

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

C

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

Fortran

NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (y <= 5d-287) then
        tmp = 2.0d0 * sqrt((x * (y + z)))
    else
        tmp = 2.0d0 * (sqrt((y + x)) * sqrt(z))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 5.00000000000000025e-287

   1. Initial program 62.2%

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

      1. +-commutative 62.2%

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

      2. associate-+r+ 62.2%

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

      3. *-commutative 62.2%

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

      4. +-commutative 62.2%

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

      5. associate-+l+ 62.2%

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

      6. *-commutative 62.2%

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

      7. *-commutative 62.2%

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

      8. *-commutative 62.2%

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

      9. distribute-lft-out 62.3%

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

   3. Simplified 62.3%

      \[\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}{x \cdot \left(y + z\right)}} \]

   if 5.00000000000000025e-287 < y

   1. Initial program 66.3%

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

      1. +-commutative 66.3%

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

      2. associate-+r+ 66.3%

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

      3. *-commutative 66.3%

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

      4. +-commutative 66.3%

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

      5. associate-+l+ 66.3%

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

      6. *-commutative 66.3%

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

      7. *-commutative 66.3%

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

      8. *-commutative 66.3%

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

      9. distribute-lft-out 66.4%

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

   3. Simplified 66.4%

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

   4. Taylor expanded in z around inf 48.2%

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

      1. +-commutative 48.2%

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

   6. Simplified 48.2%

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

      1. *-commutative 48.2%

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

      2. sqrt-prod 65.3%

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

      3. +-commutative 65.3%

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

   8. Applied egg-rr 65.3%

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

      1. +-commutative 65.3%

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

   10. Simplified 65.3%

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

4. Final simplification 55.0%

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

Alternative 4: 84.2% accurate, 0.5× speedup

Math

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

2. if y < 6.19999999999999976e-273

   1. Initial program 62.4%

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

      1. +-commutative 62.4%

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

      2. associate-+r+ 62.4%

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

      3. *-commutative 62.4%

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

      4. +-commutative 62.4%

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

      5. associate-+l+ 62.4%

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

      6. *-commutative 62.4%

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

      7. *-commutative 62.4%

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

      8. *-commutative 62.4%

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

      9. distribute-lft-out 62.4%

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

   3. Simplified 62.4%

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

   4. Taylor expanded in x around inf 46.3%

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

   if 6.19999999999999976e-273 < y

   1. Initial program 66.3%

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

      1. +-commutative 66.3%

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

      2. associate-+r+ 66.3%

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

      3. *-commutative 66.3%

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

      4. +-commutative 66.3%

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

      5. associate-+l+ 66.3%

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

      6. *-commutative 66.3%

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

      7. *-commutative 66.3%

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

      8. *-commutative 66.3%

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

      9. distribute-lft-out 66.3%

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

   3. Simplified 66.3%

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

   4. Taylor expanded in x around 0 28.2%

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

      1. *-commutative 28.2%

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

      2. sqrt-prod 48.8%

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

   6. Applied egg-rr 48.8%

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

4. Final simplification 47.4%

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

Alternative 5: 71.9% 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 64.2%

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

   1. +-commutative 64.2%

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

   2. associate-+r+ 64.2%

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

   3. *-commutative 64.2%

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

   4. +-commutative 64.2%

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

   5. associate-+l+ 64.2%

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

   6. *-commutative 64.2%

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

   7. *-commutative 64.2%

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

   8. *-commutative 64.2%

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

   9. distribute-lft-out 64.2%

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

3. Simplified 64.2%

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

4. Final simplification 64.2%

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

Alternative 6: 70.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (y <= 6.2d-273) then
        tmp = 2.0d0 * sqrt((x * (y + z)))
    else
        tmp = 2.0d0 * sqrt((y * z))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 6.19999999999999976e-273

   1. Initial program 62.4%

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

      1. +-commutative 62.4%

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

      2. associate-+r+ 62.4%

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

      3. *-commutative 62.4%

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

      4. +-commutative 62.4%

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

      5. associate-+l+ 62.4%

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

      6. *-commutative 62.4%

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

      7. *-commutative 62.4%

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

      8. *-commutative 62.4%

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

      9. distribute-lft-out 62.4%

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

   3. Simplified 62.4%

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

   4. Taylor expanded in x around inf 46.3%

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

   if 6.19999999999999976e-273 < y

   1. Initial program 66.3%

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

      1. +-commutative 66.3%

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

      2. associate-+r+ 66.3%

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

      3. *-commutative 66.3%

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

      4. +-commutative 66.3%

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

      5. associate-+l+ 66.3%

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

      6. *-commutative 66.3%

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

      7. *-commutative 66.3%

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

      8. *-commutative 66.3%

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

      9. distribute-lft-out 66.3%

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

   3. Simplified 66.3%

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

   4. Taylor expanded in x around 0 28.2%

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

4. Final simplification 37.9%

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

Alternative 7: 71.9% accurate, 1.0× speedup

Math

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

   1. Initial program 61.4%

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

      1. +-commutative 61.4%

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

      2. associate-+r+ 61.4%

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

      3. *-commutative 61.4%

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

      4. +-commutative 61.4%

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

      5. associate-+l+ 61.4%

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

      6. *-commutative 61.4%

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

      7. *-commutative 61.4%

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

      8. *-commutative 61.4%

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

      9. distribute-lft-out 61.5%

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

   3. Simplified 61.5%

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

   4. Taylor expanded in x around inf 43.8%

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

   if -2.00000000000000012e-288 < y

   1. Initial program 66.8%

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

      1. +-commutative 66.8%

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

      2. associate-+r+ 66.8%

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

      3. *-commutative 66.8%

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

      4. +-commutative 66.8%

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

      5. associate-+l+ 66.8%

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

      6. *-commutative 66.8%

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

      7. *-commutative 66.8%

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

      8. *-commutative 66.8%

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

      9. distribute-lft-out 66.9%

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

   3. Simplified 66.9%

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

   4. Taylor expanded in z around inf 50.0%

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

      1. +-commutative 50.0%

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

   6. Simplified 50.0%

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

4. Final simplification 46.9%

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

Alternative 8: 69.7% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Fortran

NOTE: x, y, and z should be sorted in increasing order before calling this function.
real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (y <= (-5d-311)) then
        tmp = 2.0d0 * sqrt((y * x))
    else
        tmp = 2.0d0 * sqrt((y * z))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := If[LessEqual[y, -5e-311], 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 < -5.00000000000023e-311

   1. Initial program 61.1%

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

      1. +-commutative 61.1%

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

      2. associate-+r+ 61.1%

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

      3. *-commutative 61.1%

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

      4. +-commutative 61.1%

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

      5. associate-+l+ 61.1%

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

      6. *-commutative 61.1%

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

      7. *-commutative 61.1%

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

      8. *-commutative 61.1%

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

      9. distribute-lft-out 61.1%

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

   3. Simplified 61.1%

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

   4. Taylor expanded in z around 0 20.4%

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

      1. *-commutative 20.4%

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

   6. Simplified 20.4%

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

   if -5.00000000000023e-311 < y

   1. Initial program 67.4%

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

      1. +-commutative 67.4%

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

      2. associate-+r+ 67.4%

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

      3. *-commutative 67.4%

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

      4. +-commutative 67.4%

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

      5. associate-+l+ 67.4%

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

      6. *-commutative 67.4%

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

      7. *-commutative 67.4%

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

      8. *-commutative 67.4%

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

      9. distribute-lft-out 67.4%

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

   3. Simplified 67.4%

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

   4. Taylor expanded in x around 0 26.9%

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

4. Final simplification 23.5%

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

Alternative 9: 36.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 64.2%

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

   1. +-commutative 64.2%

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

   2. associate-+r+ 64.2%

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

   3. *-commutative 64.2%

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

   4. +-commutative 64.2%

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

   5. associate-+l+ 64.2%

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

   6. *-commutative 64.2%

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

   7. *-commutative 64.2%

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

   8. *-commutative 64.2%

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

   9. distribute-lft-out 64.2%

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

3. Simplified 64.2%

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

4. Taylor expanded in z around 0 20.0%

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

   1. *-commutative 20.0%

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

6. Simplified 20.0%

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

7. Final simplification 20.0%

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

Developer target: 83.9% 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 2023287 
(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)))))