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

Percentage Accurate: 70.1% → 96.3%

Time: 14.6s

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.1% 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.3% accurate, 0.3× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq -4 \cdot 10^{+164}:\\ \;\;\;\;2 \cdot {\left(e^{0.25 \cdot \left(\log \left(\left(-z\right) - x\right) - \log \left(\frac{-1}{y}\right)\right)}\right)}^{2}\\ \mathbf{elif}\;y \leq -9800000:\\ \;\;\;\;2 \cdot \left(y \cdot \left(0.5 \cdot \left(\left(z \cdot x\right) \cdot \sqrt{\frac{1}{\left(z + x\right) \cdot {y}^{3}}}\right) - \sqrt{\frac{z + x}{y}}\right)\right)\\ \mathbf{elif}\;y \leq -4 \cdot 10^{-276}:\\ \;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(\sqrt{x + \mathsf{fma}\left(x, \frac{y}{z}, y\right)} \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 -4e+164)
   (* 2.0 (pow (exp (* 0.25 (- (log (- (- z) x)) (log (/ -1.0 y))))) 2.0))
   (if (<= y -9800000.0)
     (*
      2.0
      (*
       y
       (-
        (* 0.5 (* (* z x) (sqrt (/ 1.0 (* (+ z x) (pow y 3.0))))))
        (sqrt (/ (+ z x) y)))))
     (if (<= y -4e-276)
       (* 2.0 (sqrt (* x (+ y z))))
       (* 2.0 (* (sqrt (+ x (fma x (/ y z) y))) (sqrt z)))))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if (y <= -4e+164) {
		tmp = 2.0 * pow(exp((0.25 * (log((-z - x)) - log((-1.0 / y))))), 2.0);
	} else if (y <= -9800000.0) {
		tmp = 2.0 * (y * ((0.5 * ((z * x) * sqrt((1.0 / ((z + x) * pow(y, 3.0)))))) - sqrt(((z + x) / y))));
	} else if (y <= -4e-276) {
		tmp = 2.0 * sqrt((x * (y + z)));
	} else {
		tmp = 2.0 * (sqrt((x + fma(x, (y / z), y))) * sqrt(z));
	}
	return tmp;
}

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (y <= -4e+164)
		tmp = Float64(2.0 * (exp(Float64(0.25 * Float64(log(Float64(Float64(-z) - x)) - log(Float64(-1.0 / y))))) ^ 2.0));
	elseif (y <= -9800000.0)
		tmp = Float64(2.0 * Float64(y * Float64(Float64(0.5 * Float64(Float64(z * x) * sqrt(Float64(1.0 / Float64(Float64(z + x) * (y ^ 3.0)))))) - sqrt(Float64(Float64(z + x) / y)))));
	elseif (y <= -4e-276)
		tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z))));
	else
		tmp = Float64(2.0 * Float64(sqrt(Float64(x + fma(x, Float64(y / z), y))) * 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, -4e+164], N[(2.0 * N[Power[N[Exp[N[(0.25 * N[(N[Log[N[((-z) - x), $MachinePrecision]], $MachinePrecision] - N[Log[N[(-1.0 / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, -9800000.0], N[(2.0 * N[(y * N[(N[(0.5 * N[(N[(z * x), $MachinePrecision] * N[Sqrt[N[(1.0 / N[(N[(z + x), $MachinePrecision] * N[Power[y, 3.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[Sqrt[N[(N[(z + x), $MachinePrecision] / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, -4e-276], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[N[(x + N[(x * N[(y / z), $MachinePrecision] + y), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if y < -4e164

   1. Initial program 32.6%

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

      1. associate-+l+ 32.6%

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

      2. +-commutative 32.6%

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

      3. distribute-rgt-in 32.6%

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

   3. Simplified 32.6%

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

      1. add-sqr-sqrt 32.4%

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

      2. pow2 32.4%

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

      3. pow1/2 32.4%

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

      4. sqrt-pow1 32.4%

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

      5. distribute-rgt-in 32.4%

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

      6. associate-+r+ 32.4%

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

      7. *-commutative 32.4%

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

      8. distribute-lft-in 32.4%

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

      9. fma-define 33.0%

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

      10. metadata-eval 33.0%

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

   6. Applied egg-rr 33.0%

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

   7. Taylor expanded in y around -inf 87.0%

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

   if -4e164 < y < -9.8e6

   1. Initial program 62.9%

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

      1. associate-+l+ 62.9%

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

      2. +-commutative 62.9%

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

      3. distribute-rgt-in 63.1%

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

   3. Simplified 63.1%

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

   5. Taylor expanded in y around inf 0.8%

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

      1. +-commutative 0.8%

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

      2. *-commutative 0.8%

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

      3. +-commutative 0.8%

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

   7. Simplified 0.8%

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

   8. Taylor expanded in y around -inf 0.0%

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

      1. *-commutative 0.0%

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

      2. unpow2 0.0%

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

      3. rem-square-sqrt 88.9%

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

   10. Simplified 88.9%

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

   if -9.8e6 < y < -4e-276

   1. Initial program 86.0%

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

      1. associate-+l+ 86.0%

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

      2. +-commutative 86.0%

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

      3. distribute-rgt-in 86.0%

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

   3. Simplified 86.0%

      \[\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 56.9%

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

   if -4e-276 < y

   1. Initial program 76.4%

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

      1. associate-+l+ 76.4%

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

      2. +-commutative 76.4%

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

      3. distribute-rgt-in 76.5%

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

   3. Simplified 76.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 68.0%

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

      1. associate-/l* 61.8%

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

   7. Simplified 61.8%

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

      1. *-commutative 61.8%

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

      2. sqrt-prod 56.7%

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

      3. +-commutative 56.7%

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

      4. fma-define 56.7%

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

   9. Applied egg-rr 56.7%

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

4. Final simplification 64.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -4 \cdot 10^{+164}:\\ \;\;\;\;2 \cdot {\left(e^{0.25 \cdot \left(\log \left(\left(-z\right) - x\right) - \log \left(\frac{-1}{y}\right)\right)}\right)}^{2}\\ \mathbf{elif}\;y \leq -9800000:\\ \;\;\;\;2 \cdot \left(y \cdot \left(0.5 \cdot \left(\left(z \cdot x\right) \cdot \sqrt{\frac{1}{\left(z + x\right) \cdot {y}^{3}}}\right) - \sqrt{\frac{z + x}{y}}\right)\right)\\ \mathbf{elif}\;y \leq -4 \cdot 10^{-276}:\\ \;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(\sqrt{x + \mathsf{fma}\left(x, \frac{y}{z}, y\right)} \cdot \sqrt{z}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 96.1% accurate, 0.3× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq -1950000000:\\ \;\;\;\;2 \cdot {\left(e^{0.25 \cdot \left(\log \left(\left(-y\right) - z\right) - \log \left(\frac{-1}{x}\right)\right)}\right)}^{2}\\ \mathbf{elif}\;y \leq -1.2 \cdot 10^{-212}:\\ \;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\ \mathbf{elif}\;y \leq -1.6 \cdot 10^{-256}:\\ \;\;\;\;2 \cdot {\left(e^{0.25 \cdot \left(\log \left(\left(-z\right) - x\right) - \log \left(\frac{-1}{y}\right)\right)}\right)}^{2}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(\sqrt{x + \mathsf{fma}\left(x, \frac{y}{z}, y\right)} \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 -1950000000.0)
   (* 2.0 (pow (exp (* 0.25 (- (log (- (- y) z)) (log (/ -1.0 x))))) 2.0))
   (if (<= y -1.2e-212)
     (* 2.0 (sqrt (* x (+ y z))))
     (if (<= y -1.6e-256)
       (* 2.0 (pow (exp (* 0.25 (- (log (- (- z) x)) (log (/ -1.0 y))))) 2.0))
       (* 2.0 (* (sqrt (+ x (fma x (/ y z) y))) (sqrt z)))))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if (y <= -1950000000.0) {
		tmp = 2.0 * pow(exp((0.25 * (log((-y - z)) - log((-1.0 / x))))), 2.0);
	} else if (y <= -1.2e-212) {
		tmp = 2.0 * sqrt((x * (y + z)));
	} else if (y <= -1.6e-256) {
		tmp = 2.0 * pow(exp((0.25 * (log((-z - x)) - log((-1.0 / y))))), 2.0);
	} else {
		tmp = 2.0 * (sqrt((x + fma(x, (y / z), y))) * sqrt(z));
	}
	return tmp;
}

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (y <= -1950000000.0)
		tmp = Float64(2.0 * (exp(Float64(0.25 * Float64(log(Float64(Float64(-y) - z)) - log(Float64(-1.0 / x))))) ^ 2.0));
	elseif (y <= -1.2e-212)
		tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z))));
	elseif (y <= -1.6e-256)
		tmp = Float64(2.0 * (exp(Float64(0.25 * Float64(log(Float64(Float64(-z) - x)) - log(Float64(-1.0 / y))))) ^ 2.0));
	else
		tmp = Float64(2.0 * Float64(sqrt(Float64(x + fma(x, Float64(y / z), y))) * 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, -1950000000.0], N[(2.0 * N[Power[N[Exp[N[(0.25 * N[(N[Log[N[((-y) - z), $MachinePrecision]], $MachinePrecision] - N[Log[N[(-1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, -1.2e-212], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, -1.6e-256], N[(2.0 * N[Power[N[Exp[N[(0.25 * N[(N[Log[N[((-z) - x), $MachinePrecision]], $MachinePrecision] - N[Log[N[(-1.0 / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[N[(x + N[(x * N[(y / z), $MachinePrecision] + y), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if y < -1.95e9

   1. Initial program 47.8%

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

      1. associate-+l+ 47.8%

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

      2. +-commutative 47.8%

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

      3. distribute-rgt-in 47.9%

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

   3. Simplified 47.9%

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

      1. add-sqr-sqrt 47.7%

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

      2. pow2 47.7%

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

      3. pow1/2 47.7%

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

      4. sqrt-pow1 47.7%

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

      5. distribute-rgt-in 47.6%

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

      6. associate-+r+ 47.6%

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

      7. *-commutative 47.6%

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

      8. distribute-lft-in 47.6%

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

      9. fma-define 48.0%

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

      10. metadata-eval 48.0%

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

   6. Applied egg-rr 48.0%

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

   7. Taylor expanded in x around -inf 55.3%

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

   if -1.95e9 < y < -1.19999999999999995e-212

   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. associate-+l+ 81.7%

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

      2. +-commutative 81.7%

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

      3. distribute-rgt-in 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. Add Preprocessing

   5. Taylor expanded in x around inf 50.1%

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

   if -1.19999999999999995e-212 < y < -1.6e-256

   1. Initial program 99.7%

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

      1. associate-+l+ 99.7%

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

      2. +-commutative 99.7%

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

      3. distribute-rgt-in 99.7%

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

   3. Simplified 99.7%

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

      1. add-sqr-sqrt 99.5%

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

      2. pow2 99.5%

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

      3. pow1/2 99.5%

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

      4. sqrt-pow1 99.5%

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

      5. distribute-rgt-in 99.5%

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

      6. associate-+r+ 99.5%

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

      7. *-commutative 99.5%

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

      8. distribute-lft-in 99.5%

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

      9. fma-define 99.5%

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

      10. metadata-eval 99.5%

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

   6. Applied egg-rr 99.5%

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

   7. Taylor expanded in y around -inf 32.0%

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

   if -1.6e-256 < y

   1. Initial program 77.2%

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

      1. associate-+l+ 77.2%

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

      2. +-commutative 77.2%

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

      3. distribute-rgt-in 77.3%

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

   3. Simplified 77.3%

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

   5. Taylor expanded in z around inf 69.1%

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

      1. associate-/l* 63.1%

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

   7. Simplified 63.1%

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

      1. *-commutative 63.1%

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

      2. sqrt-prod 56.8%

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

      3. +-commutative 56.8%

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

      4. fma-define 56.8%

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

   9. Applied egg-rr 56.8%

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

4. Final simplification 54.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1950000000:\\ \;\;\;\;2 \cdot {\left(e^{0.25 \cdot \left(\log \left(\left(-y\right) - z\right) - \log \left(\frac{-1}{x}\right)\right)}\right)}^{2}\\ \mathbf{elif}\;y \leq -1.2 \cdot 10^{-212}:\\ \;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\ \mathbf{elif}\;y \leq -1.6 \cdot 10^{-256}:\\ \;\;\;\;2 \cdot {\left(e^{0.25 \cdot \left(\log \left(\left(-z\right) - x\right) - \log \left(\frac{-1}{y}\right)\right)}\right)}^{2}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(\sqrt{x + \mathsf{fma}\left(x, \frac{y}{z}, y\right)} \cdot \sqrt{z}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 95.1% accurate, 0.3× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq -1900000000:\\ \;\;\;\;2 \cdot \left(y \cdot \left(0.5 \cdot \left(\left(z \cdot x\right) \cdot \sqrt{\frac{1}{\left(z + x\right) \cdot {y}^{3}}}\right) - \sqrt{\frac{z + x}{y}}\right)\right)\\ \mathbf{elif}\;y \leq -4 \cdot 10^{-276}:\\ \;\;\;\;2 \cdot \sqrt{x \cdot \left(y + z\right)}\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \left(\sqrt{x + \mathsf{fma}\left(x, \frac{y}{z}, y\right)} \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 -1900000000.0)
   (*
    2.0
    (*
     y
     (-
      (* 0.5 (* (* z x) (sqrt (/ 1.0 (* (+ z x) (pow y 3.0))))))
      (sqrt (/ (+ z x) y)))))
   (if (<= y -4e-276)
     (* 2.0 (sqrt (* x (+ y z))))
     (* 2.0 (* (sqrt (+ x (fma x (/ y z) y))) (sqrt z))))))

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if (y <= -1900000000.0) {
		tmp = 2.0 * (y * ((0.5 * ((z * x) * sqrt((1.0 / ((z + x) * pow(y, 3.0)))))) - sqrt(((z + x) / y))));
	} else if (y <= -4e-276) {
		tmp = 2.0 * sqrt((x * (y + z)));
	} else {
		tmp = 2.0 * (sqrt((x + fma(x, (y / z), y))) * sqrt(z));
	}
	return tmp;
}

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (y <= -1900000000.0)
		tmp = Float64(2.0 * Float64(y * Float64(Float64(0.5 * Float64(Float64(z * x) * sqrt(Float64(1.0 / Float64(Float64(z + x) * (y ^ 3.0)))))) - sqrt(Float64(Float64(z + x) / y)))));
	elseif (y <= -4e-276)
		tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z))));
	else
		tmp = Float64(2.0 * Float64(sqrt(Float64(x + fma(x, Float64(y / z), y))) * 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, -1900000000.0], N[(2.0 * N[(y * N[(N[(0.5 * N[(N[(z * x), $MachinePrecision] * N[Sqrt[N[(1.0 / N[(N[(z + x), $MachinePrecision] * N[Power[y, 3.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[Sqrt[N[(N[(z + x), $MachinePrecision] / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, -4e-276], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[N[(x + N[(x * N[(y / z), $MachinePrecision] + y), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -1.9e9

   1. Initial program 47.8%

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

      1. associate-+l+ 47.8%

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

      2. +-commutative 47.8%

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

      3. distribute-rgt-in 47.9%

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

   3. Simplified 47.9%

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

   5. Taylor expanded in y around inf 0.7%

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

      1. +-commutative 0.7%

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

      2. *-commutative 0.7%

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

      3. +-commutative 0.7%

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

   7. Simplified 0.7%

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

   8. Taylor expanded in y around -inf 0.0%

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

      1. *-commutative 0.0%

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

      2. unpow2 0.0%

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

      3. rem-square-sqrt 84.6%

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

   10. Simplified 84.6%

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

   if -1.9e9 < y < -4e-276

   1. Initial program 86.0%

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

      1. associate-+l+ 86.0%

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

      2. +-commutative 86.0%

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

      3. distribute-rgt-in 86.0%

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

   3. Simplified 86.0%

      \[\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 56.9%

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

   if -4e-276 < y

   1. Initial program 76.4%

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

      1. associate-+l+ 76.4%

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

      2. +-commutative 76.4%

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

      3. distribute-rgt-in 76.5%

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

   3. Simplified 76.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 68.0%

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

      1. associate-/l* 61.8%

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

   7. Simplified 61.8%

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

      1. *-commutative 61.8%

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

      2. sqrt-prod 56.7%

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

      3. +-commutative 56.7%

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

      4. fma-define 56.7%

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

   9. Applied egg-rr 56.7%

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

4. Final simplification 63.5%

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

Alternative 4: 85.2% accurate, 0.4× speedup

Math

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

C

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

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (y <= -4e-276)
		tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z))));
	else
		tmp = Float64(2.0 * Float64(sqrt(Float64(x + fma(x, Float64(y / z), y))) * 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, -4e-276], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[N[(x + N[(x * N[(y / z), $MachinePrecision] + y), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * N[Sqrt[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -4e-276

   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. associate-+l+ 66.3%

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

      2. +-commutative 66.3%

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

      3. distribute-rgt-in 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. Add Preprocessing

   5. Taylor expanded in x around inf 44.2%

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

   if -4e-276 < y

   1. Initial program 76.4%

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

      1. associate-+l+ 76.4%

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

      2. +-commutative 76.4%

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

      3. distribute-rgt-in 76.5%

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

   3. Simplified 76.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 68.0%

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

      1. associate-/l* 61.8%

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

   7. Simplified 61.8%

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

      1. *-commutative 61.8%

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

      2. sqrt-prod 56.7%

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

      3. +-commutative 56.7%

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

      4. fma-define 56.7%

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

   9. Applied egg-rr 56.7%

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

Alternative 5: 84.9% accurate, 0.5× speedup

Math

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

C

assert(x < y && y < z);
double code(double x, double y, double z) {
	double tmp;
	if (y <= 3.3e-288) {
		tmp = 2.0 * sqrt((x * (y + z)));
	} else {
		tmp = 2.0 * (sqrt(z) * sqrt((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 <= 3.3d-288) then
        tmp = 2.0d0 * sqrt((x * (y + z)))
    else
        tmp = 2.0d0 * (sqrt(z) * sqrt((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 <= 3.3e-288) {
		tmp = 2.0 * Math.sqrt((x * (y + z)));
	} else {
		tmp = 2.0 * (Math.sqrt(z) * Math.sqrt((y + x)));
	}
	return tmp;
}

Python

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

Julia

x, y, z = sort([x, y, z])
function code(x, y, z)
	tmp = 0.0
	if (y <= 3.3e-288)
		tmp = Float64(2.0 * sqrt(Float64(x * Float64(y + z))));
	else
		tmp = Float64(2.0 * Float64(sqrt(z) * sqrt(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 <= 3.3e-288)
		tmp = 2.0 * sqrt((x * (y + z)));
	else
		tmp = 2.0 * (sqrt(z) * sqrt((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, 3.3e-288], N[(2.0 * N[Sqrt[N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[(N[Sqrt[z], $MachinePrecision] * N[Sqrt[N[(y + x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 3.29999999999999988e-288

   1. Initial program 68.6%

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

      1. associate-+l+ 68.6%

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

      2. +-commutative 68.6%

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

      3. distribute-rgt-in 68.7%

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

   3. Simplified 68.7%

      \[\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 47.9%

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

   if 3.29999999999999988e-288 < y

   1. Initial program 75.1%

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

      1. associate-+l+ 75.1%

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

      2. +-commutative 75.1%

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

      3. distribute-rgt-in 75.2%

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

   3. Simplified 75.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 inf 43.3%

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

      1. +-commutative 43.3%

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

   7. Simplified 43.3%

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

      1. +-commutative 43.3%

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

      2. *-commutative 43.3%

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

      3. sqrt-prod 50.9%

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

      4. +-commutative 50.9%

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

   9. Applied egg-rr 50.9%

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

4. Final simplification 49.3%

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

Alternative 6: 83.4% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 1.25e14

   1. Initial program 75.5%

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

      1. associate-+l+ 75.5%

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

      2. +-commutative 75.5%

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

      3. distribute-rgt-in 75.6%

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

   3. Simplified 75.6%

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

   if 1.25e14 < y

   1. Initial program 59.2%

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

      1. associate-+l+ 59.2%

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

      2. +-commutative 59.2%

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

      3. distribute-rgt-in 59.3%

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

   3. Simplified 59.3%

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

      1. add-sqr-sqrt 59.0%

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

      2. pow2 59.0%

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

      3. pow1/2 59.0%

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

      4. sqrt-pow1 59.1%

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

      5. distribute-rgt-in 59.0%

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

      6. associate-+r+ 59.0%

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

      7. *-commutative 59.0%

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

      8. distribute-lft-in 59.1%

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

      9. fma-define 59.5%

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

      10. metadata-eval 59.5%

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

   6. Applied egg-rr 59.5%

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

   7. Taylor expanded in x around 0 27.4%

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

      1. *-commutative 27.4%

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

   9. Simplified 27.4%

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

       1. sqrt-prod 54.7%

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

   11. Applied egg-rr 54.7%

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

4. Final simplification 70.6%

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

Alternative 7: 70.1% 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^{-278}:\\ \;\;\;\;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-278) (* 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-278) {
		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-278)) 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-278) {
		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-278:
		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-278)
		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-278)
		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-278], 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.99999999999999938e-279

   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. associate-+l+ 66.3%

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

      2. +-commutative 66.3%

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

      3. distribute-rgt-in 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. Add Preprocessing

   5. Taylor expanded in x around inf 43.2%

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

   if -9.99999999999999938e-279 < y

   1. Initial program 76.6%

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

      1. associate-+l+ 76.6%

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

      2. +-commutative 76.6%

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

      3. distribute-rgt-in 76.6%

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

   3. Simplified 76.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 48.2%

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

      1. +-commutative 48.2%

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

   7. Simplified 48.2%

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

Alternative 8: 69.2% accurate, 1.0× speedup

Math

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

   1. Initial program 68.9%

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

      1. associate-+l+ 68.9%

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

      2. +-commutative 68.9%

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

      3. distribute-rgt-in 68.9%

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

   3. Simplified 68.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 inf 48.2%

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

   if 5.39999999999999979e-281 < y

   1. Initial program 74.9%

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

      1. associate-+l+ 74.9%

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

      2. +-commutative 74.9%

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

      3. distribute-rgt-in 75.0%

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

   3. Simplified 75.0%

      \[\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 21.7%

      \[\leadsto 2 \cdot \color{blue}{\sqrt{y \cdot z}} \]
3. Recombined 2 regimes into one program.
4. 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 71.6%

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

   1. associate-+l+ 71.6%

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

   2. +-commutative 71.6%

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

   3. distribute-rgt-in 71.7%

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

3. Simplified 71.7%

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

5. Final simplification 71.7%

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

Alternative 10: 68.2% accurate, 1.0× speedup

Math

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

   1. Initial program 68.4%

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

      1. associate-+l+ 68.4%

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

      2. +-commutative 68.4%

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

      3. distribute-rgt-in 68.5%

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

   3. Simplified 68.5%

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

   5. Taylor expanded in z around 0 20.2%

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

      1. *-commutative 20.2%

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

   7. Simplified 20.2%

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

   if 3.3999999999999998e-280 < y

   1. Initial program 75.5%

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

      1. associate-+l+ 75.5%

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

      2. +-commutative 75.5%

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

      3. distribute-rgt-in 75.5%

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

   3. Simplified 75.5%

      \[\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 21.8%

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

Alternative 11: 35.6% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 71.6%

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

   1. associate-+l+ 71.6%

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

   2. +-commutative 71.6%

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

   3. distribute-rgt-in 71.7%

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

3. Simplified 71.7%

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

5. Taylor expanded in z around 0 26.6%

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

   1. *-commutative 26.6%

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

7. Simplified 26.6%

   \[\leadsto 2 \cdot \color{blue}{\sqrt{y \cdot x}} \]
8. Add Preprocessing

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

  :alt
  (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)))))