Migdal et al, Equation (64)

Percentage Accurate: 99.5% → 99.6%

Time: 7.3s

Alternatives: 9

Speedup: 2.0×

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

Specification

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{\cos th}{\sqrt{2}}\\ t\_1 \cdot \left(a1 \cdot a1\right) + t\_1 \cdot \left(a2 \cdot a2\right) \end{array} \end{array} \]

FPCore

(FPCore (a1 a2 th)
 :precision binary64
 (let* ((t_1 (/ (cos th) (sqrt 2.0))))
   (+ (* t_1 (* a1 a1)) (* t_1 (* a2 a2)))))

C

double code(double a1, double a2, double th) {
	double t_1 = cos(th) / sqrt(2.0);
	return (t_1 * (a1 * a1)) + (t_1 * (a2 * a2));
}

Fortran

real(8) function code(a1, a2, th)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: th
    real(8) :: t_1
    t_1 = cos(th) / sqrt(2.0d0)
    code = (t_1 * (a1 * a1)) + (t_1 * (a2 * a2))
end function

Java

public static double code(double a1, double a2, double th) {
	double t_1 = Math.cos(th) / Math.sqrt(2.0);
	return (t_1 * (a1 * a1)) + (t_1 * (a2 * a2));
}

Python

def code(a1, a2, th):
	t_1 = math.cos(th) / math.sqrt(2.0)
	return (t_1 * (a1 * a1)) + (t_1 * (a2 * a2))

Julia

function code(a1, a2, th)
	t_1 = Float64(cos(th) / sqrt(2.0))
	return Float64(Float64(t_1 * Float64(a1 * a1)) + Float64(t_1 * Float64(a2 * a2)))
end

MATLAB

function tmp = code(a1, a2, th)
	t_1 = cos(th) / sqrt(2.0);
	tmp = (t_1 * (a1 * a1)) + (t_1 * (a2 * a2));
end

Wolfram

