ABCF->ab-angle angle

Percentage Accurate: 54.6% → 75.8%

Time: 4.2s

Alternatives: 8

Speedup: 2.2×

Specification

Math

\[\begin{array}{l} \\ 180 \cdot \frac{\tan^{-1} \left(\frac{1}{B} \cdot \left(\left(C - A\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)\right)}{\pi} \end{array} \]

FPCore

(FPCore (A B C)
 :precision binary64
 (*
  180.0
  (/
   (atan (* (/ 1.0 B) (- (- C A) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))))
   PI)))

C

double code(double A, double B, double C) {
	return 180.0 * (atan(((1.0 / B) * ((C - A) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / ((double) M_PI));
}

Java

public static double code(double A, double B, double C) {
	return 180.0 * (Math.atan(((1.0 / B) * ((C - A) - Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / Math.PI);
}

Python

def code(A, B, C):
	return 180.0 * (math.atan(((1.0 / B) * ((C - A) - math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / math.pi)

Julia

function code(A, B, C)
	return Float64(180.0 * Float64(atan(Float64(Float64(1.0 / B) * Float64(Float64(C - A) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0)))))) / pi))
end

MATLAB

function tmp = code(A, B, C)
	tmp = 180.0 * (atan(((1.0 / B) * ((C - A) - sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / pi);
end

Wolfram

code[A_, B_, C_] := N[(180.0 * N[(N[ArcTan[N[(N[(1.0 / B), $MachinePrecision] * N[(N[(C - A), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision]

Initial Program: 54.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ 180 \cdot \frac{\tan^{-1} \left(\frac{1}{B} \cdot \left(\left(C - A\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)\right)}{\pi} \end{array} \]

FPCore

(FPCore (A B C)
 :precision binary64
 (*
  180.0
  (/
   (atan (* (/ 1.0 B) (- (- C A) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))))
   PI)))

C

double code(double A, double B, double C) {
	return 180.0 * (atan(((1.0 / B) * ((C - A) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / ((double) M_PI));
}

Java

public static double code(double A, double B, double C) {
	return 180.0 * (Math.atan(((1.0 / B) * ((C - A) - Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / Math.PI);
}

Python

def code(A, B, C):
	return 180.0 * (math.atan(((1.0 / B) * ((C - A) - math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / math.pi)

Julia

function code(A, B, C)
	return Float64(180.0 * Float64(atan(Float64(Float64(1.0 / B) * Float64(Float64(C - A) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0)))))) / pi))
end

MATLAB

function tmp = code(A, B, C)
	tmp = 180.0 * (atan(((1.0 / B) * ((C - A) - sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / pi);
end

Wolfram

code[A_, B_, C_] := N[(180.0 * N[(N[ArcTan[N[(N[(1.0 / B), $MachinePrecision] * N[(N[(C - A), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision]

Alternative 1: 75.8% accurate, 2.2× speedup

Math

\[\begin{array}{l} B\_m = \left|B\right| \\ B\_s = \mathsf{copysign}\left(1, B\right) \\ B\_s \cdot \begin{array}{l} \mathbf{if}\;A \leq -6 \cdot 10^{+38}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(0.5 \cdot \frac{1}{\frac{A}{B\_m}}\right)}{\pi}\\ \mathbf{else}:\\ \;\;\;\;\frac{\tan^{-1} \left(\frac{\left(\left(-B\_m\right) + C\right) - A}{B\_m}\right) \cdot 180}{\pi}\\ \end{array} \end{array} \]

FPCore

B\_m = (fabs.f64 B)
B\_s = (copysign.f64 #s(literal 1 binary64) B)
(FPCore (B_s A B_m C)
 :precision binary64
 (*
  B_s
  (if (<= A -6e+38)
    (* 180.0 (/ (atan (* 0.5 (/ 1.0 (/ A B_m)))) PI))
    (/ (* (atan (/ (- (+ (- B_m) C) A) B_m)) 180.0) PI))))

C

B\_m = fabs(B);
B\_s = copysign(1.0, B);
double code(double B_s, double A, double B_m, double C) {
	double tmp;
	if (A <= -6e+38) {
		tmp = 180.0 * (atan((0.5 * (1.0 / (A / B_m)))) / ((double) M_PI));
	} else {
		tmp = (atan((((-B_m + C) - A) / B_m)) * 180.0) / ((double) M_PI);
	}
	return B_s * tmp;
}

Java

B\_m = Math.abs(B);
B\_s = Math.copySign(1.0, B);
public static double code(double B_s, double A, double B_m, double C) {
	double tmp;
	if (A <= -6e+38) {
		tmp = 180.0 * (Math.atan((0.5 * (1.0 / (A / B_m)))) / Math.PI);
	} else {
		tmp = (Math.atan((((-B_m + C) - A) / B_m)) * 180.0) / Math.PI;
	}
	return B_s * tmp;
}

Python

B\_m = math.fabs(B)
B\_s = math.copysign(1.0, B)
def code(B_s, A, B_m, C):
	tmp = 0
	if A <= -6e+38:
		tmp = 180.0 * (math.atan((0.5 * (1.0 / (A / B_m)))) / math.pi)
	else:
		tmp = (math.atan((((-B_m + C) - A) / B_m)) * 180.0) / math.pi
	return B_s * tmp

Julia

B\_m = abs(B)
B\_s = copysign(1.0, B)
function code(B_s, A, B_m, C)
	tmp = 0.0
	if (A <= -6e+38)
		tmp = Float64(180.0 * Float64(atan(Float64(0.5 * Float64(1.0 / Float64(A / B_m)))) / pi));
	else
		tmp = Float64(Float64(atan(Float64(Float64(Float64(Float64(-B_m) + C) - A) / B_m)) * 180.0) / pi);
	end
	return Float64(B_s * tmp)
end

MATLAB

B\_m = abs(B);
B\_s = sign(B) * abs(1.0);
function tmp_2 = code(B_s, A, B_m, C)
	tmp = 0.0;
	if (A <= -6e+38)
		tmp = 180.0 * (atan((0.5 * (1.0 / (A / B_m)))) / pi);
	else
		tmp = (atan((((-B_m + C) - A) / B_m)) * 180.0) / pi;
	end
	tmp_2 = B_s * tmp;
end

Wolfram

B\_m = N[Abs[B], $MachinePrecision]
B\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[B]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[B$95$s_, A_, B$95$m_, C_] := N[(B$95$s * If[LessEqual[A, -6e+38], N[(180.0 * N[(N[ArcTan[N[(0.5 * N[(1.0 / N[(A / B$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision], N[(N[(N[ArcTan[N[(N[(N[((-B$95$m) + C), $MachinePrecision] - A), $MachinePrecision] / B$95$m), $MachinePrecision]], $MachinePrecision] * 180.0), $MachinePrecision] / Pi), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if A < -6.0000000000000002e38

   1. Initial program 54.6%

      \[180 \cdot \frac{\tan^{-1} \left(\frac{1}{B} \cdot \left(\left(C - A\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)\right)}{\pi} \]

   2. Taylor expanded in A around -inf

      \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{\left(\frac{1}{2} \cdot \frac{B}{A}\right)}}{\pi} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{1}{2} \cdot \color{blue}{\frac{B}{A}}\right)}{\pi} \]

      2. lower-/.f64 26.5

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(0.5 \cdot \frac{B}{\color{blue}{A}}\right)}{\pi} \]

   4. Applied rewrites 26.5%

      \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{\left(0.5 \cdot \frac{B}{A}\right)}}{\pi} \]
   5. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{1}{2} \cdot \frac{B}{\color{blue}{A}}\right)}{\pi} \]

      2. div-flip N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{1}{2} \cdot \frac{1}{\color{blue}{\frac{A}{B}}}\right)}{\pi} \]

      3. lower-/.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{1}{2} \cdot \frac{1}{\color{blue}{\frac{A}{B}}}\right)}{\pi} \]

      4. lower-/.f64 26.4

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(0.5 \cdot \frac{1}{\frac{A}{\color{blue}{B}}}\right)}{\pi} \]

   6. Applied rewrites 26.4%

      \[\leadsto 180 \cdot \frac{\tan^{-1} \left(0.5 \cdot \frac{1}{\color{blue}{\frac{A}{B}}}\right)}{\pi} \]

   if -6.0000000000000002e38 < A

   1. Initial program 54.6%

      \[180 \cdot \frac{\tan^{-1} \left(\frac{1}{B} \cdot \left(\left(C - A\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)\right)}{\pi} \]

   2. Taylor expanded in B around inf

      \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{\left(\frac{C}{B} - \left(1 + \frac{A}{B}\right)\right)}}{\pi} \]
   3. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - \color{blue}{\left(1 + \frac{A}{B}\right)}\right)}{\pi} \]

      2. lower-/.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - \left(\color{blue}{1} + \frac{A}{B}\right)\right)}{\pi} \]

      3. lower-+.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - \left(1 + \color{blue}{\frac{A}{B}}\right)\right)}{\pi} \]

      4. lower-/.f64 65.6

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - \left(1 + \frac{A}{\color{blue}{B}}\right)\right)}{\pi} \]

   4. Applied rewrites 65.6%

      \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{\left(\frac{C}{B} - \left(1 + \frac{A}{B}\right)\right)}}{\pi} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \color{blue}{180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - \left(1 + \frac{A}{B}\right)\right)}{\pi}} \]

      2. lift-/.f64 N/A

         \[\leadsto 180 \cdot \color{blue}{\frac{\tan^{-1} \left(\frac{C}{B} - \left(1 + \frac{A}{B}\right)\right)}{\pi}} \]

      3. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{180 \cdot \tan^{-1} \left(\frac{C}{B} - \left(1 + \frac{A}{B}\right)\right)}{\pi}} \]

      4. lift-PI.f64 N/A

         \[\leadsto \frac{180 \cdot \tan^{-1} \left(\frac{C}{B} - \left(1 + \frac{A}{B}\right)\right)}{\color{blue}{\mathsf{PI}\left(\right)}} \]

      5. add-sqr-sqrt N/A

         \[\leadsto \frac{180 \cdot \tan^{-1} \left(\frac{C}{B} - \left(1 + \frac{A}{B}\right)\right)}{\color{blue}{\sqrt{\mathsf{PI}\left(\right)} \cdot \sqrt{\mathsf{PI}\left(\right)}}} \]

      6. associate-/r* N/A

         \[\leadsto \color{blue}{\frac{\frac{180 \cdot \tan^{-1} \left(\frac{C}{B} - \left(1 + \frac{A}{B}\right)\right)}{\sqrt{\mathsf{PI}\left(\right)}}}{\sqrt{\mathsf{PI}\left(\right)}}} \]

      7. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\frac{180 \cdot \tan^{-1} \left(\frac{C}{B} - \left(1 + \frac{A}{B}\right)\right)}{\sqrt{\mathsf{PI}\left(\right)}}}{\sqrt{\mathsf{PI}\left(\right)}}} \]

   6. Applied rewrites 65.7%

      \[\leadsto \color{blue}{\frac{\frac{\tan^{-1} \left(\frac{C - A}{B} - 1\right) \cdot 180}{\sqrt{\pi}}}{\sqrt{\pi}}} \]

   7. Taylor expanded in B around 0

      \[\leadsto \frac{\frac{\tan^{-1} \left(\frac{\left(C + -1 \cdot B\right) - A}{\color{blue}{B}}\right) \cdot 180}{\sqrt{\pi}}}{\sqrt{\pi}} \]
   8. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \frac{\frac{\tan^{-1} \left(\frac{\left(C + -1 \cdot B\right) - A}{B}\right) \cdot 180}{\sqrt{\pi}}}{\sqrt{\pi}} \]

      2. lower--.f64 N/A

         \[\leadsto \frac{\frac{\tan^{-1} \left(\frac{\left(C + -1 \cdot B\right) - A}{B}\right) \cdot 180}{\sqrt{\pi}}}{\sqrt{\pi}} \]

      3. lower-+.f64 N/A

         \[\leadsto \frac{\frac{\tan^{-1} \left(\frac{\left(C + -1 \cdot B\right) - A}{B}\right) \cdot 180}{\sqrt{\pi}}}{\sqrt{\pi}} \]

      4. lower-*.f64 65.7

         \[\leadsto \frac{\frac{\tan^{-1} \left(\frac{\left(C + -1 \cdot B\right) - A}{B}\right) \cdot 180}{\sqrt{\pi}}}{\sqrt{\pi}} \]

   9. Applied rewrites 65.7%

      \[\leadsto \frac{\frac{\tan^{-1} \left(\frac{\left(C + -1 \cdot B\right) - A}{\color{blue}{B}}\right) \cdot 180}{\sqrt{\pi}}}{\sqrt{\pi}} \]
   10. Step-by-step derivation

       1. lift-/.f64 N/A

          \[\leadsto \color{blue}{\frac{\frac{\tan^{-1} \left(\frac{\left(C + -1 \cdot B\right) - A}{B}\right) \cdot 180}{\sqrt{\pi}}}{\sqrt{\pi}}} \]

       2. lift-/.f64 N/A

          \[\leadsto \frac{\color{blue}{\frac{\tan^{-1} \left(\frac{\left(C + -1 \cdot B\right) - A}{B}\right) \cdot 180}{\sqrt{\pi}}}}{\sqrt{\pi}} \]

       3. associate-/l/ N/A

          \[\leadsto \color{blue}{\frac{\tan^{-1} \left(\frac{\left(C + -1 \cdot B\right) - A}{B}\right) \cdot 180}{\sqrt{\pi} \cdot \sqrt{\pi}}} \]

       4. lift-sqrt.f64 N/A

          \[\leadsto \frac{\tan^{-1} \left(\frac{\left(C + -1 \cdot B\right) - A}{B}\right) \cdot 180}{\color{blue}{\sqrt{\pi}} \cdot \sqrt{\pi}} \]

       5. lift-PI.f64 N/A

          \[\leadsto \frac{\tan^{-1} \left(\frac{\left(C + -1 \cdot B\right) - A}{B}\right) \cdot 180}{\sqrt{\color{blue}{\mathsf{PI}\left(\right)}} \cdot \sqrt{\pi}} \]

       6. lift-sqrt.f64 N/A

          \[\leadsto \frac{\tan^{-1} \left(\frac{\left(C + -1 \cdot B\right) - A}{B}\right) \cdot 180}{\sqrt{\mathsf{PI}\left(\right)} \cdot \color{blue}{\sqrt{\pi}}} \]

       7. lift-PI.f64 N/A

          \[\leadsto \frac{\tan^{-1} \left(\frac{\left(C + -1 \cdot B\right) - A}{B}\right) \cdot 180}{\sqrt{\mathsf{PI}\left(\right)} \cdot \sqrt{\color{blue}{\mathsf{PI}\left(\right)}}} \]

       8. add-sqr-sqrt N/A

          \[\leadsto \frac{\tan^{-1} \left(\frac{\left(C + -1 \cdot B\right) - A}{B}\right) \cdot 180}{\color{blue}{\mathsf{PI}\left(\right)}} \]

       9. lift-PI.f64 N/A

          \[\leadsto \frac{\tan^{-1} \left(\frac{\left(C + -1 \cdot B\right) - A}{B}\right) \cdot 180}{\color{blue}{\pi}} \]

   11. Applied rewrites 66.7%

       \[\leadsto \color{blue}{\frac{\tan^{-1} \left(\frac{\left(\left(-B\right) + C\right) - A}{B}\right) \cdot 180}{\pi}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 75.6% accurate, 2.2× speedup

Math

\[\begin{array}{l} B\_m = \left|B\right| \\ B\_s = \mathsf{copysign}\left(1, B\right) \\ B\_s \cdot \begin{array}{l} \mathbf{if}\;A \leq -6 \cdot 10^{+38}:\\ \;\;\;\;\frac{180 \cdot \tan^{-1} \left(\frac{B\_m}{A} \cdot 0.5\right)}{\pi}\\ \mathbf{else}:\\ \;\;\;\;\frac{\tan^{-1} \left(\frac{\left(\left(-B\_m\right) + C\right) - A}{B\_m}\right) \cdot 180}{\pi}\\ \end{array} \end{array} \]

FPCore

B\_m = (fabs.f64 B)
B\_s = (copysign.f64 #s(literal 1 binary64) B)
(FPCore (B_s A B_m C)
 :precision binary64
 (*
  B_s
  (if (<= A -6e+38)
    (/ (* 180.0 (atan (* (/ B_m A) 0.5))) PI)
    (/ (* (atan (/ (- (+ (- B_m) C) A) B_m)) 180.0) PI))))

C

B\_m = fabs(B);
B\_s = copysign(1.0, B);
double code(double B_s, double A, double B_m, double C) {
	double tmp;
	if (A <= -6e+38) {
		tmp = (180.0 * atan(((B_m / A) * 0.5))) / ((double) M_PI);
	} else {
		tmp = (atan((((-B_m + C) - A) / B_m)) * 180.0) / ((double) M_PI);
	}
	return B_s * tmp;
}

Java

B\_m = Math.abs(B);
B\_s = Math.copySign(1.0, B);
public static double code(double B_s, double A, double B_m, double C) {
	double tmp;
	if (A <= -6e+38) {
		tmp = (180.0 * Math.atan(((B_m / A) * 0.5))) / Math.PI;
	} else {
		tmp = (Math.atan((((-B_m + C) - A) / B_m)) * 180.0) / Math.PI;
	}
	return B_s * tmp;
}

Python

B\_m = math.fabs(B)
B\_s = math.copysign(1.0, B)
def code(B_s, A, B_m, C):
	tmp = 0
	if A <= -6e+38:
		tmp = (180.0 * math.atan(((B_m / A) * 0.5))) / math.pi
	else:
		tmp = (math.atan((((-B_m + C) - A) / B_m)) * 180.0) / math.pi
	return B_s * tmp

Julia

B\_m = abs(B)
B\_s = copysign(1.0, B)
function code(B_s, A, B_m, C)
	tmp = 0.0
	if (A <= -6e+38)
		tmp = Float64(Float64(180.0 * atan(Float64(Float64(B_m / A) * 0.5))) / pi);
	else
		tmp = Float64(Float64(atan(Float64(Float64(Float64(Float64(-B_m) + C) - A) / B_m)) * 180.0) / pi);
	end
	return Float64(B_s * tmp)
end

MATLAB

B\_m = abs(B);
B\_s = sign(B) * abs(1.0);
function tmp_2 = code(B_s, A, B_m, C)
	tmp = 0.0;
	if (A <= -6e+38)
		tmp = (180.0 * atan(((B_m / A) * 0.5))) / pi;
	else
		tmp = (atan((((-B_m + C) - A) / B_m)) * 180.0) / pi;
	end
	tmp_2 = B_s * tmp;
end

Wolfram

B\_m = N[Abs[B], $MachinePrecision]
B\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[B]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[B$95$s_, A_, B$95$m_, C_] := N[(B$95$s * If[LessEqual[A, -6e+38], N[(N[(180.0 * N[ArcTan[N[(N[(B$95$m / A), $MachinePrecision] * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / Pi), $MachinePrecision], N[(N[(N[ArcTan[N[(N[(N[((-B$95$m) + C), $MachinePrecision] - A), $MachinePrecision] / B$95$m), $MachinePrecision]], $MachinePrecision] * 180.0), $MachinePrecision] / Pi), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if A < -6.0000000000000002e38

   1. Initial program 54.6%

      \[180 \cdot \frac{\tan^{-1} \left(\frac{1}{B} \cdot \left(\left(C - A\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)\right)}{\pi} \]

   2. Taylor expanded in A around -inf

      \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{\left(\frac{1}{2} \cdot \frac{B}{A}\right)}}{\pi} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{1}{2} \cdot \color{blue}{\frac{B}{A}}\right)}{\pi} \]

      2. lower-/.f64 26.5

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(0.5 \cdot \frac{B}{\color{blue}{A}}\right)}{\pi} \]

   4. Applied rewrites 26.5%

      \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{\left(0.5 \cdot \frac{B}{A}\right)}}{\pi} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \color{blue}{180 \cdot \frac{\tan^{-1} \left(\frac{1}{2} \cdot \frac{B}{A}\right)}{\pi}} \]

      2. lift-/.f64 N/A

         \[\leadsto 180 \cdot \color{blue}{\frac{\tan^{-1} \left(\frac{1}{2} \cdot \frac{B}{A}\right)}{\pi}} \]

      3. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{180 \cdot \tan^{-1} \left(\frac{1}{2} \cdot \frac{B}{A}\right)}{\pi}} \]

      4. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{180 \cdot \tan^{-1} \left(\frac{1}{2} \cdot \frac{B}{A}\right)}{\pi}} \]

      5. lower-*.f64 26.5

         \[\leadsto \frac{\color{blue}{180 \cdot \tan^{-1} \left(0.5 \cdot \frac{B}{A}\right)}}{\pi} \]

      6. lift-*.f64 N/A

         \[\leadsto \frac{180 \cdot \tan^{-1} \left(\frac{1}{2} \cdot \color{blue}{\frac{B}{A}}\right)}{\pi} \]

      7. *-commutative N/A

         \[\leadsto \frac{180 \cdot \tan^{-1} \left(\frac{B}{A} \cdot \color{blue}{\frac{1}{2}}\right)}{\pi} \]

      8. lower-*.f64 26.5

         \[\leadsto \frac{180 \cdot \tan^{-1} \left(\frac{B}{A} \cdot \color{blue}{0.5}\right)}{\pi} \]

   6. Applied rewrites 26.5%

      \[\leadsto \color{blue}{\frac{180 \cdot \tan^{-1} \left(\frac{B}{A} \cdot 0.5\right)}{\pi}} \]

   if -6.0000000000000002e38 < A

   1. Initial program 54.6%

      \[180 \cdot \frac{\tan^{-1} \left(\frac{1}{B} \cdot \left(\left(C - A\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)\right)}{\pi} \]

   2. Taylor expanded in B around inf

      \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{\left(\frac{C}{B} - \left(1 + \frac{A}{B}\right)\right)}}{\pi} \]
   3. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - \color{blue}{\left(1 + \frac{A}{B}\right)}\right)}{\pi} \]

      2. lower-/.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - \left(\color{blue}{1} + \frac{A}{B}\right)\right)}{\pi} \]

      3. lower-+.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - \left(1 + \color{blue}{\frac{A}{B}}\right)\right)}{\pi} \]

      4. lower-/.f64 65.6

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - \left(1 + \frac{A}{\color{blue}{B}}\right)\right)}{\pi} \]

   4. Applied rewrites 65.6%

      \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{\left(\frac{C}{B} - \left(1 + \frac{A}{B}\right)\right)}}{\pi} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \color{blue}{180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - \left(1 + \frac{A}{B}\right)\right)}{\pi}} \]

      2. lift-/.f64 N/A

         \[\leadsto 180 \cdot \color{blue}{\frac{\tan^{-1} \left(\frac{C}{B} - \left(1 + \frac{A}{B}\right)\right)}{\pi}} \]

      3. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{180 \cdot \tan^{-1} \left(\frac{C}{B} - \left(1 + \frac{A}{B}\right)\right)}{\pi}} \]

      4. lift-PI.f64 N/A

         \[\leadsto \frac{180 \cdot \tan^{-1} \left(\frac{C}{B} - \left(1 + \frac{A}{B}\right)\right)}{\color{blue}{\mathsf{PI}\left(\right)}} \]

      5. add-sqr-sqrt N/A

         \[\leadsto \frac{180 \cdot \tan^{-1} \left(\frac{C}{B} - \left(1 + \frac{A}{B}\right)\right)}{\color{blue}{\sqrt{\mathsf{PI}\left(\right)} \cdot \sqrt{\mathsf{PI}\left(\right)}}} \]

      6. associate-/r* N/A

         \[\leadsto \color{blue}{\frac{\frac{180 \cdot \tan^{-1} \left(\frac{C}{B} - \left(1 + \frac{A}{B}\right)\right)}{\sqrt{\mathsf{PI}\left(\right)}}}{\sqrt{\mathsf{PI}\left(\right)}}} \]

      7. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\frac{180 \cdot \tan^{-1} \left(\frac{C}{B} - \left(1 + \frac{A}{B}\right)\right)}{\sqrt{\mathsf{PI}\left(\right)}}}{\sqrt{\mathsf{PI}\left(\right)}}} \]

   6. Applied rewrites 65.7%

      \[\leadsto \color{blue}{\frac{\frac{\tan^{-1} \left(\frac{C - A}{B} - 1\right) \cdot 180}{\sqrt{\pi}}}{\sqrt{\pi}}} \]

   7. Taylor expanded in B around 0

      \[\leadsto \frac{\frac{\tan^{-1} \left(\frac{\left(C + -1 \cdot B\right) - A}{\color{blue}{B}}\right) \cdot 180}{\sqrt{\pi}}}{\sqrt{\pi}} \]
   8. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \frac{\frac{\tan^{-1} \left(\frac{\left(C + -1 \cdot B\right) - A}{B}\right) \cdot 180}{\sqrt{\pi}}}{\sqrt{\pi}} \]

      2. lower--.f64 N/A

         \[\leadsto \frac{\frac{\tan^{-1} \left(\frac{\left(C + -1 \cdot B\right) - A}{B}\right) \cdot 180}{\sqrt{\pi}}}{\sqrt{\pi}} \]

      3. lower-+.f64 N/A

         \[\leadsto \frac{\frac{\tan^{-1} \left(\frac{\left(C + -1 \cdot B\right) - A}{B}\right) \cdot 180}{\sqrt{\pi}}}{\sqrt{\pi}} \]

      4. lower-*.f64 65.7

         \[\leadsto \frac{\frac{\tan^{-1} \left(\frac{\left(C + -1 \cdot B\right) - A}{B}\right) \cdot 180}{\sqrt{\pi}}}{\sqrt{\pi}} \]

   9. Applied rewrites 65.7%

      \[\leadsto \frac{\frac{\tan^{-1} \left(\frac{\left(C + -1 \cdot B\right) - A}{\color{blue}{B}}\right) \cdot 180}{\sqrt{\pi}}}{\sqrt{\pi}} \]
   10. Step-by-step derivation

       1. lift-/.f64 N/A

          \[\leadsto \color{blue}{\frac{\frac{\tan^{-1} \left(\frac{\left(C + -1 \cdot B\right) - A}{B}\right) \cdot 180}{\sqrt{\pi}}}{\sqrt{\pi}}} \]

       2. lift-/.f64 N/A

          \[\leadsto \frac{\color{blue}{\frac{\tan^{-1} \left(\frac{\left(C + -1 \cdot B\right) - A}{B}\right) \cdot 180}{\sqrt{\pi}}}}{\sqrt{\pi}} \]

       3. associate-/l/ N/A

          \[\leadsto \color{blue}{\frac{\tan^{-1} \left(\frac{\left(C + -1 \cdot B\right) - A}{B}\right) \cdot 180}{\sqrt{\pi} \cdot \sqrt{\pi}}} \]

       4. lift-sqrt.f64 N/A

          \[\leadsto \frac{\tan^{-1} \left(\frac{\left(C + -1 \cdot B\right) - A}{B}\right) \cdot 180}{\color{blue}{\sqrt{\pi}} \cdot \sqrt{\pi}} \]

       5. lift-PI.f64 N/A

          \[\leadsto \frac{\tan^{-1} \left(\frac{\left(C + -1 \cdot B\right) - A}{B}\right) \cdot 180}{\sqrt{\color{blue}{\mathsf{PI}\left(\right)}} \cdot \sqrt{\pi}} \]

       6. lift-sqrt.f64 N/A

          \[\leadsto \frac{\tan^{-1} \left(\frac{\left(C + -1 \cdot B\right) - A}{B}\right) \cdot 180}{\sqrt{\mathsf{PI}\left(\right)} \cdot \color{blue}{\sqrt{\pi}}} \]

       7. lift-PI.f64 N/A

          \[\leadsto \frac{\tan^{-1} \left(\frac{\left(C + -1 \cdot B\right) - A}{B}\right) \cdot 180}{\sqrt{\mathsf{PI}\left(\right)} \cdot \sqrt{\color{blue}{\mathsf{PI}\left(\right)}}} \]

       8. add-sqr-sqrt N/A

          \[\leadsto \frac{\tan^{-1} \left(\frac{\left(C + -1 \cdot B\right) - A}{B}\right) \cdot 180}{\color{blue}{\mathsf{PI}\left(\right)}} \]

       9. lift-PI.f64 N/A

          \[\leadsto \frac{\tan^{-1} \left(\frac{\left(C + -1 \cdot B\right) - A}{B}\right) \cdot 180}{\color{blue}{\pi}} \]

   11. Applied rewrites 66.7%

       \[\leadsto \color{blue}{\frac{\tan^{-1} \left(\frac{\left(\left(-B\right) + C\right) - A}{B}\right) \cdot 180}{\pi}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 70.3% accurate, 2.2× speedup

Math

\[\begin{array}{l} B\_m = \left|B\right| \\ B\_s = \mathsf{copysign}\left(1, B\right) \\ B\_s \cdot \begin{array}{l} \mathbf{if}\;A \leq -6 \cdot 10^{+38}:\\ \;\;\;\;\frac{180 \cdot \tan^{-1} \left(\frac{B\_m}{A} \cdot 0.5\right)}{\pi}\\ \mathbf{elif}\;A \leq 2.1 \cdot 10^{+110}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(\frac{C}{B\_m} - 1\right)}{\pi}\\ \mathbf{else}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(\frac{C - A}{B\_m}\right)}{\pi}\\ \end{array} \end{array} \]

