ABCF->ab-angle angle

Percentage Accurate: 53.5% → 88.4%

Time: 5.8s

Alternatives: 18

Speedup: 2.3×

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: 53.5% 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: 88.4% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{1}{B} \cdot \left(\left(C - A\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)\\ t_1 := \left(-A\right) + C\\ t_2 := 180 \cdot \frac{\tan^{-1} \left(\frac{t\_1 - \mathsf{hypot}\left(t\_1, B\right)}{B}\right)}{\pi}\\ \mathbf{if}\;t\_0 \leq -0.5:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_0 \leq 0:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(\frac{B}{C - A} \cdot -0.5\right)}{\pi}\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (A B C)
 :precision binary64
 (let* ((t_0
         (* (/ 1.0 B) (- (- C A) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))))
        (t_1 (+ (- A) C))
        (t_2 (* 180.0 (/ (atan (/ (- t_1 (hypot t_1 B)) B)) PI))))
   (if (<= t_0 -0.5)
     t_2
     (if (<= t_0 0.0) (* 180.0 (/ (atan (* (/ B (- C A)) -0.5)) PI)) t_2))))

C

double code(double A, double B, double C) {
	double t_0 = (1.0 / B) * ((C - A) - sqrt((pow((A - C), 2.0) + pow(B, 2.0))));
	double t_1 = -A + C;
	double t_2 = 180.0 * (atan(((t_1 - hypot(t_1, B)) / B)) / ((double) M_PI));
	double tmp;
	if (t_0 <= -0.5) {
		tmp = t_2;
	} else if (t_0 <= 0.0) {
		tmp = 180.0 * (atan(((B / (C - A)) * -0.5)) / ((double) M_PI));
	} else {
		tmp = t_2;
	}
	return tmp;
}

Java

public static double code(double A, double B, double C) {
	double t_0 = (1.0 / B) * ((C - A) - Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0))));
	double t_1 = -A + C;
	double t_2 = 180.0 * (Math.atan(((t_1 - Math.hypot(t_1, B)) / B)) / Math.PI);
	double tmp;
	if (t_0 <= -0.5) {
		tmp = t_2;
	} else if (t_0 <= 0.0) {
		tmp = 180.0 * (Math.atan(((B / (C - A)) * -0.5)) / Math.PI);
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

def code(A, B, C):
	t_0 = (1.0 / B) * ((C - A) - math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0))))
	t_1 = -A + C
	t_2 = 180.0 * (math.atan(((t_1 - math.hypot(t_1, B)) / B)) / math.pi)
	tmp = 0
	if t_0 <= -0.5:
		tmp = t_2
	elif t_0 <= 0.0:
		tmp = 180.0 * (math.atan(((B / (C - A)) * -0.5)) / math.pi)
	else:
		tmp = t_2
	return tmp

Julia

function code(A, B, C)
	t_0 = Float64(Float64(1.0 / B) * Float64(Float64(C - A) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0)))))
	t_1 = Float64(Float64(-A) + C)
	t_2 = Float64(180.0 * Float64(atan(Float64(Float64(t_1 - hypot(t_1, B)) / B)) / pi))
	tmp = 0.0
	if (t_0 <= -0.5)
		tmp = t_2;
	elseif (t_0 <= 0.0)
		tmp = Float64(180.0 * Float64(atan(Float64(Float64(B / Float64(C - A)) * -0.5)) / pi));
	else
		tmp = t_2;
	end
	return tmp
end

MATLAB

function tmp_2 = code(A, B, C)
	t_0 = (1.0 / B) * ((C - A) - sqrt((((A - C) ^ 2.0) + (B ^ 2.0))));
	t_1 = -A + C;
	t_2 = 180.0 * (atan(((t_1 - hypot(t_1, B)) / B)) / pi);
	tmp = 0.0;
	if (t_0 <= -0.5)
		tmp = t_2;
	elseif (t_0 <= 0.0)
		tmp = 180.0 * (atan(((B / (C - A)) * -0.5)) / pi);
	else
		tmp = t_2;
	end
	tmp_2 = tmp;
end

Wolfram

code[A_, B_, C_] := Block[{t$95$0 = 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]}, Block[{t$95$1 = N[((-A) + C), $MachinePrecision]}, Block[{t$95$2 = N[(180.0 * N[(N[ArcTan[N[(N[(t$95$1 - N[Sqrt[t$95$1 ^ 2 + B ^ 2], $MachinePrecision]), $MachinePrecision] / B), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -0.5], t$95$2, If[LessEqual[t$95$0, 0.0], N[(180.0 * N[(N[ArcTan[N[(N[(B / N[(C - A), $MachinePrecision]), $MachinePrecision] * -0.5), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision], t$95$2]]]]]

Derivation

1. Split input into 2 regimes

2. if (*.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)))))) < -0.5 or -0.0 < (*.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))))))

   1. Initial program 59.2%

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

      \[\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 -0.5 < (*.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)))))) < -0.0

   1. Initial program 18.0%

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

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

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 97.3

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

   7. Applied rewrites 97.3%

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

Alternative 2: 80.8% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;C \leq 4.5 \cdot 10^{+37}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(\frac{\left(C - A\right) - \mathsf{hypot}\left(-A, B\right)}{B}\right)}{\pi}\\ \mathbf{else}:\\ \;\;\;\;\frac{180 \cdot \tan^{-1} \left(\frac{B}{C - A} \cdot -0.5\right)}{\pi}\\ \end{array} \end{array} \]

FPCore

(FPCore (A B C)
 :precision binary64
 (if (<= C 4.5e+37)
   (* 180.0 (/ (atan (/ (- (- C A) (hypot (- A) B)) B)) PI))
   (/ (* 180.0 (atan (* (/ B (- C A)) -0.5))) PI)))

C

double code(double A, double B, double C) {
	double tmp;
	if (C <= 4.5e+37) {
		tmp = 180.0 * (atan((((C - A) - hypot(-A, B)) / B)) / ((double) M_PI));
	} else {
		tmp = (180.0 * atan(((B / (C - A)) * -0.5))) / ((double) M_PI);
	}
	return tmp;
}

Java

public static double code(double A, double B, double C) {
	double tmp;
	if (C <= 4.5e+37) {
		tmp = 180.0 * (Math.atan((((C - A) - Math.hypot(-A, B)) / B)) / Math.PI);
	} else {
		tmp = (180.0 * Math.atan(((B / (C - A)) * -0.5))) / Math.PI;
	}
	return tmp;
}

Python

def code(A, B, C):
	tmp = 0
	if C <= 4.5e+37:
		tmp = 180.0 * (math.atan((((C - A) - math.hypot(-A, B)) / B)) / math.pi)
	else:
		tmp = (180.0 * math.atan(((B / (C - A)) * -0.5))) / math.pi
	return tmp

Julia

function code(A, B, C)
	tmp = 0.0
	if (C <= 4.5e+37)
		tmp = Float64(180.0 * Float64(atan(Float64(Float64(Float64(C - A) - hypot(Float64(-A), B)) / B)) / pi));
	else
		tmp = Float64(Float64(180.0 * atan(Float64(Float64(B / Float64(C - A)) * -0.5))) / pi);
	end
	return tmp
end

MATLAB

function tmp_2 = code(A, B, C)
	tmp = 0.0;
	if (C <= 4.5e+37)
		tmp = 180.0 * (atan((((C - A) - hypot(-A, B)) / B)) / pi);
	else
		tmp = (180.0 * atan(((B / (C - A)) * -0.5))) / pi;
	end
	tmp_2 = tmp;
end

Wolfram

