Octave 3.8, jcobi/2

Percentage Accurate: 63.5% → 96.2%

Time: 3.9s

Alternatives: 11

Speedup: 0.9×

Specification

\[\left(\alpha > -1 \land \beta > -1\right) \land i > 0\]

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + 2 \cdot i\\ \frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{t\_0}}{t\_0 + 2} + 1}{2} \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* 2.0 i))))
   (/ (+ (/ (/ (* (+ alpha beta) (- beta alpha)) t_0) (+ t_0 2.0)) 1.0) 2.0)))

C

double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	return (((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0)) + 1.0) / 2.0;
}

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(alpha, beta, i)
use fmin_fmax_functions
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: t_0
    t_0 = (alpha + beta) + (2.0d0 * i)
    code = (((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0d0)) + 1.0d0) / 2.0d0
end function

Java

public static double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	return (((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0)) + 1.0) / 2.0;
}

Python

def code(alpha, beta, i):
	t_0 = (alpha + beta) + (2.0 * i)
	return (((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0)) + 1.0) / 2.0

Julia

function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) * Float64(beta - alpha)) / t_0) / Float64(t_0 + 2.0)) + 1.0) / 2.0)
end

MATLAB

function tmp = code(alpha, beta, i)
	t_0 = (alpha + beta) + (2.0 * i);
	tmp = (((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0)) + 1.0) / 2.0;
end

Wolfram

code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] * N[(beta - alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 2.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / 2.0), $MachinePrecision]]

Initial Program: 63.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + 2 \cdot i\\ \frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{t\_0}}{t\_0 + 2} + 1}{2} \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* 2.0 i))))
   (/ (+ (/ (/ (* (+ alpha beta) (- beta alpha)) t_0) (+ t_0 2.0)) 1.0) 2.0)))

C

double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	return (((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0)) + 1.0) / 2.0;
}

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(alpha, beta, i)
use fmin_fmax_functions
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: t_0
    t_0 = (alpha + beta) + (2.0d0 * i)
    code = (((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0d0)) + 1.0d0) / 2.0d0
end function

Java

public static double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	return (((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0)) + 1.0) / 2.0;
}

Python

def code(alpha, beta, i):
	t_0 = (alpha + beta) + (2.0 * i)
	return (((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0)) + 1.0) / 2.0

Julia

function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	return Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) * Float64(beta - alpha)) / t_0) / Float64(t_0 + 2.0)) + 1.0) / 2.0)
end

MATLAB

function tmp = code(alpha, beta, i)
	t_0 = (alpha + beta) + (2.0 * i);
	tmp = (((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0)) + 1.0) / 2.0;
end

Wolfram

code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] * N[(beta - alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 2.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / 2.0), $MachinePrecision]]

Alternative 1: 96.2% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + 2 \cdot i\\ t_1 := t\_0 + 2\\ \mathbf{if}\;\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{t\_0}}{t\_1} + 1}{2} \leq 2 \cdot 10^{-8}:\\ \;\;\;\;\mathsf{fma}\left(2, \frac{i}{\alpha}, \frac{1 + \beta}{\alpha}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\beta}{t\_1} + 1}{2}\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* 2.0 i))) (t_1 (+ t_0 2.0)))
   (if (<=
        (/ (+ (/ (/ (* (+ alpha beta) (- beta alpha)) t_0) t_1) 1.0) 2.0)
        2e-8)
     (fma 2.0 (/ i alpha) (/ (+ 1.0 beta) alpha))
     (/ (+ (/ beta t_1) 1.0) 2.0))))

C

double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double t_1 = t_0 + 2.0;
	double tmp;
	if (((((((alpha + beta) * (beta - alpha)) / t_0) / t_1) + 1.0) / 2.0) <= 2e-8) {
		tmp = fma(2.0, (i / alpha), ((1.0 + beta) / alpha));
	} else {
		tmp = ((beta / t_1) + 1.0) / 2.0;
	}
	return tmp;
}

Julia

function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	t_1 = Float64(t_0 + 2.0)
	tmp = 0.0
	if (Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) * Float64(beta - alpha)) / t_0) / t_1) + 1.0) / 2.0) <= 2e-8)
		tmp = fma(2.0, Float64(i / alpha), Float64(Float64(1.0 + beta) / alpha));
	else
		tmp = Float64(Float64(Float64(beta / t_1) + 1.0) / 2.0);
	end
	return tmp
end

Wolfram

code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(t$95$0 + 2.0), $MachinePrecision]}, If[LessEqual[N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] * N[(beta - alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / t$95$1), $MachinePrecision] + 1.0), $MachinePrecision] / 2.0), $MachinePrecision], 2e-8], N[(2.0 * N[(i / alpha), $MachinePrecision] + N[(N[(1.0 + beta), $MachinePrecision] / alpha), $MachinePrecision]), $MachinePrecision], N[(N[(N[(beta / t$95$1), $MachinePrecision] + 1.0), $MachinePrecision] / 2.0), $MachinePrecision]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64)) < 2e-8

   1. Initial program 2.8%

      \[\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]

   2. Taylor expanded in alpha around inf

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{\left(\beta + -1 \cdot \beta\right) - -1 \cdot \left(2 + \left(2 \cdot \beta + 4 \cdot i\right)\right)}{\alpha}} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \frac{\left(\beta + -1 \cdot \beta\right) - -1 \cdot \left(2 + \left(2 \cdot \beta + 4 \cdot i\right)\right)}{\alpha} \cdot \color{blue}{\frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{\left(\beta + -1 \cdot \beta\right) - -1 \cdot \left(2 + \left(2 \cdot \beta + 4 \cdot i\right)\right)}{\alpha} \cdot \color{blue}{\frac{1}{2}} \]

   4. Applied rewrites 90.6%

      \[\leadsto \color{blue}{\frac{0 \cdot \beta - \left(-\left(2 + \mathsf{fma}\left(2, \beta, 4 \cdot i\right)\right)\right)}{\alpha} \cdot 0.5} \]

   5. Taylor expanded in i around 0

      \[\leadsto \frac{1}{2} \cdot \frac{2 + 2 \cdot \beta}{\alpha} + \color{blue}{2 \cdot \frac{i}{\alpha}} \]
   6. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2}, \frac{2 + 2 \cdot \beta}{\color{blue}{\alpha}}, 2 \cdot \frac{i}{\alpha}\right) \]

      2. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2}, \frac{2 + 2 \cdot \beta}{\alpha}, 2 \cdot \frac{i}{\alpha}\right) \]

      3. lower-+.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2}, \frac{2 + 2 \cdot \beta}{\alpha}, 2 \cdot \frac{i}{\alpha}\right) \]

      4. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2}, \frac{2 + 2 \cdot \beta}{\alpha}, 2 \cdot \frac{i}{\alpha}\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2}, \frac{2 + 2 \cdot \beta}{\alpha}, 2 \cdot \frac{i}{\alpha}\right) \]

      6. lower-/.f64 90.6

         \[\leadsto \mathsf{fma}\left(0.5, \frac{2 + 2 \cdot \beta}{\alpha}, 2 \cdot \frac{i}{\alpha}\right) \]

   7. Applied rewrites 90.6%

      \[\leadsto \mathsf{fma}\left(0.5, \color{blue}{\frac{2 + 2 \cdot \beta}{\alpha}}, 2 \cdot \frac{i}{\alpha}\right) \]

   8. Taylor expanded in beta around 0

      \[\leadsto 2 \cdot \frac{i}{\alpha} + \left(\frac{1}{\alpha} + \color{blue}{\frac{\beta}{\alpha}}\right) \]
   9. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(2, \frac{i}{\alpha}, \frac{1}{\alpha} + \frac{\beta}{\alpha}\right) \]

      2. lift-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(2, \frac{i}{\alpha}, \frac{1}{\alpha} + \frac{\beta}{\alpha}\right) \]

      3. div-add-rev N/A

         \[\leadsto \mathsf{fma}\left(2, \frac{i}{\alpha}, \frac{1 + \beta}{\alpha}\right) \]

      4. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(2, \frac{i}{\alpha}, \frac{1 + \beta}{\alpha}\right) \]

      5. lower-+.f64 90.6

         \[\leadsto \mathsf{fma}\left(2, \frac{i}{\alpha}, \frac{1 + \beta}{\alpha}\right) \]

   10. Applied rewrites 90.6%

       \[\leadsto \mathsf{fma}\left(2, \frac{i}{\color{blue}{\alpha}}, \frac{1 + \beta}{\alpha}\right) \]

   if 2e-8 < (/.f64 (+.f64 (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64))

   1. Initial program 80.5%

      \[\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]

   2. Taylor expanded in beta around inf

      \[\leadsto \frac{\frac{\color{blue}{\beta}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]
   3. Step-by-step derivation

   4. Applied rewrites 97.8%

      \[\leadsto \frac{\frac{\color{blue}{\beta}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 95.2% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + 2 \cdot i\\ t_1 := \frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{t\_0}}{t\_0 + 2} + 1}{2}\\ \mathbf{if}\;t\_1 \leq 2 \cdot 10^{-8}:\\ \;\;\;\;\mathsf{fma}\left(2, \frac{i}{\alpha}, \frac{1 + \beta}{\alpha}\right)\\ \mathbf{elif}\;t\_1 \leq 0.5:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;\left(1 + \frac{\beta - \alpha}{2 + \left(\alpha + \beta\right)}\right) \cdot 0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* 2.0 i)))
        (t_1
         (/
          (+ (/ (/ (* (+ alpha beta) (- beta alpha)) t_0) (+ t_0 2.0)) 1.0)
          2.0)))
   (if (<= t_1 2e-8)
     (fma 2.0 (/ i alpha) (/ (+ 1.0 beta) alpha))
     (if (<= t_1 0.5)
       0.5
       (* (+ 1.0 (/ (- beta alpha) (+ 2.0 (+ alpha beta)))) 0.5)))))