code[a1_, a2_, th_] := Block[{t$95$1 = N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, N[(N[(t$95$1 * N[(a1 * a1), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Initial Program: 99.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{\cos th}{\sqrt{2}}\\ t\_1 \cdot \left(a1 \cdot a1\right) + t\_1 \cdot \left(a2 \cdot a2\right) \end{array} \end{array} \]

FPCore

(FPCore (a1 a2 th)
 :precision binary64
 (let* ((t_1 (/ (cos th) (sqrt 2.0))))
   (+ (* t_1 (* a1 a1)) (* t_1 (* a2 a2)))))

C

double code(double a1, double a2, double th) {
	double t_1 = cos(th) / sqrt(2.0);
	return (t_1 * (a1 * a1)) + (t_1 * (a2 * a2));
}

Fortran

real(8) function code(a1, a2, th)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: th
    real(8) :: t_1
    t_1 = cos(th) / sqrt(2.0d0)
    code = (t_1 * (a1 * a1)) + (t_1 * (a2 * a2))
end function

Java

public static double code(double a1, double a2, double th) {
	double t_1 = Math.cos(th) / Math.sqrt(2.0);
	return (t_1 * (a1 * a1)) + (t_1 * (a2 * a2));
}

Python

def code(a1, a2, th):
	t_1 = math.cos(th) / math.sqrt(2.0)
	return (t_1 * (a1 * a1)) + (t_1 * (a2 * a2))

Julia

function code(a1, a2, th)
	t_1 = Float64(cos(th) / sqrt(2.0))
	return Float64(Float64(t_1 * Float64(a1 * a1)) + Float64(t_1 * Float64(a2 * a2)))
end

MATLAB

function tmp = code(a1, a2, th)
	t_1 = cos(th) / sqrt(2.0);
	tmp = (t_1 * (a1 * a1)) + (t_1 * (a2 * a2));
end

Wolfram

code[a1_, a2_, th_] := Block[{t$95$1 = N[(N[Cos[th], $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]}, N[(N[(t$95$1 * N[(a1 * a1), $MachinePrecision]), $MachinePrecision] + N[(t$95$1 * N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Alternative 1: 99.6% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \cos th \cdot \frac{\mathsf{fma}\left(a2, a2, a1 \cdot a1\right)}{\sqrt{2}} \end{array} \]

FPCore

(FPCore (a1 a2 th)
 :precision binary64
 (* (cos th) (/ (fma a2 a2 (* a1 a1)) (sqrt 2.0))))

C

double code(double a1, double a2, double th) {
	return cos(th) * (fma(a2, a2, (a1 * a1)) / sqrt(2.0));
}

Julia

function code(a1, a2, th)
	return Float64(cos(th) * Float64(fma(a2, a2, Float64(a1 * a1)) / sqrt(2.0)))
end

Wolfram

code[a1_, a2_, th_] := N[(N[Cos[th], $MachinePrecision] * N[(N[(a2 * a2 + N[(a1 * a1), $MachinePrecision]), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.6%

   \[\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1\right) + \frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right) \]
2. Step-by-step derivation

   1. distribute-lft-out 99.6%

      \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]

   2. cos-neg 99.6%

      \[\leadsto \frac{\color{blue}{\cos \left(-th\right)}}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   3. associate-*l/ 99.6%

      \[\leadsto \color{blue}{\frac{\cos \left(-th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)}{\sqrt{2}}} \]

   4. associate-/l* 99.6%

      \[\leadsto \color{blue}{\cos \left(-th\right) \cdot \frac{a1 \cdot a1 + a2 \cdot a2}{\sqrt{2}}} \]

   5. cos-neg 99.6%

      \[\leadsto \color{blue}{\cos th} \cdot \frac{a1 \cdot a1 + a2 \cdot a2}{\sqrt{2}} \]

   6. +-commutative 99.6%

      \[\leadsto \cos th \cdot \frac{\color{blue}{a2 \cdot a2 + a1 \cdot a1}}{\sqrt{2}} \]

   7. fma-define 99.6%

      \[\leadsto \cos th \cdot \frac{\color{blue}{\mathsf{fma}\left(a2, a2, a1 \cdot a1\right)}}{\sqrt{2}} \]

3. Simplified 99.6%

   \[\leadsto \color{blue}{\cos th \cdot \frac{\mathsf{fma}\left(a2, a2, a1 \cdot a1\right)}{\sqrt{2}}} \]
4. Add Preprocessing

5. Final simplification 99.6%

   \[\leadsto \cos th \cdot \frac{\mathsf{fma}\left(a2, a2, a1 \cdot a1\right)}{\sqrt{2}} \]
6. Add Preprocessing

Alternative 2: 72.1% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\cos th \leq 0.7:\\ \;\;\;\;a2 \cdot \left(\cos th \cdot a2\right)\\ \mathbf{else}:\\ \;\;\;\;\sqrt{0.5} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (a1 a2 th)
 :precision binary64
 (if (<= (cos th) 0.7)
   (* a2 (* (cos th) a2))
   (* (sqrt 0.5) (+ (* a1 a1) (* a2 a2)))))

C

double code(double a1, double a2, double th) {
	double tmp;
	if (cos(th) <= 0.7) {
		tmp = a2 * (cos(th) * a2);
	} else {
		tmp = sqrt(0.5) * ((a1 * a1) + (a2 * a2));
	}
	return tmp;
}

Fortran

real(8) function code(a1, a2, th)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: th
    real(8) :: tmp
    if (cos(th) <= 0.7d0) then
        tmp = a2 * (cos(th) * a2)
    else
        tmp = sqrt(0.5d0) * ((a1 * a1) + (a2 * a2))
    end if
    code = tmp
end function

Java

public static double code(double a1, double a2, double th) {
	double tmp;
	if (Math.cos(th) <= 0.7) {
		tmp = a2 * (Math.cos(th) * a2);
	} else {
		tmp = Math.sqrt(0.5) * ((a1 * a1) + (a2 * a2));
	}
	return tmp;
}

Python

def code(a1, a2, th):
	tmp = 0
	if math.cos(th) <= 0.7:
		tmp = a2 * (math.cos(th) * a2)
	else:
		tmp = math.sqrt(0.5) * ((a1 * a1) + (a2 * a2))
	return tmp

Julia

function code(a1, a2, th)
	tmp = 0.0
	if (cos(th) <= 0.7)
		tmp = Float64(a2 * Float64(cos(th) * a2));
	else
		tmp = Float64(sqrt(0.5) * Float64(Float64(a1 * a1) + Float64(a2 * a2)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a1, a2, th)
	tmp = 0.0;
	if (cos(th) <= 0.7)
		tmp = a2 * (cos(th) * a2);
	else
		tmp = sqrt(0.5) * ((a1 * a1) + (a2 * a2));
	end
	tmp_2 = tmp;
end

Wolfram

code[a1_, a2_, th_] := If[LessEqual[N[Cos[th], $MachinePrecision], 0.7], N[(a2 * N[(N[Cos[th], $MachinePrecision] * a2), $MachinePrecision]), $MachinePrecision], N[(N[Sqrt[0.5], $MachinePrecision] * N[(N[(a1 * a1), $MachinePrecision] + N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (cos.f64 th) < 0.69999999999999996

   1. Initial program 99.6%

      \[\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1\right) + \frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right) \]
   2. Step-by-step derivation

      1. distribute-lft-out 99.6%

         \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]

      2. cos-neg 99.6%

         \[\leadsto \frac{\color{blue}{\cos \left(-th\right)}}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      3. associate-*l/ 99.6%

         \[\leadsto \color{blue}{\frac{\cos \left(-th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)}{\sqrt{2}}} \]

      4. associate-/l* 99.6%

         \[\leadsto \color{blue}{\cos \left(-th\right) \cdot \frac{a1 \cdot a1 + a2 \cdot a2}{\sqrt{2}}} \]

      5. cos-neg 99.6%

         \[\leadsto \color{blue}{\cos th} \cdot \frac{a1 \cdot a1 + a2 \cdot a2}{\sqrt{2}} \]

      6. +-commutative 99.6%

         \[\leadsto \cos th \cdot \frac{\color{blue}{a2 \cdot a2 + a1 \cdot a1}}{\sqrt{2}} \]

      7. fma-define 99.6%

         \[\leadsto \cos th \cdot \frac{\color{blue}{\mathsf{fma}\left(a2, a2, a1 \cdot a1\right)}}{\sqrt{2}} \]

   3. Simplified 99.6%

      \[\leadsto \color{blue}{\cos th \cdot \frac{\mathsf{fma}\left(a2, a2, a1 \cdot a1\right)}{\sqrt{2}}} \]
   4. Add Preprocessing

   5. Taylor expanded in a2 around inf 54.0%

      \[\leadsto \color{blue}{\frac{{a2}^{2} \cdot \cos th}{\sqrt{2}}} \]

   7. Applied egg-rr 37.2%

      \[\leadsto \color{blue}{\left(a2 \cdot \cos th\right) \cdot a2} \]

   if 0.69999999999999996 < (cos.f64 th)

   1. Initial program 99.5%

      \[\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1\right) + \frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right) \]
   2. Step-by-step derivation

      1. distribute-lft-out 99.5%

         \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]

   3. Simplified 99.5%

      \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. clear-num 99.5%

         \[\leadsto \color{blue}{\frac{1}{\frac{\sqrt{2}}{\cos th}}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      2. associate-/r/ 99.5%

         \[\leadsto \color{blue}{\left(\frac{1}{\sqrt{2}} \cdot \cos th\right)} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      3. pow1/2 99.5%

         \[\leadsto \left(\frac{1}{\color{blue}{{2}^{0.5}}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      4. pow-flip 99.6%

         \[\leadsto \left(\color{blue}{{2}^{\left(-0.5\right)}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

      5. metadata-eval 99.6%

         \[\leadsto \left({2}^{\color{blue}{-0.5}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   6. Applied egg-rr 99.6%

      \[\leadsto \color{blue}{\left({2}^{-0.5} \cdot \cos th\right)} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   7. Taylor expanded in th around 0 91.0%

      \[\leadsto \color{blue}{\sqrt{0.5}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 69.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\cos th \leq 0.7:\\ \;\;\;\;a2 \cdot \left(\cos th \cdot a2\right)\\ \mathbf{else}:\\ \;\;\;\;\sqrt{0.5} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 99.6% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \left(\cos th \cdot \sqrt{0.5}\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \end{array} \]

FPCore

(FPCore (a1 a2 th)
 :precision binary64
 (* (* (cos th) (sqrt 0.5)) (+ (* a1 a1) (* a2 a2))))

C

double code(double a1, double a2, double th) {
	return (cos(th) * sqrt(0.5)) * ((a1 * a1) + (a2 * a2));
}

Fortran

real(8) function code(a1, a2, th)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: th
    code = (cos(th) * sqrt(0.5d0)) * ((a1 * a1) + (a2 * a2))
end function

Java

public static double code(double a1, double a2, double th) {
	return (Math.cos(th) * Math.sqrt(0.5)) * ((a1 * a1) + (a2 * a2));
}

Python

def code(a1, a2, th):
	return (math.cos(th) * math.sqrt(0.5)) * ((a1 * a1) + (a2 * a2))

Julia

function code(a1, a2, th)
	return Float64(Float64(cos(th) * sqrt(0.5)) * Float64(Float64(a1 * a1) + Float64(a2 * a2)))
end

MATLAB

function tmp = code(a1, a2, th)
	tmp = (cos(th) * sqrt(0.5)) * ((a1 * a1) + (a2 * a2));
end

Wolfram

code[a1_, a2_, th_] := N[(N[(N[Cos[th], $MachinePrecision] * N[Sqrt[0.5], $MachinePrecision]), $MachinePrecision] * N[(N[(a1 * a1), $MachinePrecision] + N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.6%

   \[\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1\right) + \frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right) \]
2. Step-by-step derivation

   1. distribute-lft-out 99.6%

      \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]

3. Simplified 99.6%

   \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]
4. Add Preprocessing
5. Step-by-step derivation

   1. clear-num 99.5%

      \[\leadsto \color{blue}{\frac{1}{\frac{\sqrt{2}}{\cos th}}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   2. associate-/r/ 99.5%

      \[\leadsto \color{blue}{\left(\frac{1}{\sqrt{2}} \cdot \cos th\right)} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   3. pow1/2 99.5%

      \[\leadsto \left(\frac{1}{\color{blue}{{2}^{0.5}}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   4. pow-flip 99.6%

      \[\leadsto \left(\color{blue}{{2}^{\left(-0.5\right)}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   5. metadata-eval 99.6%

      \[\leadsto \left({2}^{\color{blue}{-0.5}} \cdot \cos th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

6. Applied egg-rr 99.6%

   \[\leadsto \color{blue}{\left({2}^{-0.5} \cdot \cos th\right)} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

7. Taylor expanded in th around inf 99.6%

   \[\leadsto \color{blue}{\left(\cos th \cdot \sqrt{0.5}\right)} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]
8. Step-by-step derivation

   1. *-commutative 99.6%

      \[\leadsto \color{blue}{\left(\sqrt{0.5} \cdot \cos th\right)} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

9. Simplified 99.6%

   \[\leadsto \color{blue}{\left(\sqrt{0.5} \cdot \cos th\right)} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

10. Final simplification 99.6%

    \[\leadsto \left(\cos th \cdot \sqrt{0.5}\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]
11. Add Preprocessing

Alternative 4: 58.1% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \cos th \cdot \left(a2 \cdot \left(a2 \cdot \sqrt{0.5}\right)\right) \end{array} \]

FPCore

(FPCore (a1 a2 th) :precision binary64 (* (cos th) (* a2 (* a2 (sqrt 0.5)))))

C

double code(double a1, double a2, double th) {
	return cos(th) * (a2 * (a2 * sqrt(0.5)));
}

Fortran

real(8) function code(a1, a2, th)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: th
    code = cos(th) * (a2 * (a2 * sqrt(0.5d0)))
end function

Java

public static double code(double a1, double a2, double th) {
	return Math.cos(th) * (a2 * (a2 * Math.sqrt(0.5)));
}

Python

def code(a1, a2, th):
	return math.cos(th) * (a2 * (a2 * math.sqrt(0.5)))

Julia

function code(a1, a2, th)
	return Float64(cos(th) * Float64(a2 * Float64(a2 * sqrt(0.5))))
end

MATLAB

function tmp = code(a1, a2, th)
	tmp = cos(th) * (a2 * (a2 * sqrt(0.5)));
end

Wolfram

code[a1_, a2_, th_] := N[(N[Cos[th], $MachinePrecision] * N[(a2 * N[(a2 * N[Sqrt[0.5], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.6%

   \[\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1\right) + \frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right) \]
2. Step-by-step derivation

   1. distribute-lft-out 99.6%

      \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]

   2. cos-neg 99.6%

      \[\leadsto \frac{\color{blue}{\cos \left(-th\right)}}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   3. associate-*l/ 99.6%

      \[\leadsto \color{blue}{\frac{\cos \left(-th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)}{\sqrt{2}}} \]

   4. associate-/l* 99.6%

      \[\leadsto \color{blue}{\cos \left(-th\right) \cdot \frac{a1 \cdot a1 + a2 \cdot a2}{\sqrt{2}}} \]

   5. cos-neg 99.6%

      \[\leadsto \color{blue}{\cos th} \cdot \frac{a1 \cdot a1 + a2 \cdot a2}{\sqrt{2}} \]

   6. +-commutative 99.6%

      \[\leadsto \cos th \cdot \frac{\color{blue}{a2 \cdot a2 + a1 \cdot a1}}{\sqrt{2}} \]

   7. fma-define 99.6%

      \[\leadsto \cos th \cdot \frac{\color{blue}{\mathsf{fma}\left(a2, a2, a1 \cdot a1\right)}}{\sqrt{2}} \]

3. Simplified 99.6%

   \[\leadsto \color{blue}{\cos th \cdot \frac{\mathsf{fma}\left(a2, a2, a1 \cdot a1\right)}{\sqrt{2}}} \]
4. Add Preprocessing

5. Taylor expanded in a2 around inf 56.9%

   \[\leadsto \cos th \cdot \color{blue}{\frac{{a2}^{2}}{\sqrt{2}}} \]
6. Step-by-step derivation

   1. pow2 56.9%

      \[\leadsto \cos th \cdot \frac{\color{blue}{a2 \cdot a2}}{\sqrt{2}} \]

   2. div-inv 56.8%

      \[\leadsto \cos th \cdot \color{blue}{\left(\left(a2 \cdot a2\right) \cdot \frac{1}{\sqrt{2}}\right)} \]

   3. pow1/2 56.8%

      \[\leadsto \cos th \cdot \left(\left(a2 \cdot a2\right) \cdot \frac{1}{\color{blue}{{2}^{0.5}}}\right) \]

   4. pow-flip 56.9%

      \[\leadsto \cos th \cdot \left(\left(a2 \cdot a2\right) \cdot \color{blue}{{2}^{\left(-0.5\right)}}\right) \]

   5. metadata-eval 56.9%

      \[\leadsto \cos th \cdot \left(\left(a2 \cdot a2\right) \cdot {2}^{\color{blue}{-0.5}}\right) \]

   6. associate-*l* 56.9%

      \[\leadsto \cos th \cdot \color{blue}{\left(a2 \cdot \left(a2 \cdot {2}^{-0.5}\right)\right)} \]

   7. add-sqr-sqrt 56.6%

      \[\leadsto \cos th \cdot \left(a2 \cdot \left(a2 \cdot \color{blue}{\left(\sqrt{{2}^{-0.5}} \cdot \sqrt{{2}^{-0.5}}\right)}\right)\right) \]

   8. sqrt-unprod 56.9%

      \[\leadsto \cos th \cdot \left(a2 \cdot \left(a2 \cdot \color{blue}{\sqrt{{2}^{-0.5} \cdot {2}^{-0.5}}}\right)\right) \]

   9. pow-prod-up 56.9%

      \[\leadsto \cos th \cdot \left(a2 \cdot \left(a2 \cdot \sqrt{\color{blue}{{2}^{\left(-0.5 + -0.5\right)}}}\right)\right) \]

   10. metadata-eval 56.9%

       \[\leadsto \cos th \cdot \left(a2 \cdot \left(a2 \cdot \sqrt{{2}^{\color{blue}{-1}}}\right)\right) \]

   11. metadata-eval 56.9%

       \[\leadsto \cos th \cdot \left(a2 \cdot \left(a2 \cdot \sqrt{\color{blue}{0.5}}\right)\right) \]

7. Applied egg-rr 56.9%

   \[\leadsto \cos th \cdot \color{blue}{\left(a2 \cdot \left(a2 \cdot \sqrt{0.5}\right)\right)} \]

8. Final simplification 56.9%

   \[\leadsto \cos th \cdot \left(a2 \cdot \left(a2 \cdot \sqrt{0.5}\right)\right) \]
9. Add Preprocessing

Alternative 5: 38.5% accurate, 4.0× speedup

Math

\[\begin{array}{l} \\ a2 \cdot \left(\cos th \cdot a2\right) \end{array} \]

FPCore

(FPCore (a1 a2 th) :precision binary64 (* a2 (* (cos th) a2)))

C

double code(double a1, double a2, double th) {
	return a2 * (cos(th) * a2);
}

Fortran

real(8) function code(a1, a2, th)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: th
    code = a2 * (cos(th) * a2)
end function

Java

public static double code(double a1, double a2, double th) {
	return a2 * (Math.cos(th) * a2);
}

Python

def code(a1, a2, th):
	return a2 * (math.cos(th) * a2)

Julia

function code(a1, a2, th)
	return Float64(a2 * Float64(cos(th) * a2))
end

MATLAB

function tmp = code(a1, a2, th)
	tmp = a2 * (cos(th) * a2);
end

Wolfram

code[a1_, a2_, th_] := N[(a2 * N[(N[Cos[th], $MachinePrecision] * a2), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.6%

   \[\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1\right) + \frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right) \]
2. Step-by-step derivation

   1. distribute-lft-out 99.6%

      \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]

   2. cos-neg 99.6%

      \[\leadsto \frac{\color{blue}{\cos \left(-th\right)}}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   3. associate-*l/ 99.6%

      \[\leadsto \color{blue}{\frac{\cos \left(-th\right) \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)}{\sqrt{2}}} \]

   4. associate-/l* 99.6%

      \[\leadsto \color{blue}{\cos \left(-th\right) \cdot \frac{a1 \cdot a1 + a2 \cdot a2}{\sqrt{2}}} \]

   5. cos-neg 99.6%

      \[\leadsto \color{blue}{\cos th} \cdot \frac{a1 \cdot a1 + a2 \cdot a2}{\sqrt{2}} \]

   6. +-commutative 99.6%

      \[\leadsto \cos th \cdot \frac{\color{blue}{a2 \cdot a2 + a1 \cdot a1}}{\sqrt{2}} \]

   7. fma-define 99.6%

      \[\leadsto \cos th \cdot \frac{\color{blue}{\mathsf{fma}\left(a2, a2, a1 \cdot a1\right)}}{\sqrt{2}} \]

3. Simplified 99.6%

   \[\leadsto \color{blue}{\cos th \cdot \frac{\mathsf{fma}\left(a2, a2, a1 \cdot a1\right)}{\sqrt{2}}} \]
4. Add Preprocessing

5. Taylor expanded in a2 around inf 56.9%

   \[\leadsto \color{blue}{\frac{{a2}^{2} \cdot \cos th}{\sqrt{2}}} \]

7. Applied egg-rr 36.4%

   \[\leadsto \color{blue}{\left(a2 \cdot \cos th\right) \cdot a2} \]

8. Final simplification 36.4%

   \[\leadsto a2 \cdot \left(\cos th \cdot a2\right) \]
9. Add Preprocessing

Alternative 6: 46.2% accurate, 17.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := a1 \cdot a1 + a2 \cdot a2\\ t_2 := t\_1 \cdot 0.25\\ \mathbf{if}\;th \leq 4200:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;th \leq 8 \cdot 10^{+80}:\\ \;\;\;\;t\_1 \cdot -0.25\\ \mathbf{elif}\;th \leq 1.4 \cdot 10^{+106}:\\ \;\;\;\;t\_2\\ \mathbf{else}:\\ \;\;\;\;t\_1 \cdot -0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (a1 a2 th)
 :precision binary64
 (let* ((t_1 (+ (* a1 a1) (* a2 a2))) (t_2 (* t_1 0.25)))
   (if (<= th 4200.0)
     t_2
     (if (<= th 8e+80) (* t_1 -0.25) (if (<= th 1.4e+106) t_2 (* t_1 -0.5))))))

C

double code(double a1, double a2, double th) {
	double t_1 = (a1 * a1) + (a2 * a2);
	double t_2 = t_1 * 0.25;
	double tmp;
	if (th <= 4200.0) {
		tmp = t_2;
	} else if (th <= 8e+80) {
		tmp = t_1 * -0.25;
	} else if (th <= 1.4e+106) {
		tmp = t_2;
	} else {
		tmp = t_1 * -0.5;
	}
	return tmp;
}

Fortran

real(8) function code(a1, a2, th)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: th
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = (a1 * a1) + (a2 * a2)
    t_2 = t_1 * 0.25d0
    if (th <= 4200.0d0) then
        tmp = t_2
    else if (th <= 8d+80) then
        tmp = t_1 * (-0.25d0)
    else if (th <= 1.4d+106) then
        tmp = t_2
    else
        tmp = t_1 * (-0.5d0)
    end if
    code = tmp
end function

Java

public static double code(double a1, double a2, double th) {
	double t_1 = (a1 * a1) + (a2 * a2);
	double t_2 = t_1 * 0.25;
	double tmp;
	if (th <= 4200.0) {
		tmp = t_2;
	} else if (th <= 8e+80) {
		tmp = t_1 * -0.25;
	} else if (th <= 1.4e+106) {
		tmp = t_2;
	} else {
		tmp = t_1 * -0.5;
	}
	return tmp;
}

Python

def code(a1, a2, th):
	t_1 = (a1 * a1) + (a2 * a2)
	t_2 = t_1 * 0.25
	tmp = 0
	if th <= 4200.0:
		tmp = t_2
	elif th <= 8e+80:
		tmp = t_1 * -0.25
	elif th <= 1.4e+106:
		tmp = t_2
	else:
		tmp = t_1 * -0.5
	return tmp

Julia

function code(a1, a2, th)
	t_1 = Float64(Float64(a1 * a1) + Float64(a2 * a2))
	t_2 = Float64(t_1 * 0.25)
	tmp = 0.0
	if (th <= 4200.0)
		tmp = t_2;
	elseif (th <= 8e+80)
		tmp = Float64(t_1 * -0.25);
	elseif (th <= 1.4e+106)
		tmp = t_2;
	else
		tmp = Float64(t_1 * -0.5);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a1, a2, th)
	t_1 = (a1 * a1) + (a2 * a2);
	t_2 = t_1 * 0.25;
	tmp = 0.0;
	if (th <= 4200.0)
		tmp = t_2;
	elseif (th <= 8e+80)
		tmp = t_1 * -0.25;
	elseif (th <= 1.4e+106)
		tmp = t_2;
	else
		tmp = t_1 * -0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[a1_, a2_, th_] := Block[{t$95$1 = N[(N[(a1 * a1), $MachinePrecision] + N[(a2 * a2), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * 0.25), $MachinePrecision]}, If[LessEqual[th, 4200.0], t$95$2, If[LessEqual[th, 8e+80], N[(t$95$1 * -0.25), $MachinePrecision], If[LessEqual[th, 1.4e+106], t$95$2, N[(t$95$1 * -0.5), $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

2. if th < 4200 or 8e80 < th < 1.39999999999999996e106

   1. Initial program 99.5%

      \[\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1\right) + \frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right) \]
   2. Step-by-step derivation

      1. distribute-lft-out 99.5%

         \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]

   3. Simplified 99.5%

      \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in th around 0 73.4%

      \[\leadsto \color{blue}{\frac{1}{\sqrt{2}}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   7. Applied egg-rr 47.6%

      \[\leadsto \color{blue}{0.25} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   if 4200 < th < 8e80

   1. Initial program 99.5%

      \[\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1\right) + \frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right) \]
   2. Step-by-step derivation

      1. distribute-lft-out 99.5%

         \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]

   3. Simplified 99.5%

      \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in th around 0 35.4%

      \[\leadsto \color{blue}{\frac{1}{\sqrt{2}}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   7. Applied egg-rr 33.0%

      \[\leadsto \color{blue}{-0.25} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   if 1.39999999999999996e106 < th

   1. Initial program 99.7%

      \[\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1\right) + \frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right) \]
   2. Step-by-step derivation

      1. distribute-lft-out 99.8%

         \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]

   3. Simplified 99.8%

      \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in th around 0 26.0%

      \[\leadsto \color{blue}{\frac{1}{\sqrt{2}}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   7. Applied egg-rr 53.8%

      \[\leadsto \color{blue}{-0.5} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]
3. Recombined 3 regimes into one program.

4. Final simplification 47.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;th \leq 4200:\\ \;\;\;\;\left(a1 \cdot a1 + a2 \cdot a2\right) \cdot 0.25\\ \mathbf{elif}\;th \leq 8 \cdot 10^{+80}:\\ \;\;\;\;\left(a1 \cdot a1 + a2 \cdot a2\right) \cdot -0.25\\ \mathbf{elif}\;th \leq 1.4 \cdot 10^{+106}:\\ \;\;\;\;\left(a1 \cdot a1 + a2 \cdot a2\right) \cdot 0.25\\ \mathbf{else}:\\ \;\;\;\;\left(a1 \cdot a1 + a2 \cdot a2\right) \cdot -0.5\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 46.4% accurate, 29.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a2 \leq 1.95 \cdot 10^{+292}:\\ \;\;\;\;0.5 \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)\\ \mathbf{else}:\\ \;\;\;\;\left(-a1 \cdot a1\right) - a2 \cdot a2\\ \end{array} \end{array} \]

FPCore

(FPCore (a1 a2 th)
 :precision binary64
 (if (<= a2 1.95e+292)
   (* 0.5 (+ (* a1 a1) (* a2 a2)))
   (- (- (* a1 a1)) (* a2 a2))))

C

double code(double a1, double a2, double th) {
	double tmp;
	if (a2 <= 1.95e+292) {
		tmp = 0.5 * ((a1 * a1) + (a2 * a2));
	} else {
		tmp = -(a1 * a1) - (a2 * a2);
	}
	return tmp;
}

Fortran

real(8) function code(a1, a2, th)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: th
    real(8) :: tmp
    if (a2 <= 1.95d+292) then
        tmp = 0.5d0 * ((a1 * a1) + (a2 * a2))
    else
        tmp = -(a1 * a1) - (a2 * a2)
    end if
    code = tmp
end function

Java

public static double code(double a1, double a2, double th) {
	double tmp;
	if (a2 <= 1.95e+292) {
		tmp = 0.5 * ((a1 * a1) + (a2 * a2));
	} else {
		tmp = -(a1 * a1) - (a2 * a2);
	}
	return tmp;
}

Python

def code(a1, a2, th):
	tmp = 0
	if a2 <= 1.95e+292:
		tmp = 0.5 * ((a1 * a1) + (a2 * a2))
	else:
		tmp = -(a1 * a1) - (a2 * a2)
	return tmp

Julia

function code(a1, a2, th)
	tmp = 0.0
	if (a2 <= 1.95e+292)
		tmp = Float64(0.5 * Float64(Float64(a1 * a1) + Float64(a2 * a2)));
	else
		tmp = Float64(Float64(-Float64(a1 * a1)) - Float64(a2 * a2));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a1, a2, th)
	tmp = 0.0;
	if (a2 <= 1.95e+292)
		tmp = 0.5 * ((a1 * a1) + (a2 * a2));
	else
		tmp = -(a1 * a1) - (a2 * a2);
	end
	tmp_2 = tmp;
end

Wolfram

code[a1_, a2_, th_] := If[LessEqual[a2, 1.95e+292], N[(0.5 * N[(N[(a1 * a1), $MachinePrecision] + N[(a2 * a2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[((-N[(a1 * a1), $MachinePrecision]) - N[(a2 * a2), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a2 < 1.95e292

   1. Initial program 99.6%

      \[\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1\right) + \frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right) \]
   2. Step-by-step derivation

      1. distribute-lft-out 99.6%

         \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]

   3. Simplified 99.6%

      \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in th around 0 62.7%

      \[\leadsto \color{blue}{\frac{1}{\sqrt{2}}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   7. Applied egg-rr 43.4%

      \[\leadsto \color{blue}{0.5} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   if 1.95e292 < a2

   1. Initial program 100.0%

      \[\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1\right) + \frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right) \]
   2. Step-by-step derivation

      1. distribute-lft-out 100.0%

         \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in th around 0 100.0%

      \[\leadsto \color{blue}{\frac{1}{\sqrt{2}}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

   7. Applied egg-rr 0.0%

      \[\leadsto \color{blue}{-1} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 43.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a2 \leq 1.95 \cdot 10^{+292}:\\ \;\;\;\;0.5 \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)\\ \mathbf{else}:\\ \;\;\;\;\left(-a1 \cdot a1\right) - a2 \cdot a2\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 20.2% accurate, 46.1× speedup

Math

\[\begin{array}{l} \\ \left(a1 \cdot a1 + a2 \cdot a2\right) \cdot -0.5 \end{array} \]

FPCore

(FPCore (a1 a2 th) :precision binary64 (* (+ (* a1 a1) (* a2 a2)) -0.5))

C

double code(double a1, double a2, double th) {
	return ((a1 * a1) + (a2 * a2)) * -0.5;
}

Fortran

real(8) function code(a1, a2, th)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: th
    code = ((a1 * a1) + (a2 * a2)) * (-0.5d0)
end function

Java

public static double code(double a1, double a2, double th) {
	return ((a1 * a1) + (a2 * a2)) * -0.5;
}

Python

def code(a1, a2, th):
	return ((a1 * a1) + (a2 * a2)) * -0.5

Julia

function code(a1, a2, th)
	return Float64(Float64(Float64(a1 * a1) + Float64(a2 * a2)) * -0.5)
end

MATLAB

function tmp = code(a1, a2, th)
	tmp = ((a1 * a1) + (a2 * a2)) * -0.5;
end

Wolfram

code[a1_, a2_, th_] := N[(N[(N[(a1 * a1), $MachinePrecision] + N[(a2 * a2), $MachinePrecision]), $MachinePrecision] * -0.5), $MachinePrecision]

Derivation

1. Initial program 99.6%

   \[\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1\right) + \frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right) \]
2. Step-by-step derivation

   1. distribute-lft-out 99.6%

      \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]

3. Simplified 99.6%

   \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]
4. Add Preprocessing

5. Taylor expanded in th around 0 62.9%

   \[\leadsto \color{blue}{\frac{1}{\sqrt{2}}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

7. Applied egg-rr 21.3%

   \[\leadsto \color{blue}{-0.5} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

8. Final simplification 21.3%

   \[\leadsto \left(a1 \cdot a1 + a2 \cdot a2\right) \cdot -0.5 \]
9. Add Preprocessing

Alternative 9: 19.9% accurate, 51.9× speedup

Math

\[\begin{array}{l} \\ \left(-a1 \cdot a1\right) - a2 \cdot a2 \end{array} \]

FPCore

(FPCore (a1 a2 th) :precision binary64 (- (- (* a1 a1)) (* a2 a2)))

C

double code(double a1, double a2, double th) {
	return -(a1 * a1) - (a2 * a2);
}

Fortran

real(8) function code(a1, a2, th)
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: th
    code = -(a1 * a1) - (a2 * a2)
end function

Java

public static double code(double a1, double a2, double th) {
	return -(a1 * a1) - (a2 * a2);
}

Python

def code(a1, a2, th):
	return -(a1 * a1) - (a2 * a2)

Julia

function code(a1, a2, th)
	return Float64(Float64(-Float64(a1 * a1)) - Float64(a2 * a2))
end

MATLAB

function tmp = code(a1, a2, th)
	tmp = -(a1 * a1) - (a2 * a2);
end

Wolfram

code[a1_, a2_, th_] := N[((-N[(a1 * a1), $MachinePrecision]) - N[(a2 * a2), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.6%

   \[\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1\right) + \frac{\cos th}{\sqrt{2}} \cdot \left(a2 \cdot a2\right) \]
2. Step-by-step derivation

   1. distribute-lft-out 99.6%

      \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]

3. Simplified 99.6%

   \[\leadsto \color{blue}{\frac{\cos th}{\sqrt{2}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right)} \]
4. Add Preprocessing

5. Taylor expanded in th around 0 62.9%

   \[\leadsto \color{blue}{\frac{1}{\sqrt{2}}} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

7. Applied egg-rr 21.0%

   \[\leadsto \color{blue}{-1} \cdot \left(a1 \cdot a1 + a2 \cdot a2\right) \]

8. Final simplification 21.0%

   \[\leadsto \left(-a1 \cdot a1\right) - a2 \cdot a2 \]
9. Add Preprocessing

Reproduce

herbie shell --seed 2024096 
(FPCore (a1 a2 th)
  :name "Migdal et al, Equation (64)"
  :precision binary64
  (+ (* (/ (cos th) (sqrt 2.0)) (* a1 a1)) (* (/ (cos th) (sqrt 2.0)) (* a2 a2))))