FPCore

B\_m = (fabs.f64 B)
B\_s = (copysign.f64 #s(literal 1 binary64) B)
(FPCore (B_s A B_m C)
 :precision binary64
 (*
  B_s
  (if (<= A -6e+38)
    (/ (* 180.0 (atan (* (/ B_m A) 0.5))) PI)
    (if (<= A 2.1e+110)
      (* 180.0 (/ (atan (- (/ C B_m) 1.0)) PI))
      (* 180.0 (/ (atan (/ (- C A) B_m)) PI))))))

C

B\_m = fabs(B);
B\_s = copysign(1.0, B);
double code(double B_s, double A, double B_m, double C) {
	double tmp;
	if (A <= -6e+38) {
		tmp = (180.0 * atan(((B_m / A) * 0.5))) / ((double) M_PI);
	} else if (A <= 2.1e+110) {
		tmp = 180.0 * (atan(((C / B_m) - 1.0)) / ((double) M_PI));
	} else {
		tmp = 180.0 * (atan(((C - A) / B_m)) / ((double) M_PI));
	}
	return B_s * tmp;
}

Java

B\_m = Math.abs(B);
B\_s = Math.copySign(1.0, B);
public static double code(double B_s, double A, double B_m, double C) {
	double tmp;
	if (A <= -6e+38) {
		tmp = (180.0 * Math.atan(((B_m / A) * 0.5))) / Math.PI;
	} else if (A <= 2.1e+110) {
		tmp = 180.0 * (Math.atan(((C / B_m) - 1.0)) / Math.PI);
	} else {
		tmp = 180.0 * (Math.atan(((C - A) / B_m)) / Math.PI);
	}
	return B_s * tmp;
}

Python

B\_m = math.fabs(B)
B\_s = math.copysign(1.0, B)
def code(B_s, A, B_m, C):
	tmp = 0
	if A <= -6e+38:
		tmp = (180.0 * math.atan(((B_m / A) * 0.5))) / math.pi
	elif A <= 2.1e+110:
		tmp = 180.0 * (math.atan(((C / B_m) - 1.0)) / math.pi)
	else:
		tmp = 180.0 * (math.atan(((C - A) / B_m)) / math.pi)
	return B_s * tmp

Julia

B\_m = abs(B)
B\_s = copysign(1.0, B)
function code(B_s, A, B_m, C)
	tmp = 0.0
	if (A <= -6e+38)
		tmp = Float64(Float64(180.0 * atan(Float64(Float64(B_m / A) * 0.5))) / pi);
	elseif (A <= 2.1e+110)
		tmp = Float64(180.0 * Float64(atan(Float64(Float64(C / B_m) - 1.0)) / pi));
	else
		tmp = Float64(180.0 * Float64(atan(Float64(Float64(C - A) / B_m)) / pi));
	end
	return Float64(B_s * tmp)
end

MATLAB

B\_m = abs(B);
B\_s = sign(B) * abs(1.0);
function tmp_2 = code(B_s, A, B_m, C)
	tmp = 0.0;
	if (A <= -6e+38)
		tmp = (180.0 * atan(((B_m / A) * 0.5))) / pi;
	elseif (A <= 2.1e+110)
		tmp = 180.0 * (atan(((C / B_m) - 1.0)) / pi);
	else
		tmp = 180.0 * (atan(((C - A) / B_m)) / pi);
	end
	tmp_2 = B_s * tmp;
end

Wolfram

B\_m = N[Abs[B], $MachinePrecision]
B\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[B]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[B$95$s_, A_, B$95$m_, C_] := N[(B$95$s * If[LessEqual[A, -6e+38], N[(N[(180.0 * N[ArcTan[N[(N[(B$95$m / A), $MachinePrecision] * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / Pi), $MachinePrecision], If[LessEqual[A, 2.1e+110], N[(180.0 * N[(N[ArcTan[N[(N[(C / B$95$m), $MachinePrecision] - 1.0), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision], N[(180.0 * N[(N[ArcTan[N[(N[(C - A), $MachinePrecision] / B$95$m), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if A < -6.0000000000000002e38

   1. Initial program 54.6%

      \[180 \cdot \frac{\tan^{-1} \left(\frac{1}{B} \cdot \left(\left(C - A\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)\right)}{\pi} \]

   2. Taylor expanded in A around -inf

      \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{\left(\frac{1}{2} \cdot \frac{B}{A}\right)}}{\pi} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{1}{2} \cdot \color{blue}{\frac{B}{A}}\right)}{\pi} \]

      2. lower-/.f64 26.5

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(0.5 \cdot \frac{B}{\color{blue}{A}}\right)}{\pi} \]

   4. Applied rewrites 26.5%

      \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{\left(0.5 \cdot \frac{B}{A}\right)}}{\pi} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \color{blue}{180 \cdot \frac{\tan^{-1} \left(\frac{1}{2} \cdot \frac{B}{A}\right)}{\pi}} \]

      2. lift-/.f64 N/A

         \[\leadsto 180 \cdot \color{blue}{\frac{\tan^{-1} \left(\frac{1}{2} \cdot \frac{B}{A}\right)}{\pi}} \]

      3. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{180 \cdot \tan^{-1} \left(\frac{1}{2} \cdot \frac{B}{A}\right)}{\pi}} \]

      4. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{180 \cdot \tan^{-1} \left(\frac{1}{2} \cdot \frac{B}{A}\right)}{\pi}} \]

      5. lower-*.f64 26.5

         \[\leadsto \frac{\color{blue}{180 \cdot \tan^{-1} \left(0.5 \cdot \frac{B}{A}\right)}}{\pi} \]

      6. lift-*.f64 N/A

         \[\leadsto \frac{180 \cdot \tan^{-1} \left(\frac{1}{2} \cdot \color{blue}{\frac{B}{A}}\right)}{\pi} \]

      7. *-commutative N/A

         \[\leadsto \frac{180 \cdot \tan^{-1} \left(\frac{B}{A} \cdot \color{blue}{\frac{1}{2}}\right)}{\pi} \]

      8. lower-*.f64 26.5

         \[\leadsto \frac{180 \cdot \tan^{-1} \left(\frac{B}{A} \cdot \color{blue}{0.5}\right)}{\pi} \]

   6. Applied rewrites 26.5%

      \[\leadsto \color{blue}{\frac{180 \cdot \tan^{-1} \left(\frac{B}{A} \cdot 0.5\right)}{\pi}} \]

   if -6.0000000000000002e38 < A < 2.10000000000000015e110

   1. Initial program 54.6%

      \[180 \cdot \frac{\tan^{-1} \left(\frac{1}{B} \cdot \left(\left(C - A\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)\right)}{\pi} \]

   2. Taylor expanded in B around inf

      \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{\left(\frac{C}{B} - \left(1 + \frac{A}{B}\right)\right)}}{\pi} \]
   3. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - \color{blue}{\left(1 + \frac{A}{B}\right)}\right)}{\pi} \]

      2. lower-/.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - \left(\color{blue}{1} + \frac{A}{B}\right)\right)}{\pi} \]

      3. lower-+.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - \left(1 + \color{blue}{\frac{A}{B}}\right)\right)}{\pi} \]

      4. lower-/.f64 65.6

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - \left(1 + \frac{A}{\color{blue}{B}}\right)\right)}{\pi} \]

   4. Applied rewrites 65.6%

      \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{\left(\frac{C}{B} - \left(1 + \frac{A}{B}\right)\right)}}{\pi} \]

   5. Taylor expanded in A around 0

      \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - 1\right)}{\pi} \]
   6. Step-by-step derivation

   7. Applied rewrites 56.1%

      \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - 1\right)}{\pi} \]

   if 2.10000000000000015e110 < A

   1. Initial program 54.6%

      \[180 \cdot \frac{\tan^{-1} \left(\frac{1}{B} \cdot \left(\left(C - A\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)\right)}{\pi} \]

   2. Taylor expanded in B around inf

      \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{\left(\frac{C}{B} - \left(1 + \frac{A}{B}\right)\right)}}{\pi} \]
   3. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - \color{blue}{\left(1 + \frac{A}{B}\right)}\right)}{\pi} \]

      2. lower-/.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - \left(\color{blue}{1} + \frac{A}{B}\right)\right)}{\pi} \]

      3. lower-+.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - \left(1 + \color{blue}{\frac{A}{B}}\right)\right)}{\pi} \]

      4. lower-/.f64 65.6

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - \left(1 + \frac{A}{\color{blue}{B}}\right)\right)}{\pi} \]

   4. Applied rewrites 65.6%

      \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{\left(\frac{C}{B} - \left(1 + \frac{A}{B}\right)\right)}}{\pi} \]

   5. Taylor expanded in B around 0

      \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C - A}{\color{blue}{B}}\right)}{\pi} \]
   6. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C - A}{B}\right)}{\pi} \]

      2. lower--.f64 35.6

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C - A}{B}\right)}{\pi} \]

   7. Applied rewrites 35.6%

      \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C - A}{\color{blue}{B}}\right)}{\pi} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 4: 70.3% accurate, 2.2× speedup