C

double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double t_1 = (((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0)) + 1.0) / 2.0;
	double tmp;
	if (t_1 <= 2e-8) {
		tmp = fma(2.0, (i / alpha), ((1.0 + beta) / alpha));
	} else if (t_1 <= 0.5) {
		tmp = 0.5;
	} else {
		tmp = (1.0 + ((beta - alpha) / (2.0 + (alpha + beta)))) * 0.5;
	}
	return tmp;
}

Julia

function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	t_1 = Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) * Float64(beta - alpha)) / t_0) / Float64(t_0 + 2.0)) + 1.0) / 2.0)
	tmp = 0.0
	if (t_1 <= 2e-8)
		tmp = fma(2.0, Float64(i / alpha), Float64(Float64(1.0 + beta) / alpha));
	elseif (t_1 <= 0.5)
		tmp = 0.5;
	else
		tmp = Float64(Float64(1.0 + Float64(Float64(beta - alpha) / Float64(2.0 + Float64(alpha + beta)))) * 0.5);
	end
	return tmp
end

Wolfram

code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] * N[(beta - alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 2.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / 2.0), $MachinePrecision]}, If[LessEqual[t$95$1, 2e-8], N[(2.0 * N[(i / alpha), $MachinePrecision] + N[(N[(1.0 + beta), $MachinePrecision] / alpha), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 0.5], 0.5, N[(N[(1.0 + N[(N[(beta - alpha), $MachinePrecision] / N[(2.0 + N[(alpha + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64)) < 2e-8

   1. Initial program 2.8%

      \[\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]

   2. Taylor expanded in alpha around inf

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{\left(\beta + -1 \cdot \beta\right) - -1 \cdot \left(2 + \left(2 \cdot \beta + 4 \cdot i\right)\right)}{\alpha}} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \frac{\left(\beta + -1 \cdot \beta\right) - -1 \cdot \left(2 + \left(2 \cdot \beta + 4 \cdot i\right)\right)}{\alpha} \cdot \color{blue}{\frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{\left(\beta + -1 \cdot \beta\right) - -1 \cdot \left(2 + \left(2 \cdot \beta + 4 \cdot i\right)\right)}{\alpha} \cdot \color{blue}{\frac{1}{2}} \]

   4. Applied rewrites 90.6%

      \[\leadsto \color{blue}{\frac{0 \cdot \beta - \left(-\left(2 + \mathsf{fma}\left(2, \beta, 4 \cdot i\right)\right)\right)}{\alpha} \cdot 0.5} \]

   5. Taylor expanded in i around 0

      \[\leadsto \frac{1}{2} \cdot \frac{2 + 2 \cdot \beta}{\alpha} + \color{blue}{2 \cdot \frac{i}{\alpha}} \]
   6. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2}, \frac{2 + 2 \cdot \beta}{\color{blue}{\alpha}}, 2 \cdot \frac{i}{\alpha}\right) \]

      2. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2}, \frac{2 + 2 \cdot \beta}{\alpha}, 2 \cdot \frac{i}{\alpha}\right) \]

      3. lower-+.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2}, \frac{2 + 2 \cdot \beta}{\alpha}, 2 \cdot \frac{i}{\alpha}\right) \]

      4. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2}, \frac{2 + 2 \cdot \beta}{\alpha}, 2 \cdot \frac{i}{\alpha}\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2}, \frac{2 + 2 \cdot \beta}{\alpha}, 2 \cdot \frac{i}{\alpha}\right) \]

      6. lower-/.f64 90.6

         \[\leadsto \mathsf{fma}\left(0.5, \frac{2 + 2 \cdot \beta}{\alpha}, 2 \cdot \frac{i}{\alpha}\right) \]

   7. Applied rewrites 90.6%

      \[\leadsto \mathsf{fma}\left(0.5, \color{blue}{\frac{2 + 2 \cdot \beta}{\alpha}}, 2 \cdot \frac{i}{\alpha}\right) \]

   8. Taylor expanded in beta around 0

      \[\leadsto 2 \cdot \frac{i}{\alpha} + \left(\frac{1}{\alpha} + \color{blue}{\frac{\beta}{\alpha}}\right) \]
   9. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(2, \frac{i}{\alpha}, \frac{1}{\alpha} + \frac{\beta}{\alpha}\right) \]

      2. lift-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(2, \frac{i}{\alpha}, \frac{1}{\alpha} + \frac{\beta}{\alpha}\right) \]

      3. div-add-rev N/A

         \[\leadsto \mathsf{fma}\left(2, \frac{i}{\alpha}, \frac{1 + \beta}{\alpha}\right) \]

      4. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(2, \frac{i}{\alpha}, \frac{1 + \beta}{\alpha}\right) \]

      5. lower-+.f64 90.6

         \[\leadsto \mathsf{fma}\left(2, \frac{i}{\alpha}, \frac{1 + \beta}{\alpha}\right) \]

   10. Applied rewrites 90.6%

       \[\leadsto \mathsf{fma}\left(2, \frac{i}{\color{blue}{\alpha}}, \frac{1 + \beta}{\alpha}\right) \]

   if 2e-8 < (/.f64 (+.f64 (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64)) < 0.5

   1. Initial program 99.8%

      \[\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]

   2. Taylor expanded in i around inf

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

   4. Applied rewrites 98.2%

      \[\leadsto \color{blue}{0.5} \]

   if 0.5 < (/.f64 (+.f64 (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64))

   1. Initial program 39.4%

      \[\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]

   2. Taylor expanded in i around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(\left(1 + \frac{\beta}{2 + \left(\alpha + \beta\right)}\right) - \frac{\alpha}{2 + \left(\alpha + \beta\right)}\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(\left(1 + \frac{\beta}{2 + \left(\alpha + \beta\right)}\right) - \frac{\alpha}{2 + \left(\alpha + \beta\right)}\right) \cdot \color{blue}{\frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(\left(1 + \frac{\beta}{2 + \left(\alpha + \beta\right)}\right) - \frac{\alpha}{2 + \left(\alpha + \beta\right)}\right) \cdot \color{blue}{\frac{1}{2}} \]

      3. associate--l+ N/A

         \[\leadsto \left(1 + \left(\frac{\beta}{2 + \left(\alpha + \beta\right)} - \frac{\alpha}{2 + \left(\alpha + \beta\right)}\right)\right) \cdot \frac{1}{2} \]

      4. div-sub N/A

         \[\leadsto \left(1 + \frac{\beta - \alpha}{2 + \left(\alpha + \beta\right)}\right) \cdot \frac{1}{2} \]

      5. lower-+.f64 N/A

         \[\leadsto \left(1 + \frac{\beta - \alpha}{2 + \left(\alpha + \beta\right)}\right) \cdot \frac{1}{2} \]

      6. lower-/.f64 N/A

         \[\leadsto \left(1 + \frac{\beta - \alpha}{2 + \left(\alpha + \beta\right)}\right) \cdot \frac{1}{2} \]

      7. lift--.f64 N/A

         \[\leadsto \left(1 + \frac{\beta - \alpha}{2 + \left(\alpha + \beta\right)}\right) \cdot \frac{1}{2} \]

      8. lower-+.f64 N/A

         \[\leadsto \left(1 + \frac{\beta - \alpha}{2 + \left(\alpha + \beta\right)}\right) \cdot \frac{1}{2} \]

      9. lift-+.f64 92.7

         \[\leadsto \left(1 + \frac{\beta - \alpha}{2 + \left(\alpha + \beta\right)}\right) \cdot 0.5 \]

   4. Applied rewrites 92.7%

      \[\leadsto \color{blue}{\left(1 + \frac{\beta - \alpha}{2 + \left(\alpha + \beta\right)}\right) \cdot 0.5} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 3: 94.8% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + 2 \cdot i\\ t_1 := \frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{t\_0}}{t\_0 + 2} + 1}{2}\\ \mathbf{if}\;t\_1 \leq 2 \cdot 10^{-8}:\\ \;\;\;\;\mathsf{fma}\left(2, \frac{i}{\alpha}, \frac{1 + \beta}{\alpha}\right)\\ \mathbf{elif}\;t\_1 \leq 0.5:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{\beta}{\left(\alpha + \beta\right) + 2} + 1}{2}\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* 2.0 i)))
        (t_1
         (/
          (+ (/ (/ (* (+ alpha beta) (- beta alpha)) t_0) (+ t_0 2.0)) 1.0)
          2.0)))
   (if (<= t_1 2e-8)
     (fma 2.0 (/ i alpha) (/ (+ 1.0 beta) alpha))
     (if (<= t_1 0.5) 0.5 (/ (+ (/ beta (+ (+ alpha beta) 2.0)) 1.0) 2.0)))))

C