code[A_, B_, C_] := If[LessEqual[C, 4.5e+37], N[(180.0 * N[(N[ArcTan[N[(N[(N[(C - A), $MachinePrecision] - N[Sqrt[(-A) ^ 2 + B ^ 2], $MachinePrecision]), $MachinePrecision] / B), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision], N[(N[(180.0 * N[ArcTan[N[(N[(B / N[(C - A), $MachinePrecision]), $MachinePrecision] * -0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / Pi), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if C < 4.49999999999999962e37

   1. Initial program 62.1%

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

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

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

      1. mul-1-neg N/A

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

      2. lift-neg.f64 82.6

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

   7. Applied rewrites 82.6%

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

   8. Taylor expanded in C around 0

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

      1. lift--.f64 82.6

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

   10. Applied rewrites 82.6%

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

   if 4.49999999999999962e37 < C

   1. Initial program 23.4%

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

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

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

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

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 74.4

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

   9. Applied rewrites 74.4%

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

Alternative 3: 78.8% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 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}\\ \mathbf{if}\;t\_0 \leq -40:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(\frac{\left(\left(-A\right) + C\right) - B}{B}\right)}{\pi}\\ \mathbf{elif}\;t\_0 \leq 0:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(\frac{B}{C - A} \cdot -0.5\right)}{\pi}\\ \mathbf{else}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(1 + \frac{C - A}{B}\right)}{\pi}\\ \end{array} \end{array} \]

FPCore

(FPCore (A B C)
 :precision binary64
 (let* ((t_0
         (*
          180.0
          (/
           (atan
            (* (/ 1.0 B) (- (- C A) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))))
           PI))))
   (if (<= t_0 -40.0)
     (* 180.0 (/ (atan (/ (- (+ (- A) C) B) B)) PI))
     (if (<= t_0 0.0)
       (* 180.0 (/ (atan (* (/ B (- C A)) -0.5)) PI))
       (* 180.0 (/ (atan (+ 1.0 (/ (- C A) B))) PI))))))

C

double code(double A, double B, double C) {
	double t_0 = 180.0 * (atan(((1.0 / B) * ((C - A) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / ((double) M_PI));
	double tmp;
	if (t_0 <= -40.0) {
		tmp = 180.0 * (atan((((-A + C) - B) / B)) / ((double) M_PI));
	} else if (t_0 <= 0.0) {
		tmp = 180.0 * (atan(((B / (C - A)) * -0.5)) / ((double) M_PI));
	} else {
		tmp = 180.0 * (atan((1.0 + ((C - A) / B))) / ((double) M_PI));
	}
	return tmp;
}

Java

public static double code(double A, double B, double C) {
	double t_0 = 180.0 * (Math.atan(((1.0 / B) * ((C - A) - Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / Math.PI);
	double tmp;
	if (t_0 <= -40.0) {
		tmp = 180.0 * (Math.atan((((-A + C) - B) / B)) / Math.PI);
	} else if (t_0 <= 0.0) {
		tmp = 180.0 * (Math.atan(((B / (C - A)) * -0.5)) / Math.PI);
	} else {
		tmp = 180.0 * (Math.atan((1.0 + ((C - A) / B))) / Math.PI);
	}
	return tmp;
}

Python

def code(A, B, C):
	t_0 = 180.0 * (math.atan(((1.0 / B) * ((C - A) - math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / math.pi)
	tmp = 0
	if t_0 <= -40.0:
		tmp = 180.0 * (math.atan((((-A + C) - B) / B)) / math.pi)
	elif t_0 <= 0.0:
		tmp = 180.0 * (math.atan(((B / (C - A)) * -0.5)) / math.pi)
	else:
		tmp = 180.0 * (math.atan((1.0 + ((C - A) / B))) / math.pi)
	return tmp

Julia

function code(A, B, C)
	t_0 = 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))
	tmp = 0.0
	if (t_0 <= -40.0)
		tmp = Float64(180.0 * Float64(atan(Float64(Float64(Float64(Float64(-A) + C) - B) / B)) / pi));
	elseif (t_0 <= 0.0)
		tmp = Float64(180.0 * Float64(atan(Float64(Float64(B / Float64(C - A)) * -0.5)) / pi));
	else
		tmp = Float64(180.0 * Float64(atan(Float64(1.0 + Float64(Float64(C - A) / B))) / pi));
	end
	return tmp
end

MATLAB

function tmp_2 = code(A, B, C)
	t_0 = 180.0 * (atan(((1.0 / B) * ((C - A) - sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / pi);
	tmp = 0.0;
	if (t_0 <= -40.0)
		tmp = 180.0 * (atan((((-A + C) - B) / B)) / pi);
	elseif (t_0 <= 0.0)
		tmp = 180.0 * (atan(((B / (C - A)) * -0.5)) / pi);
	else
		tmp = 180.0 * (atan((1.0 + ((C - A) / B))) / pi);
	end
	tmp_2 = tmp;
end

Wolfram

code[A_, B_, C_] := Block[{t$95$0 = 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]}, If[LessEqual[t$95$0, -40.0], N[(180.0 * N[(N[ArcTan[N[(N[(N[((-A) + C), $MachinePrecision] - B), $MachinePrecision] / B), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 0.0], N[(180.0 * N[(N[ArcTan[N[(N[(B / N[(C - A), $MachinePrecision]), $MachinePrecision] * -0.5), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision], N[(180.0 * N[(N[ArcTan[N[(1.0 + N[(N[(C - A), $MachinePrecision] / B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 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 59.5%

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

      \[\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 B around inf

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

   7. Applied rewrites 76.1%

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

   1. Initial program 18.0%

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

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

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 97.2

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

   7. Applied rewrites 97.2%

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

   if -0.0 < (*.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 58.8%

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

      1. associate--l+ N/A

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

      2. div-sub N/A

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

      3. lower-+.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 75.4

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

   4. Applied rewrites 75.4%

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

Alternative 4: 78.8% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 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}\\ \mathbf{if}\;t\_0 \leq -40:\\ \;\;\;\;\frac{180 \cdot \tan^{-1} \left(\frac{\left(\left(-A\right) + C\right) - B}{B}\right)}{\pi}\\ \mathbf{elif}\;t\_0 \leq 0:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(\frac{B}{C - A} \cdot -0.5\right)}{\pi}\\ \mathbf{else}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(1 + \frac{C - A}{B}\right)}{\pi}\\ \end{array} \end{array} \]

FPCore

(FPCore (A B C)
 :precision binary64
 (let* ((t_0
         (*
          180.0
          (/
           (atan
            (* (/ 1.0 B) (- (- C A) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))))
           PI))))
   (if (<= t_0 -40.0)
     (/ (* 180.0 (atan (/ (- (+ (- A) C) B) B))) PI)
     (if (<= t_0 0.0)
       (* 180.0 (/ (atan (* (/ B (- C A)) -0.5)) PI))
       (* 180.0 (/ (atan (+ 1.0 (/ (- C A) B))) PI))))))

C

double code(double A, double B, double C) {
	double t_0 = 180.0 * (atan(((1.0 / B) * ((C - A) - sqrt((pow((A - C), 2.0) + pow(B, 2.0)))))) / ((double) M_PI));
	double tmp;
	if (t_0 <= -40.0) {
		tmp = (180.0 * atan((((-A + C) - B) / B))) / ((double) M_PI);
	} else if (t_0 <= 0.0) {
		tmp = 180.0 * (atan(((B / (C - A)) * -0.5)) / ((double) M_PI));
	} else {
		tmp = 180.0 * (atan((1.0 + ((C - A) / B))) / ((double) M_PI));
	}
	return tmp;
}

Java

public static double code(double A, double B, double C) {
	double t_0 = 180.0 * (Math.atan(((1.0 / B) * ((C - A) - Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0)))))) / Math.PI);
	double tmp;
	if (t_0 <= -40.0) {
		tmp = (180.0 * Math.atan((((-A + C) - B) / B))) / Math.PI;
	} else if (t_0 <= 0.0) {
		tmp = 180.0 * (Math.atan(((B / (C - A)) * -0.5)) / Math.PI);
	} else {
		tmp = 180.0 * (Math.atan((1.0 + ((C - A) / B))) / Math.PI);
	}
	return tmp;
}

Python

def code(A, B, C):
	t_0 = 180.0 * (math.atan(((1.0 / B) * ((C - A) - math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0)))))) / math.pi)
	tmp = 0
	if t_0 <= -40.0:
		tmp = (180.0 * math.atan((((-A + C) - B) / B))) / math.pi
	elif t_0 <= 0.0:
		tmp = 180.0 * (math.atan(((B / (C - A)) * -0.5)) / math.pi)
	else:
		tmp = 180.0 * (math.atan((1.0 + ((C - A) / B))) / math.pi)
	return tmp

Julia

function code(A, B, C)
	t_0 = 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))
	tmp = 0.0
	if (t_0 <= -40.0)
		tmp = Float64(Float64(180.0 * atan(Float64(Float64(Float64(Float64(-A) + C) - B) / B))) / pi);
	elseif (t_0 <= 0.0)
		tmp = Float64(180.0 * Float64(atan(Float64(Float64(B / Float64(C - A)) * -0.5)) / pi));
	else
		tmp = Float64(180.0 * Float64(atan(Float64(1.0 + Float64(Float64(C - A) / B))) / pi));
	end
	return tmp
end

MATLAB

function tmp_2 = code(A, B, C)
	t_0 = 180.0 * (atan(((1.0 / B) * ((C - A) - sqrt((((A - C) ^ 2.0) + (B ^ 2.0)))))) / pi);
	tmp = 0.0;
	if (t_0 <= -40.0)
		tmp = (180.0 * atan((((-A + C) - B) / B))) / pi;
	elseif (t_0 <= 0.0)
		tmp = 180.0 * (atan(((B / (C - A)) * -0.5)) / pi);
	else
		tmp = 180.0 * (atan((1.0 + ((C - A) / B))) / pi);
	end
	tmp_2 = tmp;
end

Wolfram

code[A_, B_, C_] := Block[{t$95$0 = 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]}, If[LessEqual[t$95$0, -40.0], N[(N[(180.0 * N[ArcTan[N[(N[(N[((-A) + C), $MachinePrecision] - B), $MachinePrecision] / B), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / Pi), $MachinePrecision], If[LessEqual[t$95$0, 0.0], N[(180.0 * N[(N[ArcTan[N[(N[(B / N[(C - A), $MachinePrecision]), $MachinePrecision] * -0.5), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision], N[(180.0 * N[(N[ArcTan[N[(1.0 + N[(N[(C - A), $MachinePrecision] / B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 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 59.5%

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

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

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

      \[\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 B around inf

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

   9. Applied rewrites 76.1%

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

   1. Initial program 18.0%

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

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

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 97.2

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

   7. Applied rewrites 97.2%

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

   if -0.0 < (*.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 58.8%

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

      1. associate--l+ N/A

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

      2. div-sub N/A

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

      3. lower-+.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 75.4

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

   4. Applied rewrites 75.4%

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

Alternative 5: 69.8% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{C - A}{B}\\ t_1 := \frac{1}{B} \cdot \left(\left(C - A\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)\\ t_2 := \tan^{-1} \left(\frac{B}{C - A} \cdot -0.5\right)\\ \mathbf{if}\;t\_1 \leq -\infty:\\ \;\;\;\;\frac{180 \cdot t\_2}{\pi}\\ \mathbf{elif}\;t\_1 \leq -1000000:\\ \;\;\;\;\frac{180 \cdot \tan^{-1} \left(t\_0 + 1\right)}{\pi}\\ \mathbf{elif}\;t\_1 \leq -0.5:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} -1}{\pi}\\ \mathbf{elif}\;t\_1 \leq 0:\\ \;\;\;\;180 \cdot \frac{t\_2}{\pi}\\ \mathbf{else}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(1 + t\_0\right)}{\pi}\\ \end{array} \end{array} \]

FPCore

(FPCore (A B C)
 :precision binary64
 (let* ((t_0 (/ (- C A) B))
        (t_1
         (* (/ 1.0 B) (- (- C A) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))))
        (t_2 (atan (* (/ B (- C A)) -0.5))))
   (if (<= t_1 (- INFINITY))
     (/ (* 180.0 t_2) PI)
     (if (<= t_1 -1000000.0)
       (/ (* 180.0 (atan (+ t_0 1.0))) PI)
       (if (<= t_1 -0.5)
         (* 180.0 (/ (atan -1.0) PI))
         (if (<= t_1 0.0)
           (* 180.0 (/ t_2 PI))
           (* 180.0 (/ (atan (+ 1.0 t_0)) PI))))))))

C

double code(double A, double B, double C) {
	double t_0 = (C - A) / B;
	double t_1 = (1.0 / B) * ((C - A) - sqrt((pow((A - C), 2.0) + pow(B, 2.0))));
	double t_2 = atan(((B / (C - A)) * -0.5));
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = (180.0 * t_2) / ((double) M_PI);
	} else if (t_1 <= -1000000.0) {
		tmp = (180.0 * atan((t_0 + 1.0))) / ((double) M_PI);
	} else if (t_1 <= -0.5) {
		tmp = 180.0 * (atan(-1.0) / ((double) M_PI));
	} else if (t_1 <= 0.0) {
		tmp = 180.0 * (t_2 / ((double) M_PI));
	} else {
		tmp = 180.0 * (atan((1.0 + t_0)) / ((double) M_PI));
	}
	return tmp;
}

Java

public static double code(double A, double B, double C) {
	double t_0 = (C - A) / B;
	double t_1 = (1.0 / B) * ((C - A) - Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0))));
	double t_2 = Math.atan(((B / (C - A)) * -0.5));
	double tmp;
	if (t_1 <= -Double.POSITIVE_INFINITY) {
		tmp = (180.0 * t_2) / Math.PI;
	} else if (t_1 <= -1000000.0) {
		tmp = (180.0 * Math.atan((t_0 + 1.0))) / Math.PI;
	} else if (t_1 <= -0.5) {
		tmp = 180.0 * (Math.atan(-1.0) / Math.PI);
	} else if (t_1 <= 0.0) {
		tmp = 180.0 * (t_2 / Math.PI);
	} else {
		tmp = 180.0 * (Math.atan((1.0 + t_0)) / Math.PI);
	}
	return tmp;
}

Python

def code(A, B, C):
	t_0 = (C - A) / B
	t_1 = (1.0 / B) * ((C - A) - math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0))))
	t_2 = math.atan(((B / (C - A)) * -0.5))
	tmp = 0
	if t_1 <= -math.inf:
		tmp = (180.0 * t_2) / math.pi
	elif t_1 <= -1000000.0:
		tmp = (180.0 * math.atan((t_0 + 1.0))) / math.pi
	elif t_1 <= -0.5:
		tmp = 180.0 * (math.atan(-1.0) / math.pi)
	elif t_1 <= 0.0:
		tmp = 180.0 * (t_2 / math.pi)
	else:
		tmp = 180.0 * (math.atan((1.0 + t_0)) / math.pi)
	return tmp

Julia

function code(A, B, C)
	t_0 = Float64(Float64(C - A) / B)
	t_1 = Float64(Float64(1.0 / B) * Float64(Float64(C - A) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0)))))
	t_2 = atan(Float64(Float64(B / Float64(C - A)) * -0.5))
	tmp = 0.0
	if (t_1 <= Float64(-Inf))
		tmp = Float64(Float64(180.0 * t_2) / pi);
	elseif (t_1 <= -1000000.0)
		tmp = Float64(Float64(180.0 * atan(Float64(t_0 + 1.0))) / pi);
	elseif (t_1 <= -0.5)
		tmp = Float64(180.0 * Float64(atan(-1.0) / pi));
	elseif (t_1 <= 0.0)
		tmp = Float64(180.0 * Float64(t_2 / pi));
	else
		tmp = Float64(180.0 * Float64(atan(Float64(1.0 + t_0)) / pi));
	end
	return tmp
end

MATLAB

function tmp_2 = code(A, B, C)
	t_0 = (C - A) / B;
	t_1 = (1.0 / B) * ((C - A) - sqrt((((A - C) ^ 2.0) + (B ^ 2.0))));
	t_2 = atan(((B / (C - A)) * -0.5));
	tmp = 0.0;
	if (t_1 <= -Inf)
		tmp = (180.0 * t_2) / pi;
	elseif (t_1 <= -1000000.0)
		tmp = (180.0 * atan((t_0 + 1.0))) / pi;
	elseif (t_1 <= -0.5)
		tmp = 180.0 * (atan(-1.0) / pi);
	elseif (t_1 <= 0.0)
		tmp = 180.0 * (t_2 / pi);
	else
		tmp = 180.0 * (atan((1.0 + t_0)) / pi);
	end
	tmp_2 = tmp;
end

Wolfram

code[A_, B_, C_] := Block[{t$95$0 = N[(N[(C - A), $MachinePrecision] / B), $MachinePrecision]}, Block[{t$95$1 = 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]}, Block[{t$95$2 = N[ArcTan[N[(N[(B / N[(C - A), $MachinePrecision]), $MachinePrecision] * -0.5), $MachinePrecision]], $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(N[(180.0 * t$95$2), $MachinePrecision] / Pi), $MachinePrecision], If[LessEqual[t$95$1, -1000000.0], N[(N[(180.0 * N[ArcTan[N[(t$95$0 + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / Pi), $MachinePrecision], If[LessEqual[t$95$1, -0.5], N[(180.0 * N[(N[ArcTan[-1.0], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 0.0], N[(180.0 * N[(t$95$2 / Pi), $MachinePrecision]), $MachinePrecision], N[(180.0 * N[(N[ArcTan[N[(1.0 + t$95$0), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision]]]]]]]]

Derivation

1. Split input into 5 regimes

2. if (*.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)))))) < -inf.0

   1. Initial program 42.0%

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

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

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

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

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 37.2

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

   9. Applied rewrites 37.2%

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

   if -inf.0 < (*.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)))))) < -1e6

   1. Initial program 96.6%

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

   2. Taylor expanded in B around -inf

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

      1. associate--l+ N/A

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

      2. div-sub N/A

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

      3. lower-+.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 95.7

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

   4. Applied rewrites 95.7%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*r/ N/A

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

      4. lower-/.f64 N/A

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

   6. Applied rewrites 95.7%

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

   if -1e6 < (*.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)))))) < -0.5

   1. Initial program 99.5%

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

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

   if -0.5 < (*.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)))))) < -0.0

   1. Initial program 18.0%

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

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

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 97.3

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

   7. Applied rewrites 97.3%

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

   if -0.0 < (*.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))))))

   1. Initial program 58.8%

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

      1. associate--l+ N/A

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

      2. div-sub N/A

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

      3. lower-+.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 75.4

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

   4. Applied rewrites 75.4%

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

Alternative 6: 69.8% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{C - A}{B}\\ t_1 := \frac{1}{B} \cdot \left(\left(C - A\right) - \sqrt{{\left(A - C\right)}^{2} + {B}^{2}}\right)\\ t_2 := \frac{180 \cdot \tan^{-1} \left(\frac{B}{C - A} \cdot -0.5\right)}{\pi}\\ \mathbf{if}\;t\_1 \leq -\infty:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq -1000000:\\ \;\;\;\;\frac{180 \cdot \tan^{-1} \left(t\_0 + 1\right)}{\pi}\\ \mathbf{elif}\;t\_1 \leq -0.5:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} -1}{\pi}\\ \mathbf{elif}\;t\_1 \leq 0:\\ \;\;\;\;t\_2\\ \mathbf{else}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(1 + t\_0\right)}{\pi}\\ \end{array} \end{array} \]

FPCore

(FPCore (A B C)
 :precision binary64
 (let* ((t_0 (/ (- C A) B))
        (t_1
         (* (/ 1.0 B) (- (- C A) (sqrt (+ (pow (- A C) 2.0) (pow B 2.0))))))
        (t_2 (/ (* 180.0 (atan (* (/ B (- C A)) -0.5))) PI)))
   (if (<= t_1 (- INFINITY))
     t_2
     (if (<= t_1 -1000000.0)
       (/ (* 180.0 (atan (+ t_0 1.0))) PI)
       (if (<= t_1 -0.5)
         (* 180.0 (/ (atan -1.0) PI))
         (if (<= t_1 0.0) t_2 (* 180.0 (/ (atan (+ 1.0 t_0)) PI))))))))

C

double code(double A, double B, double C) {
	double t_0 = (C - A) / B;
	double t_1 = (1.0 / B) * ((C - A) - sqrt((pow((A - C), 2.0) + pow(B, 2.0))));
	double t_2 = (180.0 * atan(((B / (C - A)) * -0.5))) / ((double) M_PI);
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = t_2;
	} else if (t_1 <= -1000000.0) {
		tmp = (180.0 * atan((t_0 + 1.0))) / ((double) M_PI);
	} else if (t_1 <= -0.5) {
		tmp = 180.0 * (atan(-1.0) / ((double) M_PI));
	} else if (t_1 <= 0.0) {
		tmp = t_2;
	} else {
		tmp = 180.0 * (atan((1.0 + t_0)) / ((double) M_PI));
	}
	return tmp;
}

Java

public static double code(double A, double B, double C) {
	double t_0 = (C - A) / B;
	double t_1 = (1.0 / B) * ((C - A) - Math.sqrt((Math.pow((A - C), 2.0) + Math.pow(B, 2.0))));
	double t_2 = (180.0 * Math.atan(((B / (C - A)) * -0.5))) / Math.PI;
	double tmp;
	if (t_1 <= -Double.POSITIVE_INFINITY) {
		tmp = t_2;
	} else if (t_1 <= -1000000.0) {
		tmp = (180.0 * Math.atan((t_0 + 1.0))) / Math.PI;
	} else if (t_1 <= -0.5) {
		tmp = 180.0 * (Math.atan(-1.0) / Math.PI);
	} else if (t_1 <= 0.0) {
		tmp = t_2;
	} else {
		tmp = 180.0 * (Math.atan((1.0 + t_0)) / Math.PI);
	}
	return tmp;
}

Python

def code(A, B, C):
	t_0 = (C - A) / B
	t_1 = (1.0 / B) * ((C - A) - math.sqrt((math.pow((A - C), 2.0) + math.pow(B, 2.0))))
	t_2 = (180.0 * math.atan(((B / (C - A)) * -0.5))) / math.pi
	tmp = 0
	if t_1 <= -math.inf:
		tmp = t_2
	elif t_1 <= -1000000.0:
		tmp = (180.0 * math.atan((t_0 + 1.0))) / math.pi
	elif t_1 <= -0.5:
		tmp = 180.0 * (math.atan(-1.0) / math.pi)
	elif t_1 <= 0.0:
		tmp = t_2
	else:
		tmp = 180.0 * (math.atan((1.0 + t_0)) / math.pi)
	return tmp

Julia

function code(A, B, C)
	t_0 = Float64(Float64(C - A) / B)
	t_1 = Float64(Float64(1.0 / B) * Float64(Float64(C - A) - sqrt(Float64((Float64(A - C) ^ 2.0) + (B ^ 2.0)))))
	t_2 = Float64(Float64(180.0 * atan(Float64(Float64(B / Float64(C - A)) * -0.5))) / pi)
	tmp = 0.0
	if (t_1 <= Float64(-Inf))
		tmp = t_2;
	elseif (t_1 <= -1000000.0)
		tmp = Float64(Float64(180.0 * atan(Float64(t_0 + 1.0))) / pi);
	elseif (t_1 <= -0.5)
		tmp = Float64(180.0 * Float64(atan(-1.0) / pi));
	elseif (t_1 <= 0.0)
		tmp = t_2;
	else
		tmp = Float64(180.0 * Float64(atan(Float64(1.0 + t_0)) / pi));
	end
	return tmp
end

MATLAB

function tmp_2 = code(A, B, C)
	t_0 = (C - A) / B;
	t_1 = (1.0 / B) * ((C - A) - sqrt((((A - C) ^ 2.0) + (B ^ 2.0))));
	t_2 = (180.0 * atan(((B / (C - A)) * -0.5))) / pi;
	tmp = 0.0;
	if (t_1 <= -Inf)
		tmp = t_2;
	elseif (t_1 <= -1000000.0)
		tmp = (180.0 * atan((t_0 + 1.0))) / pi;
	elseif (t_1 <= -0.5)
		tmp = 180.0 * (atan(-1.0) / pi);
	elseif (t_1 <= 0.0)
		tmp = t_2;
	else
		tmp = 180.0 * (atan((1.0 + t_0)) / pi);
	end
	tmp_2 = tmp;
end

Wolfram

code[A_, B_, C_] := Block[{t$95$0 = N[(N[(C - A), $MachinePrecision] / B), $MachinePrecision]}, Block[{t$95$1 = 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]}, Block[{t$95$2 = N[(N[(180.0 * N[ArcTan[N[(N[(B / N[(C - A), $MachinePrecision]), $MachinePrecision] * -0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / Pi), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], t$95$2, If[LessEqual[t$95$1, -1000000.0], N[(N[(180.0 * N[ArcTan[N[(t$95$0 + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / Pi), $MachinePrecision], If[LessEqual[t$95$1, -0.5], N[(180.0 * N[(N[ArcTan[-1.0], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 0.0], t$95$2, N[(180.0 * N[(N[ArcTan[N[(1.0 + t$95$0), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision]]]]]]]]

Derivation

1. Split input into 4 regimes

2. if (*.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)))))) < -inf.0 or -0.5 < (*.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)))))) < -0.0

   1. Initial program 34.4%

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

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

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

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

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 56.3

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

   9. Applied rewrites 56.3%

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

   if -inf.0 < (*.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)))))) < -1e6

   1. Initial program 96.6%

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

   2. Taylor expanded in B around -inf

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

      1. associate--l+ N/A

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

      2. div-sub N/A

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

      3. lower-+.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 95.7

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

   4. Applied rewrites 95.7%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*r/ N/A

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

      4. lower-/.f64 N/A

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

   6. Applied rewrites 95.7%

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

   if -1e6 < (*.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)))))) < -0.5

   1. Initial program 99.5%

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

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

   if -0.0 < (*.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))))))

   1. Initial program 58.8%

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

      1. associate--l+ N/A

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

      2. div-sub N/A

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

      3. lower-+.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 75.4

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

   4. Applied rewrites 75.4%

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

Alternative 7: 60.8% accurate, 2.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;C \leq 6.1 \cdot 10^{+29}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(1 + \frac{C - A}{B}\right)}{\pi}\\ \mathbf{else}:\\ \;\;\;\;\frac{180 \cdot \tan^{-1} \left(\frac{B}{C} \cdot -0.5\right)}{\pi}\\ \end{array} \end{array} \]

FPCore

(FPCore (A B C)
 :precision binary64
 (if (<= C 6.1e+29)
   (* 180.0 (/ (atan (+ 1.0 (/ (- C A) B))) PI))
   (/ (* 180.0 (atan (* (/ B C) -0.5))) PI)))

C

double code(double A, double B, double C) {
	double tmp;
	if (C <= 6.1e+29) {
		tmp = 180.0 * (atan((1.0 + ((C - A) / B))) / ((double) M_PI));
	} else {
		tmp = (180.0 * atan(((B / C) * -0.5))) / ((double) M_PI);
	}
	return tmp;
}

Java

public static double code(double A, double B, double C) {
	double tmp;
	if (C <= 6.1e+29) {
		tmp = 180.0 * (Math.atan((1.0 + ((C - A) / B))) / Math.PI);
	} else {
		tmp = (180.0 * Math.atan(((B / C) * -0.5))) / Math.PI;
	}
	return tmp;
}

Python

def code(A, B, C):
	tmp = 0
	if C <= 6.1e+29:
		tmp = 180.0 * (math.atan((1.0 + ((C - A) / B))) / math.pi)
	else:
		tmp = (180.0 * math.atan(((B / C) * -0.5))) / math.pi
	return tmp

Julia

function code(A, B, C)
	tmp = 0.0
	if (C <= 6.1e+29)
		tmp = Float64(180.0 * Float64(atan(Float64(1.0 + Float64(Float64(C - A) / B))) / pi));
	else
		tmp = Float64(Float64(180.0 * atan(Float64(Float64(B / C) * -0.5))) / pi);
	end
	return tmp
end

MATLAB

function tmp_2 = code(A, B, C)
	tmp = 0.0;
	if (C <= 6.1e+29)
		tmp = 180.0 * (atan((1.0 + ((C - A) / B))) / pi);
	else
		tmp = (180.0 * atan(((B / C) * -0.5))) / pi;
	end
	tmp_2 = tmp;
end

Wolfram

code[A_, B_, C_] := If[LessEqual[C, 6.1e+29], N[(180.0 * N[(N[ArcTan[N[(1.0 + N[(N[(C - A), $MachinePrecision] / B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision], N[(N[(180.0 * N[ArcTan[N[(N[(B / C), $MachinePrecision] * -0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / Pi), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if C < 6.0999999999999998e29

   1. Initial program 62.4%

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

      1. associate--l+ N/A

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

      2. div-sub N/A

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

      3. lower-+.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 58.4

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

   4. Applied rewrites 58.4%

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

   if 6.0999999999999998e29 < C

   1. Initial program 23.7%

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

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

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

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

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 74.0

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

   9. Applied rewrites 74.0%

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

   10. Taylor expanded in A around 0

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

   12. Applied rewrites 69.1%

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

Alternative 8: 60.8% accurate, 2.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;C \leq 6.1 \cdot 10^{+29}:\\ \;\;\;\;\frac{180 \cdot \tan^{-1} \left(\frac{C - A}{B} + 1\right)}{\pi}\\ \mathbf{else}:\\ \;\;\;\;\frac{180 \cdot \tan^{-1} \left(\frac{B}{C} \cdot -0.5\right)}{\pi}\\ \end{array} \end{array} \]

FPCore

(FPCore (A B C)
 :precision binary64
 (if (<= C 6.1e+29)
   (/ (* 180.0 (atan (+ (/ (- C A) B) 1.0))) PI)
   (/ (* 180.0 (atan (* (/ B C) -0.5))) PI)))

C

double code(double A, double B, double C) {
	double tmp;
	if (C <= 6.1e+29) {
		tmp = (180.0 * atan((((C - A) / B) + 1.0))) / ((double) M_PI);
	} else {
		tmp = (180.0 * atan(((B / C) * -0.5))) / ((double) M_PI);
	}
	return tmp;
}

Java

public static double code(double A, double B, double C) {
	double tmp;
	if (C <= 6.1e+29) {
		tmp = (180.0 * Math.atan((((C - A) / B) + 1.0))) / Math.PI;
	} else {
		tmp = (180.0 * Math.atan(((B / C) * -0.5))) / Math.PI;
	}
	return tmp;
}

Python

def code(A, B, C):
	tmp = 0
	if C <= 6.1e+29:
		tmp = (180.0 * math.atan((((C - A) / B) + 1.0))) / math.pi
	else:
		tmp = (180.0 * math.atan(((B / C) * -0.5))) / math.pi
	return tmp

Julia

function code(A, B, C)
	tmp = 0.0
	if (C <= 6.1e+29)
		tmp = Float64(Float64(180.0 * atan(Float64(Float64(Float64(C - A) / B) + 1.0))) / pi);
	else
		tmp = Float64(Float64(180.0 * atan(Float64(Float64(B / C) * -0.5))) / pi);
	end
	return tmp
end

MATLAB

function tmp_2 = code(A, B, C)
	tmp = 0.0;
	if (C <= 6.1e+29)
		tmp = (180.0 * atan((((C - A) / B) + 1.0))) / pi;
	else
		tmp = (180.0 * atan(((B / C) * -0.5))) / pi;
	end
	tmp_2 = tmp;
end

Wolfram

code[A_, B_, C_] := If[LessEqual[C, 6.1e+29], N[(N[(180.0 * N[ArcTan[N[(N[(N[(C - A), $MachinePrecision] / B), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / Pi), $MachinePrecision], N[(N[(180.0 * N[ArcTan[N[(N[(B / C), $MachinePrecision] * -0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / Pi), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if C < 6.0999999999999998e29

   1. Initial program 62.4%

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

      1. associate--l+ N/A

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

      2. div-sub N/A

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

      3. lower-+.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 58.4

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

   4. Applied rewrites 58.4%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*r/ N/A

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

      4. lower-/.f64 N/A

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

   6. Applied rewrites 58.4%

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

   if 6.0999999999999998e29 < C

   1. Initial program 23.7%

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

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

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

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

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 74.0

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

   9. Applied rewrites 74.0%

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

   10. Taylor expanded in A around 0

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

   12. Applied rewrites 69.1%

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

Alternative 9: 59.3% accurate, 2.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;C \leq -5 \cdot 10^{-127}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(1 + \frac{C}{B}\right)}{\pi}\\ \mathbf{elif}\;C \leq 6.1 \cdot 10^{+29}:\\ \;\;\;\;\frac{180 \cdot \tan^{-1} \left(\frac{-A}{B} + 1\right)}{\pi}\\ \mathbf{else}:\\ \;\;\;\;\frac{180 \cdot \tan^{-1} \left(\frac{B}{C} \cdot -0.5\right)}{\pi}\\ \end{array} \end{array} \]

FPCore

(FPCore (A B C)
 :precision binary64
 (if (<= C -5e-127)
   (* 180.0 (/ (atan (+ 1.0 (/ C B))) PI))
   (if (<= C 6.1e+29)
     (/ (* 180.0 (atan (+ (/ (- A) B) 1.0))) PI)
     (/ (* 180.0 (atan (* (/ B C) -0.5))) PI))))

C

double code(double A, double B, double C) {
	double tmp;
	if (C <= -5e-127) {
		tmp = 180.0 * (atan((1.0 + (C / B))) / ((double) M_PI));
	} else if (C <= 6.1e+29) {
		tmp = (180.0 * atan(((-A / B) + 1.0))) / ((double) M_PI);
	} else {
		tmp = (180.0 * atan(((B / C) * -0.5))) / ((double) M_PI);
	}
	return tmp;
}

Java

public static double code(double A, double B, double C) {
	double tmp;
	if (C <= -5e-127) {
		tmp = 180.0 * (Math.atan((1.0 + (C / B))) / Math.PI);
	} else if (C <= 6.1e+29) {
		tmp = (180.0 * Math.atan(((-A / B) + 1.0))) / Math.PI;
	} else {
		tmp = (180.0 * Math.atan(((B / C) * -0.5))) / Math.PI;
	}
	return tmp;
}

Python

def code(A, B, C):
	tmp = 0
	if C <= -5e-127:
		tmp = 180.0 * (math.atan((1.0 + (C / B))) / math.pi)
	elif C <= 6.1e+29:
		tmp = (180.0 * math.atan(((-A / B) + 1.0))) / math.pi
	else:
		tmp = (180.0 * math.atan(((B / C) * -0.5))) / math.pi
	return tmp

Julia

function code(A, B, C)
	tmp = 0.0
	if (C <= -5e-127)
		tmp = Float64(180.0 * Float64(atan(Float64(1.0 + Float64(C / B))) / pi));
	elseif (C <= 6.1e+29)
		tmp = Float64(Float64(180.0 * atan(Float64(Float64(Float64(-A) / B) + 1.0))) / pi);
	else
		tmp = Float64(Float64(180.0 * atan(Float64(Float64(B / C) * -0.5))) / pi);
	end
	return tmp
end

MATLAB

function tmp_2 = code(A, B, C)
	tmp = 0.0;
	if (C <= -5e-127)
		tmp = 180.0 * (atan((1.0 + (C / B))) / pi);
	elseif (C <= 6.1e+29)
		tmp = (180.0 * atan(((-A / B) + 1.0))) / pi;
	else
		tmp = (180.0 * atan(((B / C) * -0.5))) / pi;
	end
	tmp_2 = tmp;
end

Wolfram

code[A_, B_, C_] := If[LessEqual[C, -5e-127], N[(180.0 * N[(N[ArcTan[N[(1.0 + N[(C / B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision], If[LessEqual[C, 6.1e+29], N[(N[(180.0 * N[ArcTan[N[(N[((-A) / B), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / Pi), $MachinePrecision], N[(N[(180.0 * N[ArcTan[N[(N[(B / C), $MachinePrecision] * -0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / Pi), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if C < -4.9999999999999997e-127

   1. Initial program 71.6%

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

   2. Taylor expanded in B around -inf

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

      1. associate--l+ N/A

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

      2. div-sub N/A

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

      3. lower-+.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 71.7

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

   4. Applied rewrites 71.7%

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

   5. Taylor expanded in A around 0

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

   7. Applied rewrites 68.1%

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

   if -4.9999999999999997e-127 < C < 6.0999999999999998e29

   1. Initial program 54.8%

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

      1. associate--l+ N/A

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

      2. div-sub N/A

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

      3. lower-+.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 47.3

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

   4. Applied rewrites 47.3%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*r/ N/A

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

      4. lower-/.f64 N/A

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

   6. Applied rewrites 47.3%

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

   7. Taylor expanded in A around inf

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

      1. mul-1-neg N/A

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

      2. lift-neg.f64 46.7

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

   9. Applied rewrites 46.7%

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

   if 6.0999999999999998e29 < C

   1. Initial program 23.7%

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

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

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

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

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 74.0

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

   9. Applied rewrites 74.0%

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

   10. Taylor expanded in A around 0

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

   12. Applied rewrites 69.1%

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

Alternative 10: 59.3% accurate, 2.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;C \leq -5 \cdot 10^{-127}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(1 + \frac{C}{B}\right)}{\pi}\\ \mathbf{elif}\;C \leq 6.1 \cdot 10^{+29}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(1 - \frac{A}{B}\right)}{\pi}\\ \mathbf{else}:\\ \;\;\;\;\frac{180 \cdot \tan^{-1} \left(\frac{B}{C} \cdot -0.5\right)}{\pi}\\ \end{array} \end{array} \]

FPCore

(FPCore (A B C)
 :precision binary64
 (if (<= C -5e-127)
   (* 180.0 (/ (atan (+ 1.0 (/ C B))) PI))
   (if (<= C 6.1e+29)
     (* 180.0 (/ (atan (- 1.0 (/ A B))) PI))
     (/ (* 180.0 (atan (* (/ B C) -0.5))) PI))))

C

double code(double A, double B, double C) {
	double tmp;
	if (C <= -5e-127) {
		tmp = 180.0 * (atan((1.0 + (C / B))) / ((double) M_PI));
	} else if (C <= 6.1e+29) {
		tmp = 180.0 * (atan((1.0 - (A / B))) / ((double) M_PI));
	} else {
		tmp = (180.0 * atan(((B / C) * -0.5))) / ((double) M_PI);
	}
	return tmp;
}

Java

public static double code(double A, double B, double C) {
	double tmp;
	if (C <= -5e-127) {
		tmp = 180.0 * (Math.atan((1.0 + (C / B))) / Math.PI);
	} else if (C <= 6.1e+29) {
		tmp = 180.0 * (Math.atan((1.0 - (A / B))) / Math.PI);
	} else {
		tmp = (180.0 * Math.atan(((B / C) * -0.5))) / Math.PI;
	}
	return tmp;
}

Python

def code(A, B, C):
	tmp = 0
	if C <= -5e-127:
		tmp = 180.0 * (math.atan((1.0 + (C / B))) / math.pi)
	elif C <= 6.1e+29:
		tmp = 180.0 * (math.atan((1.0 - (A / B))) / math.pi)
	else:
		tmp = (180.0 * math.atan(((B / C) * -0.5))) / math.pi
	return tmp

Julia

function code(A, B, C)
	tmp = 0.0
	if (C <= -5e-127)
		tmp = Float64(180.0 * Float64(atan(Float64(1.0 + Float64(C / B))) / pi));
	elseif (C <= 6.1e+29)
		tmp = Float64(180.0 * Float64(atan(Float64(1.0 - Float64(A / B))) / pi));
	else
		tmp = Float64(Float64(180.0 * atan(Float64(Float64(B / C) * -0.5))) / pi);
	end
	return tmp
end

MATLAB

function tmp_2 = code(A, B, C)
	tmp = 0.0;
	if (C <= -5e-127)
		tmp = 180.0 * (atan((1.0 + (C / B))) / pi);
	elseif (C <= 6.1e+29)
		tmp = 180.0 * (atan((1.0 - (A / B))) / pi);
	else
		tmp = (180.0 * atan(((B / C) * -0.5))) / pi;
	end
	tmp_2 = tmp;
end

Wolfram

code[A_, B_, C_] := If[LessEqual[C, -5e-127], N[(180.0 * N[(N[ArcTan[N[(1.0 + N[(C / B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision], If[LessEqual[C, 6.1e+29], N[(180.0 * N[(N[ArcTan[N[(1.0 - N[(A / B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision], N[(N[(180.0 * N[ArcTan[N[(N[(B / C), $MachinePrecision] * -0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / Pi), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if C < -4.9999999999999997e-127

   1. Initial program 71.6%

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

   2. Taylor expanded in B around -inf

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

      1. associate--l+ N/A

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

      2. div-sub N/A

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

      3. lower-+.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 71.7

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

   4. Applied rewrites 71.7%

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

   5. Taylor expanded in A around 0

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

   7. Applied rewrites 68.1%

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

   if -4.9999999999999997e-127 < C < 6.0999999999999998e29

   1. Initial program 54.8%

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

      1. associate--l+ N/A

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

      2. div-sub N/A

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

      3. lower-+.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 47.3

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

   4. Applied rewrites 47.3%

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

   5. Taylor expanded in C around 0

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

      1. lower--.f64 N/A

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

      2. lift-/.f64 46.7

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

   7. Applied rewrites 46.7%

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

   if 6.0999999999999998e29 < C

   1. Initial program 23.7%

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

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

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

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

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 74.0

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

   9. Applied rewrites 74.0%

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

   10. Taylor expanded in A around 0

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

   12. Applied rewrites 69.1%

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

Alternative 11: 59.0% accurate, 2.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;A \leq -1.3 \cdot 10^{+55}:\\ \;\;\;\;\frac{180 \cdot \tan^{-1} \left(\frac{B}{A} \cdot 0.5\right)}{\pi}\\ \mathbf{elif}\;A \leq 7.4 \cdot 10^{-104}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(1 + \frac{C}{B}\right)}{\pi}\\ \mathbf{else}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(1 - \frac{A}{B}\right)}{\pi}\\ \end{array} \end{array} \]

FPCore

(FPCore (A B C)
 :precision binary64
 (if (<= A -1.3e+55)
   (/ (* 180.0 (atan (* (/ B A) 0.5))) PI)
   (if (<= A 7.4e-104)
     (* 180.0 (/ (atan (+ 1.0 (/ C B))) PI))
     (* 180.0 (/ (atan (- 1.0 (/ A B))) PI)))))

C

double code(double A, double B, double C) {
	double tmp;
	if (A <= -1.3e+55) {
		tmp = (180.0 * atan(((B / A) * 0.5))) / ((double) M_PI);
	} else if (A <= 7.4e-104) {
		tmp = 180.0 * (atan((1.0 + (C / B))) / ((double) M_PI));
	} else {
		tmp = 180.0 * (atan((1.0 - (A / B))) / ((double) M_PI));
	}
	return tmp;
}

Java

public static double code(double A, double B, double C) {
	double tmp;
	if (A <= -1.3e+55) {
		tmp = (180.0 * Math.atan(((B / A) * 0.5))) / Math.PI;
	} else if (A <= 7.4e-104) {
		tmp = 180.0 * (Math.atan((1.0 + (C / B))) / Math.PI);
	} else {
		tmp = 180.0 * (Math.atan((1.0 - (A / B))) / Math.PI);
	}
	return tmp;
}

Python

def code(A, B, C):
	tmp = 0
	if A <= -1.3e+55:
		tmp = (180.0 * math.atan(((B / A) * 0.5))) / math.pi
	elif A <= 7.4e-104:
		tmp = 180.0 * (math.atan((1.0 + (C / B))) / math.pi)
	else:
		tmp = 180.0 * (math.atan((1.0 - (A / B))) / math.pi)
	return tmp

Julia

function code(A, B, C)
	tmp = 0.0
	if (A <= -1.3e+55)
		tmp = Float64(Float64(180.0 * atan(Float64(Float64(B / A) * 0.5))) / pi);
	elseif (A <= 7.4e-104)
		tmp = Float64(180.0 * Float64(atan(Float64(1.0 + Float64(C / B))) / pi));
	else
		tmp = Float64(180.0 * Float64(atan(Float64(1.0 - Float64(A / B))) / pi));
	end
	return tmp
end

MATLAB

function tmp_2 = code(A, B, C)
	tmp = 0.0;
	if (A <= -1.3e+55)
		tmp = (180.0 * atan(((B / A) * 0.5))) / pi;
	elseif (A <= 7.4e-104)
		tmp = 180.0 * (atan((1.0 + (C / B))) / pi);
	else
		tmp = 180.0 * (atan((1.0 - (A / B))) / pi);
	end
	tmp_2 = tmp;
end

Wolfram

code[A_, B_, C_] := If[LessEqual[A, -1.3e+55], N[(N[(180.0 * N[ArcTan[N[(N[(B / A), $MachinePrecision] * 0.5), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / Pi), $MachinePrecision], If[LessEqual[A, 7.4e-104], N[(180.0 * N[(N[ArcTan[N[(1.0 + N[(C / B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision], N[(180.0 * N[(N[ArcTan[N[(1.0 - N[(A / B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if A < -1.3e55

   1. Initial program 21.7%

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

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

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

      \[\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(\frac{1}{2} \cdot \frac{B}{A}\right)}{\pi} \]
   8. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 72.1

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

   9. Applied rewrites 72.1%

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

   if -1.3e55 < A < 7.3999999999999999e-104

   1. Initial program 53.2%

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

      1. associate--l+ N/A

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

      2. div-sub N/A

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

      3. lower-+.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 45.7

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

   4. Applied rewrites 45.7%

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

   5. Taylor expanded in A around 0

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

   7. Applied rewrites 44.8%

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

   if 7.3999999999999999e-104 < A

   1. Initial program 73.0%

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

      1. associate--l+ N/A

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

      2. div-sub N/A

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

      3. lower-+.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 74.0

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

   4. Applied rewrites 74.0%

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

   5. Taylor expanded in C around 0

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

      1. lower--.f64 N/A

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

      2. lift-/.f64 70.7

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

   7. Applied rewrites 70.7%

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

Alternative 12: 50.8% accurate, 2.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;B \leq 5.8 \cdot 10^{-108}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(1 + \frac{C}{B}\right)}{\pi}\\ \mathbf{else}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} -1}{\pi}\\ \end{array} \end{array} \]

FPCore

(FPCore (A B C)
 :precision binary64
 (if (<= B 5.8e-108)
   (* 180.0 (/ (atan (+ 1.0 (/ C B))) PI))
   (* 180.0 (/ (atan -1.0) PI))))

C

double code(double A, double B, double C) {
	double tmp;
	if (B <= 5.8e-108) {
		tmp = 180.0 * (atan((1.0 + (C / B))) / ((double) M_PI));
	} else {
		tmp = 180.0 * (atan(-1.0) / ((double) M_PI));
	}
	return tmp;
}

Java

public static double code(double A, double B, double C) {
	double tmp;
	if (B <= 5.8e-108) {
		tmp = 180.0 * (Math.atan((1.0 + (C / B))) / Math.PI);
	} else {
		tmp = 180.0 * (Math.atan(-1.0) / Math.PI);
	}
	return tmp;
}

Python

def code(A, B, C):
	tmp = 0
	if B <= 5.8e-108:
		tmp = 180.0 * (math.atan((1.0 + (C / B))) / math.pi)
	else:
		tmp = 180.0 * (math.atan(-1.0) / math.pi)
	return tmp

Julia

function code(A, B, C)
	tmp = 0.0
	if (B <= 5.8e-108)
		tmp = Float64(180.0 * Float64(atan(Float64(1.0 + Float64(C / B))) / pi));
	else
		tmp = Float64(180.0 * Float64(atan(-1.0) / pi));
	end
	return tmp
end

MATLAB

function tmp_2 = code(A, B, C)
	tmp = 0.0;
	if (B <= 5.8e-108)
		tmp = 180.0 * (atan((1.0 + (C / B))) / pi);
	else
		tmp = 180.0 * (atan(-1.0) / pi);
	end
	tmp_2 = tmp;
end

Wolfram

code[A_, B_, C_] := If[LessEqual[B, 5.8e-108], N[(180.0 * N[(N[ArcTan[N[(1.0 + N[(C / B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision], N[(180.0 * N[(N[ArcTan[-1.0], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if B < 5.8000000000000002e-108

   1. Initial program 54.1%

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

      1. associate--l+ N/A

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

      2. div-sub N/A

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

      3. lower-+.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 61.5

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

   4. Applied rewrites 61.5%

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

   5. Taylor expanded in A around 0

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

   7. Applied rewrites 49.3%

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

   if 5.8000000000000002e-108 < B

   1. Initial program 52.2%

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

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

Alternative 13: 50.8% accurate, 2.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;B \leq 5.8 \cdot 10^{-108}:\\ \;\;\;\;\frac{180 \cdot \tan^{-1} \left(\frac{C}{B} + 1\right)}{\pi}\\ \mathbf{else}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} -1}{\pi}\\ \end{array} \end{array} \]

FPCore

(FPCore (A B C)
 :precision binary64
 (if (<= B 5.8e-108)
   (/ (* 180.0 (atan (+ (/ C B) 1.0))) PI)
   (* 180.0 (/ (atan -1.0) PI))))

C

double code(double A, double B, double C) {
	double tmp;
	if (B <= 5.8e-108) {
		tmp = (180.0 * atan(((C / B) + 1.0))) / ((double) M_PI);
	} else {
		tmp = 180.0 * (atan(-1.0) / ((double) M_PI));
	}
	return tmp;
}

Java

public static double code(double A, double B, double C) {
	double tmp;
	if (B <= 5.8e-108) {
		tmp = (180.0 * Math.atan(((C / B) + 1.0))) / Math.PI;
	} else {
		tmp = 180.0 * (Math.atan(-1.0) / Math.PI);
	}
	return tmp;
}

Python

def code(A, B, C):
	tmp = 0
	if B <= 5.8e-108:
		tmp = (180.0 * math.atan(((C / B) + 1.0))) / math.pi
	else:
		tmp = 180.0 * (math.atan(-1.0) / math.pi)
	return tmp

Julia

function code(A, B, C)
	tmp = 0.0
	if (B <= 5.8e-108)
		tmp = Float64(Float64(180.0 * atan(Float64(Float64(C / B) + 1.0))) / pi);
	else
		tmp = Float64(180.0 * Float64(atan(-1.0) / pi));
	end
	return tmp
end

MATLAB

function tmp_2 = code(A, B, C)
	tmp = 0.0;
	if (B <= 5.8e-108)
		tmp = (180.0 * atan(((C / B) + 1.0))) / pi;
	else
		tmp = 180.0 * (atan(-1.0) / pi);
	end
	tmp_2 = tmp;
end

Wolfram

code[A_, B_, C_] := If[LessEqual[B, 5.8e-108], N[(N[(180.0 * N[ArcTan[N[(N[(C / B), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] / Pi), $MachinePrecision], N[(180.0 * N[(N[ArcTan[-1.0], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if B < 5.8000000000000002e-108

   1. Initial program 54.1%

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

      1. associate--l+ N/A

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

      2. div-sub N/A

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

      3. lower-+.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 61.5

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

   4. Applied rewrites 61.5%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-*r/ N/A

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

      4. lower-/.f64 N/A

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

   6. Applied rewrites 61.5%

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

   7. Taylor expanded in A around 0

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

   9. Applied rewrites 49.3%

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

   if 5.8000000000000002e-108 < B

   1. Initial program 52.2%

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

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

Alternative 14: 50.5% accurate, 2.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;B \leq -1.75 \cdot 10^{-245}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(1 - \frac{A}{B}\right)}{\pi}\\ \mathbf{elif}\;B \leq 5.8 \cdot 10^{-108}:\\ \;\;\;\;\frac{\tan^{-1} \left(\frac{C + C}{B}\right)}{\pi} \cdot 180\\ \mathbf{else}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} -1}{\pi}\\ \end{array} \end{array} \]

FPCore

(FPCore (A B C)
 :precision binary64
 (if (<= B -1.75e-245)
   (* 180.0 (/ (atan (- 1.0 (/ A B))) PI))
   (if (<= B 5.8e-108)
     (* (/ (atan (/ (+ C C) B)) PI) 180.0)
     (* 180.0 (/ (atan -1.0) PI)))))

C

double code(double A, double B, double C) {
	double tmp;
	if (B <= -1.75e-245) {
		tmp = 180.0 * (atan((1.0 - (A / B))) / ((double) M_PI));
	} else if (B <= 5.8e-108) {
		tmp = (atan(((C + C) / B)) / ((double) M_PI)) * 180.0;
	} else {
		tmp = 180.0 * (atan(-1.0) / ((double) M_PI));
	}
	return tmp;
}

Java

public static double code(double A, double B, double C) {
	double tmp;
	if (B <= -1.75e-245) {
		tmp = 180.0 * (Math.atan((1.0 - (A / B))) / Math.PI);
	} else if (B <= 5.8e-108) {
		tmp = (Math.atan(((C + C) / B)) / Math.PI) * 180.0;
	} else {
		tmp = 180.0 * (Math.atan(-1.0) / Math.PI);
	}
	return tmp;
}

Python

def code(A, B, C):
	tmp = 0
	if B <= -1.75e-245:
		tmp = 180.0 * (math.atan((1.0 - (A / B))) / math.pi)
	elif B <= 5.8e-108:
		tmp = (math.atan(((C + C) / B)) / math.pi) * 180.0
	else:
		tmp = 180.0 * (math.atan(-1.0) / math.pi)
	return tmp

Julia

function code(A, B, C)
	tmp = 0.0
	if (B <= -1.75e-245)
		tmp = Float64(180.0 * Float64(atan(Float64(1.0 - Float64(A / B))) / pi));
	elseif (B <= 5.8e-108)
		tmp = Float64(Float64(atan(Float64(Float64(C + C) / B)) / pi) * 180.0);
	else
		tmp = Float64(180.0 * Float64(atan(-1.0) / pi));
	end
	return tmp
end

MATLAB

function tmp_2 = code(A, B, C)
	tmp = 0.0;
	if (B <= -1.75e-245)
		tmp = 180.0 * (atan((1.0 - (A / B))) / pi);
	elseif (B <= 5.8e-108)
		tmp = (atan(((C + C) / B)) / pi) * 180.0;
	else
		tmp = 180.0 * (atan(-1.0) / pi);
	end
	tmp_2 = tmp;
end

Wolfram

code[A_, B_, C_] := If[LessEqual[B, -1.75e-245], N[(180.0 * N[(N[ArcTan[N[(1.0 - N[(A / B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision], If[LessEqual[B, 5.8e-108], N[(N[(N[ArcTan[N[(N[(C + C), $MachinePrecision] / B), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision] * 180.0), $MachinePrecision], N[(180.0 * N[(N[ArcTan[-1.0], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if B < -1.75000000000000008e-245

   1. Initial program 51.6%

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

   2. Taylor expanded in B around -inf

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

      1. associate--l+ N/A

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

      2. div-sub N/A

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

      3. lower-+.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 66.5

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

   4. Applied rewrites 66.5%

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

   5. Taylor expanded in C around 0

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

      1. lower--.f64 N/A

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

      2. lift-/.f64 56.8

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

   7. Applied rewrites 56.8%

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

   if -1.75000000000000008e-245 < B < 5.8000000000000002e-108

   1. Initial program 59.5%

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

   2. Taylor expanded in C around -inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. count-2-rev N/A

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

      4. lower-+.f64 34.8

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

   4. Applied rewrites 34.8%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 34.8

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

      4. *-commutative 34.8

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

   6. Applied rewrites 34.8%

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

   if 5.8000000000000002e-108 < B

   1. Initial program 52.2%

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

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

Alternative 15: 50.5% accurate, 2.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;B \leq -1.75 \cdot 10^{-245}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(1 - \frac{A}{B}\right)}{\pi}\\ \mathbf{elif}\;B \leq 5.8 \cdot 10^{-108}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(\frac{C}{B}\right)}{\pi}\\ \mathbf{else}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} -1}{\pi}\\ \end{array} \end{array} \]

FPCore

(FPCore (A B C)
 :precision binary64
 (if (<= B -1.75e-245)
   (* 180.0 (/ (atan (- 1.0 (/ A B))) PI))
   (if (<= B 5.8e-108)
     (* 180.0 (/ (atan (/ C B)) PI))
     (* 180.0 (/ (atan -1.0) PI)))))

C

double code(double A, double B, double C) {
	double tmp;
	if (B <= -1.75e-245) {
		tmp = 180.0 * (atan((1.0 - (A / B))) / ((double) M_PI));
	} else if (B <= 5.8e-108) {
		tmp = 180.0 * (atan((C / B)) / ((double) M_PI));
	} else {
		tmp = 180.0 * (atan(-1.0) / ((double) M_PI));
	}
	return tmp;
}

Java

public static double code(double A, double B, double C) {
	double tmp;
	if (B <= -1.75e-245) {
		tmp = 180.0 * (Math.atan((1.0 - (A / B))) / Math.PI);
	} else if (B <= 5.8e-108) {
		tmp = 180.0 * (Math.atan((C / B)) / Math.PI);
	} else {
		tmp = 180.0 * (Math.atan(-1.0) / Math.PI);
	}
	return tmp;
}

Python

def code(A, B, C):
	tmp = 0
	if B <= -1.75e-245:
		tmp = 180.0 * (math.atan((1.0 - (A / B))) / math.pi)
	elif B <= 5.8e-108:
		tmp = 180.0 * (math.atan((C / B)) / math.pi)
	else:
		tmp = 180.0 * (math.atan(-1.0) / math.pi)
	return tmp

Julia

function code(A, B, C)
	tmp = 0.0
	if (B <= -1.75e-245)
		tmp = Float64(180.0 * Float64(atan(Float64(1.0 - Float64(A / B))) / pi));
	elseif (B <= 5.8e-108)
		tmp = Float64(180.0 * Float64(atan(Float64(C / B)) / pi));
	else
		tmp = Float64(180.0 * Float64(atan(-1.0) / pi));
	end
	return tmp
end

MATLAB

function tmp_2 = code(A, B, C)
	tmp = 0.0;
	if (B <= -1.75e-245)
		tmp = 180.0 * (atan((1.0 - (A / B))) / pi);
	elseif (B <= 5.8e-108)
		tmp = 180.0 * (atan((C / B)) / pi);
	else
		tmp = 180.0 * (atan(-1.0) / pi);
	end
	tmp_2 = tmp;
end

Wolfram

code[A_, B_, C_] := If[LessEqual[B, -1.75e-245], N[(180.0 * N[(N[ArcTan[N[(1.0 - N[(A / B), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision], If[LessEqual[B, 5.8e-108], N[(180.0 * N[(N[ArcTan[N[(C / B), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision], N[(180.0 * N[(N[ArcTan[-1.0], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if B < -1.75000000000000008e-245

   1. Initial program 51.6%

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

   2. Taylor expanded in B around -inf

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

      1. associate--l+ N/A

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

      2. div-sub N/A

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

      3. lower-+.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 66.5

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

   4. Applied rewrites 66.5%

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

   5. Taylor expanded in C around 0

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

      1. lower--.f64 N/A

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

      2. lift-/.f64 56.8

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

   7. Applied rewrites 56.8%

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

   if -1.75000000000000008e-245 < B < 5.8000000000000002e-108

   1. Initial program 59.5%

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

      1. associate--l+ N/A

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

      2. div-sub N/A

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

      3. lower-+.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 51.0

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

   4. Applied rewrites 51.0%

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

   5. Taylor expanded in C around inf

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

      1. lower-/.f64 34.8

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

   7. Applied rewrites 34.8%

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

   if 5.8000000000000002e-108 < B

   1. Initial program 52.2%

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

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

Alternative 16: 45.7% accurate, 2.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;B \leq -3.8 \cdot 10^{-158}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} 1}{\pi}\\ \mathbf{elif}\;B \leq 5.8 \cdot 10^{-108}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} \left(\frac{C}{B}\right)}{\pi}\\ \mathbf{else}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} -1}{\pi}\\ \end{array} \end{array} \]

FPCore

(FPCore (A B C)
 :precision binary64
 (if (<= B -3.8e-158)
   (* 180.0 (/ (atan 1.0) PI))
   (if (<= B 5.8e-108)
     (* 180.0 (/ (atan (/ C B)) PI))
     (* 180.0 (/ (atan -1.0) PI)))))

C

double code(double A, double B, double C) {
	double tmp;
	if (B <= -3.8e-158) {
		tmp = 180.0 * (atan(1.0) / ((double) M_PI));
	} else if (B <= 5.8e-108) {
		tmp = 180.0 * (atan((C / B)) / ((double) M_PI));
	} else {
		tmp = 180.0 * (atan(-1.0) / ((double) M_PI));
	}
	return tmp;
}

Java

public static double code(double A, double B, double C) {
	double tmp;
	if (B <= -3.8e-158) {
		tmp = 180.0 * (Math.atan(1.0) / Math.PI);
	} else if (B <= 5.8e-108) {
		tmp = 180.0 * (Math.atan((C / B)) / Math.PI);
	} else {
		tmp = 180.0 * (Math.atan(-1.0) / Math.PI);
	}
	return tmp;
}

Python

def code(A, B, C):
	tmp = 0
	if B <= -3.8e-158:
		tmp = 180.0 * (math.atan(1.0) / math.pi)
	elif B <= 5.8e-108:
		tmp = 180.0 * (math.atan((C / B)) / math.pi)
	else:
		tmp = 180.0 * (math.atan(-1.0) / math.pi)
	return tmp

Julia

function code(A, B, C)
	tmp = 0.0
	if (B <= -3.8e-158)
		tmp = Float64(180.0 * Float64(atan(1.0) / pi));
	elseif (B <= 5.8e-108)
		tmp = Float64(180.0 * Float64(atan(Float64(C / B)) / pi));
	else
		tmp = Float64(180.0 * Float64(atan(-1.0) / pi));
	end
	return tmp
end

MATLAB

function tmp_2 = code(A, B, C)
	tmp = 0.0;
	if (B <= -3.8e-158)
		tmp = 180.0 * (atan(1.0) / pi);
	elseif (B <= 5.8e-108)
		tmp = 180.0 * (atan((C / B)) / pi);
	else
		tmp = 180.0 * (atan(-1.0) / pi);
	end
	tmp_2 = tmp;
end

Wolfram

code[A_, B_, C_] := If[LessEqual[B, -3.8e-158], N[(180.0 * N[(N[ArcTan[1.0], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision], If[LessEqual[B, 5.8e-108], N[(180.0 * N[(N[ArcTan[N[(C / B), $MachinePrecision]], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision], N[(180.0 * N[(N[ArcTan[-1.0], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if B < -3.7999999999999999e-158

   1. Initial program 51.6%

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

   2. Taylor expanded in B around -inf

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

   4. Applied rewrites 48.4%

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

   if -3.7999999999999999e-158 < B < 5.8000000000000002e-108

   1. Initial program 57.4%

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

      1. associate--l+ N/A

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

      2. div-sub N/A

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

      3. lower-+.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 50.4

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

   4. Applied rewrites 50.4%

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

   5. Taylor expanded in C around inf

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

      1. lower-/.f64 33.8

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

   7. Applied rewrites 33.8%

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

   if 5.8000000000000002e-108 < B

   1. Initial program 52.2%

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

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

Alternative 17: 39.9% accurate, 3.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;B \leq -1 \cdot 10^{-309}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} 1}{\pi}\\ \mathbf{else}:\\ \;\;\;\;180 \cdot \frac{\tan^{-1} -1}{\pi}\\ \end{array} \end{array} \]

FPCore

(FPCore (A B C)
 :precision binary64
 (if (<= B -1e-309) (* 180.0 (/ (atan 1.0) PI)) (* 180.0 (/ (atan -1.0) PI))))

C

double code(double A, double B, double C) {
	double tmp;
	if (B <= -1e-309) {
		tmp = 180.0 * (atan(1.0) / ((double) M_PI));
	} else {
		tmp = 180.0 * (atan(-1.0) / ((double) M_PI));
	}
	return tmp;
}

Java

public static double code(double A, double B, double C) {
	double tmp;
	if (B <= -1e-309) {
		tmp = 180.0 * (Math.atan(1.0) / Math.PI);
	} else {
		tmp = 180.0 * (Math.atan(-1.0) / Math.PI);
	}
	return tmp;
}

Python

def code(A, B, C):
	tmp = 0
	if B <= -1e-309:
		tmp = 180.0 * (math.atan(1.0) / math.pi)
	else:
		tmp = 180.0 * (math.atan(-1.0) / math.pi)
	return tmp

Julia

function code(A, B, C)
	tmp = 0.0
	if (B <= -1e-309)
		tmp = Float64(180.0 * Float64(atan(1.0) / pi));
	else
		tmp = Float64(180.0 * Float64(atan(-1.0) / pi));
	end
	return tmp
end

MATLAB

function tmp_2 = code(A, B, C)
	tmp = 0.0;
	if (B <= -1e-309)
		tmp = 180.0 * (atan(1.0) / pi);
	else
		tmp = 180.0 * (atan(-1.0) / pi);
	end
	tmp_2 = tmp;
end

Wolfram

code[A_, B_, C_] := If[LessEqual[B, -1e-309], N[(180.0 * N[(N[ArcTan[1.0], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision], N[(180.0 * N[(N[ArcTan[-1.0], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if B < -1.000000000000002e-309

   1. Initial program 52.6%

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

   2. Taylor expanded in B around -inf

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

   4. Applied rewrites 39.4%

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

   if -1.000000000000002e-309 < 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.3%

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

Alternative 18: 21.1% accurate, 4.1× speedup

Math

\[\begin{array}{l} \\ 180 \cdot \frac{\tan^{-1} -1}{\pi} \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[A_, B_, C_] := N[(180.0 * N[(N[ArcTan[-1.0], $MachinePrecision] / Pi), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 53.5%

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

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

Reproduce

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