ABCF->ab-angle angle

Percentage Accurate: 54.3% → 81.9%

Time: 5.3s

Alternatives: 13

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.3% 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: 81.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} B\_m = \left|B\right| \\ B\_s = \mathsf{copysign}\left(1, B\right) \\ \begin{array}{l} t_0 := \left(-A\right) + C\\ B\_s \cdot \begin{array}{l} \mathbf{if}\;180 \cdot \frac{\tan^{-1} \left(\frac{1}{B\_m} \cdot \left(\left(C - A\right) - \sqrt{{\left(A - C\right)}^{2} + {B\_m}^{2}}\right)\right)}{\pi} \leq -40:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(\frac{t\_0 - \mathsf{hypot}\left(t\_0, B\_m\right)}{B\_m}\right)}{\pi}\\ \mathbf{else}:\\ \;\;\;\;\frac{180 \cdot \tan^{-1} \left(\frac{B\_m \cdot 0.5}{A}\right)}{\pi}\\ \end{array} \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
 (let* ((t_0 (+ (- A) C)))
   (*
    B_s
    (if (<=
         (*
          180.0
          (/
           (atan
            (*
             (/ 1.0 B_m)
             (- (- C A) (sqrt (+ (pow (- A C) 2.0) (pow B_m 2.0))))))
           PI))
         -40.0)
      (* 180.0 (/ (atan (/ (- t_0 (hypot t_0 B_m)) B_m)) PI))
      (/ (* 180.0 (atan (/ (* B_m 0.5) A))) 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 t_0 = -A + C;
	double tmp;
	if ((180.0 * (atan(((1.0 / B_m) * ((C - A) - sqrt((pow((A - C), 2.0) + pow(B_m, 2.0)))))) / ((double) M_PI))) <= -40.0) {
		tmp = 180.0 * (atan(((t_0 - hypot(t_0, B_m)) / B_m)) / ((double) M_PI));
	} else {
		tmp = (180.0 * atan(((B_m * 0.5) / A))) / ((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 t_0 = -A + C;
	double tmp;
	if ((180.0 * (Math.atan(((1.0 / B_m) * ((C - A) - Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B_m, 2.0)))))) / Math.PI)) <= -40.0) {
		tmp = 180.0 * (Math.atan(((t_0 - Math.hypot(t_0, B_m)) / B_m)) / Math.PI);
	} else {
		tmp = (180.0 * Math.atan(((B_m * 0.5) / A))) / 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):
	t_0 = -A + C
	tmp = 0
	if (180.0 * (math.atan(((1.0 / B_m) * ((C - A) - math.sqrt((math.pow((A - C), 2.0) + math.pow(B_m, 2.0)))))) / math.pi)) <= -40.0:
		tmp = 180.0 * (math.atan(((t_0 - math.hypot(t_0, B_m)) / B_m)) / math.pi)
	else:
		tmp = (180.0 * math.atan(((B_m * 0.5) / A))) / 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)
	t_0 = Float64(Float64(-A) + C)
	tmp = 0.0
	if (Float64(180.0 * Float64(atan(Float64(Float64(1.0 / B_m) * Float64(Float64(C - A) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B_m ^ 2.0)))))) / pi)) <= -40.0)
		tmp = Float64(180.0 * Float64(atan(Float64(Float64(t_0 - hypot(t_0, B_m)) / B_m)) / pi));
	else
		tmp = Float64(Float64(180.0 * atan(Float64(Float64(B_m * 0.5) / A))) / 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)
	t_0 = -A + C;
	tmp = 0.0;
	if ((180.0 * (atan(((1.0 / B_m) * ((C - A) - sqrt((((A - C) ^ 2.0) + (B_m ^ 2.0)))))) / pi)) <= -40.0)
		tmp = 180.0 * (atan(((t_0 - hypot(t_0, B_m)) / B_m)) / pi);
	else
		tmp = (180.0 * atan(((B_m * 0.5) / A))) / 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_] := Block[{t$95$0 = N[((-A) + C), $MachinePrecision]}, N[(B$95$s * If[LessEqual[N[(180.0 * N[(N[ArcTan[N[(N[(1.0 / B$95$m), $MachinePrecision] * N[(N[(C - A), $MachinePrecision] - N[Sqrt[N[(N[Power[N[(A - C), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[B$95$m, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision], -40.0], N[(180.0 * N[(N[ArcTan[N[(N[(t$95$0 - N[Sqrt[t$95$0 ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] / B$95$m), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision], N[(N[(180.0 * N[ArcTan[N[(N[(B$95$m * 0.5), $MachinePrecision] / A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / Pi), $MachinePrecision]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 #s(literal 180 binary64) (/.f64 (atan.f64 (*.f64 (/.f64 #s(literal 1 binary64) B) (-.f64 (-.f64 C A) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64))))))) (PI.f64))) < -40

   1. Initial program 54.3%

      \[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{\color{blue}{\tan^{-1} \left(\frac{\left(C + -1 \cdot A\right) - \sqrt{{B}^{2} + {\left(C + -1 \cdot A\right)}^{2}}}{B}\right)}}{\pi} \]
   3. Step-by-step derivation

      1. lower-atan.f64 N/A

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

      2. lower-/.f64 N/A

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

   4. Applied rewrites 78.1%

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

   if -40 < (*.f64 #s(literal 180 binary64) (/.f64 (atan.f64 (*.f64 (/.f64 #s(literal 1 binary64) B) (-.f64 (-.f64 C A) (sqrt.f64 (+.f64 (pow.f64 (-.f64 A C) #s(literal 2 binary64)) (pow.f64 B #s(literal 2 binary64))))))) (PI.f64)))

   1. Initial program 54.3%

      \[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. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 25.9

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

   4. Applied rewrites 25.9%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*r/ N/A

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

      4. lower-/.f64 N/A

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

      5. lower-*.f64 25.9

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

   6. Applied rewrites 25.9%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*l/ N/A

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

      4. lower-/.f64 N/A

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

      5. lower-*.f64 25.9

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

   8. Applied rewrites 25.9%

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

Alternative 2: 77.7% accurate, 1.6× 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 -8 \cdot 10^{+101}:\\ \;\;\;\;\frac{180 \cdot \tan^{-1} \left(-\frac{-0.5 \cdot \left(B\_m + B\_m \cdot \frac{C}{A}\right)}{A}\right)}{\pi}\\ \mathbf{elif}\;A \leq 1.7 \cdot 10^{+38}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(\frac{C - \mathsf{hypot}\left(C, B\_m\right)}{B\_m}\right)}{\pi}\\ \mathbf{else}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(\frac{-A}{B\_m} - 1\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 -8e+101)
    (/ (* 180.0 (atan (- (/ (* -0.5 (+ B_m (* B_m (/ C A)))) A)))) PI)
    (if (<= A 1.7e+38)
      (* 180.0 (/ (atan (/ (- C (hypot C B_m)) B_m)) PI))
      (* 180.0 (/ (atan (- (/ (- A) B_m) 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 <= -8e+101) {
		tmp = (180.0 * atan(-((-0.5 * (B_m + (B_m * (C / A)))) / A))) / ((double) M_PI);
	} else if (A <= 1.7e+38) {
		tmp = 180.0 * (atan(((C - hypot(C, B_m)) / B_m)) / ((double) M_PI));
	} else {
		tmp = 180.0 * (atan(((-A / B_m) - 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 <= -8e+101) {
		tmp = (180.0 * Math.atan(-((-0.5 * (B_m + (B_m * (C / A)))) / A))) / Math.PI;
	} else if (A <= 1.7e+38) {
		tmp = 180.0 * (Math.atan(((C - Math.hypot(C, B_m)) / B_m)) / Math.PI);
	} else {
		tmp = 180.0 * (Math.atan(((-A / B_m) - 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 <= -8e+101:
		tmp = (180.0 * math.atan(-((-0.5 * (B_m + (B_m * (C / A)))) / A))) / math.pi
	elif A <= 1.7e+38:
		tmp = 180.0 * (math.atan(((C - math.hypot(C, B_m)) / B_m)) / math.pi)
	else:
		tmp = 180.0 * (math.atan(((-A / B_m) - 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 <= -8e+101)
		tmp = Float64(Float64(180.0 * atan(Float64(-Float64(Float64(-0.5 * Float64(B_m + Float64(B_m * Float64(C / A)))) / A)))) / pi);
	elseif (A <= 1.7e+38)
		tmp = Float64(180.0 * Float64(atan(Float64(Float64(C - hypot(C, B_m)) / B_m)) / pi));
	else
		tmp = Float64(180.0 * Float64(atan(Float64(Float64(Float64(-A) / B_m) - 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 <= -8e+101)
		tmp = (180.0 * atan(-((-0.5 * (B_m + (B_m * (C / A)))) / A))) / pi;
	elseif (A <= 1.7e+38)
		tmp = 180.0 * (atan(((C - hypot(C, B_m)) / B_m)) / pi);
	else
		tmp = 180.0 * (atan(((-A / B_m) - 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, -8e+101], N[(N[(180.0 * N[ArcTan[(-N[(N[(-0.5 * N[(B$95$m + N[(B$95$m * N[(C / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / A), $MachinePrecision])], $MachinePrecision]), $MachinePrecision] / Pi), $MachinePrecision], If[LessEqual[A, 1.7e+38], N[(180.0 * N[(N[ArcTan[N[(N[(C - N[Sqrt[C ^ 2 + B$95$m ^ 2], $MachinePrecision]), $MachinePrecision] / B$95$m), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision], N[(180.0 * N[(N[ArcTan[N[(N[((-A) / B$95$m), $MachinePrecision] - 1.0), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if A < -7.9999999999999998e101

   1. Initial program 54.3%

      \[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{\color{blue}{\tan^{-1} \left(\frac{\left(C + -1 \cdot A\right) - \sqrt{{B}^{2} + {\left(C + -1 \cdot A\right)}^{2}}}{B}\right)}}{\pi} \]
   3. Step-by-step derivation

      1. lower-atan.f64 N/A

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

      2. lower-/.f64 N/A

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

   4. Applied rewrites 78.1%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*r/ N/A

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

      4. lower-/.f64 N/A

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

      5. lower-*.f64 78.1

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

   6. Applied rewrites 78.1%

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

   7. Taylor expanded in A around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. distribute-lft-out N/A

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

      5. lower-*.f64 N/A

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

      6. lower-+.f64 N/A

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

      7. associate-/l* N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 33.3

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

   9. Applied rewrites 33.3%

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

   if -7.9999999999999998e101 < A < 1.69999999999999998e38

   1. Initial program 54.3%

      \[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{\color{blue}{\tan^{-1} \left(\frac{\left(C + -1 \cdot A\right) - \sqrt{{B}^{2} + {\left(C + -1 \cdot A\right)}^{2}}}{B}\right)}}{\pi} \]
   3. Step-by-step derivation

      1. lower-atan.f64 N/A

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

      2. lower-/.f64 N/A

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

   4. Applied rewrites 78.1%

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

   5. Taylor expanded in A around 0

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

   7. Applied rewrites 72.4%

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

   8. Taylor expanded in A around 0

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

   10. Applied rewrites 64.4%

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

   if 1.69999999999999998e38 < A

   1. Initial program 54.3%

      \[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 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. unpow2 N/A

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

      9. lower-fma.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-*.f64 44.9

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

   4. Applied rewrites 44.9%

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

   5. Taylor expanded in B around inf

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

      1. lower--.f64 N/A

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

      2. associate-*r/ N/A

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

      3. mul-1-neg N/A

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

      4. lift-neg.f64 N/A

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

      5. lower-/.f64 56.0

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

   7. Applied rewrites 56.0%

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

Alternative 3: 74.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 -3.9 \cdot 10^{+65}:\\ \;\;\;\;\frac{180 \cdot \tan^{-1} \left(\frac{B\_m \cdot 0.5}{A}\right)}{\pi}\\ \mathbf{elif}\;A \leq 0.00046:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(\frac{C}{B\_m} - 1\right)}{\pi}\\ \mathbf{else}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(\frac{-A}{B\_m} - 1\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 -3.9e+65)
    (/ (* 180.0 (atan (/ (* B_m 0.5) A))) PI)
    (if (<= A 0.00046)
      (* 180.0 (/ (atan (- (/ C B_m) 1.0)) PI))
      (* 180.0 (/ (atan (- (/ (- A) B_m) 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 <= -3.9e+65) {
		tmp = (180.0 * atan(((B_m * 0.5) / A))) / ((double) M_PI);
	} else if (A <= 0.00046) {
		tmp = 180.0 * (atan(((C / B_m) - 1.0)) / ((double) M_PI));
	} else {
		tmp = 180.0 * (atan(((-A / B_m) - 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 <= -3.9e+65) {
		tmp = (180.0 * Math.atan(((B_m * 0.5) / A))) / Math.PI;
	} else if (A <= 0.00046) {
		tmp = 180.0 * (Math.atan(((C / B_m) - 1.0)) / Math.PI);
	} else {
		tmp = 180.0 * (Math.atan(((-A / B_m) - 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 <= -3.9e+65:
		tmp = (180.0 * math.atan(((B_m * 0.5) / A))) / math.pi
	elif A <= 0.00046:
		tmp = 180.0 * (math.atan(((C / B_m) - 1.0)) / math.pi)
	else:
		tmp = 180.0 * (math.atan(((-A / B_m) - 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 <= -3.9e+65)
		tmp = Float64(Float64(180.0 * atan(Float64(Float64(B_m * 0.5) / A))) / pi);
	elseif (A <= 0.00046)
		tmp = Float64(180.0 * Float64(atan(Float64(Float64(C / B_m) - 1.0)) / pi));
	else
		tmp = Float64(180.0 * Float64(atan(Float64(Float64(Float64(-A) / B_m) - 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 <= -3.9e+65)
		tmp = (180.0 * atan(((B_m * 0.5) / A))) / pi;
	elseif (A <= 0.00046)
		tmp = 180.0 * (atan(((C / B_m) - 1.0)) / pi);
	else
		tmp = 180.0 * (atan(((-A / B_m) - 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, -3.9e+65], N[(N[(180.0 * N[ArcTan[N[(N[(B$95$m * 0.5), $MachinePrecision] / A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / Pi), $MachinePrecision], If[LessEqual[A, 0.00046], 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[((-A) / B$95$m), $MachinePrecision] - 1.0), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if A < -3.8999999999999998e65

   1. Initial program 54.3%

      \[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. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 25.9

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

   4. Applied rewrites 25.9%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*r/ N/A

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

      4. lower-/.f64 N/A

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

      5. lower-*.f64 25.9

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

   6. Applied rewrites 25.9%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*l/ N/A

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

      4. lower-/.f64 N/A

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

      5. lower-*.f64 25.9

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

   8. Applied rewrites 25.9%

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

   if -3.8999999999999998e65 < A < 4.6000000000000001e-4

   1. Initial program 54.3%

      \[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. associate--r+ N/A

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

      2. lower--.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 65.4

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

   4. Applied rewrites 65.4%

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

   5. Taylor expanded in A around 0

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

      1. lift-/.f64 N/A

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

      2. lift--.f64 56.5

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

   7. Applied rewrites 56.5%

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

   if 4.6000000000000001e-4 < A

   1. Initial program 54.3%

      \[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 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-+.f64 N/A

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

      7. lower-sqrt.f64 N/A

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

      8. unpow2 N/A

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

      9. lower-fma.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-*.f64 44.9

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

   4. Applied rewrites 44.9%

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

   5. Taylor expanded in B around inf

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

      1. lower--.f64 N/A

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

      2. associate-*r/ N/A

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

      3. mul-1-neg N/A

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

      4. lift-neg.f64 N/A

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

      5. lower-/.f64 56.0

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

   7. Applied rewrites 56.0%

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

Alternative 4: 74.8% accurate, 1.8× 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 -5 \cdot 10^{+58}:\\ \;\;\;\;\frac{180 \cdot \tan^{-1} \left(-\frac{-0.5 \cdot \left(B\_m + B\_m \cdot \frac{C}{A}\right)}{A}\right)}{\pi}\\ \mathbf{else}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(\left(\frac{C}{B\_m} - 1\right) - \frac{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 -5e+58)
    (/ (* 180.0 (atan (- (/ (* -0.5 (+ B_m (* B_m (/ C A)))) A)))) PI)
    (* 180.0 (/ (atan (- (- (/ C B_m) 1.0) (/ 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 <= -5e+58) {
		tmp = (180.0 * atan(-((-0.5 * (B_m + (B_m * (C / A)))) / A))) / ((double) M_PI);
	} else {
		tmp = 180.0 * (atan((((C / B_m) - 1.0) - (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 <= -5e+58) {
		tmp = (180.0 * Math.atan(-((-0.5 * (B_m + (B_m * (C / A)))) / A))) / Math.PI;
	} else {
		tmp = 180.0 * (Math.atan((((C / B_m) - 1.0) - (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 <= -5e+58:
		tmp = (180.0 * math.atan(-((-0.5 * (B_m + (B_m * (C / A)))) / A))) / math.pi
	else:
		tmp = 180.0 * (math.atan((((C / B_m) - 1.0) - (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 <= -5e+58)
		tmp = Float64(Float64(180.0 * atan(Float64(-Float64(Float64(-0.5 * Float64(B_m + Float64(B_m * Float64(C / A)))) / A)))) / pi);
	else
		tmp = Float64(180.0 * Float64(atan(Float64(Float64(Float64(C / B_m) - 1.0) - Float64(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 <= -5e+58)
		tmp = (180.0 * atan(-((-0.5 * (B_m + (B_m * (C / A)))) / A))) / pi;
	else
		tmp = 180.0 * (atan((((C / B_m) - 1.0) - (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, -5e+58], N[(N[(180.0 * N[ArcTan[(-N[(N[(-0.5 * N[(B$95$m + N[(B$95$m * N[(C / A), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / A), $MachinePrecision])], $MachinePrecision]), $MachinePrecision] / Pi), $MachinePrecision], N[(180.0 * N[(N[ArcTan[N[(N[(N[(C / B$95$m), $MachinePrecision] - 1.0), $MachinePrecision] - N[(A / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if A < -4.99999999999999986e58

   1. Initial program 54.3%

      \[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{\color{blue}{\tan^{-1} \left(\frac{\left(C + -1 \cdot A\right) - \sqrt{{B}^{2} + {\left(C + -1 \cdot A\right)}^{2}}}{B}\right)}}{\pi} \]
   3. Step-by-step derivation

      1. lower-atan.f64 N/A

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

      2. lower-/.f64 N/A

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

   4. Applied rewrites 78.1%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*r/ N/A

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

      4. lower-/.f64 N/A

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

      5. lower-*.f64 78.1

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

   6. Applied rewrites 78.1%

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

   7. Taylor expanded in A around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. distribute-lft-out N/A

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

      5. lower-*.f64 N/A

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

      6. lower-+.f64 N/A

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

      7. associate-/l* N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 33.3

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

   9. Applied rewrites 33.3%

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

   if -4.99999999999999986e58 < A

   1. Initial program 54.3%

      \[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. associate--r+ N/A

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

      2. lower--.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 65.4

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

   4. Applied rewrites 65.4%

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

Alternative 5: 73.9% accurate, 2.1× 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 -5 \cdot 10^{+58}:\\ \;\;\;\;\frac{180 \cdot \tan^{-1} \left(\frac{B\_m \cdot 0.5}{A}\right)}{\pi}\\ \mathbf{else}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(\left(\frac{C}{B\_m} - 1\right) - \frac{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 -5e+58)
    (/ (* 180.0 (atan (/ (* B_m 0.5) A))) PI)
    (* 180.0 (/ (atan (- (- (/ C B_m) 1.0) (/ 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 <= -5e+58) {
		tmp = (180.0 * atan(((B_m * 0.5) / A))) / ((double) M_PI);
	} else {
		tmp = 180.0 * (atan((((C / B_m) - 1.0) - (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 <= -5e+58) {
		tmp = (180.0 * Math.atan(((B_m * 0.5) / A))) / Math.PI;
	} else {
		tmp = 180.0 * (Math.atan((((C / B_m) - 1.0) - (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 <= -5e+58:
		tmp = (180.0 * math.atan(((B_m * 0.5) / A))) / math.pi
	else:
		tmp = 180.0 * (math.atan((((C / B_m) - 1.0) - (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 <= -5e+58)
		tmp = Float64(Float64(180.0 * atan(Float64(Float64(B_m * 0.5) / A))) / pi);
	else
		tmp = Float64(180.0 * Float64(atan(Float64(Float64(Float64(C / B_m) - 1.0) - Float64(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 <= -5e+58)
		tmp = (180.0 * atan(((B_m * 0.5) / A))) / pi;
	else
		tmp = 180.0 * (atan((((C / B_m) - 1.0) - (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, -5e+58], N[(N[(180.0 * N[ArcTan[N[(N[(B$95$m * 0.5), $MachinePrecision] / A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / Pi), $MachinePrecision], N[(180.0 * N[(N[ArcTan[N[(N[(N[(C / B$95$m), $MachinePrecision] - 1.0), $MachinePrecision] - N[(A / B$95$m), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if A < -4.99999999999999986e58

   1. Initial program 54.3%

      \[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. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 25.9

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

   4. Applied rewrites 25.9%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*r/ N/A

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

      4. lower-/.f64 N/A

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

      5. lower-*.f64 25.9

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

   6. Applied rewrites 25.9%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*l/ N/A

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

      4. lower-/.f64 N/A

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

      5. lower-*.f64 25.9

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

   8. Applied rewrites 25.9%

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

   if -4.99999999999999986e58 < A

   1. Initial program 54.3%

      \[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. associate--r+ N/A

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

      2. lower--.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 65.4

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

   4. Applied rewrites 65.4%

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

Alternative 6: 70.0% 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 -3.9 \cdot 10^{+65}:\\ \;\;\;\;\frac{180 \cdot \tan^{-1} \left(\frac{B\_m \cdot 0.5}{A}\right)}{\pi}\\ \mathbf{elif}\;A \leq 2.2 \cdot 10^{+139}:\\ \;\;\;\;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 -3.9e+65)
    (/ (* 180.0 (atan (/ (* B_m 0.5) A))) PI)
    (if (<= A 2.2e+139)
      (* 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 <= -3.9e+65) {
		tmp = (180.0 * atan(((B_m * 0.5) / A))) / ((double) M_PI);
	} else if (A <= 2.2e+139) {
		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 <= -3.9e+65) {
		tmp = (180.0 * Math.atan(((B_m * 0.5) / A))) / Math.PI;
	} else if (A <= 2.2e+139) {
		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 <= -3.9e+65:
		tmp = (180.0 * math.atan(((B_m * 0.5) / A))) / math.pi
	elif A <= 2.2e+139:
		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 <= -3.9e+65)
		tmp = Float64(Float64(180.0 * atan(Float64(Float64(B_m * 0.5) / A))) / pi);
	elseif (A <= 2.2e+139)
		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 <= -3.9e+65)
		tmp = (180.0 * atan(((B_m * 0.5) / A))) / pi;
	elseif (A <= 2.2e+139)
		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, -3.9e+65], N[(N[(180.0 * N[ArcTan[N[(N[(B$95$m * 0.5), $MachinePrecision] / A), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / Pi), $MachinePrecision], If[LessEqual[A, 2.2e+139], 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 < -3.8999999999999998e65

   1. Initial program 54.3%

      \[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. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 25.9

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

   4. Applied rewrites 25.9%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*r/ N/A

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

      4. lower-/.f64 N/A

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

      5. lower-*.f64 25.9

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

   6. Applied rewrites 25.9%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*l/ N/A

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

      4. lower-/.f64 N/A

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

      5. lower-*.f64 25.9

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

   8. Applied rewrites 25.9%

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

   if -3.8999999999999998e65 < A < 2.1999999999999999e139

   1. Initial program 54.3%

      \[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. associate--r+ N/A

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

      2. lower--.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 65.4

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

   4. Applied rewrites 65.4%

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

   5. Taylor expanded in A around 0

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

      1. lift-/.f64 N/A

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

      2. lift--.f64 56.5

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

   7. Applied rewrites 56.5%

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

   if 2.1999999999999999e139 < A

   1. Initial program 54.3%

      \[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. associate--r+ N/A

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

      2. lower--.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 65.4

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

   4. Applied rewrites 65.4%

      \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{\left(\left(\frac{C}{B} - 1\right) - \frac{A}{B}\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 34.9

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

   7. Applied rewrites 34.9%

      \[\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 7: 70.0% 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 -3.9 \cdot 10^{+65}:\\ \;\;\;\;\frac{180 \cdot \tan^{-1} \left(\frac{B\_m}{A} \cdot 0.5\right)}{\pi}\\ \mathbf{elif}\;A \leq 2.2 \cdot 10^{+139}:\\ \;\;\;\;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 -3.9e+65)
    (/ (* 180.0 (atan (* (/ B_m A) 0.5))) PI)
    (if (<= A 2.2e+139)
      (* 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 <= -3.9e+65) {
		tmp = (180.0 * atan(((B_m / A) * 0.5))) / ((double) M_PI);
	} else if (A <= 2.2e+139) {
		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 <= -3.9e+65) {
		tmp = (180.0 * Math.atan(((B_m / A) * 0.5))) / Math.PI;
	} else if (A <= 2.2e+139) {
		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 <= -3.9e+65:
		tmp = (180.0 * math.atan(((B_m / A) * 0.5))) / math.pi
	elif A <= 2.2e+139:
		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 <= -3.9e+65)
		tmp = Float64(Float64(180.0 * atan(Float64(Float64(B_m / A) * 0.5))) / pi);
	elseif (A <= 2.2e+139)
		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 <= -3.9e+65)
		tmp = (180.0 * atan(((B_m / A) * 0.5))) / pi;
	elseif (A <= 2.2e+139)
		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, -3.9e+65], N[(N[(180.0 * N[ArcTan[N[(N[(B$95$m / A), $MachinePrecision] * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / Pi), $MachinePrecision], If[LessEqual[A, 2.2e+139], 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 < -3.8999999999999998e65

   1. Initial program 54.3%

      \[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. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 25.9

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

   4. Applied rewrites 25.9%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*r/ N/A

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

      4. lower-/.f64 N/A

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

      5. lower-*.f64 25.9

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

   6. Applied rewrites 25.9%

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

   if -3.8999999999999998e65 < A < 2.1999999999999999e139

   1. Initial program 54.3%

      \[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. associate--r+ N/A

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

      2. lower--.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 65.4

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

   4. Applied rewrites 65.4%

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

   5. Taylor expanded in A around 0

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

      1. lift-/.f64 N/A

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

      2. lift--.f64 56.5

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

   7. Applied rewrites 56.5%

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

   if 2.1999999999999999e139 < A

   1. Initial program 54.3%

      \[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. associate--r+ N/A

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

      2. lower--.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 65.4

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

   4. Applied rewrites 65.4%

      \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{\left(\left(\frac{C}{B} - 1\right) - \frac{A}{B}\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 34.9

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

   7. Applied rewrites 34.9%

      \[\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 8: 70.0% 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 -3.9 \cdot 10^{+65}:\\ \;\;\;\;\frac{\tan^{-1} \left(\frac{B\_m}{A} \cdot 0.5\right)}{\pi} \cdot 180\\ \mathbf{elif}\;A \leq 2.2 \cdot 10^{+139}:\\ \;\;\;\;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 -3.9e+65)
    (* (/ (atan (* (/ B_m A) 0.5)) PI) 180.0)
    (if (<= A 2.2e+139)
      (* 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 <= -3.9e+65) {
		tmp = (atan(((B_m / A) * 0.5)) / ((double) M_PI)) * 180.0;
	} else if (A <= 2.2e+139) {
		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 <= -3.9e+65) {
		tmp = (Math.atan(((B_m / A) * 0.5)) / Math.PI) * 180.0;
	} else if (A <= 2.2e+139) {
		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 <= -3.9e+65:
		tmp = (math.atan(((B_m / A) * 0.5)) / math.pi) * 180.0
	elif A <= 2.2e+139:
		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 <= -3.9e+65)
		tmp = Float64(Float64(atan(Float64(Float64(B_m / A) * 0.5)) / pi) * 180.0);
	elseif (A <= 2.2e+139)
		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 <= -3.9e+65)
		tmp = (atan(((B_m / A) * 0.5)) / pi) * 180.0;
	elseif (A <= 2.2e+139)
		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, -3.9e+65], N[(N[(N[ArcTan[N[(N[(B$95$m / A), $MachinePrecision] * 0.5), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision] * 180.0), $MachinePrecision], If[LessEqual[A, 2.2e+139], 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 < -3.8999999999999998e65

   1. Initial program 54.3%

      \[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. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 25.9

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

   4. Applied rewrites 25.9%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 25.9

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

   6. Applied rewrites 25.9%

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

   if -3.8999999999999998e65 < A < 2.1999999999999999e139

   1. Initial program 54.3%

      \[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. associate--r+ N/A

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

      2. lower--.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 65.4

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

   4. Applied rewrites 65.4%

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

   5. Taylor expanded in A around 0

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

      1. lift-/.f64 N/A

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

      2. lift--.f64 56.5

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

   7. Applied rewrites 56.5%

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

   if 2.1999999999999999e139 < A

   1. Initial program 54.3%

      \[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. associate--r+ N/A

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

      2. lower--.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 65.4

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

   4. Applied rewrites 65.4%

      \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{\left(\left(\frac{C}{B} - 1\right) - \frac{A}{B}\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 34.9

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

   7. Applied rewrites 34.9%

      \[\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 9: 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 -5 \cdot 10^{+205}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(\frac{0}{B\_m}\right)}{\pi}\\ \mathbf{elif}\;A \leq 2.2 \cdot 10^{+139}:\\ \;\;\;\;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 -5e+205)
    (* 180.0 (/ (atan (/ 0.0 B_m)) PI))
    (if (<= A 2.2e+139)
      (* 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 <= -5e+205) {
		tmp = 180.0 * (atan((0.0 / B_m)) / ((double) M_PI));
	} else if (A <= 2.2e+139) {
		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 <= -5e+205) {
		tmp = 180.0 * (Math.atan((0.0 / B_m)) / Math.PI);
	} else if (A <= 2.2e+139) {
		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 <= -5e+205:
		tmp = 180.0 * (math.atan((0.0 / B_m)) / math.pi)
	elif A <= 2.2e+139:
		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 <= -5e+205)
		tmp = Float64(180.0 * Float64(atan(Float64(0.0 / B_m)) / pi));
	elseif (A <= 2.2e+139)
		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 <= -5e+205)
		tmp = 180.0 * (atan((0.0 / B_m)) / pi);
	elseif (A <= 2.2e+139)
		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, -5e+205], N[(180.0 * N[(N[ArcTan[N[(0.0 / B$95$m), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision], If[LessEqual[A, 2.2e+139], 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 < -5.0000000000000002e205

   1. Initial program 54.3%

      \[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{\color{blue}{\tan^{-1} \left(\frac{\left(C + -1 \cdot A\right) - \sqrt{{B}^{2} + {\left(C + -1 \cdot A\right)}^{2}}}{B}\right)}}{\pi} \]
   3. Step-by-step derivation

      1. lower-atan.f64 N/A

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

      2. lower-/.f64 N/A

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

   4. Applied rewrites 78.1%

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

   5. Taylor expanded in C around inf

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

      1. distribute-rgt1-in N/A

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

      2. metadata-eval N/A

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

      3. *-commutative N/A

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

      4. mul0-lft N/A

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

      5. metadata-eval 13.1

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

   7. Applied rewrites 13.1%

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

   if -5.0000000000000002e205 < A < 2.1999999999999999e139

   1. Initial program 54.3%

      \[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. associate--r+ N/A

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

      2. lower--.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 65.4

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

   4. Applied rewrites 65.4%

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

   5. Taylor expanded in A around 0

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

      1. lift-/.f64 N/A

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

      2. lift--.f64 56.5

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

   7. Applied rewrites 56.5%

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

   if 2.1999999999999999e139 < A

   1. Initial program 54.3%

      \[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. associate--r+ N/A

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

      2. lower--.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 65.4

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

   4. Applied rewrites 65.4%

      \[\leadsto 180 \cdot \frac{\tan^{-1} \color{blue}{\left(\left(\frac{C}{B} - 1\right) - \frac{A}{B}\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 34.9

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

   7. Applied rewrites 34.9%

      \[\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 10: 63.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 -5 \cdot 10^{+205}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(\frac{0}{B\_m}\right)}{\pi}\\ \mathbf{elif}\;A \leq 2.25 \cdot 10^{+139}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(\frac{C}{B\_m} - 1\right)}{\pi}\\ \mathbf{else}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(\frac{-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 -5e+205)
    (* 180.0 (/ (atan (/ 0.0 B_m)) PI))
    (if (<= A 2.25e+139)
      (* 180.0 (/ (atan (- (/ C B_m) 1.0)) PI))
      (* 180.0 (/ (atan (/ (- 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 <= -5e+205) {
		tmp = 180.0 * (atan((0.0 / B_m)) / ((double) M_PI));
	} else if (A <= 2.25e+139) {
		tmp = 180.0 * (atan(((C / B_m) - 1.0)) / ((double) M_PI));
	} else {
		tmp = 180.0 * (atan((-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 <= -5e+205) {
		tmp = 180.0 * (Math.atan((0.0 / B_m)) / Math.PI);
	} else if (A <= 2.25e+139) {
		tmp = 180.0 * (Math.atan(((C / B_m) - 1.0)) / Math.PI);
	} else {
		tmp = 180.0 * (Math.atan((-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 <= -5e+205:
		tmp = 180.0 * (math.atan((0.0 / B_m)) / math.pi)
	elif A <= 2.25e+139:
		tmp = 180.0 * (math.atan(((C / B_m) - 1.0)) / math.pi)
	else:
		tmp = 180.0 * (math.atan((-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 <= -5e+205)
		tmp = Float64(180.0 * Float64(atan(Float64(0.0 / B_m)) / pi));
	elseif (A <= 2.25e+139)
		tmp = Float64(180.0 * Float64(atan(Float64(Float64(C / B_m) - 1.0)) / pi));
	else
		tmp = Float64(180.0 * Float64(atan(Float64(Float64(-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 <= -5e+205)
		tmp = 180.0 * (atan((0.0 / B_m)) / pi);
	elseif (A <= 2.25e+139)
		tmp = 180.0 * (atan(((C / B_m) - 1.0)) / pi);
	else
		tmp = 180.0 * (atan((-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, -5e+205], N[(180.0 * N[(N[ArcTan[N[(0.0 / B$95$m), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision], If[LessEqual[A, 2.25e+139], 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[((-A) / B$95$m), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if A < -5.0000000000000002e205

   1. Initial program 54.3%

      \[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{\color{blue}{\tan^{-1} \left(\frac{\left(C + -1 \cdot A\right) - \sqrt{{B}^{2} + {\left(C + -1 \cdot A\right)}^{2}}}{B}\right)}}{\pi} \]
   3. Step-by-step derivation

      1. lower-atan.f64 N/A

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

      2. lower-/.f64 N/A

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

   4. Applied rewrites 78.1%

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

   5. Taylor expanded in C around inf

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

      1. distribute-rgt1-in N/A

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

      2. metadata-eval N/A

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

      3. *-commutative N/A

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

      4. mul0-lft N/A

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

      5. metadata-eval 13.1

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

   7. Applied rewrites 13.1%

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

   if -5.0000000000000002e205 < A < 2.25e139

   1. Initial program 54.3%

      \[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. associate--r+ N/A

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

      2. lower--.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 65.4

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

   4. Applied rewrites 65.4%

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

   5. Taylor expanded in A around 0

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

      1. lift-/.f64 N/A

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

      2. lift--.f64 56.5

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

   7. Applied rewrites 56.5%

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

   if 2.25e139 < A

   1. Initial program 54.3%

      \[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. associate--r+ N/A

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

      2. lower--.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 65.4

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

   4. Applied rewrites 65.4%

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

   5. Taylor expanded in A around inf

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lift-neg.f64 N/A

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

      4. lower-/.f64 23.0

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

   7. Applied rewrites 23.0%

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

Alternative 11: 50.4% accurate, 2.4× 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 -4.5 \cdot 10^{+205}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(\frac{0}{B\_m}\right)}{\pi}\\ \mathbf{elif}\;A \leq 2.2 \cdot 10^{+139}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} -1}{\pi}\\ \mathbf{else}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(\frac{-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 -4.5e+205)
    (* 180.0 (/ (atan (/ 0.0 B_m)) PI))
    (if (<= A 2.2e+139)
      (* 180.0 (/ (atan -1.0) PI))
      (* 180.0 (/ (atan (/ (- 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 <= -4.5e+205) {
		tmp = 180.0 * (atan((0.0 / B_m)) / ((double) M_PI));
	} else if (A <= 2.2e+139) {
		tmp = 180.0 * (atan(-1.0) / ((double) M_PI));
	} else {
		tmp = 180.0 * (atan((-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 <= -4.5e+205) {
		tmp = 180.0 * (Math.atan((0.0 / B_m)) / Math.PI);
	} else if (A <= 2.2e+139) {
		tmp = 180.0 * (Math.atan(-1.0) / Math.PI);
	} else {
		tmp = 180.0 * (Math.atan((-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 <= -4.5e+205:
		tmp = 180.0 * (math.atan((0.0 / B_m)) / math.pi)
	elif A <= 2.2e+139:
		tmp = 180.0 * (math.atan(-1.0) / math.pi)
	else:
		tmp = 180.0 * (math.atan((-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 <= -4.5e+205)
		tmp = Float64(180.0 * Float64(atan(Float64(0.0 / B_m)) / pi));
	elseif (A <= 2.2e+139)
		tmp = Float64(180.0 * Float64(atan(-1.0) / pi));
	else
		tmp = Float64(180.0 * Float64(atan(Float64(Float64(-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 <= -4.5e+205)
		tmp = 180.0 * (atan((0.0 / B_m)) / pi);
	elseif (A <= 2.2e+139)
		tmp = 180.0 * (atan(-1.0) / pi);
	else
		tmp = 180.0 * (atan((-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, -4.5e+205], N[(180.0 * N[(N[ArcTan[N[(0.0 / B$95$m), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision], If[LessEqual[A, 2.2e+139], N[(180.0 * N[(N[ArcTan[-1.0], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision], N[(180.0 * N[(N[ArcTan[N[((-A) / B$95$m), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if A < -4.50000000000000035e205

   1. Initial program 54.3%

      \[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{\color{blue}{\tan^{-1} \left(\frac{\left(C + -1 \cdot A\right) - \sqrt{{B}^{2} + {\left(C + -1 \cdot A\right)}^{2}}}{B}\right)}}{\pi} \]
   3. Step-by-step derivation

      1. lower-atan.f64 N/A

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

      2. lower-/.f64 N/A

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

   4. Applied rewrites 78.1%

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

   5. Taylor expanded in C around inf

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

      1. distribute-rgt1-in N/A

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

      2. metadata-eval N/A

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

      3. *-commutative N/A

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

      4. mul0-lft N/A

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

      5. metadata-eval 13.1

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

   7. Applied rewrites 13.1%

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

   if -4.50000000000000035e205 < A < 2.1999999999999999e139

   1. Initial program 54.3%

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

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

   if 2.1999999999999999e139 < A

   1. Initial program 54.3%

      \[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. associate--r+ N/A

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

      2. lower--.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 65.4

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

   4. Applied rewrites 65.4%

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

   5. Taylor expanded in A around inf

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lift-neg.f64 N/A

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

      4. lower-/.f64 23.0

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

   7. Applied rewrites 23.0%

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

Alternative 12: 45.6% accurate, 2.8× 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.15 \cdot 10^{-150}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(\frac{0}{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.15e-150)
    (* 180.0 (/ (atan (/ 0.0 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.15e-150) {
		tmp = 180.0 * (atan((0.0 / 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.15e-150) {
		tmp = 180.0 * (Math.atan((0.0 / 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.15e-150:
		tmp = 180.0 * (math.atan((0.0 / 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.15e-150)
		tmp = Float64(180.0 * Float64(atan(Float64(0.0 / 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.15e-150)
		tmp = 180.0 * (atan((0.0 / 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.15e-150], N[(180.0 * N[(N[ArcTan[N[(0.0 / 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.15000000000000003e-150

   1. Initial program 54.3%

      \[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{\color{blue}{\tan^{-1} \left(\frac{\left(C + -1 \cdot A\right) - \sqrt{{B}^{2} + {\left(C + -1 \cdot A\right)}^{2}}}{B}\right)}}{\pi} \]
   3. Step-by-step derivation

      1. lower-atan.f64 N/A

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

      2. lower-/.f64 N/A

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

   4. Applied rewrites 78.1%

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

   5. Taylor expanded in C around inf

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

      1. distribute-rgt1-in N/A

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

      2. metadata-eval N/A

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

      3. *-commutative N/A

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

      4. mul0-lft N/A

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

      5. metadata-eval 13.1

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

   7. Applied rewrites 13.1%

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

   if 4.15000000000000003e-150 < B

   1. Initial program 54.3%

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

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

Alternative 13: 40.4% 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.3%

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

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

Reproduce

herbie shell --seed 2025142 
(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)))