double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double t_1 = (((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0)) + 1.0) / 2.0;
	double tmp;
	if (t_1 <= 2e-8) {
		tmp = fma(2.0, (i / alpha), ((1.0 + beta) / alpha));
	} else if (t_1 <= 0.5) {
		tmp = 0.5;
	} else {
		tmp = ((beta / ((alpha + beta) + 2.0)) + 1.0) / 2.0;
	}
	return tmp;
}

Julia

function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	t_1 = Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) * Float64(beta - alpha)) / t_0) / Float64(t_0 + 2.0)) + 1.0) / 2.0)
	tmp = 0.0
	if (t_1 <= 2e-8)
		tmp = fma(2.0, Float64(i / alpha), Float64(Float64(1.0 + beta) / alpha));
	elseif (t_1 <= 0.5)
		tmp = 0.5;
	else
		tmp = Float64(Float64(Float64(beta / Float64(Float64(alpha + beta) + 2.0)) + 1.0) / 2.0);
	end
	return tmp
end

Wolfram

code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] * N[(beta - alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 2.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / 2.0), $MachinePrecision]}, If[LessEqual[t$95$1, 2e-8], N[(2.0 * N[(i / alpha), $MachinePrecision] + N[(N[(1.0 + beta), $MachinePrecision] / alpha), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 0.5], 0.5, N[(N[(N[(beta / N[(N[(alpha + beta), $MachinePrecision] + 2.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / 2.0), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64)) < 2e-8

   1. Initial program 2.8%

      \[\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]

   2. Taylor expanded in alpha around inf

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{\left(\beta + -1 \cdot \beta\right) - -1 \cdot \left(2 + \left(2 \cdot \beta + 4 \cdot i\right)\right)}{\alpha}} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \frac{\left(\beta + -1 \cdot \beta\right) - -1 \cdot \left(2 + \left(2 \cdot \beta + 4 \cdot i\right)\right)}{\alpha} \cdot \color{blue}{\frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{\left(\beta + -1 \cdot \beta\right) - -1 \cdot \left(2 + \left(2 \cdot \beta + 4 \cdot i\right)\right)}{\alpha} \cdot \color{blue}{\frac{1}{2}} \]

   4. Applied rewrites 90.6%

      \[\leadsto \color{blue}{\frac{0 \cdot \beta - \left(-\left(2 + \mathsf{fma}\left(2, \beta, 4 \cdot i\right)\right)\right)}{\alpha} \cdot 0.5} \]

   5. Taylor expanded in i around 0

      \[\leadsto \frac{1}{2} \cdot \frac{2 + 2 \cdot \beta}{\alpha} + \color{blue}{2 \cdot \frac{i}{\alpha}} \]
   6. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2}, \frac{2 + 2 \cdot \beta}{\color{blue}{\alpha}}, 2 \cdot \frac{i}{\alpha}\right) \]

      2. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2}, \frac{2 + 2 \cdot \beta}{\alpha}, 2 \cdot \frac{i}{\alpha}\right) \]

      3. lower-+.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2}, \frac{2 + 2 \cdot \beta}{\alpha}, 2 \cdot \frac{i}{\alpha}\right) \]

      4. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2}, \frac{2 + 2 \cdot \beta}{\alpha}, 2 \cdot \frac{i}{\alpha}\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2}, \frac{2 + 2 \cdot \beta}{\alpha}, 2 \cdot \frac{i}{\alpha}\right) \]

      6. lower-/.f64 90.6

         \[\leadsto \mathsf{fma}\left(0.5, \frac{2 + 2 \cdot \beta}{\alpha}, 2 \cdot \frac{i}{\alpha}\right) \]

   7. Applied rewrites 90.6%

      \[\leadsto \mathsf{fma}\left(0.5, \color{blue}{\frac{2 + 2 \cdot \beta}{\alpha}}, 2 \cdot \frac{i}{\alpha}\right) \]

   8. Taylor expanded in beta around 0

      \[\leadsto 2 \cdot \frac{i}{\alpha} + \left(\frac{1}{\alpha} + \color{blue}{\frac{\beta}{\alpha}}\right) \]
   9. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(2, \frac{i}{\alpha}, \frac{1}{\alpha} + \frac{\beta}{\alpha}\right) \]

      2. lift-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(2, \frac{i}{\alpha}, \frac{1}{\alpha} + \frac{\beta}{\alpha}\right) \]

      3. div-add-rev N/A

         \[\leadsto \mathsf{fma}\left(2, \frac{i}{\alpha}, \frac{1 + \beta}{\alpha}\right) \]

      4. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(2, \frac{i}{\alpha}, \frac{1 + \beta}{\alpha}\right) \]

      5. lower-+.f64 90.6

         \[\leadsto \mathsf{fma}\left(2, \frac{i}{\alpha}, \frac{1 + \beta}{\alpha}\right) \]

   10. Applied rewrites 90.6%

       \[\leadsto \mathsf{fma}\left(2, \frac{i}{\color{blue}{\alpha}}, \frac{1 + \beta}{\alpha}\right) \]

   if 2e-8 < (/.f64 (+.f64 (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64)) < 0.5

   1. Initial program 99.8%

      \[\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]

   2. Taylor expanded in i around inf

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

   4. Applied rewrites 98.2%

      \[\leadsto \color{blue}{0.5} \]

   if 0.5 < (/.f64 (+.f64 (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64))

   1. Initial program 39.4%

      \[\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]

   2. Taylor expanded in beta around inf

      \[\leadsto \frac{\frac{\color{blue}{\beta}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]
   3. Step-by-step derivation

   4. Applied rewrites 96.2%

      \[\leadsto \frac{\frac{\color{blue}{\beta}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]

   5. Taylor expanded in i around 0

      \[\leadsto \frac{\frac{\beta}{\color{blue}{\left(\alpha + \beta\right)} + 2} + 1}{2} \]
   6. Step-by-step derivation

      1. lift-+.f64 91.1

         \[\leadsto \frac{\frac{\beta}{\left(\alpha + \color{blue}{\beta}\right) + 2} + 1}{2} \]

   7. Applied rewrites 91.1%

      \[\leadsto \frac{\frac{\beta}{\color{blue}{\left(\alpha + \beta\right)} + 2} + 1}{2} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 4: 94.8% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + 2 \cdot i\\ t_1 := \frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{t\_0}}{t\_0 + 2} + 1}{2}\\ \mathbf{if}\;t\_1 \leq 2 \cdot 10^{-8}:\\ \;\;\;\;\mathsf{fma}\left(2, \frac{i}{\alpha}, \frac{1 + \beta}{\alpha}\right)\\ \mathbf{elif}\;t\_1 \leq 0.5:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;\left(1 + \frac{\beta}{2 + \beta}\right) \cdot 0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* 2.0 i)))
        (t_1
         (/
          (+ (/ (/ (* (+ alpha beta) (- beta alpha)) t_0) (+ t_0 2.0)) 1.0)
          2.0)))
   (if (<= t_1 2e-8)
     (fma 2.0 (/ i alpha) (/ (+ 1.0 beta) alpha))
     (if (<= t_1 0.5) 0.5 (* (+ 1.0 (/ beta (+ 2.0 beta))) 0.5)))))

C

double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double t_1 = (((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0)) + 1.0) / 2.0;
	double tmp;
	if (t_1 <= 2e-8) {
		tmp = fma(2.0, (i / alpha), ((1.0 + beta) / alpha));
	} else if (t_1 <= 0.5) {
		tmp = 0.5;
	} else {
		tmp = (1.0 + (beta / (2.0 + beta))) * 0.5;
	}
	return tmp;
}

Julia

function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	t_1 = Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) * Float64(beta - alpha)) / t_0) / Float64(t_0 + 2.0)) + 1.0) / 2.0)
	tmp = 0.0
	if (t_1 <= 2e-8)
		tmp = fma(2.0, Float64(i / alpha), Float64(Float64(1.0 + beta) / alpha));
	elseif (t_1 <= 0.5)
		tmp = 0.5;
	else
		tmp = Float64(Float64(1.0 + Float64(beta / Float64(2.0 + beta))) * 0.5);
	end
	return tmp
end

Wolfram

