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

Percentage Accurate: 70.2% → 95.3%

Time: 14.4s

Alternatives: 11

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.2% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 95.3% accurate, 0.3× speedup

Math

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

Derivation

1. Split input into 3 regimes

2. if y < -4e13

   1. Initial program 50.3%

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

      1. +-commutative 50.3%

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

      2. associate-+r+ 50.3%

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

      3. *-commutative 50.3%

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

      4. +-commutative 50.3%

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

      5. +-commutative 50.3%

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

      6. *-commutative 50.3%

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

      7. *-commutative 50.3%

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

      8. associate-+l+ 50.3%

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

      9. +-commutative 50.3%

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

      10. *-commutative 50.3%

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

      11. associate-+l+ 50.3%

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

      12. *-commutative 50.3%

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

      13. *-commutative 50.3%

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

      14. +-commutative 50.3%

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

   3. Simplified 50.3%

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

   5. Taylor expanded in z around 0 31.0%

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

      1. add-sqr-sqrt 30.8%

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

      2. pow2 30.8%

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

      3. pow1/2 31.2%

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

      4. sqrt-pow1 31.2%

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

      5. *-commutative 31.2%

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

      6. metadata-eval 31.2%

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

   7. Applied egg-rr 31.2%

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

   8. Taylor expanded in x around -inf 46.2%

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

   if -4e13 < y < 7.6000000000000005e-268

   1. Initial program 85.3%

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

      1. +-commutative 85.3%

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

      2. associate-+r+ 85.3%

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

      3. *-commutative 85.3%

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

      4. +-commutative 85.3%

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

      5. +-commutative 85.3%

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

      6. *-commutative 85.3%

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

      7. *-commutative 85.3%

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

      8. associate-+l+ 85.3%

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

      9. +-commutative 85.3%

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

      10. *-commutative 85.3%

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

      11. associate-+l+ 85.3%

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

      12. *-commutative 85.3%

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

      13. *-commutative 85.3%

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

      14. +-commutative 85.3%

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

   3. Simplified 85.3%

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

   if 7.6000000000000005e-268 < 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. +-commutative 70.0%

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

      6. *-commutative 70.0%

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

      7. *-commutative 70.0%

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

      8. associate-+l+ 70.0%

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

      9. +-commutative 70.0%

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

      10. *-commutative 70.0%

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

      11. associate-+l+ 70.0%

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

      12. *-commutative 70.0%

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

      13. *-commutative 70.0%

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

      14. +-commutative 70.0%

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

   3. Simplified 70.1%

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

   5. Taylor expanded in z around inf 45.4%

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

      1. sqrt-prod 56.0%

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

      2. *-commutative 56.0%

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

      3. +-commutative 56.0%

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

   7. Applied egg-rr 56.0%

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

4. Final simplification 61.5%

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

