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

Percentage Accurate: 70.5% → 84.2%

Time: 14.3s

Alternatives: 9

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 70.5% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 84.2% accurate, 0.4× speedup

Math

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

C

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if z < 1.1499999999999999e108

   1. Initial program 74.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 74.3%

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

      2. *-commutative 74.3%

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

   4. Applied egg-rr 74.3%

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

   if 1.1499999999999999e108 < z

   1. Initial program 43.4%

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

      1. +-commutative 43.4%

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

      2. *-commutative 43.4%

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

      3. +-commutative 43.4%

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

      4. *-commutative 43.4%

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

      5. associate-+l+ 43.4%

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

      6. *-commutative 43.4%

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

      7. *-commutative 43.4%

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

      8. +-commutative 43.4%

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

      9. fma-define 43.4%

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

      10. +-commutative 43.4%

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

      11. distribute-lft-out 43.8%

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

   3. Simplified 43.8%

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

   5. Taylor expanded in z around inf 43.7%

      \[\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-+r+ 43.7%

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

      2. associate-/l* 44.1%

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

   7. Simplified 44.1%

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

      1. sqrt-prod 95.2%

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

      2. +-commutative 95.2%

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

      3. fma-define 95.2%

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

   9. Applied egg-rr 95.2%

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

       1. fma-undefine 95.2%

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

       2. +-commutative 95.2%

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

       3. associate-+r+ 95.2%

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

       4. +-commutative 95.2%

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

       5. associate-*r/ 81.6%

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

       6. +-commutative 81.6%

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

       7. associate-*r/ 95.2%

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

       8. +-commutative 95.2%

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

       9. fma-define 95.2%

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

   11. Simplified 95.2%

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

4. Final simplification 77.8%

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

Alternative 2: 83.9% accurate, 0.5× speedup

Math

\[\begin{array}{l} [x, y, z] = \mathsf{sort}([x, y, z])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq 1.36 \cdot 10^{-247}:\\ \;\;\;\;2 \cdot \sqrt{x \cdot \left(z + y\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 1.36e-247)
   (* 2.0 (sqrt (* x (+ z y))))
   (* 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 <= 1.36e-247) {
		tmp = 2.0 * sqrt((x * (z + y)));
	} 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 <= 1.36d-247) then
        tmp = 2.0d0 * sqrt((x * (z + y)))
    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 <= 1.36e-247) {
		tmp = 2.0 * Math.sqrt((x * (z + y)));
	} 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 <= 1.36e-247:
		tmp = 2.0 * math.sqrt((x * (z + y)))
	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 <= 1.36e-247)
		tmp = Float64(2.0 * sqrt(Float64(x * Float64(z + y))));
	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 <= 1.36e-247)
		tmp = 2.0 * sqrt((x * (z + y)));
	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, 1.36e-247], N[(2.0 * N[Sqrt[N[(x * N[(z + y), $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 < 1.3599999999999999e-247

   1. Initial program 69.7%

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

      1. associate-+l+ 69.7%

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

      2. *-commutative 69.7%

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

      3. *-commutative 69.7%

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

      4. *-commutative 69.7%

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

      5. +-commutative 69.7%

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

      6. +-commutative 69.7%

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

      7. associate-+l+ 69.7%

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

      8. *-commutative 69.7%

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

      9. *-commutative 69.7%

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

      10. +-commutative 69.7%

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

      11. +-commutative 69.7%

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

      12. *-commutative 69.7%

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

      13. associate-+l+ 69.7%

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

      14. *-commutative 69.7%

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

      15. *-commutative 69.7%

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

      16. +-commutative 69.7%

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

   3. Simplified 69.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 48.8%

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

      1. +-commutative 48.8%

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

   7. Simplified 48.8%

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

   if 1.3599999999999999e-247 < y

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

      3. *-commutative 68.9%

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

      4. *-commutative 68.9%

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

      5. +-commutative 68.9%

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

      6. +-commutative 68.9%

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

      7. associate-+l+ 68.9%

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

      8. *-commutative 68.9%

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

      9. *-commutative 68.9%

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

      10. +-commutative 68.9%

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

      11. +-commutative 68.9%

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

      12. *-commutative 68.9%

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

      13. associate-+l+ 68.9%

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

      14. *-commutative 68.9%

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

      15. *-commutative 68.9%

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

      16. +-commutative 68.9%

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

   3. Simplified 69.0%

      \[\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.9%

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

      1. *-commutative 43.9%

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

      2. sqrt-prod 49.6%

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

      3. +-commutative 49.6%

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

   7. Applied egg-rr 49.6%

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

4. Final simplification 49.2%

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

Alternative 3: 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 3.2 \cdot 10^{+38}:\\ \;\;\;\;2 \cdot \sqrt{x \cdot \left(z + y\right) + z \cdot y}\\ \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 3.2e+38)
   (* 2.0 (sqrt (+ (* x (+ z y)) (* z y))))
   (* 2.0 (* (sqrt z) (sqrt y)))))

C

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

   1. Initial program 74.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 74.3%

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

      2. *-commutative 74.3%

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

   4. Applied egg-rr 74.3%

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

   if 3.19999999999999985e38 < y

   1. Initial program 57.3%

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

      1. associate-+l+ 57.3%

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

      2. *-commutative 57.3%

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

      3. *-commutative 57.3%

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

      4. *-commutative 57.3%

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

      5. +-commutative 57.3%

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

      6. +-commutative 57.3%

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

      7. associate-+l+ 57.3%

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

      8. *-commutative 57.3%

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

      9. *-commutative 57.3%

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

      10. +-commutative 57.3%

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

      11. +-commutative 57.3%

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

      12. *-commutative 57.3%

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

      13. associate-+l+ 57.3%

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

      14. *-commutative 57.3%

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

      15. *-commutative 57.3%

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

      16. +-commutative 57.3%

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

   3. Simplified 57.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 27.5%

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

      1. *-commutative 27.5%

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

      2. sqrt-prod 48.1%

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

      3. +-commutative 48.1%

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

   7. Applied egg-rr 48.1%

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

   8. Taylor expanded in y around inf 43.5%

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

4. Final simplification 65.1%

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

Alternative 4: 70.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

   1. Initial program 69.8%

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

      1. associate-+l+ 69.8%

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

      2. *-commutative 69.8%

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

      3. *-commutative 69.8%

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

      4. *-commutative 69.8%

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

      5. +-commutative 69.8%

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

      6. +-commutative 69.8%

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

      7. associate-+l+ 69.8%

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

      8. *-commutative 69.8%

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

      9. *-commutative 69.8%

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

      10. +-commutative 69.8%

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

      11. +-commutative 69.8%

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

      12. *-commutative 69.8%

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

      13. associate-+l+ 69.8%

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

      14. *-commutative 69.8%

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

      15. *-commutative 69.8%

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

      16. +-commutative 69.8%

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

   3. Simplified 69.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 47.2%

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

      1. +-commutative 47.2%

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

   7. Simplified 47.2%

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

   if -2e-282 < y

   1. Initial program 68.8%

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

      1. associate-+l+ 68.8%

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

      2. *-commutative 68.8%

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

      3. *-commutative 68.8%

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

      4. *-commutative 68.8%

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

      5. +-commutative 68.8%

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

      6. +-commutative 68.8%

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

      7. associate-+l+ 68.8%

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

      8. *-commutative 68.8%

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

      9. *-commutative 68.8%

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

      10. +-commutative 68.8%

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

      11. +-commutative 68.8%

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

      12. *-commutative 68.8%

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

      13. associate-+l+ 68.8%

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

      14. *-commutative 68.8%

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

      15. *-commutative 68.8%

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

      16. +-commutative 68.8%

          \[\leadsto 2 \cdot \sqrt{x \cdot y + \color{blue}{\left(z \cdot y + z \cdot 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 z around inf 45.4%

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

4. Final simplification 46.2%

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

Alternative 5: 68.9% accurate, 1.0× speedup

Math

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

C

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

Python

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

Julia

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

Derivation

1. Split input into 2 regimes

2. if y < 2.94999999999999999e-242

   1. Initial program 69.7%

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

      1. associate-+l+ 69.7%

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

      2. *-commutative 69.7%

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

      3. *-commutative 69.7%

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

      4. *-commutative 69.7%

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

      5. +-commutative 69.7%

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

      6. +-commutative 69.7%

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

      7. associate-+l+ 69.7%

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

      8. *-commutative 69.7%

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

      9. *-commutative 69.7%

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

      10. +-commutative 69.7%

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

      11. +-commutative 69.7%

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

      12. *-commutative 69.7%

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

      13. associate-+l+ 69.7%

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

      14. *-commutative 69.7%

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

      15. *-commutative 69.7%

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

      16. +-commutative 69.7%

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

   3. Simplified 69.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 48.8%

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

      1. +-commutative 48.8%

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

   7. Simplified 48.8%

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

   if 2.94999999999999999e-242 < y

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

      3. *-commutative 68.9%

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

      4. *-commutative 68.9%

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

      5. +-commutative 68.9%

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

      6. +-commutative 68.9%

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

      7. associate-+l+ 68.9%

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

      8. *-commutative 68.9%

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

      9. *-commutative 68.9%

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

      10. +-commutative 68.9%

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

      11. +-commutative 68.9%

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

      12. *-commutative 68.9%

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

      13. associate-+l+ 68.9%

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

      14. *-commutative 68.9%

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

      15. *-commutative 68.9%

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

      16. +-commutative 68.9%

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

   3. Simplified 69.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 28.7%

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

      1. *-commutative 28.7%

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

   7. Simplified 28.7%

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

Alternative 6: 70.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 69.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 69.3%

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

   2. *-commutative 69.3%

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

4. Applied egg-rr 69.3%

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

5. Final simplification 69.3%

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

Alternative 7: 70.5% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 69.2%

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

   1. associate-+l+ 69.2%

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

   2. *-commutative 69.2%

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

   3. *-commutative 69.2%

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

   4. *-commutative 69.2%

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

   5. +-commutative 69.2%

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

   6. +-commutative 69.2%

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

   7. associate-+l+ 69.2%

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

   8. *-commutative 69.2%

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

   9. *-commutative 69.2%

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

   10. +-commutative 69.2%

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

   11. +-commutative 69.2%

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

   12. *-commutative 69.2%

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

   13. associate-+l+ 69.2%

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

   14. *-commutative 69.2%

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

   15. *-commutative 69.2%

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

   16. +-commutative 69.2%

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

3. Simplified 69.3%

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

5. Final simplification 69.3%

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

Alternative 8: 68.5% 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{z \cdot y}\\ \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 (* z y)))))

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((z * 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 <= (-5d-310)) then
        tmp = 2.0d0 * sqrt((y * x))
    else
        tmp = 2.0d0 * sqrt((z * 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 <= -5e-310) {
		tmp = 2.0 * Math.sqrt((y * x));
	} else {
		tmp = 2.0 * Math.sqrt((z * y));
	}
	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((z * y))
	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(z * 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 <= -5e-310)
		tmp = 2.0 * sqrt((y * x));
	else
		tmp = 2.0 * sqrt((z * 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, -5e-310], N[(2.0 * N[Sqrt[N[(y * x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(2.0 * N[Sqrt[N[(z * y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -4.999999999999985e-310

   1. Initial program 69.5%

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

      1. associate-+l+ 69.5%

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

      2. *-commutative 69.5%

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

      3. *-commutative 69.5%

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

      4. *-commutative 69.5%

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

      5. +-commutative 69.5%

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

      6. +-commutative 69.5%

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

      7. associate-+l+ 69.5%

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

      8. *-commutative 69.5%

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

      9. *-commutative 69.5%

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

      10. +-commutative 69.5%

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

      11. +-commutative 69.5%

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

      12. *-commutative 69.5%

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

      13. associate-+l+ 69.5%

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

      14. *-commutative 69.5%

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

      15. *-commutative 69.5%

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

      16. +-commutative 69.5%

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

   3. Simplified 69.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 29.6%

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

   if -4.999999999999985e-310 < y

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

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

      2. *-commutative 69.1%

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

      3. *-commutative 69.1%

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

      4. *-commutative 69.1%

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

      5. +-commutative 69.1%

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

      6. +-commutative 69.1%

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

      7. associate-+l+ 69.1%

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

      8. *-commutative 69.1%

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

      9. *-commutative 69.1%

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

      10. +-commutative 69.1%

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

      11. +-commutative 69.1%

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

      12. *-commutative 69.1%

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

      13. associate-+l+ 69.1%

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

      14. *-commutative 69.1%

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

      15. *-commutative 69.1%

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

      16. +-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 x around 0 27.5%

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

      1. *-commutative 27.5%

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

   7. Simplified 27.5%

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

4. Final simplification 28.5%

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

Alternative 9: 35.8% 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.2%

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

   1. associate-+l+ 69.2%

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

   2. *-commutative 69.2%

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

   3. *-commutative 69.2%

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

   4. *-commutative 69.2%

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

   5. +-commutative 69.2%

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

   6. +-commutative 69.2%

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

   7. associate-+l+ 69.2%

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

   8. *-commutative 69.2%

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

   9. *-commutative 69.2%

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

   10. +-commutative 69.2%

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

   11. +-commutative 69.2%

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

   12. *-commutative 69.2%

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

   13. associate-+l+ 69.2%

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

   14. *-commutative 69.2%

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

   15. *-commutative 69.2%

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

   16. +-commutative 69.2%

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

3. Simplified 69.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 27.1%

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

6. Final simplification 27.1%

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

Developer Target 1: 83.0% 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 2024157 
(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)))))