VandenBroeck and Keller, Equation (24)

Percentage Accurate: 99.7% → 99.8%

Time: 5.3s

Alternatives: 11

Speedup: 1.1×

Specification

Math

\[\begin{array}{l} \\ \left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \end{array} \]

FPCore

(FPCore (B x)
 :precision binary64
 (+ (- (* x (/ 1.0 (tan B)))) (/ 1.0 (sin B))))

C

double code(double B, double x) {
	return -(x * (1.0 / tan(B))) + (1.0 / sin(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(b, x)
use fmin_fmax_functions
    real(8), intent (in) :: b
    real(8), intent (in) :: x
    code = -(x * (1.0d0 / tan(b))) + (1.0d0 / sin(b))
end function

Java

public static double code(double B, double x) {
	return -(x * (1.0 / Math.tan(B))) + (1.0 / Math.sin(B));
}

Python

def code(B, x):
	return -(x * (1.0 / math.tan(B))) + (1.0 / math.sin(B))

Julia

function code(B, x)
	return Float64(Float64(-Float64(x * Float64(1.0 / tan(B)))) + Float64(1.0 / sin(B)))
end

MATLAB

function tmp = code(B, x)
	tmp = -(x * (1.0 / tan(B))) + (1.0 / sin(B));
end

Wolfram

code[B_, x_] := N[((-N[(x * N[(1.0 / N[Tan[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]) + N[(1.0 / N[Sin[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 99.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \end{array} \]

FPCore

(FPCore (B x)
 :precision binary64
 (+ (- (* x (/ 1.0 (tan B)))) (/ 1.0 (sin B))))

C

double code(double B, double x) {
	return -(x * (1.0 / tan(B))) + (1.0 / sin(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(b, x)
use fmin_fmax_functions
    real(8), intent (in) :: b
    real(8), intent (in) :: x
    code = -(x * (1.0d0 / tan(b))) + (1.0d0 / sin(b))
end function

Java

public static double code(double B, double x) {
	return -(x * (1.0 / Math.tan(B))) + (1.0 / Math.sin(B));
}

Python

def code(B, x):
	return -(x * (1.0 / math.tan(B))) + (1.0 / math.sin(B))

Julia

function code(B, x)
	return Float64(Float64(-Float64(x * Float64(1.0 / tan(B)))) + Float64(1.0 / sin(B)))
end

MATLAB

function tmp = code(B, x)
	tmp = -(x * (1.0 / tan(B))) + (1.0 / sin(B));
end

Wolfram

code[B_, x_] := N[((-N[(x * N[(1.0 / N[Tan[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]) + N[(1.0 / N[Sin[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x}{-\tan B} + \frac{1}{\sin B} \end{array} \]

FPCore

(FPCore (B x) :precision binary64 (+ (/ x (- (tan B))) (/ 1.0 (sin B))))

C

double code(double B, double x) {
	return (x / -tan(B)) + (1.0 / sin(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(b, x)
use fmin_fmax_functions
    real(8), intent (in) :: b
    real(8), intent (in) :: x
    code = (x / -tan(b)) + (1.0d0 / sin(b))
end function

Java

public static double code(double B, double x) {
	return (x / -Math.tan(B)) + (1.0 / Math.sin(B));
}

Python

def code(B, x):
	return (x / -math.tan(B)) + (1.0 / math.sin(B))

Julia

function code(B, x)
	return Float64(Float64(x / Float64(-tan(B))) + Float64(1.0 / sin(B)))
end

MATLAB

function tmp = code(B, x)
	tmp = (x / -tan(B)) + (1.0 / sin(B));
end

Wolfram

code[B_, x_] := N[(N[(x / (-N[Tan[B], $MachinePrecision])), $MachinePrecision] + N[(1.0 / N[Sin[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.7%

   \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-neg.f64 N/A

      \[\leadsto \color{blue}{\left(\mathsf{neg}\left(x \cdot \frac{1}{\tan B}\right)\right)} + \frac{1}{\sin B} \]

   2. lift-*.f64 N/A

      \[\leadsto \left(\mathsf{neg}\left(\color{blue}{x \cdot \frac{1}{\tan B}}\right)\right) + \frac{1}{\sin B} \]

   3. lift-/.f64 N/A

      \[\leadsto \left(\mathsf{neg}\left(x \cdot \color{blue}{\frac{1}{\tan B}}\right)\right) + \frac{1}{\sin B} \]

   4. associate-*r/ N/A

      \[\leadsto \left(\mathsf{neg}\left(\color{blue}{\frac{x \cdot 1}{\tan B}}\right)\right) + \frac{1}{\sin B} \]

   5. distribute-neg-frac2 N/A

      \[\leadsto \color{blue}{\frac{x \cdot 1}{\mathsf{neg}\left(\tan B\right)}} + \frac{1}{\sin B} \]

   6. lift-tan.f64 N/A

      \[\leadsto \frac{x \cdot 1}{\mathsf{neg}\left(\color{blue}{\tan B}\right)} + \frac{1}{\sin B} \]

   7. tan-neg-rev N/A

      \[\leadsto \frac{x \cdot 1}{\color{blue}{\tan \left(\mathsf{neg}\left(B\right)\right)}} + \frac{1}{\sin B} \]

   8. lower-/.f64 N/A

      \[\leadsto \color{blue}{\frac{x \cdot 1}{\tan \left(\mathsf{neg}\left(B\right)\right)}} + \frac{1}{\sin B} \]

   9. lower-*.f64 N/A

      \[\leadsto \frac{\color{blue}{x \cdot 1}}{\tan \left(\mathsf{neg}\left(B\right)\right)} + \frac{1}{\sin B} \]

   10. tan-neg-rev N/A

       \[\leadsto \frac{x \cdot 1}{\color{blue}{\mathsf{neg}\left(\tan B\right)}} + \frac{1}{\sin B} \]

   11. lift-tan.f64 N/A

       \[\leadsto \frac{x \cdot 1}{\mathsf{neg}\left(\color{blue}{\tan B}\right)} + \frac{1}{\sin B} \]

   12. lower-neg.f64 99.8

       \[\leadsto \frac{x \cdot 1}{\color{blue}{-\tan B}} + \frac{1}{\sin B} \]

4. Applied rewrites 99.8%

   \[\leadsto \color{blue}{\frac{x \cdot 1}{-\tan B}} + \frac{1}{\sin B} \]

5. Taylor expanded in x around 0

   \[\leadsto \frac{\color{blue}{x}}{-\tan B} + \frac{1}{\sin B} \]
6. Step-by-step derivation

7. Applied rewrites 99.8%

   \[\leadsto \frac{\color{blue}{x}}{-\tan B} + \frac{1}{\sin B} \]
8. Add Preprocessing

Alternative 2: 98.3% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x \cdot \frac{-1}{\tan B} + \frac{1}{\sin B}\\ \mathbf{if}\;t\_0 \leq -5 \cdot 10^{+17} \lor \neg \left(t\_0 \leq 1000\right):\\ \;\;\;\;\frac{x}{-\tan B} + \frac{1}{B}\\ \mathbf{else}:\\ \;\;\;\;{\sin B}^{-1}\\ \end{array} \end{array} \]

FPCore

(FPCore (B x)
 :precision binary64
 (let* ((t_0 (+ (* x (/ -1.0 (tan B))) (/ 1.0 (sin B)))))
   (if (or (<= t_0 -5e+17) (not (<= t_0 1000.0)))
     (+ (/ x (- (tan B))) (/ 1.0 B))
     (pow (sin B) -1.0))))

C

double code(double B, double x) {
	double t_0 = (x * (-1.0 / tan(B))) + (1.0 / sin(B));
	double tmp;
	if ((t_0 <= -5e+17) || !(t_0 <= 1000.0)) {
		tmp = (x / -tan(B)) + (1.0 / B);
	} else {
		tmp = pow(sin(B), -1.0);
	}
	return tmp;
}

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(b, x)
use fmin_fmax_functions
    real(8), intent (in) :: b
    real(8), intent (in) :: x
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (x * ((-1.0d0) / tan(b))) + (1.0d0 / sin(b))
    if ((t_0 <= (-5d+17)) .or. (.not. (t_0 <= 1000.0d0))) then
        tmp = (x / -tan(b)) + (1.0d0 / b)
    else
        tmp = sin(b) ** (-1.0d0)
    end if
    code = tmp
end function

Java

public static double code(double B, double x) {
	double t_0 = (x * (-1.0 / Math.tan(B))) + (1.0 / Math.sin(B));
	double tmp;
	if ((t_0 <= -5e+17) || !(t_0 <= 1000.0)) {
		tmp = (x / -Math.tan(B)) + (1.0 / B);
	} else {
		tmp = Math.pow(Math.sin(B), -1.0);
	}
	return tmp;
}

Python

def code(B, x):
	t_0 = (x * (-1.0 / math.tan(B))) + (1.0 / math.sin(B))
	tmp = 0
	if (t_0 <= -5e+17) or not (t_0 <= 1000.0):
		tmp = (x / -math.tan(B)) + (1.0 / B)
	else:
		tmp = math.pow(math.sin(B), -1.0)
	return tmp

Julia

function code(B, x)
	t_0 = Float64(Float64(x * Float64(-1.0 / tan(B))) + Float64(1.0 / sin(B)))
	tmp = 0.0
	if ((t_0 <= -5e+17) || !(t_0 <= 1000.0))
		tmp = Float64(Float64(x / Float64(-tan(B))) + Float64(1.0 / B));
	else
		tmp = sin(B) ^ -1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(B, x)
	t_0 = (x * (-1.0 / tan(B))) + (1.0 / sin(B));
	tmp = 0.0;
	if ((t_0 <= -5e+17) || ~((t_0 <= 1000.0)))
		tmp = (x / -tan(B)) + (1.0 / B);
	else
		tmp = sin(B) ^ -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[B_, x_] := Block[{t$95$0 = N[(N[(x * N[(-1.0 / N[Tan[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(1.0 / N[Sin[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$0, -5e+17], N[Not[LessEqual[t$95$0, 1000.0]], $MachinePrecision]], N[(N[(x / (-N[Tan[B], $MachinePrecision])), $MachinePrecision] + N[(1.0 / B), $MachinePrecision]), $MachinePrecision], N[Power[N[Sin[B], $MachinePrecision], -1.0], $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (neg.f64 (*.f64 x (/.f64 #s(literal 1 binary64) (tan.f64 B)))) (/.f64 #s(literal 1 binary64) (sin.f64 B))) < -5e17 or 1e3 < (+.f64 (neg.f64 (*.f64 x (/.f64 #s(literal 1 binary64) (tan.f64 B)))) (/.f64 #s(literal 1 binary64) (sin.f64 B)))

   1. Initial program 99.8%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-neg.f64 N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(x \cdot \frac{1}{\tan B}\right)\right)} + \frac{1}{\sin B} \]

      2. lift-*.f64 N/A

         \[\leadsto \left(\mathsf{neg}\left(\color{blue}{x \cdot \frac{1}{\tan B}}\right)\right) + \frac{1}{\sin B} \]

      3. lift-/.f64 N/A

         \[\leadsto \left(\mathsf{neg}\left(x \cdot \color{blue}{\frac{1}{\tan B}}\right)\right) + \frac{1}{\sin B} \]

      4. associate-*r/ N/A

         \[\leadsto \left(\mathsf{neg}\left(\color{blue}{\frac{x \cdot 1}{\tan B}}\right)\right) + \frac{1}{\sin B} \]

      5. distribute-neg-frac2 N/A

         \[\leadsto \color{blue}{\frac{x \cdot 1}{\mathsf{neg}\left(\tan B\right)}} + \frac{1}{\sin B} \]

      6. lift-tan.f64 N/A

         \[\leadsto \frac{x \cdot 1}{\mathsf{neg}\left(\color{blue}{\tan B}\right)} + \frac{1}{\sin B} \]

      7. tan-neg-rev N/A

         \[\leadsto \frac{x \cdot 1}{\color{blue}{\tan \left(\mathsf{neg}\left(B\right)\right)}} + \frac{1}{\sin B} \]

      8. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x \cdot 1}{\tan \left(\mathsf{neg}\left(B\right)\right)}} + \frac{1}{\sin B} \]

      9. lower-*.f64 N/A

         \[\leadsto \frac{\color{blue}{x \cdot 1}}{\tan \left(\mathsf{neg}\left(B\right)\right)} + \frac{1}{\sin B} \]

      10. tan-neg-rev N/A

          \[\leadsto \frac{x \cdot 1}{\color{blue}{\mathsf{neg}\left(\tan B\right)}} + \frac{1}{\sin B} \]

      11. lift-tan.f64 N/A

          \[\leadsto \frac{x \cdot 1}{\mathsf{neg}\left(\color{blue}{\tan B}\right)} + \frac{1}{\sin B} \]

      12. lower-neg.f64 99.9

          \[\leadsto \frac{x \cdot 1}{\color{blue}{-\tan B}} + \frac{1}{\sin B} \]

   4. Applied rewrites 99.9%

      \[\leadsto \color{blue}{\frac{x \cdot 1}{-\tan B}} + \frac{1}{\sin B} \]

   5. Taylor expanded in x around 0

      \[\leadsto \frac{\color{blue}{x}}{-\tan B} + \frac{1}{\sin B} \]
   6. Step-by-step derivation

   7. Applied rewrites 99.9%

      \[\leadsto \frac{\color{blue}{x}}{-\tan B} + \frac{1}{\sin B} \]

   8. Taylor expanded in B around 0

      \[\leadsto \frac{x}{-\tan B} + \frac{1}{\color{blue}{B}} \]
   9. Step-by-step derivation

   10. Applied rewrites 99.8%

       \[\leadsto \frac{x}{-\tan B} + \frac{1}{\color{blue}{B}} \]

   if -5e17 < (+.f64 (neg.f64 (*.f64 x (/.f64 #s(literal 1 binary64) (tan.f64 B)))) (/.f64 #s(literal 1 binary64) (sin.f64 B))) < 1e3

   1. Initial program 99.6%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{1}{\sin B}} \]
   4. Step-by-step derivation

   5. Applied rewrites 96.9%

      \[\leadsto \color{blue}{{\sin B}^{-1}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \cdot \frac{-1}{\tan B} + \frac{1}{\sin B} \leq -5 \cdot 10^{+17} \lor \neg \left(x \cdot \frac{-1}{\tan B} + \frac{1}{\sin B} \leq 1000\right):\\ \;\;\;\;\frac{x}{-\tan B} + \frac{1}{B}\\ \mathbf{else}:\\ \;\;\;\;{\sin B}^{-1}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 98.3% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{1}{\sin B}\\ t_1 := x \cdot \frac{-1}{\tan B} + t\_0\\ \mathbf{if}\;t\_1 \leq -5 \cdot 10^{+17} \lor \neg \left(t\_1 \leq 1000\right):\\ \;\;\;\;\frac{x}{-\tan B} + \frac{1}{B}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (B x)
 :precision binary64
 (let* ((t_0 (/ 1.0 (sin B))) (t_1 (+ (* x (/ -1.0 (tan B))) t_0)))
   (if (or (<= t_1 -5e+17) (not (<= t_1 1000.0)))
     (+ (/ x (- (tan B))) (/ 1.0 B))
     t_0)))

C

double code(double B, double x) {
	double t_0 = 1.0 / sin(B);
	double t_1 = (x * (-1.0 / tan(B))) + t_0;
	double tmp;
	if ((t_1 <= -5e+17) || !(t_1 <= 1000.0)) {
		tmp = (x / -tan(B)) + (1.0 / B);
	} else {
		tmp = t_0;
	}
	return tmp;
}

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(b, x)
use fmin_fmax_functions
    real(8), intent (in) :: b
    real(8), intent (in) :: x
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = 1.0d0 / sin(b)
    t_1 = (x * ((-1.0d0) / tan(b))) + t_0
    if ((t_1 <= (-5d+17)) .or. (.not. (t_1 <= 1000.0d0))) then
        tmp = (x / -tan(b)) + (1.0d0 / b)
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double B, double x) {
	double t_0 = 1.0 / Math.sin(B);
	double t_1 = (x * (-1.0 / Math.tan(B))) + t_0;
	double tmp;
	if ((t_1 <= -5e+17) || !(t_1 <= 1000.0)) {
		tmp = (x / -Math.tan(B)) + (1.0 / B);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(B, x):
	t_0 = 1.0 / math.sin(B)
	t_1 = (x * (-1.0 / math.tan(B))) + t_0
	tmp = 0
	if (t_1 <= -5e+17) or not (t_1 <= 1000.0):
		tmp = (x / -math.tan(B)) + (1.0 / B)
	else:
		tmp = t_0
	return tmp

Julia

function code(B, x)
	t_0 = Float64(1.0 / sin(B))
	t_1 = Float64(Float64(x * Float64(-1.0 / tan(B))) + t_0)
	tmp = 0.0
	if ((t_1 <= -5e+17) || !(t_1 <= 1000.0))
		tmp = Float64(Float64(x / Float64(-tan(B))) + Float64(1.0 / B));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(B, x)
	t_0 = 1.0 / sin(B);
	t_1 = (x * (-1.0 / tan(B))) + t_0;
	tmp = 0.0;
	if ((t_1 <= -5e+17) || ~((t_1 <= 1000.0)))
		tmp = (x / -tan(B)) + (1.0 / B);
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[B_, x_] := Block[{t$95$0 = N[(1.0 / N[Sin[B], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x * N[(-1.0 / N[Tan[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$0), $MachinePrecision]}, If[Or[LessEqual[t$95$1, -5e+17], N[Not[LessEqual[t$95$1, 1000.0]], $MachinePrecision]], N[(N[(x / (-N[Tan[B], $MachinePrecision])), $MachinePrecision] + N[(1.0 / B), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (neg.f64 (*.f64 x (/.f64 #s(literal 1 binary64) (tan.f64 B)))) (/.f64 #s(literal 1 binary64) (sin.f64 B))) < -5e17 or 1e3 < (+.f64 (neg.f64 (*.f64 x (/.f64 #s(literal 1 binary64) (tan.f64 B)))) (/.f64 #s(literal 1 binary64) (sin.f64 B)))

   1. Initial program 99.8%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-neg.f64 N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(x \cdot \frac{1}{\tan B}\right)\right)} + \frac{1}{\sin B} \]

      2. lift-*.f64 N/A

         \[\leadsto \left(\mathsf{neg}\left(\color{blue}{x \cdot \frac{1}{\tan B}}\right)\right) + \frac{1}{\sin B} \]

      3. lift-/.f64 N/A

         \[\leadsto \left(\mathsf{neg}\left(x \cdot \color{blue}{\frac{1}{\tan B}}\right)\right) + \frac{1}{\sin B} \]

      4. associate-*r/ N/A

         \[\leadsto \left(\mathsf{neg}\left(\color{blue}{\frac{x \cdot 1}{\tan B}}\right)\right) + \frac{1}{\sin B} \]

      5. distribute-neg-frac2 N/A

         \[\leadsto \color{blue}{\frac{x \cdot 1}{\mathsf{neg}\left(\tan B\right)}} + \frac{1}{\sin B} \]

      6. lift-tan.f64 N/A

         \[\leadsto \frac{x \cdot 1}{\mathsf{neg}\left(\color{blue}{\tan B}\right)} + \frac{1}{\sin B} \]

      7. tan-neg-rev N/A

         \[\leadsto \frac{x \cdot 1}{\color{blue}{\tan \left(\mathsf{neg}\left(B\right)\right)}} + \frac{1}{\sin B} \]

      8. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x \cdot 1}{\tan \left(\mathsf{neg}\left(B\right)\right)}} + \frac{1}{\sin B} \]

      9. lower-*.f64 N/A

         \[\leadsto \frac{\color{blue}{x \cdot 1}}{\tan \left(\mathsf{neg}\left(B\right)\right)} + \frac{1}{\sin B} \]

      10. tan-neg-rev N/A

          \[\leadsto \frac{x \cdot 1}{\color{blue}{\mathsf{neg}\left(\tan B\right)}} + \frac{1}{\sin B} \]

      11. lift-tan.f64 N/A

          \[\leadsto \frac{x \cdot 1}{\mathsf{neg}\left(\color{blue}{\tan B}\right)} + \frac{1}{\sin B} \]

      12. lower-neg.f64 99.9

          \[\leadsto \frac{x \cdot 1}{\color{blue}{-\tan B}} + \frac{1}{\sin B} \]

   4. Applied rewrites 99.9%

      \[\leadsto \color{blue}{\frac{x \cdot 1}{-\tan B}} + \frac{1}{\sin B} \]

   5. Taylor expanded in x around 0

      \[\leadsto \frac{\color{blue}{x}}{-\tan B} + \frac{1}{\sin B} \]
   6. Step-by-step derivation

   7. Applied rewrites 99.9%

      \[\leadsto \frac{\color{blue}{x}}{-\tan B} + \frac{1}{\sin B} \]

   8. Taylor expanded in B around 0

      \[\leadsto \frac{x}{-\tan B} + \frac{1}{\color{blue}{B}} \]
   9. Step-by-step derivation

   10. Applied rewrites 99.8%

       \[\leadsto \frac{x}{-\tan B} + \frac{1}{\color{blue}{B}} \]

   if -5e17 < (+.f64 (neg.f64 (*.f64 x (/.f64 #s(literal 1 binary64) (tan.f64 B)))) (/.f64 #s(literal 1 binary64) (sin.f64 B))) < 1e3

   1. Initial program 99.6%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Add Preprocessing

   3. Taylor expanded in B around inf

      \[\leadsto \color{blue}{\frac{1}{\sin B} - \frac{x \cdot \cos B}{\sin B}} \]
   4. Step-by-step derivation

   5. Applied rewrites 99.7%

      \[\leadsto \color{blue}{\frac{1 - \cos B \cdot x}{\sin B}} \]

   6. Taylor expanded in x around 0

      \[\leadsto \frac{1}{\sin \color{blue}{B}} \]
   7. Step-by-step derivation

   8. Applied rewrites 96.9%

      \[\leadsto \frac{1}{\sin \color{blue}{B}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \cdot \frac{-1}{\tan B} + \frac{1}{\sin B} \leq -5 \cdot 10^{+17} \lor \neg \left(x \cdot \frac{-1}{\tan B} + \frac{1}{\sin B} \leq 1000\right):\\ \;\;\;\;\frac{x}{-\tan B} + \frac{1}{B}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\sin B}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 99.8% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \frac{1 - \cos B \cdot x}{\sin B} \end{array} \]

FPCore

(FPCore (B x) :precision binary64 (/ (- 1.0 (* (cos B) x)) (sin B)))

C

double code(double B, double x) {
	return (1.0 - (cos(B) * x)) / sin(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(b, x)
use fmin_fmax_functions
    real(8), intent (in) :: b
    real(8), intent (in) :: x
    code = (1.0d0 - (cos(b) * x)) / sin(b)
end function

Java

public static double code(double B, double x) {
	return (1.0 - (Math.cos(B) * x)) / Math.sin(B);
}

Python

def code(B, x):
	return (1.0 - (math.cos(B) * x)) / math.sin(B)

Julia

function code(B, x)
	return Float64(Float64(1.0 - Float64(cos(B) * x)) / sin(B))
end

MATLAB

function tmp = code(B, x)
	tmp = (1.0 - (cos(B) * x)) / sin(B);
end

Wolfram

code[B_, x_] := N[(N[(1.0 - N[(N[Cos[B], $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision] / N[Sin[B], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.7%

   \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
2. Add Preprocessing

3. Taylor expanded in B around inf

   \[\leadsto \color{blue}{\frac{1}{\sin B} - \frac{x \cdot \cos B}{\sin B}} \]
4. Step-by-step derivation

5. Applied rewrites 99.8%

   \[\leadsto \color{blue}{\frac{1 - \cos B \cdot x}{\sin B}} \]
6. Add Preprocessing

Alternative 5: 86.6% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -3.5 \cdot 10^{+14} \lor \neg \left(x \leq 6.9 \cdot 10^{+18}\right):\\ \;\;\;\;x \cdot \frac{-1}{\tan B} + 0.16666666666666666 \cdot B\\ \mathbf{else}:\\ \;\;\;\;\left(-\frac{x}{B}\right) + \frac{1}{\sin B}\\ \end{array} \end{array} \]

FPCore

(FPCore (B x)
 :precision binary64
 (if (or (<= x -3.5e+14) (not (<= x 6.9e+18)))
   (+ (* x (/ -1.0 (tan B))) (* 0.16666666666666666 B))
   (+ (- (/ x B)) (/ 1.0 (sin B)))))

C

double code(double B, double x) {
	double tmp;
	if ((x <= -3.5e+14) || !(x <= 6.9e+18)) {
		tmp = (x * (-1.0 / tan(B))) + (0.16666666666666666 * B);
	} else {
		tmp = -(x / B) + (1.0 / sin(B));
	}
	return tmp;
}

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(b, x)
use fmin_fmax_functions
    real(8), intent (in) :: b
    real(8), intent (in) :: x
    real(8) :: tmp
    if ((x <= (-3.5d+14)) .or. (.not. (x <= 6.9d+18))) then
        tmp = (x * ((-1.0d0) / tan(b))) + (0.16666666666666666d0 * b)
    else
        tmp = -(x / b) + (1.0d0 / sin(b))
    end if
    code = tmp
end function

Java

public static double code(double B, double x) {
	double tmp;
	if ((x <= -3.5e+14) || !(x <= 6.9e+18)) {
		tmp = (x * (-1.0 / Math.tan(B))) + (0.16666666666666666 * B);
	} else {
		tmp = -(x / B) + (1.0 / Math.sin(B));
	}
	return tmp;
}

Python

def code(B, x):
	tmp = 0
	if (x <= -3.5e+14) or not (x <= 6.9e+18):
		tmp = (x * (-1.0 / math.tan(B))) + (0.16666666666666666 * B)
	else:
		tmp = -(x / B) + (1.0 / math.sin(B))
	return tmp

Julia

function code(B, x)
	tmp = 0.0
	if ((x <= -3.5e+14) || !(x <= 6.9e+18))
		tmp = Float64(Float64(x * Float64(-1.0 / tan(B))) + Float64(0.16666666666666666 * B));
	else
		tmp = Float64(Float64(-Float64(x / B)) + Float64(1.0 / sin(B)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(B, x)
	tmp = 0.0;
	if ((x <= -3.5e+14) || ~((x <= 6.9e+18)))
		tmp = (x * (-1.0 / tan(B))) + (0.16666666666666666 * B);
	else
		tmp = -(x / B) + (1.0 / sin(B));
	end
	tmp_2 = tmp;
end

Wolfram

code[B_, x_] := If[Or[LessEqual[x, -3.5e+14], N[Not[LessEqual[x, 6.9e+18]], $MachinePrecision]], N[(N[(x * N[(-1.0 / N[Tan[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(0.16666666666666666 * B), $MachinePrecision]), $MachinePrecision], N[((-N[(x / B), $MachinePrecision]) + N[(1.0 / N[Sin[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -3.5e14 or 6.9e18 < x

   1. Initial program 99.6%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Add Preprocessing

   3. Taylor expanded in B around 0

      \[\leadsto \left(-x \cdot \frac{1}{\tan B}\right) + \color{blue}{\frac{1 + \frac{1}{6} \cdot {B}^{2}}{B}} \]
   4. Step-by-step derivation

   5. Applied rewrites 69.9%

      \[\leadsto \left(-x \cdot \frac{1}{\tan B}\right) + \color{blue}{\frac{\mathsf{fma}\left(0.16666666666666666, B \cdot B, 1\right)}{B}} \]

   6. Taylor expanded in B around inf

      \[\leadsto \left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{6} \cdot \color{blue}{B} \]
   7. Step-by-step derivation

   8. Applied rewrites 77.3%

      \[\leadsto \left(-x \cdot \frac{1}{\tan B}\right) + 0.16666666666666666 \cdot \color{blue}{B} \]

   if -3.5e14 < x < 6.9e18

   1. Initial program 99.8%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Add Preprocessing

   3. Taylor expanded in B around 0

      \[\leadsto \left(-\color{blue}{\frac{x}{B}}\right) + \frac{1}{\sin B} \]
   4. Step-by-step derivation

   5. Applied rewrites 97.8%

      \[\leadsto \left(-\color{blue}{\frac{x}{B}}\right) + \frac{1}{\sin B} \]
3. Recombined 2 regimes into one program.

4. Final simplification 88.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -3.5 \cdot 10^{+14} \lor \neg \left(x \leq 6.9 \cdot 10^{+18}\right):\\ \;\;\;\;x \cdot \frac{-1}{\tan B} + 0.16666666666666666 \cdot B\\ \mathbf{else}:\\ \;\;\;\;\left(-\frac{x}{B}\right) + \frac{1}{\sin B}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 86.7% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -6.8 \cdot 10^{+44} \lor \neg \left(x \leq 6.9 \cdot 10^{+18}\right):\\ \;\;\;\;x \cdot \frac{-1}{\tan B} + 0.16666666666666666 \cdot B\\ \mathbf{else}:\\ \;\;\;\;\frac{1 - x}{\sin B}\\ \end{array} \end{array} \]

FPCore

(FPCore (B x)
 :precision binary64
 (if (or (<= x -6.8e+44) (not (<= x 6.9e+18)))
   (+ (* x (/ -1.0 (tan B))) (* 0.16666666666666666 B))
   (/ (- 1.0 x) (sin B))))

C

double code(double B, double x) {
	double tmp;
	if ((x <= -6.8e+44) || !(x <= 6.9e+18)) {
		tmp = (x * (-1.0 / tan(B))) + (0.16666666666666666 * B);
	} else {
		tmp = (1.0 - x) / sin(B);
	}
	return tmp;
}

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(b, x)
use fmin_fmax_functions
    real(8), intent (in) :: b
    real(8), intent (in) :: x
    real(8) :: tmp
    if ((x <= (-6.8d+44)) .or. (.not. (x <= 6.9d+18))) then
        tmp = (x * ((-1.0d0) / tan(b))) + (0.16666666666666666d0 * b)
    else
        tmp = (1.0d0 - x) / sin(b)
    end if
    code = tmp
end function

Java

public static double code(double B, double x) {
	double tmp;
	if ((x <= -6.8e+44) || !(x <= 6.9e+18)) {
		tmp = (x * (-1.0 / Math.tan(B))) + (0.16666666666666666 * B);
	} else {
		tmp = (1.0 - x) / Math.sin(B);
	}
	return tmp;
}

Python

def code(B, x):
	tmp = 0
	if (x <= -6.8e+44) or not (x <= 6.9e+18):
		tmp = (x * (-1.0 / math.tan(B))) + (0.16666666666666666 * B)
	else:
		tmp = (1.0 - x) / math.sin(B)
	return tmp

Julia

function code(B, x)
	tmp = 0.0
	if ((x <= -6.8e+44) || !(x <= 6.9e+18))
		tmp = Float64(Float64(x * Float64(-1.0 / tan(B))) + Float64(0.16666666666666666 * B));
	else
		tmp = Float64(Float64(1.0 - x) / sin(B));
	end
	return tmp
end

MATLAB

function tmp_2 = code(B, x)
	tmp = 0.0;
	if ((x <= -6.8e+44) || ~((x <= 6.9e+18)))
		tmp = (x * (-1.0 / tan(B))) + (0.16666666666666666 * B);
	else
		tmp = (1.0 - x) / sin(B);
	end
	tmp_2 = tmp;
end

Wolfram

code[B_, x_] := If[Or[LessEqual[x, -6.8e+44], N[Not[LessEqual[x, 6.9e+18]], $MachinePrecision]], N[(N[(x * N[(-1.0 / N[Tan[B], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(0.16666666666666666 * B), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - x), $MachinePrecision] / N[Sin[B], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -6.8e44 or 6.9e18 < x

   1. Initial program 99.6%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Add Preprocessing

   3. Taylor expanded in B around 0

      \[\leadsto \left(-x \cdot \frac{1}{\tan B}\right) + \color{blue}{\frac{1 + \frac{1}{6} \cdot {B}^{2}}{B}} \]
   4. Step-by-step derivation

   5. Applied rewrites 69.8%

      \[\leadsto \left(-x \cdot \frac{1}{\tan B}\right) + \color{blue}{\frac{\mathsf{fma}\left(0.16666666666666666, B \cdot B, 1\right)}{B}} \]

   6. Taylor expanded in B around inf

      \[\leadsto \left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{6} \cdot \color{blue}{B} \]
   7. Step-by-step derivation

   8. Applied rewrites 77.9%

      \[\leadsto \left(-x \cdot \frac{1}{\tan B}\right) + 0.16666666666666666 \cdot \color{blue}{B} \]

   if -6.8e44 < x < 6.9e18

   1. Initial program 99.8%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Add Preprocessing

   3. Taylor expanded in B around inf

      \[\leadsto \color{blue}{\frac{1}{\sin B} - \frac{x \cdot \cos B}{\sin B}} \]
   4. Step-by-step derivation

   5. Applied rewrites 99.8%

      \[\leadsto \color{blue}{\frac{1 - \cos B \cdot x}{\sin B}} \]

   6. Taylor expanded in B around 0

      \[\leadsto \frac{1 - x}{\sin B} \]
   7. Step-by-step derivation

   8. Applied rewrites 96.0%

      \[\leadsto \frac{1 - x}{\sin B} \]
3. Recombined 2 regimes into one program.

4. Final simplification 88.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -6.8 \cdot 10^{+44} \lor \neg \left(x \leq 6.9 \cdot 10^{+18}\right):\\ \;\;\;\;x \cdot \frac{-1}{\tan B} + 0.16666666666666666 \cdot B\\ \mathbf{else}:\\ \;\;\;\;\frac{1 - x}{\sin B}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 63.4% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;B \leq 0.00016:\\ \;\;\;\;\frac{1 - x}{B}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\sin B}\\ \end{array} \end{array} \]

FPCore

(FPCore (B x)
 :precision binary64
 (if (<= B 0.00016) (/ (- 1.0 x) B) (/ 1.0 (sin B))))

C

double code(double B, double x) {
	double tmp;
	if (B <= 0.00016) {
		tmp = (1.0 - x) / B;
	} else {
		tmp = 1.0 / sin(B);
	}
	return tmp;
}

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(b, x)
use fmin_fmax_functions
    real(8), intent (in) :: b
    real(8), intent (in) :: x
    real(8) :: tmp
    if (b <= 0.00016d0) then
        tmp = (1.0d0 - x) / b
    else
        tmp = 1.0d0 / sin(b)
    end if
    code = tmp
end function

Java

public static double code(double B, double x) {
	double tmp;
	if (B <= 0.00016) {
		tmp = (1.0 - x) / B;
	} else {
		tmp = 1.0 / Math.sin(B);
	}
	return tmp;
}

Python

def code(B, x):
	tmp = 0
	if B <= 0.00016:
		tmp = (1.0 - x) / B
	else:
		tmp = 1.0 / math.sin(B)
	return tmp

Julia

function code(B, x)
	tmp = 0.0
	if (B <= 0.00016)
		tmp = Float64(Float64(1.0 - x) / B);
	else
		tmp = Float64(1.0 / sin(B));
	end
	return tmp
end

MATLAB

function tmp_2 = code(B, x)
	tmp = 0.0;
	if (B <= 0.00016)
		tmp = (1.0 - x) / B;
	else
		tmp = 1.0 / sin(B);
	end
	tmp_2 = tmp;
end

Wolfram

code[B_, x_] := If[LessEqual[B, 0.00016], N[(N[(1.0 - x), $MachinePrecision] / B), $MachinePrecision], N[(1.0 / N[Sin[B], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if B < 1.60000000000000013e-4

   1. Initial program 99.8%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Add Preprocessing

   3. Taylor expanded in B around 0

      \[\leadsto \color{blue}{\frac{1 - x}{B}} \]
   4. Step-by-step derivation

   5. Applied rewrites 67.4%

      \[\leadsto \color{blue}{\frac{1 - x}{B}} \]

   if 1.60000000000000013e-4 < B

   1. Initial program 99.5%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Add Preprocessing

   3. Taylor expanded in B around inf

      \[\leadsto \color{blue}{\frac{1}{\sin B} - \frac{x \cdot \cos B}{\sin B}} \]
   4. Step-by-step derivation

   5. Applied rewrites 99.5%

      \[\leadsto \color{blue}{\frac{1 - \cos B \cdot x}{\sin B}} \]

   6. Taylor expanded in x around 0

      \[\leadsto \frac{1}{\sin \color{blue}{B}} \]
   7. Step-by-step derivation

   8. Applied rewrites 55.3%

      \[\leadsto \frac{1}{\sin \color{blue}{B}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 8: 77.3% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \frac{1 - x}{\sin B} \end{array} \]

FPCore

(FPCore (B x) :precision binary64 (/ (- 1.0 x) (sin B)))

C

double code(double B, double x) {
	return (1.0 - x) / sin(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(b, x)
use fmin_fmax_functions
    real(8), intent (in) :: b
    real(8), intent (in) :: x
    code = (1.0d0 - x) / sin(b)
end function

Java

public static double code(double B, double x) {
	return (1.0 - x) / Math.sin(B);
}

Python

def code(B, x):
	return (1.0 - x) / math.sin(B)

Julia

function code(B, x)
	return Float64(Float64(1.0 - x) / sin(B))
end

MATLAB

function tmp = code(B, x)
	tmp = (1.0 - x) / sin(B);
end

Wolfram

code[B_, x_] := N[(N[(1.0 - x), $MachinePrecision] / N[Sin[B], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.7%

   \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
2. Add Preprocessing

3. Taylor expanded in B around inf

   \[\leadsto \color{blue}{\frac{1}{\sin B} - \frac{x \cdot \cos B}{\sin B}} \]
4. Step-by-step derivation

5. Applied rewrites 99.8%

   \[\leadsto \color{blue}{\frac{1 - \cos B \cdot x}{\sin B}} \]

6. Taylor expanded in B around 0

   \[\leadsto \frac{1 - x}{\sin B} \]
7. Step-by-step derivation

8. Applied rewrites 82.1%

   \[\leadsto \frac{1 - x}{\sin B} \]
9. Add Preprocessing

Alternative 9: 49.8% accurate, 8.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -3.1 \cdot 10^{-5} \lor \neg \left(x \leq 1.85 \cdot 10^{-22}\right):\\ \;\;\;\;\frac{-x}{B}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{B}\\ \end{array} \end{array} \]

FPCore

(FPCore (B x)
 :precision binary64
 (if (or (<= x -3.1e-5) (not (<= x 1.85e-22))) (/ (- x) B) (/ 1.0 B)))

C

double code(double B, double x) {
	double tmp;
	if ((x <= -3.1e-5) || !(x <= 1.85e-22)) {
		tmp = -x / B;
	} else {
		tmp = 1.0 / B;
	}
	return tmp;
}

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(b, x)
use fmin_fmax_functions
    real(8), intent (in) :: b
    real(8), intent (in) :: x
    real(8) :: tmp
    if ((x <= (-3.1d-5)) .or. (.not. (x <= 1.85d-22))) then
        tmp = -x / b
    else
        tmp = 1.0d0 / b
    end if
    code = tmp
end function

Java

public static double code(double B, double x) {
	double tmp;
	if ((x <= -3.1e-5) || !(x <= 1.85e-22)) {
		tmp = -x / B;
	} else {
		tmp = 1.0 / B;
	}
	return tmp;
}

Python

def code(B, x):
	tmp = 0
	if (x <= -3.1e-5) or not (x <= 1.85e-22):
		tmp = -x / B
	else:
		tmp = 1.0 / B
	return tmp

Julia

function code(B, x)
	tmp = 0.0
	if ((x <= -3.1e-5) || !(x <= 1.85e-22))
		tmp = Float64(Float64(-x) / B);
	else
		tmp = Float64(1.0 / B);
	end
	return tmp
end

MATLAB

function tmp_2 = code(B, x)
	tmp = 0.0;
	if ((x <= -3.1e-5) || ~((x <= 1.85e-22)))
		tmp = -x / B;
	else
		tmp = 1.0 / B;
	end
	tmp_2 = tmp;
end

Wolfram

code[B_, x_] := If[Or[LessEqual[x, -3.1e-5], N[Not[LessEqual[x, 1.85e-22]], $MachinePrecision]], N[((-x) / B), $MachinePrecision], N[(1.0 / B), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -3.10000000000000014e-5 or 1.85e-22 < x

   1. Initial program 99.6%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Add Preprocessing

   3. Taylor expanded in B around 0

      \[\leadsto \color{blue}{\frac{1 - x}{B}} \]
   4. Step-by-step derivation

   5. Applied rewrites 55.6%

      \[\leadsto \color{blue}{\frac{1 - x}{B}} \]

   6. Taylor expanded in x around inf

      \[\leadsto \frac{-1 \cdot x}{B} \]
   7. Step-by-step derivation

   8. Applied rewrites 55.3%

      \[\leadsto \frac{-x}{B} \]

   if -3.10000000000000014e-5 < x < 1.85e-22

   1. Initial program 99.8%

      \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
   2. Add Preprocessing

   3. Taylor expanded in B around 0

      \[\leadsto \color{blue}{\frac{1 - x}{B}} \]
   4. Step-by-step derivation

   5. Applied rewrites 51.9%

      \[\leadsto \color{blue}{\frac{1 - x}{B}} \]

   6. Taylor expanded in x around 0

      \[\leadsto \frac{1}{B} \]
   7. Step-by-step derivation

   8. Applied rewrites 51.7%

      \[\leadsto \frac{1}{B} \]
3. Recombined 2 regimes into one program.

4. Final simplification 53.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -3.1 \cdot 10^{-5} \lor \neg \left(x \leq 1.85 \cdot 10^{-22}\right):\\ \;\;\;\;\frac{-x}{B}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{B}\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 51.6% accurate, 15.5× speedup

Math

\[\begin{array}{l} \\ \frac{1 - x}{B} \end{array} \]

FPCore

(FPCore (B x) :precision binary64 (/ (- 1.0 x) B))

C

double code(double B, double x) {
	return (1.0 - x) / 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(b, x)
use fmin_fmax_functions
    real(8), intent (in) :: b
    real(8), intent (in) :: x
    code = (1.0d0 - x) / b
end function

Java

public static double code(double B, double x) {
	return (1.0 - x) / B;
}

Python

def code(B, x):
	return (1.0 - x) / B

Julia

function code(B, x)
	return Float64(Float64(1.0 - x) / B)
end

MATLAB

function tmp = code(B, x)
	tmp = (1.0 - x) / B;
end

Wolfram

code[B_, x_] := N[(N[(1.0 - x), $MachinePrecision] / B), $MachinePrecision]

Derivation

1. Initial program 99.7%

   \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
2. Add Preprocessing

3. Taylor expanded in B around 0

   \[\leadsto \color{blue}{\frac{1 - x}{B}} \]
4. Step-by-step derivation

5. Applied rewrites 53.6%

   \[\leadsto \color{blue}{\frac{1 - x}{B}} \]
6. Add Preprocessing

Alternative 11: 26.3% accurate, 19.4× speedup

Math

\[\begin{array}{l} \\ \frac{1}{B} \end{array} \]

FPCore

(FPCore (B x) :precision binary64 (/ 1.0 B))

C

double code(double B, double x) {
	return 1.0 / 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(b, x)
use fmin_fmax_functions
    real(8), intent (in) :: b
    real(8), intent (in) :: x
    code = 1.0d0 / b
end function

Java

public static double code(double B, double x) {
	return 1.0 / B;
}

Python

def code(B, x):
	return 1.0 / B

Julia

function code(B, x)
	return Float64(1.0 / B)
end

MATLAB

function tmp = code(B, x)
	tmp = 1.0 / B;
end

Wolfram

code[B_, x_] := N[(1.0 / B), $MachinePrecision]

Derivation

1. Initial program 99.7%

   \[\left(-x \cdot \frac{1}{\tan B}\right) + \frac{1}{\sin B} \]
2. Add Preprocessing

3. Taylor expanded in B around 0

   \[\leadsto \color{blue}{\frac{1 - x}{B}} \]
4. Step-by-step derivation

5. Applied rewrites 53.6%

   \[\leadsto \color{blue}{\frac{1 - x}{B}} \]

6. Taylor expanded in x around 0

   \[\leadsto \frac{1}{B} \]
7. Step-by-step derivation

8. Applied rewrites 29.4%

   \[\leadsto \frac{1}{B} \]
9. Add Preprocessing

Reproduce

herbie shell --seed 2025026 
(FPCore (B x)
  :name "VandenBroeck and Keller, Equation (24)"
  :precision binary64
  (+ (- (* x (/ 1.0 (tan B)))) (/ 1.0 (sin B))))