code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] * N[(beta - alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 2.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / 2.0), $MachinePrecision]}, If[LessEqual[t$95$1, 2e-8], N[(2.0 * N[(i / alpha), $MachinePrecision] + N[(N[(1.0 + beta), $MachinePrecision] / alpha), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 0.5], 0.5, N[(N[(1.0 + N[(beta / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64)) < 2e-8

   1. Initial program 2.8%

      \[\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]

   2. Taylor expanded in alpha around inf

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{\left(\beta + -1 \cdot \beta\right) - -1 \cdot \left(2 + \left(2 \cdot \beta + 4 \cdot i\right)\right)}{\alpha}} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \frac{\left(\beta + -1 \cdot \beta\right) - -1 \cdot \left(2 + \left(2 \cdot \beta + 4 \cdot i\right)\right)}{\alpha} \cdot \color{blue}{\frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{\left(\beta + -1 \cdot \beta\right) - -1 \cdot \left(2 + \left(2 \cdot \beta + 4 \cdot i\right)\right)}{\alpha} \cdot \color{blue}{\frac{1}{2}} \]

   4. Applied rewrites 90.6%

      \[\leadsto \color{blue}{\frac{0 \cdot \beta - \left(-\left(2 + \mathsf{fma}\left(2, \beta, 4 \cdot i\right)\right)\right)}{\alpha} \cdot 0.5} \]

   5. Taylor expanded in i around 0

      \[\leadsto \frac{1}{2} \cdot \frac{2 + 2 \cdot \beta}{\alpha} + \color{blue}{2 \cdot \frac{i}{\alpha}} \]
   6. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2}, \frac{2 + 2 \cdot \beta}{\color{blue}{\alpha}}, 2 \cdot \frac{i}{\alpha}\right) \]

      2. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2}, \frac{2 + 2 \cdot \beta}{\alpha}, 2 \cdot \frac{i}{\alpha}\right) \]

      3. lower-+.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2}, \frac{2 + 2 \cdot \beta}{\alpha}, 2 \cdot \frac{i}{\alpha}\right) \]

      4. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2}, \frac{2 + 2 \cdot \beta}{\alpha}, 2 \cdot \frac{i}{\alpha}\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2}, \frac{2 + 2 \cdot \beta}{\alpha}, 2 \cdot \frac{i}{\alpha}\right) \]

      6. lower-/.f64 90.6

         \[\leadsto \mathsf{fma}\left(0.5, \frac{2 + 2 \cdot \beta}{\alpha}, 2 \cdot \frac{i}{\alpha}\right) \]

   7. Applied rewrites 90.6%

      \[\leadsto \mathsf{fma}\left(0.5, \color{blue}{\frac{2 + 2 \cdot \beta}{\alpha}}, 2 \cdot \frac{i}{\alpha}\right) \]

   8. Taylor expanded in beta around 0

      \[\leadsto 2 \cdot \frac{i}{\alpha} + \left(\frac{1}{\alpha} + \color{blue}{\frac{\beta}{\alpha}}\right) \]
   9. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(2, \frac{i}{\alpha}, \frac{1}{\alpha} + \frac{\beta}{\alpha}\right) \]

      2. lift-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(2, \frac{i}{\alpha}, \frac{1}{\alpha} + \frac{\beta}{\alpha}\right) \]

      3. div-add-rev N/A

         \[\leadsto \mathsf{fma}\left(2, \frac{i}{\alpha}, \frac{1 + \beta}{\alpha}\right) \]

      4. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(2, \frac{i}{\alpha}, \frac{1 + \beta}{\alpha}\right) \]

      5. lower-+.f64 90.6

         \[\leadsto \mathsf{fma}\left(2, \frac{i}{\alpha}, \frac{1 + \beta}{\alpha}\right) \]

   10. Applied rewrites 90.6%

       \[\leadsto \mathsf{fma}\left(2, \frac{i}{\color{blue}{\alpha}}, \frac{1 + \beta}{\alpha}\right) \]

   if 2e-8 < (/.f64 (+.f64 (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64)) < 0.5

   1. Initial program 99.8%

      \[\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]

   2. Taylor expanded in i around inf

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

   4. Applied rewrites 98.2%

      \[\leadsto \color{blue}{0.5} \]

   if 0.5 < (/.f64 (+.f64 (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64))

   1. Initial program 39.4%

      \[\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]

   2. Taylor expanded in alpha around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(1 + \frac{{\beta}^{2}}{\left(2 + \left(\beta + 2 \cdot i\right)\right) \cdot \left(\beta + 2 \cdot i\right)}\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(1 + \frac{{\beta}^{2}}{\left(2 + \left(\beta + 2 \cdot i\right)\right) \cdot \left(\beta + 2 \cdot i\right)}\right) \cdot \color{blue}{\frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(1 + \frac{{\beta}^{2}}{\left(2 + \left(\beta + 2 \cdot i\right)\right) \cdot \left(\beta + 2 \cdot i\right)}\right) \cdot \color{blue}{\frac{1}{2}} \]

   4. Applied rewrites 36.4%

      \[\leadsto \color{blue}{\left(1 + \frac{\beta \cdot \beta}{\left(2 + \left(\beta + \left(i + i\right)\right)\right) \cdot \left(\beta + \left(i + i\right)\right)}\right) \cdot 0.5} \]

   5. Taylor expanded in i around 0

      \[\leadsto \left(1 + \frac{\beta}{2 + \beta}\right) \cdot \frac{1}{2} \]
   6. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \left(1 + \frac{\beta}{2 + \beta}\right) \cdot \frac{1}{2} \]

      2. lower-+.f64 91.1

         \[\leadsto \left(1 + \frac{\beta}{2 + \beta}\right) \cdot 0.5 \]

   7. Applied rewrites 91.1%

      \[\leadsto \left(1 + \frac{\beta}{2 + \beta}\right) \cdot 0.5 \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 5: 91.2% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + 2 \cdot i\\ t_1 := \frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{t\_0}}{t\_0 + 2} + 1}{2}\\ \mathbf{if}\;t\_1 \leq 2 \cdot 10^{-8}:\\ \;\;\;\;\mathsf{fma}\left(2, \frac{i}{\alpha}, \frac{1}{\alpha}\right)\\ \mathbf{elif}\;t\_1 \leq 0.5:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;\left(1 + \frac{\beta}{2 + \beta}\right) \cdot 0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* 2.0 i)))
        (t_1
         (/
          (+ (/ (/ (* (+ alpha beta) (- beta alpha)) t_0) (+ t_0 2.0)) 1.0)
          2.0)))
   (if (<= t_1 2e-8)
     (fma 2.0 (/ i alpha) (/ 1.0 alpha))
     (if (<= t_1 0.5) 0.5 (* (+ 1.0 (/ beta (+ 2.0 beta))) 0.5)))))

C

double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double t_1 = (((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0)) + 1.0) / 2.0;
	double tmp;
	if (t_1 <= 2e-8) {
		tmp = fma(2.0, (i / alpha), (1.0 / alpha));
	} else if (t_1 <= 0.5) {
		tmp = 0.5;
	} else {
		tmp = (1.0 + (beta / (2.0 + beta))) * 0.5;
	}
	return tmp;
}

Julia

function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	t_1 = Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) * Float64(beta - alpha)) / t_0) / Float64(t_0 + 2.0)) + 1.0) / 2.0)
	tmp = 0.0
	if (t_1 <= 2e-8)
		tmp = fma(2.0, Float64(i / alpha), Float64(1.0 / alpha));
	elseif (t_1 <= 0.5)
		tmp = 0.5;
	else
		tmp = Float64(Float64(1.0 + Float64(beta / Float64(2.0 + beta))) * 0.5);
	end
	return tmp
end

Wolfram

