ab-angle->ABCF A

Percentage Accurate: 80.0% → 80.0%

Time: 3.7s

Alternatives: 6

Speedup: N/A×

• 35.9% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{angle}{180} \cdot \pi\\ {\left(a \cdot \sin t\_0\right)}^{2} + {\left(b \cdot \cos t\_0\right)}^{2} \end{array} \end{array} \]

FPCore

(FPCore (a b angle)
 :precision binary64
 (let* ((t_0 (* (/ angle 180.0) PI)))
   (+ (pow (* a (sin t_0)) 2.0) (pow (* b (cos t_0)) 2.0))))

C

double code(double a, double b, double angle) {
	double t_0 = (angle / 180.0) * ((double) M_PI);
	return pow((a * sin(t_0)), 2.0) + pow((b * cos(t_0)), 2.0);
}

Java

public static double code(double a, double b, double angle) {
	double t_0 = (angle / 180.0) * Math.PI;
	return Math.pow((a * Math.sin(t_0)), 2.0) + Math.pow((b * Math.cos(t_0)), 2.0);
}

Python

def code(a, b, angle):
	t_0 = (angle / 180.0) * math.pi
	return math.pow((a * math.sin(t_0)), 2.0) + math.pow((b * math.cos(t_0)), 2.0)

Julia

function code(a, b, angle)
	t_0 = Float64(Float64(angle / 180.0) * pi)
	return Float64((Float64(a * sin(t_0)) ^ 2.0) + (Float64(b * cos(t_0)) ^ 2.0))
end

MATLAB

function tmp = code(a, b, angle)
	t_0 = (angle / 180.0) * pi;
	tmp = ((a * sin(t_0)) ^ 2.0) + ((b * cos(t_0)) ^ 2.0);
end

Wolfram