Math

\[\begin{array}{l} B\_m = \left|B\right| \\ B\_s = \mathsf{copysign}\left(1, B\right) \\ B\_s \cdot \begin{array}{l} \mathbf{if}\;A \leq -6 \cdot 10^{+38}:\\ \;\;\;\;\frac{\tan^{-1} \left(\frac{B\_m}{A} \cdot 0.5\right)}{\pi} \cdot 180\\ \mathbf{elif}\;A \leq 2.1 \cdot 10^{+110}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(\frac{C}{B\_m} - 1\right)}{\pi}\\ \mathbf{else}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(\frac{C - A}{B\_m}\right)}{\pi}\\ \end{array} \end{array} \]

FPCore

B\_m = (fabs.f64 B)
B\_s = (copysign.f64 #s(literal 1 binary64) B)
(FPCore (B_s A B_m C)
 :precision binary64
 (*
  B_s
  (if (<= A -6e+38)
    (* (/ (atan (* (/ B_m A) 0.5)) PI) 180.0)
    (if (<= A 2.1e+110)
      (* 180.0 (/ (atan (- (/ C B_m) 1.0)) PI))
      (* 180.0 (/ (atan (/ (- C A) B_m)) PI))))))

C

B\_m = fabs(B);
B\_s = copysign(1.0, B);
double code(double B_s, double A, double B_m, double C) {
	double tmp;
	if (A <= -6e+38) {
		tmp = (atan(((B_m / A) * 0.5)) / ((double) M_PI)) * 180.0;
	} else if (A <= 2.1e+110) {
		tmp = 180.0 * (atan(((C / B_m) - 1.0)) / ((double) M_PI));
	} else {
		tmp = 180.0 * (atan(((C - A) / B_m)) / ((double) M_PI));
	}
	return B_s * tmp;
}

Java

B\_m = Math.abs(B);
B\_s = Math.copySign(1.0, B);
public static double code(double B_s, double A, double B_m, double C) {
	double tmp;
	if (A <= -6e+38) {
		tmp = (Math.atan(((B_m / A) * 0.5)) / Math.PI) * 180.0;
	} else if (A <= 2.1e+110) {
		tmp = 180.0 * (Math.atan(((C / B_m) - 1.0)) / Math.PI);
	} else {
		tmp = 180.0 * (Math.atan(((C - A) / B_m)) / Math.PI);
	}
	return B_s * tmp;
}

Python

B\_m = math.fabs(B)
B\_s = math.copysign(1.0, B)
def code(B_s, A, B_m, C):
	tmp = 0
	if A <= -6e+38:
		tmp = (math.atan(((B_m / A) * 0.5)) / math.pi) * 180.0
	elif A <= 2.1e+110:
		tmp = 180.0 * (math.atan(((C / B_m) - 1.0)) / math.pi)
	else:
		tmp = 180.0 * (math.atan(((C - A) / B_m)) / math.pi)
	return B_s * tmp

Julia

B\_m = abs(B)
B\_s = copysign(1.0, B)
function code(B_s, A, B_m, C)
	tmp = 0.0
	if (A <= -6e+38)
		tmp = Float64(Float64(atan(Float64(Float64(B_m / A) * 0.5)) / pi) * 180.0);
	elseif (A <= 2.1e+110)
		tmp = Float64(180.0 * Float64(atan(Float64(Float64(C / B_m) - 1.0)) / pi));
	else
		tmp = Float64(180.0 * Float64(atan(Float64(Float64(C - A) / B_m)) / pi));
	end
	return Float64(B_s * tmp)
end

MATLAB

B\_m = abs(B);
B\_s = sign(B) * abs(1.0);
function tmp_2 = code(B_s, A, B_m, C)
	tmp = 0.0;
	if (A <= -6e+38)
		tmp = (atan(((B_m / A) * 0.5)) / pi) * 180.0;
	elseif (A <= 2.1e+110)
		tmp = 180.0 * (atan(((C / B_m) - 1.0)) / pi);
	else
		tmp = 180.0 * (atan(((C - A) / B_m)) / pi);
	end
	tmp_2 = B_s * tmp;
end

Wolfram

B\_m = N[Abs[B], $MachinePrecision]
B\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[B]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[B$95$s_, A_, B$95$m_, C_] := N[(B$95$s * If[LessEqual[A, -6e+38], N[(N[(N[ArcTan[N[(N[(B$95$m / A), $MachinePrecision] * 0.5), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision] * 180.0), $MachinePrecision], If[LessEqual[A, 2.1e+110], N[(180.0 * N[(N[ArcTan[N[(N[(C / B$95$m), $MachinePrecision] - 1.0), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision], N[(180.0 * N[(N[ArcTan[N[(N[(C - A), $MachinePrecision] / B$95$m), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if A < -6.0000000000000002e38

   1. Initial program 54.6%

      \[180 \cdot \frac{\tan^{-1} \left(\frac{1}{B} \cdot \left(\left(C - A\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)\right)}{\pi} \]

   2. Taylor expanded in A around -inf

      \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{\left(\frac{1}{2} \cdot \frac{B}{A}\right)}}{\pi} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{1}{2} \cdot \color{blue}{\frac{B}{A}}\right)}{\pi} \]

      2. lower-/.f64 26.5

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(0.5 \cdot \frac{B}{\color{blue}{A}}\right)}{\pi} \]

   4. Applied rewrites 26.5%

      \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{\left(0.5 \cdot \frac{B}{A}\right)}}{\pi} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \color{blue}{180 \cdot \frac{\tan^{-1} \left(\frac{1}{2} \cdot \frac{B}{A}\right)}{\pi}} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{\frac{\tan^{-1} \left(\frac{1}{2} \cdot \frac{B}{A}\right)}{\pi} \cdot 180} \]

      3. lower-*.f64 26.5

         \[\leadsto \color{blue}{\frac{\tan^{-1} \left(0.5 \cdot \frac{B}{A}\right)}{\pi} \cdot 180} \]

      4. lift-*.f64 N/A

         \[\leadsto \frac{\tan^{-1} \left(\frac{1}{2} \cdot \color{blue}{\frac{B}{A}}\right)}{\pi} \cdot 180 \]

      5. *-commutative N/A

         \[\leadsto \frac{\tan^{-1} \left(\frac{B}{A} \cdot \color{blue}{\frac{1}{2}}\right)}{\pi} \cdot 180 \]

      6. lower-*.f64 26.5

         \[\leadsto \frac{\tan^{-1} \left(\frac{B}{A} \cdot \color{blue}{0.5}\right)}{\pi} \cdot 180 \]

   6. Applied rewrites 26.5%

      \[\leadsto \color{blue}{\frac{\tan^{-1} \left(\frac{B}{A} \cdot 0.5\right)}{\pi} \cdot 180} \]

   if -6.0000000000000002e38 < A < 2.10000000000000015e110

   1. Initial program 54.6%

      \[180 \cdot \frac{\tan^{-1} \left(\frac{1}{B} \cdot \left(\left(C - A\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)\right)}{\pi} \]

   2. Taylor expanded in B around inf

      \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{\left(\frac{C}{B} - \left(1 + \frac{A}{B}\right)\right)}}{\pi} \]
   3. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - \color{blue}{\left(1 + \frac{A}{B}\right)}\right)}{\pi} \]

      2. lower-/.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - \left(\color{blue}{1} + \frac{A}{B}\right)\right)}{\pi} \]

      3. lower-+.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - \left(1 + \color{blue}{\frac{A}{B}}\right)\right)}{\pi} \]

      4. lower-/.f64 65.6

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - \left(1 + \frac{A}{\color{blue}{B}}\right)\right)}{\pi} \]

   4. Applied rewrites 65.6%

      \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{\left(\frac{C}{B} - \left(1 + \frac{A}{B}\right)\right)}}{\pi} \]

   5. Taylor expanded in A around 0

      \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - 1\right)}{\pi} \]
   6. Step-by-step derivation

   7. Applied rewrites 56.1%

      \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - 1\right)}{\pi} \]

   if 2.10000000000000015e110 < A

   1. Initial program 54.6%

      \[180 \cdot \frac{\tan^{-1} \left(\frac{1}{B} \cdot \left(\left(C - A\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)\right)}{\pi} \]

   2. Taylor expanded in B around inf

      \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{\left(\frac{C}{B} - \left(1 + \frac{A}{B}\right)\right)}}{\pi} \]
   3. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - \color{blue}{\left(1 + \frac{A}{B}\right)}\right)}{\pi} \]

      2. lower-/.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - \left(\color{blue}{1} + \frac{A}{B}\right)\right)}{\pi} \]

      3. lower-+.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - \left(1 + \color{blue}{\frac{A}{B}}\right)\right)}{\pi} \]

      4. lower-/.f64 65.6

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - \left(1 + \frac{A}{\color{blue}{B}}\right)\right)}{\pi} \]

   4. Applied rewrites 65.6%

      \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{\left(\frac{C}{B} - \left(1 + \frac{A}{B}\right)\right)}}{\pi} \]

   5. Taylor expanded in B around 0

      \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C - A}{\color{blue}{B}}\right)}{\pi} \]
   6. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C - A}{B}\right)}{\pi} \]

      2. lower--.f64 35.6

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C - A}{B}\right)}{\pi} \]

   7. Applied rewrites 35.6%

      \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C - A}{\color{blue}{B}}\right)}{\pi} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 5: 63.7% accurate, 2.2× speedup