code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] * N[(beta - alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 2.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / 2.0), $MachinePrecision]}, If[LessEqual[t$95$1, 2e-8], N[(2.0 * N[(i / alpha), $MachinePrecision] + N[(1.0 / alpha), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 0.5], 0.5, N[(N[(1.0 + N[(beta / N[(2.0 + beta), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * 0.5), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64)) < 2e-8

   1. Initial program 2.8%

      \[\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]

   2. Taylor expanded in alpha around inf

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{\left(\beta + -1 \cdot \beta\right) - -1 \cdot \left(2 + \left(2 \cdot \beta + 4 \cdot i\right)\right)}{\alpha}} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \frac{\left(\beta + -1 \cdot \beta\right) - -1 \cdot \left(2 + \left(2 \cdot \beta + 4 \cdot i\right)\right)}{\alpha} \cdot \color{blue}{\frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{\left(\beta + -1 \cdot \beta\right) - -1 \cdot \left(2 + \left(2 \cdot \beta + 4 \cdot i\right)\right)}{\alpha} \cdot \color{blue}{\frac{1}{2}} \]

   4. Applied rewrites 90.6%

      \[\leadsto \color{blue}{\frac{0 \cdot \beta - \left(-\left(2 + \mathsf{fma}\left(2, \beta, 4 \cdot i\right)\right)\right)}{\alpha} \cdot 0.5} \]

   5. Taylor expanded in i around 0

      \[\leadsto \frac{1}{2} \cdot \frac{2 + 2 \cdot \beta}{\alpha} + \color{blue}{2 \cdot \frac{i}{\alpha}} \]
   6. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2}, \frac{2 + 2 \cdot \beta}{\color{blue}{\alpha}}, 2 \cdot \frac{i}{\alpha}\right) \]

      2. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2}, \frac{2 + 2 \cdot \beta}{\alpha}, 2 \cdot \frac{i}{\alpha}\right) \]

      3. lower-+.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2}, \frac{2 + 2 \cdot \beta}{\alpha}, 2 \cdot \frac{i}{\alpha}\right) \]

      4. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2}, \frac{2 + 2 \cdot \beta}{\alpha}, 2 \cdot \frac{i}{\alpha}\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2}, \frac{2 + 2 \cdot \beta}{\alpha}, 2 \cdot \frac{i}{\alpha}\right) \]

      6. lower-/.f64 90.6

         \[\leadsto \mathsf{fma}\left(0.5, \frac{2 + 2 \cdot \beta}{\alpha}, 2 \cdot \frac{i}{\alpha}\right) \]

   7. Applied rewrites 90.6%

      \[\leadsto \mathsf{fma}\left(0.5, \color{blue}{\frac{2 + 2 \cdot \beta}{\alpha}}, 2 \cdot \frac{i}{\alpha}\right) \]

   8. Taylor expanded in beta around 0

      \[\leadsto 2 \cdot \frac{i}{\alpha} + \frac{1}{\color{blue}{\alpha}} \]
   9. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(2, \frac{i}{\alpha}, \frac{1}{\alpha}\right) \]

      2. lift-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(2, \frac{i}{\alpha}, \frac{1}{\alpha}\right) \]

      3. lower-/.f64 74.3

         \[\leadsto \mathsf{fma}\left(2, \frac{i}{\alpha}, \frac{1}{\alpha}\right) \]

   10. Applied rewrites 74.3%

       \[\leadsto \mathsf{fma}\left(2, \frac{i}{\color{blue}{\alpha}}, \frac{1}{\alpha}\right) \]

   if 2e-8 < (/.f64 (+.f64 (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64)) < 0.5

   1. Initial program 99.8%

      \[\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]

   2. Taylor expanded in i around inf

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

   4. Applied rewrites 98.2%

      \[\leadsto \color{blue}{0.5} \]

   if 0.5 < (/.f64 (+.f64 (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64))

   1. Initial program 39.4%

      \[\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]

   2. Taylor expanded in alpha around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(1 + \frac{{\beta}^{2}}{\left(2 + \left(\beta + 2 \cdot i\right)\right) \cdot \left(\beta + 2 \cdot i\right)}\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(1 + \frac{{\beta}^{2}}{\left(2 + \left(\beta + 2 \cdot i\right)\right) \cdot \left(\beta + 2 \cdot i\right)}\right) \cdot \color{blue}{\frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(1 + \frac{{\beta}^{2}}{\left(2 + \left(\beta + 2 \cdot i\right)\right) \cdot \left(\beta + 2 \cdot i\right)}\right) \cdot \color{blue}{\frac{1}{2}} \]

   4. Applied rewrites 36.4%

      \[\leadsto \color{blue}{\left(1 + \frac{\beta \cdot \beta}{\left(2 + \left(\beta + \left(i + i\right)\right)\right) \cdot \left(\beta + \left(i + i\right)\right)}\right) \cdot 0.5} \]

   5. Taylor expanded in i around 0

      \[\leadsto \left(1 + \frac{\beta}{2 + \beta}\right) \cdot \frac{1}{2} \]
   6. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \left(1 + \frac{\beta}{2 + \beta}\right) \cdot \frac{1}{2} \]

      2. lower-+.f64 91.1

         \[\leadsto \left(1 + \frac{\beta}{2 + \beta}\right) \cdot 0.5 \]

   7. Applied rewrites 91.1%

      \[\leadsto \left(1 + \frac{\beta}{2 + \beta}\right) \cdot 0.5 \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 6: 90.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + 2 \cdot i\\ t_1 := \frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{t\_0}}{t\_0 + 2} + 1}{2}\\ \mathbf{if}\;t\_1 \leq 2 \cdot 10^{-8}:\\ \;\;\;\;\mathsf{fma}\left(2, \frac{i}{\alpha}, \frac{1}{\alpha}\right)\\ \mathbf{elif}\;t\_1 \leq 0.8:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;1 - \frac{1}{\beta}\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* 2.0 i)))
        (t_1
         (/
          (+ (/ (/ (* (+ alpha beta) (- beta alpha)) t_0) (+ t_0 2.0)) 1.0)
          2.0)))
   (if (<= t_1 2e-8)
     (fma 2.0 (/ i alpha) (/ 1.0 alpha))
     (if (<= t_1 0.8) 0.5 (- 1.0 (/ 1.0 beta))))))

C

double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double t_1 = (((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0)) + 1.0) / 2.0;
	double tmp;
	if (t_1 <= 2e-8) {
		tmp = fma(2.0, (i / alpha), (1.0 / alpha));
	} else if (t_1 <= 0.8) {
		tmp = 0.5;
	} else {
		tmp = 1.0 - (1.0 / beta);
	}
	return tmp;
}

Julia

function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	t_1 = Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) * Float64(beta - alpha)) / t_0) / Float64(t_0 + 2.0)) + 1.0) / 2.0)
	tmp = 0.0
	if (t_1 <= 2e-8)
		tmp = fma(2.0, Float64(i / alpha), Float64(1.0 / alpha));
	elseif (t_1 <= 0.8)
		tmp = 0.5;
	else
		tmp = Float64(1.0 - Float64(1.0 / beta));
	end
	return tmp
end

Wolfram

code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] * N[(beta - alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 2.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / 2.0), $MachinePrecision]}, If[LessEqual[t$95$1, 2e-8], N[(2.0 * N[(i / alpha), $MachinePrecision] + N[(1.0 / alpha), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 0.8], 0.5, N[(1.0 - N[(1.0 / beta), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64)) < 2e-8

   1. Initial program 2.8%

      \[\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]

   2. Taylor expanded in alpha around inf

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{\left(\beta + -1 \cdot \beta\right) - -1 \cdot \left(2 + \left(2 \cdot \beta + 4 \cdot i\right)\right)}{\alpha}} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \frac{\left(\beta + -1 \cdot \beta\right) - -1 \cdot \left(2 + \left(2 \cdot \beta + 4 \cdot i\right)\right)}{\alpha} \cdot \color{blue}{\frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{\left(\beta + -1 \cdot \beta\right) - -1 \cdot \left(2 + \left(2 \cdot \beta + 4 \cdot i\right)\right)}{\alpha} \cdot \color{blue}{\frac{1}{2}} \]

   4. Applied rewrites 90.6%

      \[\leadsto \color{blue}{\frac{0 \cdot \beta - \left(-\left(2 + \mathsf{fma}\left(2, \beta, 4 \cdot i\right)\right)\right)}{\alpha} \cdot 0.5} \]

   5. Taylor expanded in i around 0

      \[\leadsto \frac{1}{2} \cdot \frac{2 + 2 \cdot \beta}{\alpha} + \color{blue}{2 \cdot \frac{i}{\alpha}} \]
   6. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2}, \frac{2 + 2 \cdot \beta}{\color{blue}{\alpha}}, 2 \cdot \frac{i}{\alpha}\right) \]

      2. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2}, \frac{2 + 2 \cdot \beta}{\alpha}, 2 \cdot \frac{i}{\alpha}\right) \]

      3. lower-+.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2}, \frac{2 + 2 \cdot \beta}{\alpha}, 2 \cdot \frac{i}{\alpha}\right) \]

      4. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2}, \frac{2 + 2 \cdot \beta}{\alpha}, 2 \cdot \frac{i}{\alpha}\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2}, \frac{2 + 2 \cdot \beta}{\alpha}, 2 \cdot \frac{i}{\alpha}\right) \]

      6. lower-/.f64 90.6

         \[\leadsto \mathsf{fma}\left(0.5, \frac{2 + 2 \cdot \beta}{\alpha}, 2 \cdot \frac{i}{\alpha}\right) \]

   7. Applied rewrites 90.6%

      \[\leadsto \mathsf{fma}\left(0.5, \color{blue}{\frac{2 + 2 \cdot \beta}{\alpha}}, 2 \cdot \frac{i}{\alpha}\right) \]

   8. Taylor expanded in beta around 0

      \[\leadsto 2 \cdot \frac{i}{\alpha} + \frac{1}{\color{blue}{\alpha}} \]
   9. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(2, \frac{i}{\alpha}, \frac{1}{\alpha}\right) \]

      2. lift-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(2, \frac{i}{\alpha}, \frac{1}{\alpha}\right) \]

      3. lower-/.f64 74.3

         \[\leadsto \mathsf{fma}\left(2, \frac{i}{\alpha}, \frac{1}{\alpha}\right) \]

   10. Applied rewrites 74.3%

       \[\leadsto \mathsf{fma}\left(2, \frac{i}{\color{blue}{\alpha}}, \frac{1}{\alpha}\right) \]

   if 2e-8 < (/.f64 (+.f64 (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64)) < 0.80000000000000004

   1. Initial program 99.8%

      \[\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]

   2. Taylor expanded in i around inf

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

   4. Applied rewrites 97.4%

      \[\leadsto \color{blue}{0.5} \]

   if 0.80000000000000004 < (/.f64 (+.f64 (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64))

   1. Initial program 36.3%

      \[\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]

   2. Taylor expanded in alpha around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(1 + \frac{{\beta}^{2}}{\left(2 + \left(\beta + 2 \cdot i\right)\right) \cdot \left(\beta + 2 \cdot i\right)}\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(1 + \frac{{\beta}^{2}}{\left(2 + \left(\beta + 2 \cdot i\right)\right) \cdot \left(\beta + 2 \cdot i\right)}\right) \cdot \color{blue}{\frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(1 + \frac{{\beta}^{2}}{\left(2 + \left(\beta + 2 \cdot i\right)\right) \cdot \left(\beta + 2 \cdot i\right)}\right) \cdot \color{blue}{\frac{1}{2}} \]

   4. Applied rewrites 33.9%

      \[\leadsto \color{blue}{\left(1 + \frac{\beta \cdot \beta}{\left(2 + \left(\beta + \left(i + i\right)\right)\right) \cdot \left(\beta + \left(i + i\right)\right)}\right) \cdot 0.5} \]

   5. Taylor expanded in beta around inf

      \[\leadsto 1 + \color{blue}{\frac{-1}{2} \cdot \frac{2 + 4 \cdot i}{\beta}} \]
   6. Step-by-step derivation

      1. lower-+.f64 N/A

         \[\leadsto 1 + \frac{-1}{2} \cdot \color{blue}{\frac{2 + 4 \cdot i}{\beta}} \]

      2. lower-*.f64 N/A

         \[\leadsto 1 + \frac{-1}{2} \cdot \frac{2 + 4 \cdot i}{\color{blue}{\beta}} \]

      3. lower-/.f64 N/A

         \[\leadsto 1 + \frac{-1}{2} \cdot \frac{2 + 4 \cdot i}{\beta} \]

      4. lower-+.f64 N/A

         \[\leadsto 1 + \frac{-1}{2} \cdot \frac{2 + 4 \cdot i}{\beta} \]

      5. lift-*.f64 90.9

         \[\leadsto 1 + -0.5 \cdot \frac{2 + 4 \cdot i}{\beta} \]

   7. Applied rewrites 90.9%

      \[\leadsto 1 + \color{blue}{-0.5 \cdot \frac{2 + 4 \cdot i}{\beta}} \]

   8. Taylor expanded in i around 0

      \[\leadsto 1 - \frac{1}{\color{blue}{\beta}} \]
   9. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto 1 - \frac{1}{\beta} \]

      2. lower-/.f64 91.6

         \[\leadsto 1 - \frac{1}{\beta} \]

   10. Applied rewrites 91.6%

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

Alternative 7: 85.3% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + 2 \cdot i\\ t_1 := \frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{t\_0}}{t\_0 + 2} + 1}{2}\\ \mathbf{if}\;t\_1 \leq 2 \cdot 10^{-8}:\\ \;\;\;\;\frac{2}{\alpha} \cdot 0.5\\ \mathbf{elif}\;t\_1 \leq 0.8:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;1 - \frac{1}{\beta}\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* 2.0 i)))
        (t_1
         (/
          (+ (/ (/ (* (+ alpha beta) (- beta alpha)) t_0) (+ t_0 2.0)) 1.0)
          2.0)))
   (if (<= t_1 2e-8)
     (* (/ 2.0 alpha) 0.5)
     (if (<= t_1 0.8) 0.5 (- 1.0 (/ 1.0 beta))))))