code[a_, b_, angle_] := Block[{t$95$0 = N[(N[(angle / 180.0), $MachinePrecision] * Pi), $MachinePrecision]}, N[(N[Power[N[(a * N[Sin[t$95$0], $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[N[(b * N[Cos[t$95$0], $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]]

Initial Program: 80.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{angle}{180} \cdot \pi\\ {\left(a \cdot \sin t\_0\right)}^{2} + {\left(b \cdot \cos t\_0\right)}^{2} \end{array} \end{array} \]

FPCore

(FPCore (a b angle)
 :precision binary64
 (let* ((t_0 (* (/ angle 180.0) PI)))
   (+ (pow (* a (sin t_0)) 2.0) (pow (* b (cos t_0)) 2.0))))

C

double code(double a, double b, double angle) {
	double t_0 = (angle / 180.0) * ((double) M_PI);
	return pow((a * sin(t_0)), 2.0) + pow((b * cos(t_0)), 2.0);
}

Java

public static double code(double a, double b, double angle) {
	double t_0 = (angle / 180.0) * Math.PI;
	return Math.pow((a * Math.sin(t_0)), 2.0) + Math.pow((b * Math.cos(t_0)), 2.0);
}

Python

def code(a, b, angle):
	t_0 = (angle / 180.0) * math.pi
	return math.pow((a * math.sin(t_0)), 2.0) + math.pow((b * math.cos(t_0)), 2.0)

Julia

function code(a, b, angle)
	t_0 = Float64(Float64(angle / 180.0) * pi)
	return Float64((Float64(a * sin(t_0)) ^ 2.0) + (Float64(b * cos(t_0)) ^ 2.0))
end

MATLAB

function tmp = code(a, b, angle)
	t_0 = (angle / 180.0) * pi;
	tmp = ((a * sin(t_0)) ^ 2.0) + ((b * cos(t_0)) ^ 2.0);
end

Wolfram

code[a_, b_, angle_] := Block[{t$95$0 = N[(N[(angle / 180.0), $MachinePrecision] * Pi), $MachinePrecision]}, N[(N[Power[N[(a * N[Sin[t$95$0], $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[N[(b * N[Cos[t$95$0], $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision]]

Alternative 1: 80.0% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ {\left(a \cdot \sin \left(\left(0.005555555555555556 \cdot \pi\right) \cdot angle\right)\right)}^{2} + b \cdot b \end{array} \]

FPCore

(FPCore (a b angle)
 :precision binary64
 (+ (pow (* a (sin (* (* 0.005555555555555556 PI) angle))) 2.0) (* b b)))

C

double code(double a, double b, double angle) {
	return pow((a * sin(((0.005555555555555556 * ((double) M_PI)) * angle))), 2.0) + (b * b);
}

Java

public static double code(double a, double b, double angle) {
	return Math.pow((a * Math.sin(((0.005555555555555556 * Math.PI) * angle))), 2.0) + (b * b);
}

Python

def code(a, b, angle):
	return math.pow((a * math.sin(((0.005555555555555556 * math.pi) * angle))), 2.0) + (b * b)

Julia

function code(a, b, angle)
	return Float64((Float64(a * sin(Float64(Float64(0.005555555555555556 * pi) * angle))) ^ 2.0) + Float64(b * b))
end

MATLAB

function tmp = code(a, b, angle)
	tmp = ((a * sin(((0.005555555555555556 * pi) * angle))) ^ 2.0) + (b * b);
end

Wolfram

code[a_, b_, angle_] := N[(N[Power[N[(a * N[Sin[N[(N[(0.005555555555555556 * Pi), $MachinePrecision] * angle), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] + N[(b * b), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 80.0%

   \[{\left(a \cdot \sin \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} + {\left(b \cdot \cos \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} \]

2. Taylor expanded in angle around 0

   \[\leadsto {\left(a \cdot \sin \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} + \color{blue}{{b}^{2}} \]
3. Step-by-step derivation

   1. unpow2 N/A

      \[\leadsto {\left(a \cdot \sin \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} + b \cdot \color{blue}{b} \]

   2. lower-*.f64 80.0

      \[\leadsto {\left(a \cdot \sin \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} + b \cdot \color{blue}{b} \]

4. Applied rewrites 80.0%

   \[\leadsto {\left(a \cdot \sin \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} + \color{blue}{b \cdot b} \]

5. Taylor expanded in angle around 0

   \[\leadsto {\left(a \cdot \sin \color{blue}{\left(\frac{1}{180} \cdot \left(angle \cdot \mathsf{PI}\left(\right)\right)\right)}\right)}^{2} + b \cdot b \]
6. Step-by-step derivation

   1. lift-/.f64 N/A

      \[\leadsto {\left(a \cdot \sin \left(\frac{1}{180} \cdot \left(angle \cdot \mathsf{PI}\left(\right)\right)\right)\right)}^{2} + b \cdot b \]

   2. *-commutative N/A

      \[\leadsto {\left(a \cdot \sin \left(\color{blue}{\frac{1}{180}} \cdot \left(angle \cdot \mathsf{PI}\left(\right)\right)\right)\right)}^{2} + b \cdot b \]

   3. lift-/.f64 N/A

      \[\leadsto {\left(a \cdot \sin \left(\frac{1}{180} \cdot \left(angle \cdot \mathsf{PI}\left(\right)\right)\right)\right)}^{2} + b \cdot b \]

   4. *-commutative N/A

      \[\leadsto {\left(a \cdot \sin \left(\frac{1}{180} \cdot \left(\mathsf{PI}\left(\right) \cdot \color{blue}{angle}\right)\right)\right)}^{2} + b \cdot b \]

   5. lift-*.f64 N/A

      \[\leadsto {\left(a \cdot \sin \left(\frac{1}{180} \cdot \left(\mathsf{PI}\left(\right) \cdot \color{blue}{angle}\right)\right)\right)}^{2} + b \cdot b \]

   6. lift-PI.f64 N/A

      \[\leadsto {\left(a \cdot \sin \left(\frac{1}{180} \cdot \left(\pi \cdot angle\right)\right)\right)}^{2} + b \cdot b \]

   7. lower-*.f64 79.9

      \[\leadsto {\left(a \cdot \sin \left(0.005555555555555556 \cdot \color{blue}{\left(\pi \cdot angle\right)}\right)\right)}^{2} + b \cdot b \]

7. Applied rewrites 79.9%

   \[\leadsto {\left(a \cdot \sin \color{blue}{\left(0.005555555555555556 \cdot \left(\pi \cdot angle\right)\right)}\right)}^{2} + b \cdot b \]
8. Step-by-step derivation

   1. lift-*.f64 N/A

      \[\leadsto {\left(a \cdot \sin \left(\frac{1}{180} \cdot \color{blue}{\left(\pi \cdot angle\right)}\right)\right)}^{2} + b \cdot b \]

   2. lift-PI.f64 N/A

      \[\leadsto {\left(a \cdot \sin \left(\frac{1}{180} \cdot \left(\mathsf{PI}\left(\right) \cdot angle\right)\right)\right)}^{2} + b \cdot b \]

   3. lift-*.f64 N/A

      \[\leadsto {\left(a \cdot \sin \left(\frac{1}{180} \cdot \left(\mathsf{PI}\left(\right) \cdot \color{blue}{angle}\right)\right)\right)}^{2} + b \cdot b \]

   4. associate-*r* N/A

      \[\leadsto {\left(a \cdot \sin \left(\left(\frac{1}{180} \cdot \mathsf{PI}\left(\right)\right) \cdot \color{blue}{angle}\right)\right)}^{2} + b \cdot b \]

   5. lower-*.f64 N/A

      \[\leadsto {\left(a \cdot \sin \left(\left(\frac{1}{180} \cdot \mathsf{PI}\left(\right)\right) \cdot \color{blue}{angle}\right)\right)}^{2} + b \cdot b \]

   6. lower-*.f64 N/A

      \[\leadsto {\left(a \cdot \sin \left(\left(\frac{1}{180} \cdot \mathsf{PI}\left(\right)\right) \cdot angle\right)\right)}^{2} + b \cdot b \]

   7. lift-PI.f64 80.0

      \[\leadsto {\left(a \cdot \sin \left(\left(0.005555555555555556 \cdot \pi\right) \cdot angle\right)\right)}^{2} + b \cdot b \]

9. Applied rewrites 80.0%

   \[\leadsto {\left(a \cdot \sin \left(\left(0.005555555555555556 \cdot \pi\right) \cdot \color{blue}{angle}\right)\right)}^{2} + b \cdot b \]
10. Add Preprocessing

Alternative 2: 79.9% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ {\left(a \cdot \sin \left(0.005555555555555556 \cdot \left(\pi \cdot angle\right)\right)\right)}^{2} + b \cdot b \end{array} \]

FPCore

(FPCore (a b angle)
 :precision binary64
 (+ (pow (* a (sin (* 0.005555555555555556 (* PI angle)))) 2.0) (* b b)))

C

double code(double a, double b, double angle) {
	return pow((a * sin((0.005555555555555556 * (((double) M_PI) * angle)))), 2.0) + (b * b);
}

Java

public static double code(double a, double b, double angle) {
	return Math.pow((a * Math.sin((0.005555555555555556 * (Math.PI * angle)))), 2.0) + (b * b);
}

Python

def code(a, b, angle):
	return math.pow((a * math.sin((0.005555555555555556 * (math.pi * angle)))), 2.0) + (b * b)

Julia

function code(a, b, angle)
	return Float64((Float64(a * sin(Float64(0.005555555555555556 * Float64(pi * angle)))) ^ 2.0) + Float64(b * b))
end

MATLAB

function tmp = code(a, b, angle)
	tmp = ((a * sin((0.005555555555555556 * (pi * angle)))) ^ 2.0) + (b * b);
end

Wolfram

code[a_, b_, angle_] := N[(N[Power[N[(a * N[Sin[N[(0.005555555555555556 * N[(Pi * angle), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] + N[(b * b), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 80.0%

   \[{\left(a \cdot \sin \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} + {\left(b \cdot \cos \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} \]

2. Taylor expanded in angle around 0

   \[\leadsto {\left(a \cdot \sin \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} + \color{blue}{{b}^{2}} \]
3. Step-by-step derivation

   1. unpow2 N/A

      \[\leadsto {\left(a \cdot \sin \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} + b \cdot \color{blue}{b} \]

   2. lower-*.f64 80.0

      \[\leadsto {\left(a \cdot \sin \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} + b \cdot \color{blue}{b} \]

4. Applied rewrites 80.0%

   \[\leadsto {\left(a \cdot \sin \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} + \color{blue}{b \cdot b} \]

5. Taylor expanded in angle around 0

   \[\leadsto {\left(a \cdot \sin \color{blue}{\left(\frac{1}{180} \cdot \left(angle \cdot \mathsf{PI}\left(\right)\right)\right)}\right)}^{2} + b \cdot b \]
6. Step-by-step derivation

   1. lift-/.f64 N/A

      \[\leadsto {\left(a \cdot \sin \left(\frac{1}{180} \cdot \left(angle \cdot \mathsf{PI}\left(\right)\right)\right)\right)}^{2} + b \cdot b \]

   2. *-commutative N/A

      \[\leadsto {\left(a \cdot \sin \left(\color{blue}{\frac{1}{180}} \cdot \left(angle \cdot \mathsf{PI}\left(\right)\right)\right)\right)}^{2} + b \cdot b \]

   3. lift-/.f64 N/A

      \[\leadsto {\left(a \cdot \sin \left(\frac{1}{180} \cdot \left(angle \cdot \mathsf{PI}\left(\right)\right)\right)\right)}^{2} + b \cdot b \]

   4. *-commutative N/A

      \[\leadsto {\left(a \cdot \sin \left(\frac{1}{180} \cdot \left(\mathsf{PI}\left(\right) \cdot \color{blue}{angle}\right)\right)\right)}^{2} + b \cdot b \]

   5. lift-*.f64 N/A

      \[\leadsto {\left(a \cdot \sin \left(\frac{1}{180} \cdot \left(\mathsf{PI}\left(\right) \cdot \color{blue}{angle}\right)\right)\right)}^{2} + b \cdot b \]

   6. lift-PI.f64 N/A

      \[\leadsto {\left(a \cdot \sin \left(\frac{1}{180} \cdot \left(\pi \cdot angle\right)\right)\right)}^{2} + b \cdot b \]

   7. lower-*.f64 79.9

      \[\leadsto {\left(a \cdot \sin \left(0.005555555555555556 \cdot \color{blue}{\left(\pi \cdot angle\right)}\right)\right)}^{2} + b \cdot b \]

7. Applied rewrites 79.9%

   \[\leadsto {\left(a \cdot \sin \color{blue}{\left(0.005555555555555556 \cdot \left(\pi \cdot angle\right)\right)}\right)}^{2} + b \cdot b \]
8. Add Preprocessing

Alternative 3: 67.7% accurate, 2.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq 4.4 \cdot 10^{-56}:\\ \;\;\;\;b \cdot b\\ \mathbf{else}:\\ \;\;\;\;{\left(a \cdot \left(\left(\pi \cdot angle\right) \cdot 0.005555555555555556\right)\right)}^{2} + {b}^{2}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b angle)
 :precision binary64
 (if (<= a 4.4e-56)
   (* b b)
   (+ (pow (* a (* (* PI angle) 0.005555555555555556)) 2.0) (pow b 2.0))))

C

double code(double a, double b, double angle) {
	double tmp;
	if (a <= 4.4e-56) {
		tmp = b * b;
	} else {
		tmp = pow((a * ((((double) M_PI) * angle) * 0.005555555555555556)), 2.0) + pow(b, 2.0);
	}
	return tmp;
}

Java

public static double code(double a, double b, double angle) {
	double tmp;
	if (a <= 4.4e-56) {
		tmp = b * b;
	} else {
		tmp = Math.pow((a * ((Math.PI * angle) * 0.005555555555555556)), 2.0) + Math.pow(b, 2.0);
	}
	return tmp;
}

Python

def code(a, b, angle):
	tmp = 0
	if a <= 4.4e-56:
		tmp = b * b
	else:
		tmp = math.pow((a * ((math.pi * angle) * 0.005555555555555556)), 2.0) + math.pow(b, 2.0)
	return tmp

Julia

function code(a, b, angle)
	tmp = 0.0
	if (a <= 4.4e-56)
		tmp = Float64(b * b);
	else
		tmp = Float64((Float64(a * Float64(Float64(pi * angle) * 0.005555555555555556)) ^ 2.0) + (b ^ 2.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, angle)
	tmp = 0.0;
	if (a <= 4.4e-56)
		tmp = b * b;
	else
		tmp = ((a * ((pi * angle) * 0.005555555555555556)) ^ 2.0) + (b ^ 2.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, angle_] := If[LessEqual[a, 4.4e-56], N[(b * b), $MachinePrecision], N[(N[Power[N[(a * N[(N[(Pi * angle), $MachinePrecision] * 0.005555555555555556), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] + N[Power[b, 2.0], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < 4.40000000000000008e-56

   1. Initial program 79.0%

      \[{\left(a \cdot \sin \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} + {\left(b \cdot \cos \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} \]

   2. Taylor expanded in angle around 0

      \[\leadsto \color{blue}{{b}^{2}} \]
   3. Step-by-step derivation

      1. unpow2 N/A

         \[\leadsto b \cdot \color{blue}{b} \]

      2. lower-*.f64 62.9

         \[\leadsto b \cdot \color{blue}{b} \]

   4. Applied rewrites 62.9%

      \[\leadsto \color{blue}{b \cdot b} \]

   if 4.40000000000000008e-56 < a

   1. Initial program 82.5%

      \[{\left(a \cdot \sin \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} + {\left(b \cdot \cos \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} \]

   2. Taylor expanded in angle around 0

      \[\leadsto {\left(a \cdot \color{blue}{\left(\frac{1}{180} \cdot \left(angle \cdot \mathsf{PI}\left(\right)\right)\right)}\right)}^{2} + {\left(b \cdot \cos \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto {\left(a \cdot \left(\left(angle \cdot \mathsf{PI}\left(\right)\right) \cdot \color{blue}{\frac{1}{180}}\right)\right)}^{2} + {\left(b \cdot \cos \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} \]

      2. lower-*.f64 N/A

         \[\leadsto {\left(a \cdot \left(\left(angle \cdot \mathsf{PI}\left(\right)\right) \cdot \color{blue}{\frac{1}{180}}\right)\right)}^{2} + {\left(b \cdot \cos \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} \]

      3. *-commutative N/A

         \[\leadsto {\left(a \cdot \left(\left(\mathsf{PI}\left(\right) \cdot angle\right) \cdot \frac{1}{180}\right)\right)}^{2} + {\left(b \cdot \cos \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} \]

      4. lower-*.f64 N/A

         \[\leadsto {\left(a \cdot \left(\left(\mathsf{PI}\left(\right) \cdot angle\right) \cdot \frac{1}{180}\right)\right)}^{2} + {\left(b \cdot \cos \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} \]

      5. lift-PI.f64 79.5

         \[\leadsto {\left(a \cdot \left(\left(\pi \cdot angle\right) \cdot 0.005555555555555556\right)\right)}^{2} + {\left(b \cdot \cos \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} \]

   4. Applied rewrites 79.5%

      \[\leadsto {\left(a \cdot \color{blue}{\left(\left(\pi \cdot angle\right) \cdot 0.005555555555555556\right)}\right)}^{2} + {\left(b \cdot \cos \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} \]

   5. Taylor expanded in angle around 0

      \[\leadsto {\left(a \cdot \left(\left(\pi \cdot angle\right) \cdot \frac{1}{180}\right)\right)}^{2} + {\color{blue}{b}}^{2} \]
   6. Step-by-step derivation

   7. Applied rewrites 79.3%

      \[\leadsto {\left(a \cdot \left(\left(\pi \cdot angle\right) \cdot 0.005555555555555556\right)\right)}^{2} + {\color{blue}{b}}^{2} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 67.7% accurate, 3.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq 4.4 \cdot 10^{-56}:\\ \;\;\;\;b \cdot b\\ \mathbf{else}:\\ \;\;\;\;{\left(\left(\left(\pi \cdot angle\right) \cdot a\right) \cdot 0.005555555555555556\right)}^{2} + b \cdot b\\ \end{array} \end{array} \]

FPCore

(FPCore (a b angle)
 :precision binary64
 (if (<= a 4.4e-56)
   (* b b)
   (+ (pow (* (* (* PI angle) a) 0.005555555555555556) 2.0) (* b b))))

C

double code(double a, double b, double angle) {
	double tmp;
	if (a <= 4.4e-56) {
		tmp = b * b;
	} else {
		tmp = pow((((((double) M_PI) * angle) * a) * 0.005555555555555556), 2.0) + (b * b);
	}
	return tmp;
}

Java

public static double code(double a, double b, double angle) {
	double tmp;
	if (a <= 4.4e-56) {
		tmp = b * b;
	} else {
		tmp = Math.pow((((Math.PI * angle) * a) * 0.005555555555555556), 2.0) + (b * b);
	}
	return tmp;
}

Python

def code(a, b, angle):
	tmp = 0
	if a <= 4.4e-56:
		tmp = b * b
	else:
		tmp = math.pow((((math.pi * angle) * a) * 0.005555555555555556), 2.0) + (b * b)
	return tmp

Julia

function code(a, b, angle)
	tmp = 0.0
	if (a <= 4.4e-56)
		tmp = Float64(b * b);
	else
		tmp = Float64((Float64(Float64(Float64(pi * angle) * a) * 0.005555555555555556) ^ 2.0) + Float64(b * b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, angle)
	tmp = 0.0;
	if (a <= 4.4e-56)
		tmp = b * b;
	else
		tmp = ((((pi * angle) * a) * 0.005555555555555556) ^ 2.0) + (b * b);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, angle_] := If[LessEqual[a, 4.4e-56], N[(b * b), $MachinePrecision], N[(N[Power[N[(N[(N[(Pi * angle), $MachinePrecision] * a), $MachinePrecision] * 0.005555555555555556), $MachinePrecision], 2.0], $MachinePrecision] + N[(b * b), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < 4.40000000000000008e-56

   1. Initial program 79.0%

      \[{\left(a \cdot \sin \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} + {\left(b \cdot \cos \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} \]

   2. Taylor expanded in angle around 0

      \[\leadsto \color{blue}{{b}^{2}} \]
   3. Step-by-step derivation

      1. unpow2 N/A

         \[\leadsto b \cdot \color{blue}{b} \]

      2. lower-*.f64 62.9

         \[\leadsto b \cdot \color{blue}{b} \]

   4. Applied rewrites 62.9%

      \[\leadsto \color{blue}{b \cdot b} \]

   if 4.40000000000000008e-56 < a

   1. Initial program 82.5%

      \[{\left(a \cdot \sin \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} + {\left(b \cdot \cos \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} \]

   2. Taylor expanded in angle around 0

      \[\leadsto {\left(a \cdot \sin \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} + \color{blue}{{b}^{2}} \]
   3. Step-by-step derivation

      1. unpow2 N/A

         \[\leadsto {\left(a \cdot \sin \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} + b \cdot \color{blue}{b} \]

      2. lower-*.f64 82.5

         \[\leadsto {\left(a \cdot \sin \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} + b \cdot \color{blue}{b} \]

   4. Applied rewrites 82.5%

      \[\leadsto {\left(a \cdot \sin \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} + \color{blue}{b \cdot b} \]

   5. Taylor expanded in angle around 0

      \[\leadsto {\color{blue}{\left(\frac{1}{180} \cdot \left(a \cdot \left(angle \cdot \mathsf{PI}\left(\right)\right)\right)\right)}}^{2} + b \cdot b \]
   6. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto {\left(\left(a \cdot \left(angle \cdot \mathsf{PI}\left(\right)\right)\right) \cdot \color{blue}{\frac{1}{180}}\right)}^{2} + b \cdot b \]

      2. lower-*.f64 N/A

         \[\leadsto {\left(\left(a \cdot \left(angle \cdot \mathsf{PI}\left(\right)\right)\right) \cdot \color{blue}{\frac{1}{180}}\right)}^{2} + b \cdot b \]

      3. *-commutative N/A

         \[\leadsto {\left(\left(a \cdot \left(\mathsf{PI}\left(\right) \cdot angle\right)\right) \cdot \frac{1}{180}\right)}^{2} + b \cdot b \]

      4. lift-*.f64 N/A

         \[\leadsto {\left(\left(a \cdot \left(\mathsf{PI}\left(\right) \cdot angle\right)\right) \cdot \frac{1}{180}\right)}^{2} + b \cdot b \]

      5. lift-PI.f64 N/A

         \[\leadsto {\left(\left(a \cdot \left(\pi \cdot angle\right)\right) \cdot \frac{1}{180}\right)}^{2} + b \cdot b \]

      6. *-commutative N/A

         \[\leadsto {\left(\left(\left(\pi \cdot angle\right) \cdot a\right) \cdot \frac{1}{180}\right)}^{2} + b \cdot b \]

      7. lower-*.f64 79.3

         \[\leadsto {\left(\left(\left(\pi \cdot angle\right) \cdot a\right) \cdot 0.005555555555555556\right)}^{2} + b \cdot b \]

   7. Applied rewrites 79.3%

      \[\leadsto {\color{blue}{\left(\left(\left(\pi \cdot angle\right) \cdot a\right) \cdot 0.005555555555555556\right)}}^{2} + b \cdot b \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 62.7% accurate, 4.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq 4.4 \cdot 10^{-56}:\\ \;\;\;\;b \cdot b\\ \mathbf{else}:\\ \;\;\;\;\left(3.08641975308642 \cdot 10^{-5} \cdot \left(a \cdot a\right)\right) \cdot \left(\left(\pi \cdot \pi\right) \cdot \left(angle \cdot angle\right)\right) + b \cdot b\\ \end{array} \end{array} \]

FPCore

(FPCore (a b angle)
 :precision binary64
 (if (<= a 4.4e-56)
   (* b b)
   (+
    (* (* 3.08641975308642e-5 (* a a)) (* (* PI PI) (* angle angle)))
    (* b b))))

C

double code(double a, double b, double angle) {
	double tmp;
	if (a <= 4.4e-56) {
		tmp = b * b;
	} else {
		tmp = ((3.08641975308642e-5 * (a * a)) * ((((double) M_PI) * ((double) M_PI)) * (angle * angle))) + (b * b);
	}
	return tmp;
}

Java

public static double code(double a, double b, double angle) {
	double tmp;
	if (a <= 4.4e-56) {
		tmp = b * b;
	} else {
		tmp = ((3.08641975308642e-5 * (a * a)) * ((Math.PI * Math.PI) * (angle * angle))) + (b * b);
	}
	return tmp;
}

Python

def code(a, b, angle):
	tmp = 0
	if a <= 4.4e-56:
		tmp = b * b
	else:
		tmp = ((3.08641975308642e-5 * (a * a)) * ((math.pi * math.pi) * (angle * angle))) + (b * b)
	return tmp

Julia

function code(a, b, angle)
	tmp = 0.0
	if (a <= 4.4e-56)
		tmp = Float64(b * b);
	else
		tmp = Float64(Float64(Float64(3.08641975308642e-5 * Float64(a * a)) * Float64(Float64(pi * pi) * Float64(angle * angle))) + Float64(b * b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b, angle)
	tmp = 0.0;
	if (a <= 4.4e-56)
		tmp = b * b;
	else
		tmp = ((3.08641975308642e-5 * (a * a)) * ((pi * pi) * (angle * angle))) + (b * b);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_, angle_] := If[LessEqual[a, 4.4e-56], N[(b * b), $MachinePrecision], N[(N[(N[(3.08641975308642e-5 * N[(a * a), $MachinePrecision]), $MachinePrecision] * N[(N[(Pi * Pi), $MachinePrecision] * N[(angle * angle), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(b * b), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < 4.40000000000000008e-56

   1. Initial program 79.0%

      \[{\left(a \cdot \sin \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} + {\left(b \cdot \cos \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} \]

   2. Taylor expanded in angle around 0

      \[\leadsto \color{blue}{{b}^{2}} \]
   3. Step-by-step derivation

      1. unpow2 N/A

         \[\leadsto b \cdot \color{blue}{b} \]

      2. lower-*.f64 62.9

         \[\leadsto b \cdot \color{blue}{b} \]

   4. Applied rewrites 62.9%

      \[\leadsto \color{blue}{b \cdot b} \]

   if 4.40000000000000008e-56 < a

   1. Initial program 82.5%

      \[{\left(a \cdot \sin \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} + {\left(b \cdot \cos \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} \]

   2. Taylor expanded in angle around 0

      \[\leadsto {\left(a \cdot \sin \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} + \color{blue}{{b}^{2}} \]
   3. Step-by-step derivation

      1. unpow2 N/A

         \[\leadsto {\left(a \cdot \sin \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} + b \cdot \color{blue}{b} \]

      2. lower-*.f64 82.5

         \[\leadsto {\left(a \cdot \sin \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} + b \cdot \color{blue}{b} \]

   4. Applied rewrites 82.5%

      \[\leadsto {\left(a \cdot \sin \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} + \color{blue}{b \cdot b} \]

   5. Taylor expanded in angle around 0

      \[\leadsto \color{blue}{\frac{1}{32400} \cdot \left({a}^{2} \cdot \left({angle}^{2} \cdot {\mathsf{PI}\left(\right)}^{2}\right)\right)} + b \cdot b \]
   6. Step-by-step derivation

      1. associate-*r* N/A

         \[\leadsto \left(\frac{1}{32400} \cdot {a}^{2}\right) \cdot \color{blue}{\left({angle}^{2} \cdot {\mathsf{PI}\left(\right)}^{2}\right)} + b \cdot b \]

      2. lower-*.f64 N/A

         \[\leadsto \left(\frac{1}{32400} \cdot {a}^{2}\right) \cdot \color{blue}{\left({angle}^{2} \cdot {\mathsf{PI}\left(\right)}^{2}\right)} + b \cdot b \]

      3. lower-*.f64 N/A

         \[\leadsto \left(\frac{1}{32400} \cdot {a}^{2}\right) \cdot \left(\color{blue}{{angle}^{2}} \cdot {\mathsf{PI}\left(\right)}^{2}\right) + b \cdot b \]

      4. unpow2 N/A

         \[\leadsto \left(\frac{1}{32400} \cdot \left(a \cdot a\right)\right) \cdot \left({angle}^{\color{blue}{2}} \cdot {\mathsf{PI}\left(\right)}^{2}\right) + b \cdot b \]

      5. lower-*.f64 N/A

         \[\leadsto \left(\frac{1}{32400} \cdot \left(a \cdot a\right)\right) \cdot \left({angle}^{\color{blue}{2}} \cdot {\mathsf{PI}\left(\right)}^{2}\right) + b \cdot b \]

      6. *-commutative N/A

         \[\leadsto \left(\frac{1}{32400} \cdot \left(a \cdot a\right)\right) \cdot \left({\mathsf{PI}\left(\right)}^{2} \cdot \color{blue}{{angle}^{2}}\right) + b \cdot b \]

      7. lower-*.f64 N/A

         \[\leadsto \left(\frac{1}{32400} \cdot \left(a \cdot a\right)\right) \cdot \left({\mathsf{PI}\left(\right)}^{2} \cdot \color{blue}{{angle}^{2}}\right) + b \cdot b \]

      8. unpow2 N/A

         \[\leadsto \left(\frac{1}{32400} \cdot \left(a \cdot a\right)\right) \cdot \left(\left(\mathsf{PI}\left(\right) \cdot \mathsf{PI}\left(\right)\right) \cdot {\color{blue}{angle}}^{2}\right) + b \cdot b \]

      9. lower-*.f64 N/A

         \[\leadsto \left(\frac{1}{32400} \cdot \left(a \cdot a\right)\right) \cdot \left(\left(\mathsf{PI}\left(\right) \cdot \mathsf{PI}\left(\right)\right) \cdot {\color{blue}{angle}}^{2}\right) + b \cdot b \]

      10. lift-PI.f64 N/A

          \[\leadsto \left(\frac{1}{32400} \cdot \left(a \cdot a\right)\right) \cdot \left(\left(\pi \cdot \mathsf{PI}\left(\right)\right) \cdot {angle}^{2}\right) + b \cdot b \]

      11. lift-PI.f64 N/A

          \[\leadsto \left(\frac{1}{32400} \cdot \left(a \cdot a\right)\right) \cdot \left(\left(\pi \cdot \pi\right) \cdot {angle}^{2}\right) + b \cdot b \]

      12. unpow2 N/A

          \[\leadsto \left(\frac{1}{32400} \cdot \left(a \cdot a\right)\right) \cdot \left(\left(\pi \cdot \pi\right) \cdot \left(angle \cdot \color{blue}{angle}\right)\right) + b \cdot b \]

      13. lower-*.f64 62.2

          \[\leadsto \left(3.08641975308642 \cdot 10^{-5} \cdot \left(a \cdot a\right)\right) \cdot \left(\left(\pi \cdot \pi\right) \cdot \left(angle \cdot \color{blue}{angle}\right)\right) + b \cdot b \]

   7. Applied rewrites 62.2%

      \[\leadsto \color{blue}{\left(3.08641975308642 \cdot 10^{-5} \cdot \left(a \cdot a\right)\right) \cdot \left(\left(\pi \cdot \pi\right) \cdot \left(angle \cdot angle\right)\right)} + b \cdot b \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 57.8% accurate, 29.7× speedup

Math

\[\begin{array}{l} \\ b \cdot b \end{array} \]

FPCore

(FPCore (a b angle) :precision binary64 (* b b))

C

double code(double a, double b, double angle) {
	return b * b;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b, angle)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: angle
    code = b * b
end function

Java

public static double code(double a, double b, double angle) {
	return b * b;
}

Python

def code(a, b, angle):
	return b * b

Julia

function code(a, b, angle)
	return Float64(b * b)
end

MATLAB

function tmp = code(a, b, angle)
	tmp = b * b;
end

Wolfram

code[a_, b_, angle_] := N[(b * b), $MachinePrecision]

Derivation

1. Initial program 80.0%

   \[{\left(a \cdot \sin \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} + {\left(b \cdot \cos \left(\frac{angle}{180} \cdot \pi\right)\right)}^{2} \]

2. Taylor expanded in angle around 0

   \[\leadsto \color{blue}{{b}^{2}} \]
3. Step-by-step derivation

   1. unpow2 N/A

      \[\leadsto b \cdot \color{blue}{b} \]

   2. lower-*.f64 57.8

      \[\leadsto b \cdot \color{blue}{b} \]

4. Applied rewrites 57.8%

   \[\leadsto \color{blue}{b \cdot b} \]
5. Add Preprocessing

Reproduce

herbie shell --seed 2025122 
(FPCore (a b angle)
  :name "ab-angle->ABCF A"
  :precision binary64
  (+ (pow (* a (sin (* (/ angle 180.0) PI))) 2.0) (pow (* b (cos (* (/ angle 180.0) PI))) 2.0)))