Math

\[\begin{array}{l} B\_m = \left|B\right| \\ B\_s = \mathsf{copysign}\left(1, B\right) \\ B\_s \cdot \begin{array}{l} \mathbf{if}\;A \leq -2.3 \cdot 10^{+169}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} 0}{\pi}\\ \mathbf{elif}\;A \leq 2.1 \cdot 10^{+110}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(\frac{C}{B\_m} - 1\right)}{\pi}\\ \mathbf{else}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(\frac{C - A}{B\_m}\right)}{\pi}\\ \end{array} \end{array} \]

FPCore

B\_m = (fabs.f64 B)
B\_s = (copysign.f64 #s(literal 1 binary64) B)
(FPCore (B_s A B_m C)
 :precision binary64
 (*
  B_s
  (if (<= A -2.3e+169)
    (* 180.0 (/ (atan 0.0) PI))
    (if (<= A 2.1e+110)
      (* 180.0 (/ (atan (- (/ C B_m) 1.0)) PI))
      (* 180.0 (/ (atan (/ (- C A) B_m)) PI))))))

C

B\_m = fabs(B);
B\_s = copysign(1.0, B);
double code(double B_s, double A, double B_m, double C) {
	double tmp;
	if (A <= -2.3e+169) {
		tmp = 180.0 * (atan(0.0) / ((double) M_PI));
	} else if (A <= 2.1e+110) {
		tmp = 180.0 * (atan(((C / B_m) - 1.0)) / ((double) M_PI));
	} else {
		tmp = 180.0 * (atan(((C - A) / B_m)) / ((double) M_PI));
	}
	return B_s * tmp;
}

Java

B\_m = Math.abs(B);
B\_s = Math.copySign(1.0, B);
public static double code(double B_s, double A, double B_m, double C) {
	double tmp;
	if (A <= -2.3e+169) {
		tmp = 180.0 * (Math.atan(0.0) / Math.PI);
	} else if (A <= 2.1e+110) {
		tmp = 180.0 * (Math.atan(((C / B_m) - 1.0)) / Math.PI);
	} else {
		tmp = 180.0 * (Math.atan(((C - A) / B_m)) / Math.PI);
	}
	return B_s * tmp;
}

Python

B\_m = math.fabs(B)
B\_s = math.copysign(1.0, B)
def code(B_s, A, B_m, C):
	tmp = 0
	if A <= -2.3e+169:
		tmp = 180.0 * (math.atan(0.0) / math.pi)
	elif A <= 2.1e+110:
		tmp = 180.0 * (math.atan(((C / B_m) - 1.0)) / math.pi)
	else:
		tmp = 180.0 * (math.atan(((C - A) / B_m)) / math.pi)
	return B_s * tmp

Julia

B\_m = abs(B)
B\_s = copysign(1.0, B)
function code(B_s, A, B_m, C)
	tmp = 0.0
	if (A <= -2.3e+169)
		tmp = Float64(180.0 * Float64(atan(0.0) / pi));
	elseif (A <= 2.1e+110)
		tmp = Float64(180.0 * Float64(atan(Float64(Float64(C / B_m) - 1.0)) / pi));
	else
		tmp = Float64(180.0 * Float64(atan(Float64(Float64(C - A) / B_m)) / pi));
	end
	return Float64(B_s * tmp)
end

MATLAB

B\_m = abs(B);
B\_s = sign(B) * abs(1.0);
function tmp_2 = code(B_s, A, B_m, C)
	tmp = 0.0;
	if (A <= -2.3e+169)
		tmp = 180.0 * (atan(0.0) / pi);
	elseif (A <= 2.1e+110)
		tmp = 180.0 * (atan(((C / B_m) - 1.0)) / pi);
	else
		tmp = 180.0 * (atan(((C - A) / B_m)) / pi);
	end
	tmp_2 = B_s * tmp;
end

Wolfram

B\_m = N[Abs[B], $MachinePrecision]
B\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[B]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[B$95$s_, A_, B$95$m_, C_] := N[(B$95$s * If[LessEqual[A, -2.3e+169], N[(180.0 * N[(N[ArcTan[0.0], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision], If[LessEqual[A, 2.1e+110], N[(180.0 * N[(N[ArcTan[N[(N[(C / B$95$m), $MachinePrecision] - 1.0), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision], N[(180.0 * N[(N[ArcTan[N[(N[(C - A), $MachinePrecision] / B$95$m), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if A < -2.2999999999999999e169

   1. Initial program 54.6%

      \[180 \cdot \frac{\tan^{-1} \left(\frac{1}{B} \cdot \left(\left(C - A\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)\right)}{\pi} \]

   2. Taylor expanded in C around inf

      \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{\left(-1 \cdot \frac{A + -1 \cdot A}{B}\right)}}{\pi} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(-1 \cdot \color{blue}{\frac{A + -1 \cdot A}{B}}\right)}{\pi} \]

      2. lower-/.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(-1 \cdot \frac{A + -1 \cdot A}{\color{blue}{B}}\right)}{\pi} \]

      3. lower-+.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(-1 \cdot \frac{A + -1 \cdot A}{B}\right)}{\pi} \]

      4. lower-*.f64 12.9

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(-1 \cdot \frac{A + -1 \cdot A}{B}\right)}{\pi} \]

   4. Applied rewrites 12.9%

      \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{\left(-1 \cdot \frac{A + -1 \cdot A}{B}\right)}}{\pi} \]

   5. Taylor expanded in A around 0

      \[\leadsto 180 \cdot \frac{\tan^{-1} 0}{\pi} \]
   6. Step-by-step derivation

   7. Applied rewrites 12.9%

      \[\leadsto 180 \cdot \frac{\tan^{-1} 0}{\pi} \]

   if -2.2999999999999999e169 < A < 2.10000000000000015e110

   1. Initial program 54.6%

      \[180 \cdot \frac{\tan^{-1} \left(\frac{1}{B} \cdot \left(\left(C - A\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)\right)}{\pi} \]

   2. Taylor expanded in B around inf

      \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{\left(\frac{C}{B} - \left(1 + \frac{A}{B}\right)\right)}}{\pi} \]
   3. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - \color{blue}{\left(1 + \frac{A}{B}\right)}\right)}{\pi} \]

      2. lower-/.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - \left(\color{blue}{1} + \frac{A}{B}\right)\right)}{\pi} \]

      3. lower-+.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - \left(1 + \color{blue}{\frac{A}{B}}\right)\right)}{\pi} \]

      4. lower-/.f64 65.6

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - \left(1 + \frac{A}{\color{blue}{B}}\right)\right)}{\pi} \]

   4. Applied rewrites 65.6%

      \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{\left(\frac{C}{B} - \left(1 + \frac{A}{B}\right)\right)}}{\pi} \]

   5. Taylor expanded in A around 0

      \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - 1\right)}{\pi} \]
   6. Step-by-step derivation

   7. Applied rewrites 56.1%

      \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - 1\right)}{\pi} \]

   if 2.10000000000000015e110 < A

   1. Initial program 54.6%

      \[180 \cdot \frac{\tan^{-1} \left(\frac{1}{B} \cdot \left(\left(C - A\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)\right)}{\pi} \]

   2. Taylor expanded in B around inf

      \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{\left(\frac{C}{B} - \left(1 + \frac{A}{B}\right)\right)}}{\pi} \]
   3. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - \color{blue}{\left(1 + \frac{A}{B}\right)}\right)}{\pi} \]

      2. lower-/.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - \left(\color{blue}{1} + \frac{A}{B}\right)\right)}{\pi} \]

      3. lower-+.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - \left(1 + \color{blue}{\frac{A}{B}}\right)\right)}{\pi} \]

      4. lower-/.f64 65.6

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - \left(1 + \frac{A}{\color{blue}{B}}\right)\right)}{\pi} \]

   4. Applied rewrites 65.6%

      \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{\left(\frac{C}{B} - \left(1 + \frac{A}{B}\right)\right)}}{\pi} \]

   5. Taylor expanded in B around 0

      \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C - A}{\color{blue}{B}}\right)}{\pi} \]
   6. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C - A}{B}\right)}{\pi} \]

      2. lower--.f64 35.6

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C - A}{B}\right)}{\pi} \]

   7. Applied rewrites 35.6%

      \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C - A}{\color{blue}{B}}\right)}{\pi} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 6: 53.4% accurate, 2.5× speedup