C

double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double t_1 = (((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0)) + 1.0) / 2.0;
	double tmp;
	if (t_1 <= 2e-8) {
		tmp = (2.0 / alpha) * 0.5;
	} else if (t_1 <= 0.8) {
		tmp = 0.5;
	} else {
		tmp = 1.0 - (1.0 / beta);
	}
	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(alpha, beta, i)
use fmin_fmax_functions
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = (alpha + beta) + (2.0d0 * i)
    t_1 = (((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0d0)) + 1.0d0) / 2.0d0
    if (t_1 <= 2d-8) then
        tmp = (2.0d0 / alpha) * 0.5d0
    else if (t_1 <= 0.8d0) then
        tmp = 0.5d0
    else
        tmp = 1.0d0 - (1.0d0 / beta)
    end if
    code = tmp
end function

Java

public static double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double t_1 = (((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0)) + 1.0) / 2.0;
	double tmp;
	if (t_1 <= 2e-8) {
		tmp = (2.0 / alpha) * 0.5;
	} else if (t_1 <= 0.8) {
		tmp = 0.5;
	} else {
		tmp = 1.0 - (1.0 / beta);
	}
	return tmp;
}

Python

def code(alpha, beta, i):
	t_0 = (alpha + beta) + (2.0 * i)
	t_1 = (((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0)) + 1.0) / 2.0
	tmp = 0
	if t_1 <= 2e-8:
		tmp = (2.0 / alpha) * 0.5
	elif t_1 <= 0.8:
		tmp = 0.5
	else:
		tmp = 1.0 - (1.0 / beta)
	return tmp

Julia

function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	t_1 = Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) * Float64(beta - alpha)) / t_0) / Float64(t_0 + 2.0)) + 1.0) / 2.0)
	tmp = 0.0
	if (t_1 <= 2e-8)
		tmp = Float64(Float64(2.0 / alpha) * 0.5);
	elseif (t_1 <= 0.8)
		tmp = 0.5;
	else
		tmp = Float64(1.0 - Float64(1.0 / beta));
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta, i)
	t_0 = (alpha + beta) + (2.0 * i);
	t_1 = (((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0)) + 1.0) / 2.0;
	tmp = 0.0;
	if (t_1 <= 2e-8)
		tmp = (2.0 / alpha) * 0.5;
	elseif (t_1 <= 0.8)
		tmp = 0.5;
	else
		tmp = 1.0 - (1.0 / beta);
	end
	tmp_2 = tmp;
end

Wolfram

code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] * N[(beta - alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 2.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / 2.0), $MachinePrecision]}, If[LessEqual[t$95$1, 2e-8], N[(N[(2.0 / alpha), $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[t$95$1, 0.8], 0.5, N[(1.0 - N[(1.0 / beta), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64)) < 2e-8

   1. Initial program 2.8%

      \[\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]

   2. Taylor expanded in alpha around inf

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{\left(\beta + -1 \cdot \beta\right) - -1 \cdot \left(2 + \left(2 \cdot \beta + 4 \cdot i\right)\right)}{\alpha}} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \frac{\left(\beta + -1 \cdot \beta\right) - -1 \cdot \left(2 + \left(2 \cdot \beta + 4 \cdot i\right)\right)}{\alpha} \cdot \color{blue}{\frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{\left(\beta + -1 \cdot \beta\right) - -1 \cdot \left(2 + \left(2 \cdot \beta + 4 \cdot i\right)\right)}{\alpha} \cdot \color{blue}{\frac{1}{2}} \]

   4. Applied rewrites 90.6%

      \[\leadsto \color{blue}{\frac{0 \cdot \beta - \left(-\left(2 + \mathsf{fma}\left(2, \beta, 4 \cdot i\right)\right)\right)}{\alpha} \cdot 0.5} \]

   5. Taylor expanded in beta around 0

      \[\leadsto \frac{2 + 4 \cdot i}{\alpha} \cdot \frac{1}{2} \]
   6. Step-by-step derivation

      1. lower-+.f64 N/A

         \[\leadsto \frac{2 + 4 \cdot i}{\alpha} \cdot \frac{1}{2} \]

      2. lift-*.f64 74.3

         \[\leadsto \frac{2 + 4 \cdot i}{\alpha} \cdot 0.5 \]

   7. Applied rewrites 74.3%

      \[\leadsto \frac{2 + 4 \cdot i}{\alpha} \cdot 0.5 \]

   8. Taylor expanded in i around 0

      \[\leadsto \frac{2}{\alpha} \cdot \frac{1}{2} \]
   9. Step-by-step derivation

   10. Applied rewrites 48.9%

       \[\leadsto \frac{2}{\alpha} \cdot 0.5 \]

   if 2e-8 < (/.f64 (+.f64 (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64)) < 0.80000000000000004

   1. Initial program 99.8%

      \[\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]

   2. Taylor expanded in i around inf

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

   4. Applied rewrites 97.4%

      \[\leadsto \color{blue}{0.5} \]

   if 0.80000000000000004 < (/.f64 (+.f64 (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64))

   1. Initial program 36.3%

      \[\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]

   2. Taylor expanded in alpha around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(1 + \frac{{\beta}^{2}}{\left(2 + \left(\beta + 2 \cdot i\right)\right) \cdot \left(\beta + 2 \cdot i\right)}\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(1 + \frac{{\beta}^{2}}{\left(2 + \left(\beta + 2 \cdot i\right)\right) \cdot \left(\beta + 2 \cdot i\right)}\right) \cdot \color{blue}{\frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(1 + \frac{{\beta}^{2}}{\left(2 + \left(\beta + 2 \cdot i\right)\right) \cdot \left(\beta + 2 \cdot i\right)}\right) \cdot \color{blue}{\frac{1}{2}} \]

   4. Applied rewrites 33.9%

      \[\leadsto \color{blue}{\left(1 + \frac{\beta \cdot \beta}{\left(2 + \left(\beta + \left(i + i\right)\right)\right) \cdot \left(\beta + \left(i + i\right)\right)}\right) \cdot 0.5} \]

   5. Taylor expanded in beta around inf

      \[\leadsto 1 + \color{blue}{\frac{-1}{2} \cdot \frac{2 + 4 \cdot i}{\beta}} \]
   6. Step-by-step derivation

      1. lower-+.f64 N/A

         \[\leadsto 1 + \frac{-1}{2} \cdot \color{blue}{\frac{2 + 4 \cdot i}{\beta}} \]

      2. lower-*.f64 N/A

         \[\leadsto 1 + \frac{-1}{2} \cdot \frac{2 + 4 \cdot i}{\color{blue}{\beta}} \]

      3. lower-/.f64 N/A

         \[\leadsto 1 + \frac{-1}{2} \cdot \frac{2 + 4 \cdot i}{\beta} \]

      4. lower-+.f64 N/A

         \[\leadsto 1 + \frac{-1}{2} \cdot \frac{2 + 4 \cdot i}{\beta} \]

      5. lift-*.f64 90.9

         \[\leadsto 1 + -0.5 \cdot \frac{2 + 4 \cdot i}{\beta} \]

   7. Applied rewrites 90.9%

      \[\leadsto 1 + \color{blue}{-0.5 \cdot \frac{2 + 4 \cdot i}{\beta}} \]

   8. Taylor expanded in i around 0

      \[\leadsto 1 - \frac{1}{\color{blue}{\beta}} \]
   9. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto 1 - \frac{1}{\beta} \]

      2. lower-/.f64 91.6

         \[\leadsto 1 - \frac{1}{\beta} \]

   10. Applied rewrites 91.6%

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

Alternative 8: 81.0% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + 2 \cdot i\\ t_1 := \frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{t\_0}}{t\_0 + 2} + 1}{2}\\ \mathbf{if}\;t\_1 \leq 0:\\ \;\;\;\;2 \cdot \frac{i}{\alpha}\\ \mathbf{elif}\;t\_1 \leq 0.8:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;1 - \frac{1}{\beta}\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* 2.0 i)))
        (t_1
         (/
          (+ (/ (/ (* (+ alpha beta) (- beta alpha)) t_0) (+ t_0 2.0)) 1.0)
          2.0)))
   (if (<= t_1 0.0)
     (* 2.0 (/ i alpha))
     (if (<= t_1 0.8) 0.5 (- 1.0 (/ 1.0 beta))))))