Alternative 2: 85.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq -9.2 \cdot 10^{-225}:\\ \;\;\;\;2 \cdot \left(\sqrt{1 + \frac{y}{z}} \cdot \sqrt{x \cdot z}\right)\\ \mathbf{elif}\;z \leq 1.65 \cdot 10^{+141}:\\ \;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, z, y \cdot \left(x + z\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{\left|y + x\right|}\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, and z should be sorted in increasing order before calling this function.
(FPCore (x y z)
 :precision binary64
 (if (<= z -9.2e-225)
   (* 2.0 (* (sqrt (+ 1.0 (/ y z))) (sqrt (* x z))))
   (if (<= z 1.65e+141)
     (* 2.0 (sqrt (fma x z (* y (+ x z)))))
     (* 2.0 (* (sqrt z) (sqrt (fabs (+ y x))))))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if (z <= -9.2e-225) {
		tmp = 2.0 * (sqrt((1.0 + (y / z))) * sqrt((x * z)));
	} else if (z <= 1.65e+141) {
		tmp = 2.0 * sqrt(fma(x, z, (y * (x + z))));
	} else {
		tmp = 2.0 * (sqrt(z) * sqrt(fabs((y + x))));
	}
	return tmp;
}

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (z <= -9.2e-225)
		tmp = Float64(2.0 * Float64(sqrt(Float64(1.0 + Float64(y / z))) * sqrt(Float64(x * z))));
	elseif (z <= 1.65e+141)
		tmp = Float64(2.0 * sqrt(fma(x, z, Float64(y * Float64(x + z)))));
	else
		tmp = Float64(2.0 * Float64(sqrt(z) * sqrt(abs(Float64(y + x)))));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if z < -9.1999999999999995e-225

   1. Initial program 66.2%

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

      1. distribute-lft-out 66.2%

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

      2. *-commutative 66.2%

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

   4. Applied egg-rr 66.2%

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

   5. Taylor expanded in z around inf 62.7%

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

   6. Taylor expanded in x around inf 40.5%

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

      1. associate-*r* 39.3%

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

   8. Simplified 39.3%

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

      1. *-commutative 39.3%

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

      2. sqrt-prod 34.8%

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

      3. *-commutative 34.8%

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

   10. Applied egg-rr 34.8%

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

   if -9.1999999999999995e-225 < z < 1.6499999999999998e141

   1. Initial program 82.2%

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

      1. associate-+l+ 82.2%

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

      2. *-commutative 82.2%

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

      3. *-commutative 82.2%

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

      4. *-commutative 82.2%

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

      5. +-commutative 82.2%

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

      6. +-commutative 82.2%

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

      7. +-commutative 82.2%

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

      8. *-commutative 82.2%

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

      9. *-commutative 82.2%

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

      10. associate-+l+ 82.2%

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

      11. +-commutative 82.2%

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

      12. fma-define 82.2%

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

      13. distribute-lft-out 82.1%

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

   3. Simplified 82.1%

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

   if 1.6499999999999998e141 < z

   1. Initial program 45.6%

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

      1. +-commutative 45.6%

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

      2. associate-+r+ 45.6%

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

      3. *-commutative 45.6%

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

      4. +-commutative 45.6%

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

      5. +-commutative 45.6%

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

      6. *-commutative 45.6%

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

      7. *-commutative 45.6%

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

      8. associate-+l+ 45.6%

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

      9. +-commutative 45.6%

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

      10. *-commutative 45.6%

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

      11. associate-+l+ 45.6%

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

      12. *-commutative 45.6%

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

      13. *-commutative 45.6%

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

      14. +-commutative 45.6%

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

   3. Simplified 45.8%

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

   5. Taylor expanded in z around inf 46.2%

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

      1. sqrt-prod 99.5%

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

      2. *-commutative 99.5%

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

      3. +-commutative 99.5%

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

   7. Applied egg-rr 99.5%

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

      1. add-sqr-sqrt 99.5%

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

      2. sqrt-unprod 52.6%

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

      3. pow2 52.6%

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

      4. +-commutative 52.6%

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

   9. Applied egg-rr 52.6%

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

       1. unpow2 52.6%

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

       2. rem-sqrt-square 99.5%

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

   11. Simplified 99.5%

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

4. Final simplification 64.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -9.2 \cdot 10^{-225}:\\ \;\;\;\;2 \cdot \left(\sqrt{1 + \frac{y}{z}} \cdot \sqrt{x \cdot z}\right)\\ \mathbf{elif}\;z \leq 1.65 \cdot 10^{+141}:\\ \;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, z, y \cdot \left(x + z\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(\sqrt{z} \cdot \sqrt{\left|y + x\right|}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 85.8% accurate, 0.5× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq -9.2 \cdot 10^{-225}:\\ \;\;\;\;2 \cdot \left(\sqrt{1 + \frac{y}{z}} \cdot \sqrt{x \cdot z}\right)\\ \mathbf{elif}\;z \leq 1.4 \cdot 10^{+162}:\\ \;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, z, y \cdot \left(x + z\right)\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 (<= z -9.2e-225)
   (* 2.0 (* (sqrt (+ 1.0 (/ y z))) (sqrt (* x z))))
   (if (<= z 1.4e+162)
     (* 2.0 (sqrt (fma x z (* y (+ x 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 (z <= -9.2e-225) {
		tmp = 2.0 * (sqrt((1.0 + (y / z))) * sqrt((x * z)));
	} else if (z <= 1.4e+162) {
		tmp = 2.0 * sqrt(fma(x, z, (y * (x + z))));
	} else {
		tmp = 2.0 * (sqrt((y + x)) * sqrt(z));
	}
	return tmp;
}

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (z <= -9.2e-225)
		tmp = Float64(2.0 * Float64(sqrt(Float64(1.0 + Float64(y / z))) * sqrt(Float64(x * z))));
	elseif (z <= 1.4e+162)
		tmp = Float64(2.0 * sqrt(fma(x, z, Float64(y * Float64(x + z)))));
	else
		tmp = Float64(2.0 * Float64(sqrt(Float64(y + x)) * sqrt(z)));
	end
	return tmp
end

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := If[LessEqual[z, -9.2e-225], N[(2.0 * N[(N[Sqrt[N[(1.0 + N[(y / z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(x * z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.4e+162], N[(2.0 * N[Sqrt[N[(x * z + N[(y * N[(x + z), $MachinePrecision]), $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 z < -9.1999999999999995e-225

   1. Initial program 66.2%

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

      1. distribute-lft-out 66.2%

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

      2. *-commutative 66.2%

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

   4. Applied egg-rr 66.2%

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

   5. Taylor expanded in z around inf 62.7%

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

   6. Taylor expanded in x around inf 40.5%

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

      1. associate-*r* 39.3%

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

   8. Simplified 39.3%

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

      1. *-commutative 39.3%

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

      2. sqrt-prod 34.8%

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

      3. *-commutative 34.8%

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

   10. Applied egg-rr 34.8%

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

   if -9.1999999999999995e-225 < z < 1.39999999999999995e162

   1. Initial program 82.5%

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

      1. associate-+l+ 82.5%

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

      2. *-commutative 82.5%

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

      3. *-commutative 82.5%

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

      4. *-commutative 82.5%

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

      5. +-commutative 82.5%

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

      6. +-commutative 82.5%

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

      7. +-commutative 82.5%

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

      8. *-commutative 82.5%

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

      9. *-commutative 82.5%

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

      10. associate-+l+ 82.5%

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

      11. +-commutative 82.5%

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

      12. fma-define 82.5%

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

      13. distribute-lft-out 82.4%

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

   3. Simplified 82.4%

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

   if 1.39999999999999995e162 < z

   1. Initial program 37.4%

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

      1. +-commutative 37.4%

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

      2. associate-+r+ 37.4%

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

      3. *-commutative 37.4%

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

      4. +-commutative 37.4%

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

      5. +-commutative 37.4%

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

      6. *-commutative 37.4%

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

      7. *-commutative 37.4%

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

      8. associate-+l+ 37.4%

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

      9. +-commutative 37.4%

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

      10. *-commutative 37.4%

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

      11. associate-+l+ 37.4%

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

      12. *-commutative 37.4%

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

      13. *-commutative 37.4%

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

      14. +-commutative 37.4%

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

   3. Simplified 37.6%

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

   5. Taylor expanded in z around inf 38.2%

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

      1. sqrt-prod 99.5%

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

      2. *-commutative 99.5%

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

      3. +-commutative 99.5%

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

   7. Applied egg-rr 99.5%

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

4. Final simplification 63.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -9.2 \cdot 10^{-225}:\\ \;\;\;\;2 \cdot \left(\sqrt{1 + \frac{y}{z}} \cdot \sqrt{x \cdot z}\right)\\ \mathbf{elif}\;z \leq 1.4 \cdot 10^{+162}:\\ \;\;\;\;2 \cdot \sqrt{\mathsf{fma}\left(x, z, y \cdot \left(x + z\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(\sqrt{y + x} \cdot \sqrt{z}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 84.3% accurate, 0.5× speedup

Math

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

Julia

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

Wolfram

NOTE: x, y, and z should be sorted in increasing order before calling this function.
code[x_, y_, z_] := If[LessEqual[y, 7.6e-268], N[(2.0 * N[Sqrt[N[(x * z + N[(y * N[(x + z), $MachinePrecision]), $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 < 7.6000000000000005e-268

   1. Initial program 68.3%

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

      1. associate-+l+ 68.3%

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

      2. *-commutative 68.3%

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

      3. *-commutative 68.3%

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

      4. *-commutative 68.3%

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

      5. +-commutative 68.3%

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

      6. +-commutative 68.3%

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

      7. +-commutative 68.3%

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

      8. *-commutative 68.3%

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

      9. *-commutative 68.3%

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

      10. associate-+l+ 68.3%

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

      11. +-commutative 68.3%

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

      12. fma-define 68.3%

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

      13. distribute-lft-out 68.5%

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

   3. Simplified 68.5%

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

   if 7.6000000000000005e-268 < 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. +-commutative 70.0%

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

      6. *-commutative 70.0%

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

      7. *-commutative 70.0%

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

      8. associate-+l+ 70.0%

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

      9. +-commutative 70.0%

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

      10. *-commutative 70.0%

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

      11. associate-+l+ 70.0%

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

      12. *-commutative 70.0%

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

      13. *-commutative 70.0%

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

      14. +-commutative 70.0%

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

   3. Simplified 70.1%

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

   5. Taylor expanded in z around inf 45.4%

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

      1. sqrt-prod 56.0%

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

      2. *-commutative 56.0%

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

      3. +-commutative 56.0%

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

   7. Applied egg-rr 56.0%

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

Alternative 5: 84.5% accurate, 0.5× speedup

Math

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

   1. Initial program 67.6%

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

      1. +-commutative 67.6%

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

      2. associate-+r+ 67.6%

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

      3. *-commutative 67.6%

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

      4. +-commutative 67.6%

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

      5. +-commutative 67.6%

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

      6. *-commutative 67.6%

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

      7. *-commutative 67.6%

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

      8. associate-+l+ 67.6%

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

      9. +-commutative 67.6%

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

      10. *-commutative 67.6%

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

      11. associate-+l+ 67.6%

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

      12. *-commutative 67.6%

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

      13. *-commutative 67.6%

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

      14. +-commutative 67.6%

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

   3. Simplified 67.6%

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

   5. Taylor expanded in x around inf 48.9%

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

      1. +-commutative 48.9%

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

   7. Simplified 48.9%

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

   if 2.7999999999999999e-296 < y

   1. Initial program 70.8%

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

      1. +-commutative 70.8%

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

      2. associate-+r+ 70.8%

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

      3. *-commutative 70.8%

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

      4. +-commutative 70.8%

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

      5. +-commutative 70.8%

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

      6. *-commutative 70.8%

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

      7. *-commutative 70.8%

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

      8. associate-+l+ 70.8%

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

      9. +-commutative 70.8%

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

      10. *-commutative 70.8%

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

      11. associate-+l+ 70.8%

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

      12. *-commutative 70.8%

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

      13. *-commutative 70.8%

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

      14. +-commutative 70.8%

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

   3. Simplified 70.9%

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

   5. Taylor expanded in z around inf 46.3%

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

      1. sqrt-prod 55.4%

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

      2. *-commutative 55.4%

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

      3. +-commutative 55.4%

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

   7. Applied egg-rr 55.4%

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

4. Final simplification 52.0%

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

Alternative 6: 83.0% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 7.6000000000000005e-268

   1. Initial program 68.3%

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

      1. distribute-lft-out 68.3%

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

      2. *-commutative 68.3%

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

   4. Applied egg-rr 68.3%

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

   if 7.6000000000000005e-268 < 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. +-commutative 70.0%

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

      6. *-commutative 70.0%

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

      7. *-commutative 70.0%

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

      8. associate-+l+ 70.0%

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

      9. +-commutative 70.0%

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

      10. *-commutative 70.0%

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

      11. associate-+l+ 70.0%

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

      12. *-commutative 70.0%

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

      13. *-commutative 70.0%

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

      14. +-commutative 70.0%

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

   3. Simplified 70.1%

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

   5. Taylor expanded in z around inf 45.4%

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

      1. sqrt-prod 56.0%

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

      2. *-commutative 56.0%

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

      3. +-commutative 56.0%

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

   7. Applied egg-rr 56.0%

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

   8. Taylor expanded in y around inf 38.5%

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

4. Final simplification 54.6%

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

Alternative 7: 70.4% 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^{-299}:\\ \;\;\;\;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-299) (* 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-299) {
		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-299)) 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-299) {
		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-299:
		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-299)
		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-299)
		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-299], 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.99999999999999992e-300

   1. Initial program 65.8%

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

      1. +-commutative 65.8%

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

      2. associate-+r+ 65.8%

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

      3. *-commutative 65.8%

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

      4. +-commutative 65.8%

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

      5. +-commutative 65.8%

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

      6. *-commutative 65.8%

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

      7. *-commutative 65.8%

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

      8. associate-+l+ 65.8%

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

      9. +-commutative 65.8%

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

      10. *-commutative 65.8%

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

      11. associate-+l+ 65.8%

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

      12. *-commutative 65.8%

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

      13. *-commutative 65.8%

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

      14. +-commutative 65.8%

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

   3. Simplified 65.8%

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

   5. Taylor expanded in x around inf 46.1%

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

      1. +-commutative 46.1%

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

   7. Simplified 46.1%

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

   if -9.99999999999999992e-300 < y

   1. Initial program 72.4%

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

      1. +-commutative 72.4%

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

      2. associate-+r+ 72.4%

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

      3. *-commutative 72.4%

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

      4. +-commutative 72.4%

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

      5. +-commutative 72.4%

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

      6. *-commutative 72.4%

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

      7. *-commutative 72.4%

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

      8. associate-+l+ 72.4%

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

      9. +-commutative 72.4%

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

      10. *-commutative 72.4%

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

      11. associate-+l+ 72.4%

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

      12. *-commutative 72.4%

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

      13. *-commutative 72.4%

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

      14. +-commutative 72.4%

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

   3. Simplified 72.5%

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

   5. Taylor expanded in z around inf 49.3%

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

4. Final simplification 47.7%

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

Alternative 8: 69.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq 2.8 \cdot 10^{-296}:\\ \;\;\;\;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 2.8e-296) (* 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 <= 2.8e-296) {
		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 <= 2.8d-296) 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 <= 2.8e-296) {
		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 <= 2.8e-296:
		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 <= 2.8e-296)
		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 <= 2.8e-296)
		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, 2.8e-296], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[Sqrt[N[(y * z), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 2.7999999999999999e-296

   1. Initial program 67.6%

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

      1. +-commutative 67.6%

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

      2. associate-+r+ 67.6%

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

      3. *-commutative 67.6%

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

      4. +-commutative 67.6%

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

      5. +-commutative 67.6%

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

      6. *-commutative 67.6%

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

      7. *-commutative 67.6%

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

      8. associate-+l+ 67.6%

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

      9. +-commutative 67.6%

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

      10. *-commutative 67.6%

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

      11. associate-+l+ 67.6%

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

      12. *-commutative 67.6%

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

      13. *-commutative 67.6%

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

      14. +-commutative 67.6%

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

   3. Simplified 67.6%

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

   5. Taylor expanded in x around inf 48.9%

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

      1. +-commutative 48.9%

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

   7. Simplified 48.9%

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

   if 2.7999999999999999e-296 < y

   1. Initial program 70.8%

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

      1. +-commutative 70.8%

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

      2. associate-+r+ 70.8%

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

      3. *-commutative 70.8%

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

      4. +-commutative 70.8%

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

      5. +-commutative 70.8%

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

      6. *-commutative 70.8%

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

      7. *-commutative 70.8%

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

      8. associate-+l+ 70.8%

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

      9. +-commutative 70.8%

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

      10. *-commutative 70.8%

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

      11. associate-+l+ 70.8%

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

      12. *-commutative 70.8%

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

      13. *-commutative 70.8%

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

      14. +-commutative 70.8%

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

   3. Simplified 70.9%

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

   5. Taylor expanded in x around 0 23.9%

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

      1. *-commutative 23.9%

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

   7. Simplified 23.9%

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

4. Final simplification 37.1%

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

Alternative 9: 70.2% 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.1%

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

   1. +-commutative 69.1%

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

   2. associate-+r+ 69.1%

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

   3. *-commutative 69.1%

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

   4. +-commutative 69.1%

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

   5. +-commutative 69.1%

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

   6. *-commutative 69.1%

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

   7. *-commutative 69.1%

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

   8. associate-+l+ 69.1%

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

   9. +-commutative 69.1%

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

   10. *-commutative 69.1%

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

   11. associate-+l+ 69.1%

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

   12. *-commutative 69.1%

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

   13. *-commutative 69.1%

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

   14. +-commutative 69.1%

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

3. Simplified 69.2%

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

5. Final simplification 69.2%

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

Alternative 10: 68.1% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -4.999999999999985e-310

   1. Initial program 66.6%

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

      1. +-commutative 66.6%

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

      2. associate-+r+ 66.6%

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

      3. *-commutative 66.6%

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

      4. +-commutative 66.6%

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

      5. +-commutative 66.6%

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

      6. *-commutative 66.6%

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

      7. *-commutative 66.6%

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

      8. associate-+l+ 66.6%

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

      9. +-commutative 66.6%

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

      10. *-commutative 66.6%

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

      11. associate-+l+ 66.6%

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

      12. *-commutative 66.6%

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

      13. *-commutative 66.6%

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

      14. +-commutative 66.6%

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

   3. Simplified 66.6%

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

   5. Taylor expanded in z around 0 26.4%

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

   if -4.999999999999985e-310 < y

   1. Initial program 71.7%

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

      1. +-commutative 71.7%

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

      2. associate-+r+ 71.7%

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

      3. *-commutative 71.7%

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

      4. +-commutative 71.7%

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

      5. +-commutative 71.7%

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

      6. *-commutative 71.7%

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

      7. *-commutative 71.7%

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

      8. associate-+l+ 71.7%

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

      9. +-commutative 71.7%

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

      10. *-commutative 71.7%

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

      11. associate-+l+ 71.7%

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

      12. *-commutative 71.7%

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

      13. *-commutative 71.7%

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

      14. +-commutative 71.7%

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

   3. Simplified 71.8%

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

   5. Taylor expanded in x around 0 23.2%

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

      1. *-commutative 23.2%

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

   7. Simplified 23.2%

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

4. Final simplification 24.8%

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

Alternative 11: 35.4% 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.1%

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

   1. +-commutative 69.1%

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

   2. associate-+r+ 69.1%

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

   3. *-commutative 69.1%

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

   4. +-commutative 69.1%

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

   5. +-commutative 69.1%

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

   6. *-commutative 69.1%

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

   7. *-commutative 69.1%

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

   8. associate-+l+ 69.1%

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

   9. +-commutative 69.1%

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

   10. *-commutative 69.1%

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

   11. associate-+l+ 69.1%

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

   12. *-commutative 69.1%

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

   13. *-commutative 69.1%

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

   14. +-commutative 69.1%

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

3. Simplified 69.2%

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

5. Taylor expanded in z around 0 25.5%

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

6. Final simplification 25.5%

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

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

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

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