Math

\[\begin{array}{l} B\_m = \left|B\right| \\ B\_s = \mathsf{copysign}\left(1, B\right) \\ B\_s \cdot \begin{array}{l} \mathbf{if}\;B\_m \leq 4.7 \cdot 10^{-59}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(\frac{C - A}{B\_m}\right)}{\pi}\\ \mathbf{else}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} -1}{\pi}\\ \end{array} \end{array} \]

FPCore

B\_m = (fabs.f64 B)
B\_s = (copysign.f64 #s(literal 1 binary64) B)
(FPCore (B_s A B_m C)
 :precision binary64
 (*
  B_s
  (if (<= B_m 4.7e-59)
    (* 180.0 (/ (atan (/ (- C A) B_m)) PI))
    (* 180.0 (/ (atan -1.0) PI)))))

C

B\_m = fabs(B);
B\_s = copysign(1.0, B);
double code(double B_s, double A, double B_m, double C) {
	double tmp;
	if (B_m <= 4.7e-59) {
		tmp = 180.0 * (atan(((C - A) / B_m)) / ((double) M_PI));
	} else {
		tmp = 180.0 * (atan(-1.0) / ((double) M_PI));
	}
	return B_s * tmp;
}

Java

B\_m = Math.abs(B);
B\_s = Math.copySign(1.0, B);
public static double code(double B_s, double A, double B_m, double C) {
	double tmp;
	if (B_m <= 4.7e-59) {
		tmp = 180.0 * (Math.atan(((C - A) / B_m)) / Math.PI);
	} else {
		tmp = 180.0 * (Math.atan(-1.0) / Math.PI);
	}
	return B_s * tmp;
}

Python

B\_m = math.fabs(B)
B\_s = math.copysign(1.0, B)
def code(B_s, A, B_m, C):
	tmp = 0
	if B_m <= 4.7e-59:
		tmp = 180.0 * (math.atan(((C - A) / B_m)) / math.pi)
	else:
		tmp = 180.0 * (math.atan(-1.0) / math.pi)
	return B_s * tmp

Julia

B\_m = abs(B)
B\_s = copysign(1.0, B)
function code(B_s, A, B_m, C)
	tmp = 0.0
	if (B_m <= 4.7e-59)
		tmp = Float64(180.0 * Float64(atan(Float64(Float64(C - A) / B_m)) / pi));
	else
		tmp = Float64(180.0 * Float64(atan(-1.0) / pi));
	end
	return Float64(B_s * tmp)
end

MATLAB

B\_m = abs(B);
B\_s = sign(B) * abs(1.0);
function tmp_2 = code(B_s, A, B_m, C)
	tmp = 0.0;
	if (B_m <= 4.7e-59)
		tmp = 180.0 * (atan(((C - A) / B_m)) / pi);
	else
		tmp = 180.0 * (atan(-1.0) / pi);
	end
	tmp_2 = B_s * tmp;
end

Wolfram

B\_m = N[Abs[B], $MachinePrecision]
B\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[B]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[B$95$s_, A_, B$95$m_, C_] := N[(B$95$s * If[LessEqual[B$95$m, 4.7e-59], N[(180.0 * N[(N[ArcTan[N[(N[(C - A), $MachinePrecision] / B$95$m), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision], N[(180.0 * N[(N[ArcTan[-1.0], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if B < 4.6999999999999999e-59

   1. Initial program 54.6%

      \[180 \cdot \frac{\tan^{-1} \left(\frac{1}{B} \cdot \left(\left(C - A\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)\right)}{\pi} \]

   2. Taylor expanded in B around inf

      \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{\left(\frac{C}{B} - \left(1 + \frac{A}{B}\right)\right)}}{\pi} \]
   3. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - \color{blue}{\left(1 + \frac{A}{B}\right)}\right)}{\pi} \]

      2. lower-/.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - \left(\color{blue}{1} + \frac{A}{B}\right)\right)}{\pi} \]

      3. lower-+.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - \left(1 + \color{blue}{\frac{A}{B}}\right)\right)}{\pi} \]

      4. lower-/.f64 65.6

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C}{B} - \left(1 + \frac{A}{\color{blue}{B}}\right)\right)}{\pi} \]

   4. Applied rewrites 65.6%

      \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{\left(\frac{C}{B} - \left(1 + \frac{A}{B}\right)\right)}}{\pi} \]

   5. Taylor expanded in B around 0

      \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C - A}{\color{blue}{B}}\right)}{\pi} \]
   6. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C - A}{B}\right)}{\pi} \]

      2. lower--.f64 35.6

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C - A}{B}\right)}{\pi} \]

   7. Applied rewrites 35.6%

      \[\leadsto 180 \cdot \frac{\tan^{-1} \left(\frac{C - A}{\color{blue}{B}}\right)}{\pi} \]

   if 4.6999999999999999e-59 < B

   1. Initial program 54.6%

      \[180 \cdot \frac{\tan^{-1} \left(\frac{1}{B} \cdot \left(\left(C - A\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)\right)}{\pi} \]

   2. Taylor expanded in B around inf

      \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{-1}}{\pi} \]
   3. Step-by-step derivation

   4. Applied rewrites 39.9%

      \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{-1}}{\pi} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 7: 42.6% accurate, 3.3× speedup