C

double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double t_1 = (((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0)) + 1.0) / 2.0;
	double tmp;
	if (t_1 <= 0.0) {
		tmp = 2.0 * (i / alpha);
	} else if (t_1 <= 0.8) {
		tmp = 0.5;
	} else {
		tmp = 1.0 - (1.0 / beta);
	}
	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(alpha, beta, i)
use fmin_fmax_functions
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = (alpha + beta) + (2.0d0 * i)
    t_1 = (((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0d0)) + 1.0d0) / 2.0d0
    if (t_1 <= 0.0d0) then
        tmp = 2.0d0 * (i / alpha)
    else if (t_1 <= 0.8d0) then
        tmp = 0.5d0
    else
        tmp = 1.0d0 - (1.0d0 / beta)
    end if
    code = tmp
end function

Java

public static double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double t_1 = (((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0)) + 1.0) / 2.0;
	double tmp;
	if (t_1 <= 0.0) {
		tmp = 2.0 * (i / alpha);
	} else if (t_1 <= 0.8) {
		tmp = 0.5;
	} else {
		tmp = 1.0 - (1.0 / beta);
	}
	return tmp;
}

Python

def code(alpha, beta, i):
	t_0 = (alpha + beta) + (2.0 * i)
	t_1 = (((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0)) + 1.0) / 2.0
	tmp = 0
	if t_1 <= 0.0:
		tmp = 2.0 * (i / alpha)
	elif t_1 <= 0.8:
		tmp = 0.5
	else:
		tmp = 1.0 - (1.0 / beta)
	return tmp

Julia

function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	t_1 = Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) * Float64(beta - alpha)) / t_0) / Float64(t_0 + 2.0)) + 1.0) / 2.0)
	tmp = 0.0
	if (t_1 <= 0.0)
		tmp = Float64(2.0 * Float64(i / alpha));
	elseif (t_1 <= 0.8)
		tmp = 0.5;
	else
		tmp = Float64(1.0 - Float64(1.0 / beta));
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta, i)
	t_0 = (alpha + beta) + (2.0 * i);
	t_1 = (((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0)) + 1.0) / 2.0;
	tmp = 0.0;
	if (t_1 <= 0.0)
		tmp = 2.0 * (i / alpha);
	elseif (t_1 <= 0.8)
		tmp = 0.5;
	else
		tmp = 1.0 - (1.0 / beta);
	end
	tmp_2 = tmp;
end

Wolfram

code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] * N[(beta - alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 2.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / 2.0), $MachinePrecision]}, If[LessEqual[t$95$1, 0.0], N[(2.0 * N[(i / alpha), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 0.8], 0.5, N[(1.0 - N[(1.0 / beta), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (+.f64 (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64)) < 0.0

   1. Initial program 1.9%

      \[\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]

   2. Taylor expanded in alpha around inf

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{\left(\beta + -1 \cdot \beta\right) - -1 \cdot \left(2 + \left(2 \cdot \beta + 4 \cdot i\right)\right)}{\alpha}} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \frac{\left(\beta + -1 \cdot \beta\right) - -1 \cdot \left(2 + \left(2 \cdot \beta + 4 \cdot i\right)\right)}{\alpha} \cdot \color{blue}{\frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{\left(\beta + -1 \cdot \beta\right) - -1 \cdot \left(2 + \left(2 \cdot \beta + 4 \cdot i\right)\right)}{\alpha} \cdot \color{blue}{\frac{1}{2}} \]

   4. Applied rewrites 90.7%

      \[\leadsto \color{blue}{\frac{0 \cdot \beta - \left(-\left(2 + \mathsf{fma}\left(2, \beta, 4 \cdot i\right)\right)\right)}{\alpha} \cdot 0.5} \]

   5. Taylor expanded in i around inf

      \[\leadsto 2 \cdot \color{blue}{\frac{i}{\alpha}} \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto 2 \cdot \frac{i}{\color{blue}{\alpha}} \]

      2. lower-/.f64 29.7

         \[\leadsto 2 \cdot \frac{i}{\alpha} \]

   7. Applied rewrites 29.7%

      \[\leadsto 2 \cdot \color{blue}{\frac{i}{\alpha}} \]

   if 0.0 < (/.f64 (+.f64 (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64)) < 0.80000000000000004

   1. Initial program 98.7%

      \[\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]

   2. Taylor expanded in i around inf

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

   4. Applied rewrites 96.0%

      \[\leadsto \color{blue}{0.5} \]

   if 0.80000000000000004 < (/.f64 (+.f64 (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64))

   1. Initial program 36.3%

      \[\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]

   2. Taylor expanded in alpha around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(1 + \frac{{\beta}^{2}}{\left(2 + \left(\beta + 2 \cdot i\right)\right) \cdot \left(\beta + 2 \cdot i\right)}\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(1 + \frac{{\beta}^{2}}{\left(2 + \left(\beta + 2 \cdot i\right)\right) \cdot \left(\beta + 2 \cdot i\right)}\right) \cdot \color{blue}{\frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(1 + \frac{{\beta}^{2}}{\left(2 + \left(\beta + 2 \cdot i\right)\right) \cdot \left(\beta + 2 \cdot i\right)}\right) \cdot \color{blue}{\frac{1}{2}} \]

   4. Applied rewrites 33.9%

      \[\leadsto \color{blue}{\left(1 + \frac{\beta \cdot \beta}{\left(2 + \left(\beta + \left(i + i\right)\right)\right) \cdot \left(\beta + \left(i + i\right)\right)}\right) \cdot 0.5} \]

   5. Taylor expanded in beta around inf

      \[\leadsto 1 + \color{blue}{\frac{-1}{2} \cdot \frac{2 + 4 \cdot i}{\beta}} \]
   6. Step-by-step derivation

      1. lower-+.f64 N/A

         \[\leadsto 1 + \frac{-1}{2} \cdot \color{blue}{\frac{2 + 4 \cdot i}{\beta}} \]

      2. lower-*.f64 N/A

         \[\leadsto 1 + \frac{-1}{2} \cdot \frac{2 + 4 \cdot i}{\color{blue}{\beta}} \]

      3. lower-/.f64 N/A

         \[\leadsto 1 + \frac{-1}{2} \cdot \frac{2 + 4 \cdot i}{\beta} \]

      4. lower-+.f64 N/A

         \[\leadsto 1 + \frac{-1}{2} \cdot \frac{2 + 4 \cdot i}{\beta} \]

      5. lift-*.f64 90.9

         \[\leadsto 1 + -0.5 \cdot \frac{2 + 4 \cdot i}{\beta} \]

   7. Applied rewrites 90.9%

      \[\leadsto 1 + \color{blue}{-0.5 \cdot \frac{2 + 4 \cdot i}{\beta}} \]

   8. Taylor expanded in i around 0

      \[\leadsto 1 - \frac{1}{\color{blue}{\beta}} \]
   9. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto 1 - \frac{1}{\beta} \]

      2. lower-/.f64 91.6

         \[\leadsto 1 - \frac{1}{\beta} \]

   10. Applied rewrites 91.6%

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

Alternative 9: 77.6% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + 2 \cdot i\\ \mathbf{if}\;\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{t\_0}}{t\_0 + 2} + 1}{2} \leq 0.8:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;1 - \frac{1}{\beta}\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* 2.0 i))))
   (if (<=
        (/
         (+ (/ (/ (* (+ alpha beta) (- beta alpha)) t_0) (+ t_0 2.0)) 1.0)
         2.0)
        0.8)
     0.5
     (- 1.0 (/ 1.0 beta)))))

C

double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double tmp;
	if (((((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0)) + 1.0) / 2.0) <= 0.8) {
		tmp = 0.5;
	} else {
		tmp = 1.0 - (1.0 / beta);
	}
	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(alpha, beta, i)
use fmin_fmax_functions
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (alpha + beta) + (2.0d0 * i)
    if (((((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0d0)) + 1.0d0) / 2.0d0) <= 0.8d0) then
        tmp = 0.5d0
    else
        tmp = 1.0d0 - (1.0d0 / beta)
    end if
    code = tmp
end function

Java

public static double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double tmp;
	if (((((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0)) + 1.0) / 2.0) <= 0.8) {
		tmp = 0.5;
	} else {
		tmp = 1.0 - (1.0 / beta);
	}
	return tmp;
}

Python

def code(alpha, beta, i):
	t_0 = (alpha + beta) + (2.0 * i)
	tmp = 0
	if ((((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0)) + 1.0) / 2.0) <= 0.8:
		tmp = 0.5
	else:
		tmp = 1.0 - (1.0 / beta)
	return tmp

Julia

function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	tmp = 0.0
	if (Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) * Float64(beta - alpha)) / t_0) / Float64(t_0 + 2.0)) + 1.0) / 2.0) <= 0.8)
		tmp = 0.5;
	else
		tmp = Float64(1.0 - Float64(1.0 / beta));
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta, i)
	t_0 = (alpha + beta) + (2.0 * i);
	tmp = 0.0;
	if (((((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0)) + 1.0) / 2.0) <= 0.8)
		tmp = 0.5;
	else
		tmp = 1.0 - (1.0 / beta);
	end
	tmp_2 = tmp;
end

Wolfram

code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] * N[(beta - alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 2.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / 2.0), $MachinePrecision], 0.8], 0.5, N[(1.0 - N[(1.0 / beta), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64)) < 0.80000000000000004

   1. Initial program 72.0%

      \[\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]

   2. Taylor expanded in i around inf

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

   4. Applied rewrites 73.2%

      \[\leadsto \color{blue}{0.5} \]

   if 0.80000000000000004 < (/.f64 (+.f64 (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64))

   1. Initial program 36.3%

      \[\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]

   2. Taylor expanded in alpha around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \left(1 + \frac{{\beta}^{2}}{\left(2 + \left(\beta + 2 \cdot i\right)\right) \cdot \left(\beta + 2 \cdot i\right)}\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(1 + \frac{{\beta}^{2}}{\left(2 + \left(\beta + 2 \cdot i\right)\right) \cdot \left(\beta + 2 \cdot i\right)}\right) \cdot \color{blue}{\frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(1 + \frac{{\beta}^{2}}{\left(2 + \left(\beta + 2 \cdot i\right)\right) \cdot \left(\beta + 2 \cdot i\right)}\right) \cdot \color{blue}{\frac{1}{2}} \]

   4. Applied rewrites 33.9%

      \[\leadsto \color{blue}{\left(1 + \frac{\beta \cdot \beta}{\left(2 + \left(\beta + \left(i + i\right)\right)\right) \cdot \left(\beta + \left(i + i\right)\right)}\right) \cdot 0.5} \]

   5. Taylor expanded in beta around inf

      \[\leadsto 1 + \color{blue}{\frac{-1}{2} \cdot \frac{2 + 4 \cdot i}{\beta}} \]
   6. Step-by-step derivation

      1. lower-+.f64 N/A

         \[\leadsto 1 + \frac{-1}{2} \cdot \color{blue}{\frac{2 + 4 \cdot i}{\beta}} \]

      2. lower-*.f64 N/A

         \[\leadsto 1 + \frac{-1}{2} \cdot \frac{2 + 4 \cdot i}{\color{blue}{\beta}} \]

      3. lower-/.f64 N/A

         \[\leadsto 1 + \frac{-1}{2} \cdot \frac{2 + 4 \cdot i}{\beta} \]

      4. lower-+.f64 N/A

         \[\leadsto 1 + \frac{-1}{2} \cdot \frac{2 + 4 \cdot i}{\beta} \]

      5. lift-*.f64 90.9

         \[\leadsto 1 + -0.5 \cdot \frac{2 + 4 \cdot i}{\beta} \]

   7. Applied rewrites 90.9%

      \[\leadsto 1 + \color{blue}{-0.5 \cdot \frac{2 + 4 \cdot i}{\beta}} \]

   8. Taylor expanded in i around 0

      \[\leadsto 1 - \frac{1}{\color{blue}{\beta}} \]
   9. Step-by-step derivation

      1. lower--.f64 N/A

         \[\leadsto 1 - \frac{1}{\beta} \]

      2. lower-/.f64 91.6

         \[\leadsto 1 - \frac{1}{\beta} \]

   10. Applied rewrites 91.6%

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

Alternative 10: 77.5% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\alpha + \beta\right) + 2 \cdot i\\ \mathbf{if}\;\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{t\_0}}{t\_0 + 2} + 1}{2} \leq 0.8:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (alpha beta i)
 :precision binary64
 (let* ((t_0 (+ (+ alpha beta) (* 2.0 i))))
   (if (<=
        (/
         (+ (/ (/ (* (+ alpha beta) (- beta alpha)) t_0) (+ t_0 2.0)) 1.0)
         2.0)
        0.8)
     0.5
     1.0)))

C

double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double tmp;
	if (((((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0)) + 1.0) / 2.0) <= 0.8) {
		tmp = 0.5;
	} else {
		tmp = 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(alpha, beta, i)
use fmin_fmax_functions
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (alpha + beta) + (2.0d0 * i)
    if (((((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0d0)) + 1.0d0) / 2.0d0) <= 0.8d0) then
        tmp = 0.5d0
    else
        tmp = 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double alpha, double beta, double i) {
	double t_0 = (alpha + beta) + (2.0 * i);
	double tmp;
	if (((((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0)) + 1.0) / 2.0) <= 0.8) {
		tmp = 0.5;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(alpha, beta, i):
	t_0 = (alpha + beta) + (2.0 * i)
	tmp = 0
	if ((((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0)) + 1.0) / 2.0) <= 0.8:
		tmp = 0.5
	else:
		tmp = 1.0
	return tmp

Julia

function code(alpha, beta, i)
	t_0 = Float64(Float64(alpha + beta) + Float64(2.0 * i))
	tmp = 0.0
	if (Float64(Float64(Float64(Float64(Float64(Float64(alpha + beta) * Float64(beta - alpha)) / t_0) / Float64(t_0 + 2.0)) + 1.0) / 2.0) <= 0.8)
		tmp = 0.5;
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(alpha, beta, i)
	t_0 = (alpha + beta) + (2.0 * i);
	tmp = 0.0;
	if (((((((alpha + beta) * (beta - alpha)) / t_0) / (t_0 + 2.0)) + 1.0) / 2.0) <= 0.8)
		tmp = 0.5;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[alpha_, beta_, i_] := Block[{t$95$0 = N[(N[(alpha + beta), $MachinePrecision] + N[(2.0 * i), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(N[(N[(N[(alpha + beta), $MachinePrecision] * N[(beta - alpha), $MachinePrecision]), $MachinePrecision] / t$95$0), $MachinePrecision] / N[(t$95$0 + 2.0), $MachinePrecision]), $MachinePrecision] + 1.0), $MachinePrecision] / 2.0), $MachinePrecision], 0.8], 0.5, 1.0]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (+.f64 (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64)) < 0.80000000000000004

   1. Initial program 72.0%

      \[\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]

   2. Taylor expanded in i around inf

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

   4. Applied rewrites 73.2%

      \[\leadsto \color{blue}{0.5} \]

   if 0.80000000000000004 < (/.f64 (+.f64 (/.f64 (/.f64 (*.f64 (+.f64 alpha beta) (-.f64 beta alpha)) (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i))) (+.f64 (+.f64 (+.f64 alpha beta) (*.f64 #s(literal 2 binary64) i)) #s(literal 2 binary64))) #s(literal 1 binary64)) #s(literal 2 binary64))

   1. Initial program 36.3%

      \[\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]

   2. Taylor expanded in beta around inf

      \[\leadsto \color{blue}{1} \]
   3. Step-by-step derivation

   4. Applied rewrites 91.2%

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

Alternative 11: 61.6% accurate, 41.7× speedup

Math

\[\begin{array}{l} \\ 0.5 \end{array} \]

FPCore

(FPCore (alpha beta i) :precision binary64 0.5)

C

double code(double alpha, double beta, double i) {
	return 0.5;
}

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(alpha, beta, i)
use fmin_fmax_functions
    real(8), intent (in) :: alpha
    real(8), intent (in) :: beta
    real(8), intent (in) :: i
    code = 0.5d0
end function

Java

public static double code(double alpha, double beta, double i) {
	return 0.5;
}

Python

def code(alpha, beta, i):
	return 0.5

Julia

function code(alpha, beta, i)
	return 0.5
end

MATLAB

function tmp = code(alpha, beta, i)
	tmp = 0.5;
end

Wolfram

code[alpha_, beta_, i_] := 0.5

Derivation

1. Initial program 63.5%

   \[\frac{\frac{\frac{\left(\alpha + \beta\right) \cdot \left(\beta - \alpha\right)}{\left(\alpha + \beta\right) + 2 \cdot i}}{\left(\left(\alpha + \beta\right) + 2 \cdot i\right) + 2} + 1}{2} \]

2. Taylor expanded in i around inf

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

4. Applied rewrites 61.6%

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

Reproduce

herbie shell --seed 2025122 
(FPCore (alpha beta i)
  :name "Octave 3.8, jcobi/2"
  :precision binary64
  :pre (and (and (> alpha -1.0) (> beta -1.0)) (> i 0.0))
  (/ (+ (/ (/ (* (+ alpha beta) (- beta alpha)) (+ (+ alpha beta) (* 2.0 i))) (+ (+ (+ alpha beta) (* 2.0 i)) 2.0)) 1.0) 2.0))