Math

\[\begin{array}{l} B\_m = \left|B\right| \\ B\_s = \mathsf{copysign}\left(1, B\right) \\ B\_s \cdot \begin{array}{l} \mathbf{if}\;A \leq -1.2 \cdot 10^{+169}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} 0}{\pi}\\ \mathbf{else}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} -1}{\pi}\\ \end{array} \end{array} \]

FPCore

B\_m = (fabs.f64 B)
B\_s = (copysign.f64 #s(literal 1 binary64) B)
(FPCore (B_s A B_m C)
 :precision binary64
 (*
  B_s
  (if (<= A -1.2e+169)
    (* 180.0 (/ (atan 0.0) PI))
    (* 180.0 (/ (atan -1.0) PI)))))

C

B\_m = fabs(B);
B\_s = copysign(1.0, B);
double code(double B_s, double A, double B_m, double C) {
	double tmp;
	if (A <= -1.2e+169) {
		tmp = 180.0 * (atan(0.0) / ((double) M_PI));
	} else {
		tmp = 180.0 * (atan(-1.0) / ((double) M_PI));
	}
	return B_s * tmp;
}

Java

B\_m = Math.abs(B);
B\_s = Math.copySign(1.0, B);
public static double code(double B_s, double A, double B_m, double C) {
	double tmp;
	if (A <= -1.2e+169) {
		tmp = 180.0 * (Math.atan(0.0) / Math.PI);
	} else {
		tmp = 180.0 * (Math.atan(-1.0) / Math.PI);
	}
	return B_s * tmp;
}

Python

B\_m = math.fabs(B)
B\_s = math.copysign(1.0, B)
def code(B_s, A, B_m, C):
	tmp = 0
	if A <= -1.2e+169:
		tmp = 180.0 * (math.atan(0.0) / math.pi)
	else:
		tmp = 180.0 * (math.atan(-1.0) / math.pi)
	return B_s * tmp

Julia

B\_m = abs(B)
B\_s = copysign(1.0, B)
function code(B_s, A, B_m, C)
	tmp = 0.0
	if (A <= -1.2e+169)
		tmp = Float64(180.0 * Float64(atan(0.0) / pi));
	else
		tmp = Float64(180.0 * Float64(atan(-1.0) / pi));
	end
	return Float64(B_s * tmp)
end

MATLAB

B\_m = abs(B);
B\_s = sign(B) * abs(1.0);
function tmp_2 = code(B_s, A, B_m, C)
	tmp = 0.0;
	if (A <= -1.2e+169)
		tmp = 180.0 * (atan(0.0) / pi);
	else
		tmp = 180.0 * (atan(-1.0) / pi);
	end
	tmp_2 = B_s * tmp;
end

Wolfram

B\_m = N[Abs[B], $MachinePrecision]
B\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[B]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[B$95$s_, A_, B$95$m_, C_] := N[(B$95$s * If[LessEqual[A, -1.2e+169], N[(180.0 * N[(N[ArcTan[0.0], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision], N[(180.0 * N[(N[ArcTan[-1.0], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if A < -1.1999999999999999e169

   1. Initial program 54.6%

      \[180 \cdot \frac{\tan^{-1} \left(\frac{1}{B} \cdot \left(\left(C - A\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)\right)}{\pi} \]

   2. Taylor expanded in C around inf

      \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{\left(-1 \cdot \frac{A + -1 \cdot A}{B}\right)}}{\pi} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(-1 \cdot \color{blue}{\frac{A + -1 \cdot A}{B}}\right)}{\pi} \]

      2. lower-/.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(-1 \cdot \frac{A + -1 \cdot A}{\color{blue}{B}}\right)}{\pi} \]

      3. lower-+.f64 N/A

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(-1 \cdot \frac{A + -1 \cdot A}{B}\right)}{\pi} \]

      4. lower-*.f64 12.9

         \[\leadsto 180 \cdot \frac{\tan^{-1} \left(-1 \cdot \frac{A + -1 \cdot A}{B}\right)}{\pi} \]

   4. Applied rewrites 12.9%

      \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{\left(-1 \cdot \frac{A + -1 \cdot A}{B}\right)}}{\pi} \]

   5. Taylor expanded in A around 0

      \[\leadsto 180 \cdot \frac{\tan^{-1} 0}{\pi} \]
   6. Step-by-step derivation

   7. Applied rewrites 12.9%

      \[\leadsto 180 \cdot \frac{\tan^{-1} 0}{\pi} \]

   if -1.1999999999999999e169 < A

   1. Initial program 54.6%

      \[180 \cdot \frac{\tan^{-1} \left(\frac{1}{B} \cdot \left(\left(C - A\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)\right)}{\pi} \]

   2. Taylor expanded in B around inf

      \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{-1}}{\pi} \]
   3. Step-by-step derivation

   4. Applied rewrites 39.9%

      \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{-1}}{\pi} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 8: 39.9% accurate, 4.1× speedup

Math

\[\begin{array}{l} B\_m = \left|B\right| \\ B\_s = \mathsf{copysign}\left(1, B\right) \\ B\_s \cdot \left(180 \cdot \frac{\tan^{-1} -1}{\pi}\right) \end{array} \]

FPCore

B\_m = (fabs.f64 B)
B\_s = (copysign.f64 #s(literal 1 binary64) B)
(FPCore (B_s A B_m C) :precision binary64 (* B_s (* 180.0 (/ (atan -1.0) PI))))

C

B\_m = fabs(B);
B\_s = copysign(1.0, B);
double code(double B_s, double A, double B_m, double C) {
	return B_s * (180.0 * (atan(-1.0) / ((double) M_PI)));
}

Java

B\_m = Math.abs(B);
B\_s = Math.copySign(1.0, B);
public static double code(double B_s, double A, double B_m, double C) {
	return B_s * (180.0 * (Math.atan(-1.0) / Math.PI));
}

Python

B\_m = math.fabs(B)
B\_s = math.copysign(1.0, B)
def code(B_s, A, B_m, C):
	return B_s * (180.0 * (math.atan(-1.0) / math.pi))

Julia

B\_m = abs(B)
B\_s = copysign(1.0, B)
function code(B_s, A, B_m, C)
	return Float64(B_s * Float64(180.0 * Float64(atan(-1.0) / pi)))
end

MATLAB

B\_m = abs(B);
B\_s = sign(B) * abs(1.0);
function tmp = code(B_s, A, B_m, C)
	tmp = B_s * (180.0 * (atan(-1.0) / pi));
end

Wolfram

B\_m = N[Abs[B], $MachinePrecision]
B\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[B]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[B$95$s_, A_, B$95$m_, C_] := N[(B$95$s * N[(180.0 * N[(N[ArcTan[-1.0], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 54.6%

   \[180 \cdot \frac{\tan^{-1} \left(\frac{1}{B} \cdot \left(\left(C - A\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)\right)}{\pi} \]

2. Taylor expanded in B around inf

   \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{-1}}{\pi} \]
3. Step-by-step derivation

4. Applied rewrites 39.9%

   \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{-1}}{\pi} \]
5. Add Preprocessing

Reproduce

herbie shell --seed 2025149 
(FPCore (A B C)
  :name "ABCF->ab-angle angle"
  :precision binary64
  (* 180.0 (/ (atan (* (/ 1.0 B) (- (- C A) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0)))))) PI)))