Quotient of sum of exps

Percentage Accurate: 99.1% → 99.1%

Time: 9.4s

Alternatives: 11

Speedup: 1.0×

• could not determine a ground truth

  1. a = 2.1502144469437776e+261
  2. b = -1.3765601635526297e-87

Specification

Math

\[\begin{array}{l} \\ \frac{e^{a}}{e^{a} + e^{b}} \end{array} \]

FPCore

(FPCore (a b) :precision binary64 (/ (exp a) (+ (exp a) (exp b))))

C

double code(double a, double b) {
	return exp(a) / (exp(a) + exp(b));
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = exp(a) / (exp(a) + exp(b))
end function

Java

public static double code(double a, double b) {
	return Math.exp(a) / (Math.exp(a) + Math.exp(b));
}

Python

def code(a, b):
	return math.exp(a) / (math.exp(a) + math.exp(b))

Julia

function code(a, b)
	return Float64(exp(a) / Float64(exp(a) + exp(b)))
end

MATLAB

function tmp = code(a, b)
	tmp = exp(a) / (exp(a) + exp(b));
end

Wolfram

code[a_, b_] := N[(N[Exp[a], $MachinePrecision] / N[(N[Exp[a], $MachinePrecision] + N[Exp[b], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 99.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{e^{a}}{e^{a} + e^{b}} \end{array} \]

FPCore

(FPCore (a b) :precision binary64 (/ (exp a) (+ (exp a) (exp b))))

C

double code(double a, double b) {
	return exp(a) / (exp(a) + exp(b));
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = exp(a) / (exp(a) + exp(b))
end function

Java

public static double code(double a, double b) {
	return Math.exp(a) / (Math.exp(a) + Math.exp(b));
}

Python

def code(a, b):
	return math.exp(a) / (math.exp(a) + math.exp(b))

Julia

function code(a, b)
	return Float64(exp(a) / Float64(exp(a) + exp(b)))
end

MATLAB

function tmp = code(a, b)
	tmp = exp(a) / (exp(a) + exp(b));
end

Wolfram

code[a_, b_] := N[(N[Exp[a], $MachinePrecision] / N[(N[Exp[a], $MachinePrecision] + N[Exp[b], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{e^{a}}{e^{a} + e^{b}} \end{array} \]

FPCore

(FPCore (a b) :precision binary64 (/ (exp a) (+ (exp a) (exp b))))

C

double code(double a, double b) {
	return exp(a) / (exp(a) + exp(b));
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = exp(a) / (exp(a) + exp(b))
end function

Java

public static double code(double a, double b) {
	return Math.exp(a) / (Math.exp(a) + Math.exp(b));
}

Python

def code(a, b):
	return math.exp(a) / (math.exp(a) + math.exp(b))

Julia

function code(a, b)
	return Float64(exp(a) / Float64(exp(a) + exp(b)))
end

MATLAB

function tmp = code(a, b)
	tmp = exp(a) / (exp(a) + exp(b));
end

Wolfram

code[a_, b_] := N[(N[Exp[a], $MachinePrecision] / N[(N[Exp[a], $MachinePrecision] + N[Exp[b], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.2%

   \[\frac{e^{a}}{e^{a} + e^{b}} \]
2. Add Preprocessing
3. Add Preprocessing

Alternative 2: 98.7% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;e^{a} \leq 0:\\ \;\;\;\;\frac{e^{a}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{e^{b} + 1}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= (exp a) 0.0) (/ (exp a) 2.0) (/ 1.0 (+ (exp b) 1.0))))

C

double code(double a, double b) {
	double tmp;
	if (exp(a) <= 0.0) {
		tmp = exp(a) / 2.0;
	} else {
		tmp = 1.0 / (exp(b) + 1.0);
	}
	return tmp;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (exp(a) <= 0.0d0) then
        tmp = exp(a) / 2.0d0
    else
        tmp = 1.0d0 / (exp(b) + 1.0d0)
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double tmp;
	if (Math.exp(a) <= 0.0) {
		tmp = Math.exp(a) / 2.0;
	} else {
		tmp = 1.0 / (Math.exp(b) + 1.0);
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if math.exp(a) <= 0.0:
		tmp = math.exp(a) / 2.0
	else:
		tmp = 1.0 / (math.exp(b) + 1.0)
	return tmp

Julia

function code(a, b)
	tmp = 0.0
	if (exp(a) <= 0.0)
		tmp = Float64(exp(a) / 2.0);
	else
		tmp = Float64(1.0 / Float64(exp(b) + 1.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	tmp = 0.0;
	if (exp(a) <= 0.0)
		tmp = exp(a) / 2.0;
	else
		tmp = 1.0 / (exp(b) + 1.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := If[LessEqual[N[Exp[a], $MachinePrecision], 0.0], N[(N[Exp[a], $MachinePrecision] / 2.0), $MachinePrecision], N[(1.0 / N[(N[Exp[b], $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (exp.f64 a) < 0.0

   1. Initial program 97.5%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in b around 0

      \[\leadsto \mathsf{/.f64}\left(\mathsf{exp.f64}\left(a\right), \mathsf{+.f64}\left(\mathsf{exp.f64}\left(a\right), \color{blue}{1}\right)\right) \]
   4. Step-by-step derivation

   5. Simplified 98.8%

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]

   6. Taylor expanded in a around 0

      \[\leadsto \mathsf{/.f64}\left(\mathsf{exp.f64}\left(a\right), \color{blue}{2}\right) \]
   7. Step-by-step derivation

   8. Simplified 98.8%

      \[\leadsto \frac{e^{a}}{\color{blue}{2}} \]

   if 0.0 < (exp.f64 a)

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b}}} \]
   4. Step-by-step derivation

      1. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \color{blue}{\left(1 + e^{b}\right)}\right) \]

      2. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(1, \color{blue}{\left(e^{b}\right)}\right)\right) \]

      3. exp-lowering-exp.f64 98.6%

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(1, \mathsf{exp.f64}\left(b\right)\right)\right) \]

   5. Simplified 98.6%

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b}}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;e^{a} \leq 0:\\ \;\;\;\;\frac{e^{a}}{2}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{e^{b} + 1}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 79.7% accurate, 2.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := b \cdot \left(0.5 + b \cdot 0.16666666666666666\right)\\ t_1 := b \cdot \left(-1 - t\_0\right)\\ \mathbf{if}\;b \leq 9.5 \cdot 10^{+33}:\\ \;\;\;\;\frac{e^{a}}{2}\\ \mathbf{elif}\;b \leq 10^{+103}:\\ \;\;\;\;\frac{2 + t\_1}{4 + \left(b \cdot \left(1 + t\_0\right)\right) \cdot t\_1}\\ \mathbf{else}:\\ \;\;\;\;\frac{6}{b \cdot \left(b \cdot b\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (let* ((t_0 (* b (+ 0.5 (* b 0.16666666666666666)))) (t_1 (* b (- -1.0 t_0))))
   (if (<= b 9.5e+33)
     (/ (exp a) 2.0)
     (if (<= b 1e+103)
       (/ (+ 2.0 t_1) (+ 4.0 (* (* b (+ 1.0 t_0)) t_1)))
       (/ 6.0 (* b (* b b)))))))

C

double code(double a, double b) {
	double t_0 = b * (0.5 + (b * 0.16666666666666666));
	double t_1 = b * (-1.0 - t_0);
	double tmp;
	if (b <= 9.5e+33) {
		tmp = exp(a) / 2.0;
	} else if (b <= 1e+103) {
		tmp = (2.0 + t_1) / (4.0 + ((b * (1.0 + t_0)) * t_1));
	} else {
		tmp = 6.0 / (b * (b * b));
	}
	return tmp;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = b * (0.5d0 + (b * 0.16666666666666666d0))
    t_1 = b * ((-1.0d0) - t_0)
    if (b <= 9.5d+33) then
        tmp = exp(a) / 2.0d0
    else if (b <= 1d+103) then
        tmp = (2.0d0 + t_1) / (4.0d0 + ((b * (1.0d0 + t_0)) * t_1))
    else
        tmp = 6.0d0 / (b * (b * b))
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double t_0 = b * (0.5 + (b * 0.16666666666666666));
	double t_1 = b * (-1.0 - t_0);
	double tmp;
	if (b <= 9.5e+33) {
		tmp = Math.exp(a) / 2.0;
	} else if (b <= 1e+103) {
		tmp = (2.0 + t_1) / (4.0 + ((b * (1.0 + t_0)) * t_1));
	} else {
		tmp = 6.0 / (b * (b * b));
	}
	return tmp;
}

Python

def code(a, b):
	t_0 = b * (0.5 + (b * 0.16666666666666666))
	t_1 = b * (-1.0 - t_0)
	tmp = 0
	if b <= 9.5e+33:
		tmp = math.exp(a) / 2.0
	elif b <= 1e+103:
		tmp = (2.0 + t_1) / (4.0 + ((b * (1.0 + t_0)) * t_1))
	else:
		tmp = 6.0 / (b * (b * b))
	return tmp

Julia

function code(a, b)
	t_0 = Float64(b * Float64(0.5 + Float64(b * 0.16666666666666666)))
	t_1 = Float64(b * Float64(-1.0 - t_0))
	tmp = 0.0
	if (b <= 9.5e+33)
		tmp = Float64(exp(a) / 2.0);
	elseif (b <= 1e+103)
		tmp = Float64(Float64(2.0 + t_1) / Float64(4.0 + Float64(Float64(b * Float64(1.0 + t_0)) * t_1)));
	else
		tmp = Float64(6.0 / Float64(b * Float64(b * b)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	t_0 = b * (0.5 + (b * 0.16666666666666666));
	t_1 = b * (-1.0 - t_0);
	tmp = 0.0;
	if (b <= 9.5e+33)
		tmp = exp(a) / 2.0;
	elseif (b <= 1e+103)
		tmp = (2.0 + t_1) / (4.0 + ((b * (1.0 + t_0)) * t_1));
	else
		tmp = 6.0 / (b * (b * b));
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := Block[{t$95$0 = N[(b * N[(0.5 + N[(b * 0.16666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(b * N[(-1.0 - t$95$0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, 9.5e+33], N[(N[Exp[a], $MachinePrecision] / 2.0), $MachinePrecision], If[LessEqual[b, 1e+103], N[(N[(2.0 + t$95$1), $MachinePrecision] / N[(4.0 + N[(N[(b * N[(1.0 + t$95$0), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(6.0 / N[(b * N[(b * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if b < 9.5000000000000003e33

   1. Initial program 99.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in b around 0

      \[\leadsto \mathsf{/.f64}\left(\mathsf{exp.f64}\left(a\right), \mathsf{+.f64}\left(\mathsf{exp.f64}\left(a\right), \color{blue}{1}\right)\right) \]
   4. Step-by-step derivation

   5. Simplified 75.7%

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]

   6. Taylor expanded in a around 0

      \[\leadsto \mathsf{/.f64}\left(\mathsf{exp.f64}\left(a\right), \color{blue}{2}\right) \]
   7. Step-by-step derivation

   8. Simplified 74.4%

      \[\leadsto \frac{e^{a}}{\color{blue}{2}} \]

   if 9.5000000000000003e33 < b < 1e103

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b}}} \]
   4. Step-by-step derivation

      1. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \color{blue}{\left(1 + e^{b}\right)}\right) \]

      2. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(1, \color{blue}{\left(e^{b}\right)}\right)\right) \]

      3. exp-lowering-exp.f64 100.0%

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(1, \mathsf{exp.f64}\left(b\right)\right)\right) \]

   5. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b}}} \]

   6. Taylor expanded in b around 0

      \[\leadsto \mathsf{/.f64}\left(1, \color{blue}{\left(2 + b \cdot \left(1 + b \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot b\right)\right)\right)}\right) \]
   7. Step-by-step derivation

      1. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \color{blue}{\left(b \cdot \left(1 + b \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot b\right)\right)\right)}\right)\right) \]

      2. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \color{blue}{\left(1 + b \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot b\right)\right)}\right)\right)\right) \]

      3. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \color{blue}{\left(b \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot b\right)\right)}\right)\right)\right)\right) \]

      4. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \color{blue}{\left(\frac{1}{2} + \frac{1}{6} \cdot b\right)}\right)\right)\right)\right)\right) \]

      5. metadata-eval N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \left(\left(\frac{1}{2} - 0\right) + \color{blue}{\frac{1}{6}} \cdot b\right)\right)\right)\right)\right)\right) \]

      6. associate--r- N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \left(\frac{1}{2} - \color{blue}{\left(0 - \frac{1}{6} \cdot b\right)}\right)\right)\right)\right)\right)\right) \]

      7. neg-sub0 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \left(\frac{1}{2} - \left(\mathsf{neg}\left(\frac{1}{6} \cdot b\right)\right)\right)\right)\right)\right)\right)\right) \]

      8. --lowering--.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \mathsf{\_.f64}\left(\frac{1}{2}, \color{blue}{\left(\mathsf{neg}\left(\frac{1}{6} \cdot b\right)\right)}\right)\right)\right)\right)\right)\right) \]

      9. *-commutative N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \mathsf{\_.f64}\left(\frac{1}{2}, \left(\mathsf{neg}\left(b \cdot \frac{1}{6}\right)\right)\right)\right)\right)\right)\right)\right) \]

      10. distribute-rgt-neg-in N/A

          \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \mathsf{\_.f64}\left(\frac{1}{2}, \left(b \cdot \color{blue}{\left(\mathsf{neg}\left(\frac{1}{6}\right)\right)}\right)\right)\right)\right)\right)\right)\right) \]

      11. *-lowering-*.f64 N/A

          \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \mathsf{\_.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(b, \color{blue}{\left(\mathsf{neg}\left(\frac{1}{6}\right)\right)}\right)\right)\right)\right)\right)\right)\right) \]

      12. metadata-eval 6.0%

          \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \mathsf{\_.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(b, \frac{-1}{6}\right)\right)\right)\right)\right)\right)\right) \]

   8. Simplified 6.0%

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

      1. flip-+ N/A

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

      2. clear-num N/A

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

      3. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\left(2 - b \cdot \left(1 + b \cdot \left(\frac{1}{2} - b \cdot \frac{-1}{6}\right)\right)\right), \color{blue}{\left(2 \cdot 2 - \left(b \cdot \left(1 + b \cdot \left(\frac{1}{2} - b \cdot \frac{-1}{6}\right)\right)\right) \cdot \left(b \cdot \left(1 + b \cdot \left(\frac{1}{2} - b \cdot \frac{-1}{6}\right)\right)\right)\right)}\right) \]

   10. Applied egg-rr 92.0%

       \[\leadsto \color{blue}{\frac{2 - b \cdot \left(1 + b \cdot \left(0.5 + b \cdot 0.16666666666666666\right)\right)}{4 - \left(b \cdot \left(1 + b \cdot \left(0.5 + b \cdot 0.16666666666666666\right)\right)\right) \cdot \left(b \cdot \left(1 + b \cdot \left(0.5 + b \cdot 0.16666666666666666\right)\right)\right)}} \]

   if 1e103 < b

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b}}} \]
   4. Step-by-step derivation

      1. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \color{blue}{\left(1 + e^{b}\right)}\right) \]

      2. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(1, \color{blue}{\left(e^{b}\right)}\right)\right) \]

      3. exp-lowering-exp.f64 100.0%

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(1, \mathsf{exp.f64}\left(b\right)\right)\right) \]

   5. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b}}} \]

   6. Taylor expanded in b around 0

      \[\leadsto \mathsf{/.f64}\left(1, \color{blue}{\left(2 + b \cdot \left(1 + b \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot b\right)\right)\right)}\right) \]
   7. Step-by-step derivation

      1. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \color{blue}{\left(b \cdot \left(1 + b \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot b\right)\right)\right)}\right)\right) \]

      2. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \color{blue}{\left(1 + b \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot b\right)\right)}\right)\right)\right) \]

      3. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \color{blue}{\left(b \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot b\right)\right)}\right)\right)\right)\right) \]

      4. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \color{blue}{\left(\frac{1}{2} + \frac{1}{6} \cdot b\right)}\right)\right)\right)\right)\right) \]

      5. metadata-eval N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \left(\left(\frac{1}{2} - 0\right) + \color{blue}{\frac{1}{6}} \cdot b\right)\right)\right)\right)\right)\right) \]

      6. associate--r- N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \left(\frac{1}{2} - \color{blue}{\left(0 - \frac{1}{6} \cdot b\right)}\right)\right)\right)\right)\right)\right) \]

      7. neg-sub0 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \left(\frac{1}{2} - \left(\mathsf{neg}\left(\frac{1}{6} \cdot b\right)\right)\right)\right)\right)\right)\right)\right) \]

      8. --lowering--.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \mathsf{\_.f64}\left(\frac{1}{2}, \color{blue}{\left(\mathsf{neg}\left(\frac{1}{6} \cdot b\right)\right)}\right)\right)\right)\right)\right)\right) \]

      9. *-commutative N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \mathsf{\_.f64}\left(\frac{1}{2}, \left(\mathsf{neg}\left(b \cdot \frac{1}{6}\right)\right)\right)\right)\right)\right)\right)\right) \]

      10. distribute-rgt-neg-in N/A

          \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \mathsf{\_.f64}\left(\frac{1}{2}, \left(b \cdot \color{blue}{\left(\mathsf{neg}\left(\frac{1}{6}\right)\right)}\right)\right)\right)\right)\right)\right)\right) \]

      11. *-lowering-*.f64 N/A

          \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \mathsf{\_.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(b, \color{blue}{\left(\mathsf{neg}\left(\frac{1}{6}\right)\right)}\right)\right)\right)\right)\right)\right)\right) \]

      12. metadata-eval 100.0%

          \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \mathsf{\_.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(b, \frac{-1}{6}\right)\right)\right)\right)\right)\right)\right) \]

   8. Simplified 100.0%

      \[\leadsto \frac{1}{\color{blue}{2 + b \cdot \left(1 + b \cdot \left(0.5 - b \cdot -0.16666666666666666\right)\right)}} \]

   9. Taylor expanded in b around inf

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

       1. /-lowering-/.f64 N/A

          \[\leadsto \mathsf{/.f64}\left(6, \color{blue}{\left({b}^{3}\right)}\right) \]

       2. cube-mult N/A

          \[\leadsto \mathsf{/.f64}\left(6, \left(b \cdot \color{blue}{\left(b \cdot b\right)}\right)\right) \]

       3. unpow2 N/A

          \[\leadsto \mathsf{/.f64}\left(6, \left(b \cdot {b}^{\color{blue}{2}}\right)\right) \]

       4. *-lowering-*.f64 N/A

          \[\leadsto \mathsf{/.f64}\left(6, \mathsf{*.f64}\left(b, \color{blue}{\left({b}^{2}\right)}\right)\right) \]

       5. unpow2 N/A

          \[\leadsto \mathsf{/.f64}\left(6, \mathsf{*.f64}\left(b, \left(b \cdot \color{blue}{b}\right)\right)\right) \]

       6. *-lowering-*.f64 100.0%

          \[\leadsto \mathsf{/.f64}\left(6, \mathsf{*.f64}\left(b, \mathsf{*.f64}\left(b, \color{blue}{b}\right)\right)\right) \]

   11. Simplified 100.0%

       \[\leadsto \color{blue}{\frac{6}{b \cdot \left(b \cdot b\right)}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 80.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq 9.5 \cdot 10^{+33}:\\ \;\;\;\;\frac{e^{a}}{2}\\ \mathbf{elif}\;b \leq 10^{+103}:\\ \;\;\;\;\frac{2 + b \cdot \left(-1 - b \cdot \left(0.5 + b \cdot 0.16666666666666666\right)\right)}{4 + \left(b \cdot \left(1 + b \cdot \left(0.5 + b \cdot 0.16666666666666666\right)\right)\right) \cdot \left(b \cdot \left(-1 - b \cdot \left(0.5 + b \cdot 0.16666666666666666\right)\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{6}{b \cdot \left(b \cdot b\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 66.5% accurate, 10.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -360:\\ \;\;\;\;\frac{1}{b \cdot \left(b \cdot \left(b \cdot \left(0.16666666666666666 + \frac{\frac{1}{b} + \left(0.5 + \frac{2}{b \cdot b}\right)}{b}\right)\right)\right)}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{2 + b \cdot \left(1 + b \cdot \left(0.5 - b \cdot -0.16666666666666666\right)\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= a -360.0)
   (/
    1.0
    (*
     b
     (*
      b
      (*
       b
       (+ 0.16666666666666666 (/ (+ (/ 1.0 b) (+ 0.5 (/ 2.0 (* b b)))) b))))))
   (/ 1.0 (+ 2.0 (* b (+ 1.0 (* b (- 0.5 (* b -0.16666666666666666)))))))))

C

double code(double a, double b) {
	double tmp;
	if (a <= -360.0) {
		tmp = 1.0 / (b * (b * (b * (0.16666666666666666 + (((1.0 / b) + (0.5 + (2.0 / (b * b)))) / b)))));
	} else {
		tmp = 1.0 / (2.0 + (b * (1.0 + (b * (0.5 - (b * -0.16666666666666666))))));
	}
	return tmp;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (a <= (-360.0d0)) then
        tmp = 1.0d0 / (b * (b * (b * (0.16666666666666666d0 + (((1.0d0 / b) + (0.5d0 + (2.0d0 / (b * b)))) / b)))))
    else
        tmp = 1.0d0 / (2.0d0 + (b * (1.0d0 + (b * (0.5d0 - (b * (-0.16666666666666666d0)))))))
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double tmp;
	if (a <= -360.0) {
		tmp = 1.0 / (b * (b * (b * (0.16666666666666666 + (((1.0 / b) + (0.5 + (2.0 / (b * b)))) / b)))));
	} else {
		tmp = 1.0 / (2.0 + (b * (1.0 + (b * (0.5 - (b * -0.16666666666666666))))));
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if a <= -360.0:
		tmp = 1.0 / (b * (b * (b * (0.16666666666666666 + (((1.0 / b) + (0.5 + (2.0 / (b * b)))) / b)))))
	else:
		tmp = 1.0 / (2.0 + (b * (1.0 + (b * (0.5 - (b * -0.16666666666666666))))))
	return tmp

Julia

function code(a, b)
	tmp = 0.0
	if (a <= -360.0)
		tmp = Float64(1.0 / Float64(b * Float64(b * Float64(b * Float64(0.16666666666666666 + Float64(Float64(Float64(1.0 / b) + Float64(0.5 + Float64(2.0 / Float64(b * b)))) / b))))));
	else
		tmp = Float64(1.0 / Float64(2.0 + Float64(b * Float64(1.0 + Float64(b * Float64(0.5 - Float64(b * -0.16666666666666666)))))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	tmp = 0.0;
	if (a <= -360.0)
		tmp = 1.0 / (b * (b * (b * (0.16666666666666666 + (((1.0 / b) + (0.5 + (2.0 / (b * b)))) / b)))));
	else
		tmp = 1.0 / (2.0 + (b * (1.0 + (b * (0.5 - (b * -0.16666666666666666))))));
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := If[LessEqual[a, -360.0], N[(1.0 / N[(b * N[(b * N[(b * N[(0.16666666666666666 + N[(N[(N[(1.0 / b), $MachinePrecision] + N[(0.5 + N[(2.0 / N[(b * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(2.0 + N[(b * N[(1.0 + N[(b * N[(0.5 - N[(b * -0.16666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < -360

   1. Initial program 97.5%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b}}} \]
   4. Step-by-step derivation

      1. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \color{blue}{\left(1 + e^{b}\right)}\right) \]

      2. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(1, \color{blue}{\left(e^{b}\right)}\right)\right) \]

      3. exp-lowering-exp.f64 35.0%

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(1, \mathsf{exp.f64}\left(b\right)\right)\right) \]

   5. Simplified 35.0%

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b}}} \]

   6. Taylor expanded in b around 0

      \[\leadsto \mathsf{/.f64}\left(1, \color{blue}{\left(2 + b \cdot \left(1 + b \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot b\right)\right)\right)}\right) \]
   7. Step-by-step derivation

      1. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \color{blue}{\left(b \cdot \left(1 + b \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot b\right)\right)\right)}\right)\right) \]

      2. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \color{blue}{\left(1 + b \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot b\right)\right)}\right)\right)\right) \]

      3. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \color{blue}{\left(b \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot b\right)\right)}\right)\right)\right)\right) \]

      4. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \color{blue}{\left(\frac{1}{2} + \frac{1}{6} \cdot b\right)}\right)\right)\right)\right)\right) \]

      5. metadata-eval N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \left(\left(\frac{1}{2} - 0\right) + \color{blue}{\frac{1}{6}} \cdot b\right)\right)\right)\right)\right)\right) \]

      6. associate--r- N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \left(\frac{1}{2} - \color{blue}{\left(0 - \frac{1}{6} \cdot b\right)}\right)\right)\right)\right)\right)\right) \]

      7. neg-sub0 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \left(\frac{1}{2} - \left(\mathsf{neg}\left(\frac{1}{6} \cdot b\right)\right)\right)\right)\right)\right)\right)\right) \]

      8. --lowering--.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \mathsf{\_.f64}\left(\frac{1}{2}, \color{blue}{\left(\mathsf{neg}\left(\frac{1}{6} \cdot b\right)\right)}\right)\right)\right)\right)\right)\right) \]

      9. *-commutative N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \mathsf{\_.f64}\left(\frac{1}{2}, \left(\mathsf{neg}\left(b \cdot \frac{1}{6}\right)\right)\right)\right)\right)\right)\right)\right) \]

      10. distribute-rgt-neg-in N/A

          \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \mathsf{\_.f64}\left(\frac{1}{2}, \left(b \cdot \color{blue}{\left(\mathsf{neg}\left(\frac{1}{6}\right)\right)}\right)\right)\right)\right)\right)\right)\right) \]

      11. *-lowering-*.f64 N/A

          \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \mathsf{\_.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(b, \color{blue}{\left(\mathsf{neg}\left(\frac{1}{6}\right)\right)}\right)\right)\right)\right)\right)\right)\right) \]

      12. metadata-eval 21.8%

          \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \mathsf{\_.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(b, \frac{-1}{6}\right)\right)\right)\right)\right)\right)\right) \]

   8. Simplified 21.8%

      \[\leadsto \frac{1}{\color{blue}{2 + b \cdot \left(1 + b \cdot \left(0.5 - b \cdot -0.16666666666666666\right)\right)}} \]

   9. Taylor expanded in b around -inf

      \[\leadsto \mathsf{/.f64}\left(1, \color{blue}{\left(-1 \cdot \left({b}^{3} \cdot \left(-1 \cdot \frac{\frac{1}{2} + \left(\frac{1}{b} + \frac{2}{{b}^{2}}\right)}{b} - \frac{1}{6}\right)\right)\right)}\right) \]
   10. Step-by-step derivation

       1. mul-1-neg N/A

          \[\leadsto \mathsf{/.f64}\left(1, \left(\mathsf{neg}\left({b}^{3} \cdot \left(-1 \cdot \frac{\frac{1}{2} + \left(\frac{1}{b} + \frac{2}{{b}^{2}}\right)}{b} - \frac{1}{6}\right)\right)\right)\right) \]

       2. cube-mult N/A

          \[\leadsto \mathsf{/.f64}\left(1, \left(\mathsf{neg}\left(\left(b \cdot \left(b \cdot b\right)\right) \cdot \left(-1 \cdot \frac{\frac{1}{2} + \left(\frac{1}{b} + \frac{2}{{b}^{2}}\right)}{b} - \frac{1}{6}\right)\right)\right)\right) \]

       3. unpow2 N/A

          \[\leadsto \mathsf{/.f64}\left(1, \left(\mathsf{neg}\left(\left(b \cdot {b}^{2}\right) \cdot \left(-1 \cdot \frac{\frac{1}{2} + \left(\frac{1}{b} + \frac{2}{{b}^{2}}\right)}{b} - \frac{1}{6}\right)\right)\right)\right) \]

       4. associate-*l* N/A

          \[\leadsto \mathsf{/.f64}\left(1, \left(\mathsf{neg}\left(b \cdot \left({b}^{2} \cdot \left(-1 \cdot \frac{\frac{1}{2} + \left(\frac{1}{b} + \frac{2}{{b}^{2}}\right)}{b} - \frac{1}{6}\right)\right)\right)\right)\right) \]

       5. distribute-rgt-neg-in N/A

          \[\leadsto \mathsf{/.f64}\left(1, \left(b \cdot \color{blue}{\left(\mathsf{neg}\left({b}^{2} \cdot \left(-1 \cdot \frac{\frac{1}{2} + \left(\frac{1}{b} + \frac{2}{{b}^{2}}\right)}{b} - \frac{1}{6}\right)\right)\right)}\right)\right) \]

       6. *-lowering-*.f64 N/A

          \[\leadsto \mathsf{/.f64}\left(1, \mathsf{*.f64}\left(b, \color{blue}{\left(\mathsf{neg}\left({b}^{2} \cdot \left(-1 \cdot \frac{\frac{1}{2} + \left(\frac{1}{b} + \frac{2}{{b}^{2}}\right)}{b} - \frac{1}{6}\right)\right)\right)}\right)\right) \]

       7. unpow2 N/A

          \[\leadsto \mathsf{/.f64}\left(1, \mathsf{*.f64}\left(b, \left(\mathsf{neg}\left(\left(b \cdot b\right) \cdot \left(-1 \cdot \frac{\frac{1}{2} + \left(\frac{1}{b} + \frac{2}{{b}^{2}}\right)}{b} - \frac{1}{6}\right)\right)\right)\right)\right) \]

       8. associate-*l* N/A

          \[\leadsto \mathsf{/.f64}\left(1, \mathsf{*.f64}\left(b, \left(\mathsf{neg}\left(b \cdot \left(b \cdot \left(-1 \cdot \frac{\frac{1}{2} + \left(\frac{1}{b} + \frac{2}{{b}^{2}}\right)}{b} - \frac{1}{6}\right)\right)\right)\right)\right)\right) \]

       9. *-commutative N/A

          \[\leadsto \mathsf{/.f64}\left(1, \mathsf{*.f64}\left(b, \left(\mathsf{neg}\left(b \cdot \left(\left(-1 \cdot \frac{\frac{1}{2} + \left(\frac{1}{b} + \frac{2}{{b}^{2}}\right)}{b} - \frac{1}{6}\right) \cdot b\right)\right)\right)\right)\right) \]

       10. distribute-rgt-neg-in N/A

           \[\leadsto \mathsf{/.f64}\left(1, \mathsf{*.f64}\left(b, \left(b \cdot \color{blue}{\left(\mathsf{neg}\left(\left(-1 \cdot \frac{\frac{1}{2} + \left(\frac{1}{b} + \frac{2}{{b}^{2}}\right)}{b} - \frac{1}{6}\right) \cdot b\right)\right)}\right)\right)\right) \]

   11. Simplified 63.5%

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

   if -360 < a

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b}}} \]
   4. Step-by-step derivation

      1. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \color{blue}{\left(1 + e^{b}\right)}\right) \]

      2. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(1, \color{blue}{\left(e^{b}\right)}\right)\right) \]

      3. exp-lowering-exp.f64 98.6%

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(1, \mathsf{exp.f64}\left(b\right)\right)\right) \]

   5. Simplified 98.6%

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b}}} \]

   6. Taylor expanded in b around 0

      \[\leadsto \mathsf{/.f64}\left(1, \color{blue}{\left(2 + b \cdot \left(1 + b \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot b\right)\right)\right)}\right) \]
   7. Step-by-step derivation

      1. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \color{blue}{\left(b \cdot \left(1 + b \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot b\right)\right)\right)}\right)\right) \]

      2. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \color{blue}{\left(1 + b \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot b\right)\right)}\right)\right)\right) \]

      3. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \color{blue}{\left(b \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot b\right)\right)}\right)\right)\right)\right) \]

      4. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \color{blue}{\left(\frac{1}{2} + \frac{1}{6} \cdot b\right)}\right)\right)\right)\right)\right) \]

      5. metadata-eval N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \left(\left(\frac{1}{2} - 0\right) + \color{blue}{\frac{1}{6}} \cdot b\right)\right)\right)\right)\right)\right) \]

      6. associate--r- N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \left(\frac{1}{2} - \color{blue}{\left(0 - \frac{1}{6} \cdot b\right)}\right)\right)\right)\right)\right)\right) \]

      7. neg-sub0 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \left(\frac{1}{2} - \left(\mathsf{neg}\left(\frac{1}{6} \cdot b\right)\right)\right)\right)\right)\right)\right)\right) \]

      8. --lowering--.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \mathsf{\_.f64}\left(\frac{1}{2}, \color{blue}{\left(\mathsf{neg}\left(\frac{1}{6} \cdot b\right)\right)}\right)\right)\right)\right)\right)\right) \]

      9. *-commutative N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \mathsf{\_.f64}\left(\frac{1}{2}, \left(\mathsf{neg}\left(b \cdot \frac{1}{6}\right)\right)\right)\right)\right)\right)\right)\right) \]

      10. distribute-rgt-neg-in N/A

          \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \mathsf{\_.f64}\left(\frac{1}{2}, \left(b \cdot \color{blue}{\left(\mathsf{neg}\left(\frac{1}{6}\right)\right)}\right)\right)\right)\right)\right)\right)\right) \]

      11. *-lowering-*.f64 N/A

          \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \mathsf{\_.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(b, \color{blue}{\left(\mathsf{neg}\left(\frac{1}{6}\right)\right)}\right)\right)\right)\right)\right)\right)\right) \]

      12. metadata-eval 65.1%

          \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \mathsf{\_.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(b, \frac{-1}{6}\right)\right)\right)\right)\right)\right)\right) \]

   8. Simplified 65.1%

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

Alternative 5: 60.5% accurate, 12.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 2.6 \cdot 10^{-11}:\\ \;\;\;\;0.5 + a \cdot \left(0.25 + -0.020833333333333332 \cdot \left(a \cdot a\right)\right)\\ \mathbf{elif}\;b \leq 4.3 \cdot 10^{+89}:\\ \;\;\;\;-0.020833333333333332 \cdot \left(a \cdot \left(a \cdot a\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{2 + b \cdot \left(1 + b \cdot \left(0.5 - b \cdot -0.16666666666666666\right)\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= b 2.6e-11)
   (+ 0.5 (* a (+ 0.25 (* -0.020833333333333332 (* a a)))))
   (if (<= b 4.3e+89)
     (* -0.020833333333333332 (* a (* a a)))
     (/ 1.0 (+ 2.0 (* b (+ 1.0 (* b (- 0.5 (* b -0.16666666666666666))))))))))

C

double code(double a, double b) {
	double tmp;
	if (b <= 2.6e-11) {
		tmp = 0.5 + (a * (0.25 + (-0.020833333333333332 * (a * a))));
	} else if (b <= 4.3e+89) {
		tmp = -0.020833333333333332 * (a * (a * a));
	} else {
		tmp = 1.0 / (2.0 + (b * (1.0 + (b * (0.5 - (b * -0.16666666666666666))))));
	}
	return tmp;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (b <= 2.6d-11) then
        tmp = 0.5d0 + (a * (0.25d0 + ((-0.020833333333333332d0) * (a * a))))
    else if (b <= 4.3d+89) then
        tmp = (-0.020833333333333332d0) * (a * (a * a))
    else
        tmp = 1.0d0 / (2.0d0 + (b * (1.0d0 + (b * (0.5d0 - (b * (-0.16666666666666666d0)))))))
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double tmp;
	if (b <= 2.6e-11) {
		tmp = 0.5 + (a * (0.25 + (-0.020833333333333332 * (a * a))));
	} else if (b <= 4.3e+89) {
		tmp = -0.020833333333333332 * (a * (a * a));
	} else {
		tmp = 1.0 / (2.0 + (b * (1.0 + (b * (0.5 - (b * -0.16666666666666666))))));
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if b <= 2.6e-11:
		tmp = 0.5 + (a * (0.25 + (-0.020833333333333332 * (a * a))))
	elif b <= 4.3e+89:
		tmp = -0.020833333333333332 * (a * (a * a))
	else:
		tmp = 1.0 / (2.0 + (b * (1.0 + (b * (0.5 - (b * -0.16666666666666666))))))
	return tmp

Julia

function code(a, b)
	tmp = 0.0
	if (b <= 2.6e-11)
		tmp = Float64(0.5 + Float64(a * Float64(0.25 + Float64(-0.020833333333333332 * Float64(a * a)))));
	elseif (b <= 4.3e+89)
		tmp = Float64(-0.020833333333333332 * Float64(a * Float64(a * a)));
	else
		tmp = Float64(1.0 / Float64(2.0 + Float64(b * Float64(1.0 + Float64(b * Float64(0.5 - Float64(b * -0.16666666666666666)))))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	tmp = 0.0;
	if (b <= 2.6e-11)
		tmp = 0.5 + (a * (0.25 + (-0.020833333333333332 * (a * a))));
	elseif (b <= 4.3e+89)
		tmp = -0.020833333333333332 * (a * (a * a));
	else
		tmp = 1.0 / (2.0 + (b * (1.0 + (b * (0.5 - (b * -0.16666666666666666))))));
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := If[LessEqual[b, 2.6e-11], N[(0.5 + N[(a * N[(0.25 + N[(-0.020833333333333332 * N[(a * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 4.3e+89], N[(-0.020833333333333332 * N[(a * N[(a * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(2.0 + N[(b * N[(1.0 + N[(b * N[(0.5 - N[(b * -0.16666666666666666), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < 2.6000000000000001e-11

   1. Initial program 98.9%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in b around 0

      \[\leadsto \mathsf{/.f64}\left(\mathsf{exp.f64}\left(a\right), \mathsf{+.f64}\left(\mathsf{exp.f64}\left(a\right), \color{blue}{1}\right)\right) \]
   4. Step-by-step derivation

   5. Simplified 77.5%

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]

   6. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\frac{1}{2} + a \cdot \left(\frac{1}{4} + \frac{-1}{48} \cdot {a}^{2}\right)} \]
   7. Step-by-step derivation

      1. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \color{blue}{\left(a \cdot \left(\frac{1}{4} + \frac{-1}{48} \cdot {a}^{2}\right)\right)}\right) \]

      2. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(a, \color{blue}{\left(\frac{1}{4} + \frac{-1}{48} \cdot {a}^{2}\right)}\right)\right) \]

      3. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(\frac{1}{4}, \color{blue}{\left(\frac{-1}{48} \cdot {a}^{2}\right)}\right)\right)\right) \]

      4. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(\frac{1}{4}, \mathsf{*.f64}\left(\frac{-1}{48}, \color{blue}{\left({a}^{2}\right)}\right)\right)\right)\right) \]

      5. unpow2 N/A

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(\frac{1}{4}, \mathsf{*.f64}\left(\frac{-1}{48}, \left(a \cdot \color{blue}{a}\right)\right)\right)\right)\right) \]

      6. *-lowering-*.f64 49.4%

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(\frac{1}{4}, \mathsf{*.f64}\left(\frac{-1}{48}, \mathsf{*.f64}\left(a, \color{blue}{a}\right)\right)\right)\right)\right) \]

   8. Simplified 49.4%

      \[\leadsto \color{blue}{0.5 + a \cdot \left(0.25 + -0.020833333333333332 \cdot \left(a \cdot a\right)\right)} \]

   if 2.6000000000000001e-11 < b < 4.3000000000000002e89

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in b around 0

      \[\leadsto \mathsf{/.f64}\left(\mathsf{exp.f64}\left(a\right), \mathsf{+.f64}\left(\mathsf{exp.f64}\left(a\right), \color{blue}{1}\right)\right) \]
   4. Step-by-step derivation

   5. Simplified 45.8%

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]

   6. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\frac{1}{2} + a \cdot \left(\frac{1}{4} + \frac{-1}{48} \cdot {a}^{2}\right)} \]
   7. Step-by-step derivation

      1. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \color{blue}{\left(a \cdot \left(\frac{1}{4} + \frac{-1}{48} \cdot {a}^{2}\right)\right)}\right) \]

      2. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(a, \color{blue}{\left(\frac{1}{4} + \frac{-1}{48} \cdot {a}^{2}\right)}\right)\right) \]

      3. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(\frac{1}{4}, \color{blue}{\left(\frac{-1}{48} \cdot {a}^{2}\right)}\right)\right)\right) \]

      4. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(\frac{1}{4}, \mathsf{*.f64}\left(\frac{-1}{48}, \color{blue}{\left({a}^{2}\right)}\right)\right)\right)\right) \]

      5. unpow2 N/A

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(\frac{1}{4}, \mathsf{*.f64}\left(\frac{-1}{48}, \left(a \cdot \color{blue}{a}\right)\right)\right)\right)\right) \]

      6. *-lowering-*.f64 2.7%

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(\frac{1}{4}, \mathsf{*.f64}\left(\frac{-1}{48}, \mathsf{*.f64}\left(a, \color{blue}{a}\right)\right)\right)\right)\right) \]

   8. Simplified 2.7%

      \[\leadsto \color{blue}{0.5 + a \cdot \left(0.25 + -0.020833333333333332 \cdot \left(a \cdot a\right)\right)} \]

   9. Taylor expanded in a around inf

      \[\leadsto \color{blue}{\frac{-1}{48} \cdot {a}^{3}} \]
   10. Step-by-step derivation

       1. *-lowering-*.f64 N/A

          \[\leadsto \mathsf{*.f64}\left(\frac{-1}{48}, \color{blue}{\left({a}^{3}\right)}\right) \]

       2. cube-mult N/A

          \[\leadsto \mathsf{*.f64}\left(\frac{-1}{48}, \left(a \cdot \color{blue}{\left(a \cdot a\right)}\right)\right) \]

       3. unpow2 N/A

          \[\leadsto \mathsf{*.f64}\left(\frac{-1}{48}, \left(a \cdot {a}^{\color{blue}{2}}\right)\right) \]

       4. *-lowering-*.f64 N/A

          \[\leadsto \mathsf{*.f64}\left(\frac{-1}{48}, \mathsf{*.f64}\left(a, \color{blue}{\left({a}^{2}\right)}\right)\right) \]

       5. unpow2 N/A

          \[\leadsto \mathsf{*.f64}\left(\frac{-1}{48}, \mathsf{*.f64}\left(a, \left(a \cdot \color{blue}{a}\right)\right)\right) \]

       6. *-lowering-*.f64 30.4%

          \[\leadsto \mathsf{*.f64}\left(\frac{-1}{48}, \mathsf{*.f64}\left(a, \mathsf{*.f64}\left(a, \color{blue}{a}\right)\right)\right) \]

   11. Simplified 30.4%

       \[\leadsto \color{blue}{-0.020833333333333332 \cdot \left(a \cdot \left(a \cdot a\right)\right)} \]

   if 4.3000000000000002e89 < b

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b}}} \]
   4. Step-by-step derivation

      1. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \color{blue}{\left(1 + e^{b}\right)}\right) \]

      2. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(1, \color{blue}{\left(e^{b}\right)}\right)\right) \]

      3. exp-lowering-exp.f64 100.0%

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(1, \mathsf{exp.f64}\left(b\right)\right)\right) \]

   5. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b}}} \]

   6. Taylor expanded in b around 0

      \[\leadsto \mathsf{/.f64}\left(1, \color{blue}{\left(2 + b \cdot \left(1 + b \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot b\right)\right)\right)}\right) \]
   7. Step-by-step derivation

      1. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \color{blue}{\left(b \cdot \left(1 + b \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot b\right)\right)\right)}\right)\right) \]

      2. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \color{blue}{\left(1 + b \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot b\right)\right)}\right)\right)\right) \]

      3. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \color{blue}{\left(b \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot b\right)\right)}\right)\right)\right)\right) \]

      4. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \color{blue}{\left(\frac{1}{2} + \frac{1}{6} \cdot b\right)}\right)\right)\right)\right)\right) \]

      5. metadata-eval N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \left(\left(\frac{1}{2} - 0\right) + \color{blue}{\frac{1}{6}} \cdot b\right)\right)\right)\right)\right)\right) \]

      6. associate--r- N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \left(\frac{1}{2} - \color{blue}{\left(0 - \frac{1}{6} \cdot b\right)}\right)\right)\right)\right)\right)\right) \]

      7. neg-sub0 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \left(\frac{1}{2} - \left(\mathsf{neg}\left(\frac{1}{6} \cdot b\right)\right)\right)\right)\right)\right)\right)\right) \]

      8. --lowering--.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \mathsf{\_.f64}\left(\frac{1}{2}, \color{blue}{\left(\mathsf{neg}\left(\frac{1}{6} \cdot b\right)\right)}\right)\right)\right)\right)\right)\right) \]

      9. *-commutative N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \mathsf{\_.f64}\left(\frac{1}{2}, \left(\mathsf{neg}\left(b \cdot \frac{1}{6}\right)\right)\right)\right)\right)\right)\right)\right) \]

      10. distribute-rgt-neg-in N/A

          \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \mathsf{\_.f64}\left(\frac{1}{2}, \left(b \cdot \color{blue}{\left(\mathsf{neg}\left(\frac{1}{6}\right)\right)}\right)\right)\right)\right)\right)\right)\right) \]

      11. *-lowering-*.f64 N/A

          \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \mathsf{\_.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(b, \color{blue}{\left(\mathsf{neg}\left(\frac{1}{6}\right)\right)}\right)\right)\right)\right)\right)\right)\right) \]

      12. metadata-eval 96.6%

          \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \mathsf{\_.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(b, \frac{-1}{6}\right)\right)\right)\right)\right)\right)\right) \]

   8. Simplified 96.6%

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

Alternative 6: 60.5% accurate, 17.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 2.6 \cdot 10^{-11}:\\ \;\;\;\;0.5 + a \cdot \left(0.25 + -0.020833333333333332 \cdot \left(a \cdot a\right)\right)\\ \mathbf{elif}\;b \leq 4.3 \cdot 10^{+89}:\\ \;\;\;\;-0.020833333333333332 \cdot \left(a \cdot \left(a \cdot a\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{6}{b \cdot \left(b \cdot b\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= b 2.6e-11)
   (+ 0.5 (* a (+ 0.25 (* -0.020833333333333332 (* a a)))))
   (if (<= b 4.3e+89)
     (* -0.020833333333333332 (* a (* a a)))
     (/ 6.0 (* b (* b b))))))

C

double code(double a, double b) {
	double tmp;
	if (b <= 2.6e-11) {
		tmp = 0.5 + (a * (0.25 + (-0.020833333333333332 * (a * a))));
	} else if (b <= 4.3e+89) {
		tmp = -0.020833333333333332 * (a * (a * a));
	} else {
		tmp = 6.0 / (b * (b * b));
	}
	return tmp;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (b <= 2.6d-11) then
        tmp = 0.5d0 + (a * (0.25d0 + ((-0.020833333333333332d0) * (a * a))))
    else if (b <= 4.3d+89) then
        tmp = (-0.020833333333333332d0) * (a * (a * a))
    else
        tmp = 6.0d0 / (b * (b * b))
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double tmp;
	if (b <= 2.6e-11) {
		tmp = 0.5 + (a * (0.25 + (-0.020833333333333332 * (a * a))));
	} else if (b <= 4.3e+89) {
		tmp = -0.020833333333333332 * (a * (a * a));
	} else {
		tmp = 6.0 / (b * (b * b));
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if b <= 2.6e-11:
		tmp = 0.5 + (a * (0.25 + (-0.020833333333333332 * (a * a))))
	elif b <= 4.3e+89:
		tmp = -0.020833333333333332 * (a * (a * a))
	else:
		tmp = 6.0 / (b * (b * b))
	return tmp

Julia

function code(a, b)
	tmp = 0.0
	if (b <= 2.6e-11)
		tmp = Float64(0.5 + Float64(a * Float64(0.25 + Float64(-0.020833333333333332 * Float64(a * a)))));
	elseif (b <= 4.3e+89)
		tmp = Float64(-0.020833333333333332 * Float64(a * Float64(a * a)));
	else
		tmp = Float64(6.0 / Float64(b * Float64(b * b)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	tmp = 0.0;
	if (b <= 2.6e-11)
		tmp = 0.5 + (a * (0.25 + (-0.020833333333333332 * (a * a))));
	elseif (b <= 4.3e+89)
		tmp = -0.020833333333333332 * (a * (a * a));
	else
		tmp = 6.0 / (b * (b * b));
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := If[LessEqual[b, 2.6e-11], N[(0.5 + N[(a * N[(0.25 + N[(-0.020833333333333332 * N[(a * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 4.3e+89], N[(-0.020833333333333332 * N[(a * N[(a * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(6.0 / N[(b * N[(b * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < 2.6000000000000001e-11

   1. Initial program 98.9%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in b around 0

      \[\leadsto \mathsf{/.f64}\left(\mathsf{exp.f64}\left(a\right), \mathsf{+.f64}\left(\mathsf{exp.f64}\left(a\right), \color{blue}{1}\right)\right) \]
   4. Step-by-step derivation

   5. Simplified 77.5%

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]

   6. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\frac{1}{2} + a \cdot \left(\frac{1}{4} + \frac{-1}{48} \cdot {a}^{2}\right)} \]
   7. Step-by-step derivation

      1. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \color{blue}{\left(a \cdot \left(\frac{1}{4} + \frac{-1}{48} \cdot {a}^{2}\right)\right)}\right) \]

      2. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(a, \color{blue}{\left(\frac{1}{4} + \frac{-1}{48} \cdot {a}^{2}\right)}\right)\right) \]

      3. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(\frac{1}{4}, \color{blue}{\left(\frac{-1}{48} \cdot {a}^{2}\right)}\right)\right)\right) \]

      4. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(\frac{1}{4}, \mathsf{*.f64}\left(\frac{-1}{48}, \color{blue}{\left({a}^{2}\right)}\right)\right)\right)\right) \]

      5. unpow2 N/A

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(\frac{1}{4}, \mathsf{*.f64}\left(\frac{-1}{48}, \left(a \cdot \color{blue}{a}\right)\right)\right)\right)\right) \]

      6. *-lowering-*.f64 49.4%

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(\frac{1}{4}, \mathsf{*.f64}\left(\frac{-1}{48}, \mathsf{*.f64}\left(a, \color{blue}{a}\right)\right)\right)\right)\right) \]

   8. Simplified 49.4%

      \[\leadsto \color{blue}{0.5 + a \cdot \left(0.25 + -0.020833333333333332 \cdot \left(a \cdot a\right)\right)} \]

   if 2.6000000000000001e-11 < b < 4.3000000000000002e89

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in b around 0

      \[\leadsto \mathsf{/.f64}\left(\mathsf{exp.f64}\left(a\right), \mathsf{+.f64}\left(\mathsf{exp.f64}\left(a\right), \color{blue}{1}\right)\right) \]
   4. Step-by-step derivation

   5. Simplified 45.8%

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]

   6. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\frac{1}{2} + a \cdot \left(\frac{1}{4} + \frac{-1}{48} \cdot {a}^{2}\right)} \]
   7. Step-by-step derivation

      1. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \color{blue}{\left(a \cdot \left(\frac{1}{4} + \frac{-1}{48} \cdot {a}^{2}\right)\right)}\right) \]

      2. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(a, \color{blue}{\left(\frac{1}{4} + \frac{-1}{48} \cdot {a}^{2}\right)}\right)\right) \]

      3. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(\frac{1}{4}, \color{blue}{\left(\frac{-1}{48} \cdot {a}^{2}\right)}\right)\right)\right) \]

      4. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(\frac{1}{4}, \mathsf{*.f64}\left(\frac{-1}{48}, \color{blue}{\left({a}^{2}\right)}\right)\right)\right)\right) \]

      5. unpow2 N/A

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(\frac{1}{4}, \mathsf{*.f64}\left(\frac{-1}{48}, \left(a \cdot \color{blue}{a}\right)\right)\right)\right)\right) \]

      6. *-lowering-*.f64 2.7%

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(\frac{1}{4}, \mathsf{*.f64}\left(\frac{-1}{48}, \mathsf{*.f64}\left(a, \color{blue}{a}\right)\right)\right)\right)\right) \]

   8. Simplified 2.7%

      \[\leadsto \color{blue}{0.5 + a \cdot \left(0.25 + -0.020833333333333332 \cdot \left(a \cdot a\right)\right)} \]

   9. Taylor expanded in a around inf

      \[\leadsto \color{blue}{\frac{-1}{48} \cdot {a}^{3}} \]
   10. Step-by-step derivation

       1. *-lowering-*.f64 N/A

          \[\leadsto \mathsf{*.f64}\left(\frac{-1}{48}, \color{blue}{\left({a}^{3}\right)}\right) \]

       2. cube-mult N/A

          \[\leadsto \mathsf{*.f64}\left(\frac{-1}{48}, \left(a \cdot \color{blue}{\left(a \cdot a\right)}\right)\right) \]

       3. unpow2 N/A

          \[\leadsto \mathsf{*.f64}\left(\frac{-1}{48}, \left(a \cdot {a}^{\color{blue}{2}}\right)\right) \]

       4. *-lowering-*.f64 N/A

          \[\leadsto \mathsf{*.f64}\left(\frac{-1}{48}, \mathsf{*.f64}\left(a, \color{blue}{\left({a}^{2}\right)}\right)\right) \]

       5. unpow2 N/A

          \[\leadsto \mathsf{*.f64}\left(\frac{-1}{48}, \mathsf{*.f64}\left(a, \left(a \cdot \color{blue}{a}\right)\right)\right) \]

       6. *-lowering-*.f64 30.4%

          \[\leadsto \mathsf{*.f64}\left(\frac{-1}{48}, \mathsf{*.f64}\left(a, \mathsf{*.f64}\left(a, \color{blue}{a}\right)\right)\right) \]

   11. Simplified 30.4%

       \[\leadsto \color{blue}{-0.020833333333333332 \cdot \left(a \cdot \left(a \cdot a\right)\right)} \]

   if 4.3000000000000002e89 < b

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b}}} \]
   4. Step-by-step derivation

      1. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \color{blue}{\left(1 + e^{b}\right)}\right) \]

      2. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(1, \color{blue}{\left(e^{b}\right)}\right)\right) \]

      3. exp-lowering-exp.f64 100.0%

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(1, \mathsf{exp.f64}\left(b\right)\right)\right) \]

   5. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b}}} \]

   6. Taylor expanded in b around 0

      \[\leadsto \mathsf{/.f64}\left(1, \color{blue}{\left(2 + b \cdot \left(1 + b \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot b\right)\right)\right)}\right) \]
   7. Step-by-step derivation

      1. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \color{blue}{\left(b \cdot \left(1 + b \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot b\right)\right)\right)}\right)\right) \]

      2. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \color{blue}{\left(1 + b \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot b\right)\right)}\right)\right)\right) \]

      3. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \color{blue}{\left(b \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot b\right)\right)}\right)\right)\right)\right) \]

      4. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \color{blue}{\left(\frac{1}{2} + \frac{1}{6} \cdot b\right)}\right)\right)\right)\right)\right) \]

      5. metadata-eval N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \left(\left(\frac{1}{2} - 0\right) + \color{blue}{\frac{1}{6}} \cdot b\right)\right)\right)\right)\right)\right) \]

      6. associate--r- N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \left(\frac{1}{2} - \color{blue}{\left(0 - \frac{1}{6} \cdot b\right)}\right)\right)\right)\right)\right)\right) \]

      7. neg-sub0 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \left(\frac{1}{2} - \left(\mathsf{neg}\left(\frac{1}{6} \cdot b\right)\right)\right)\right)\right)\right)\right)\right) \]

      8. --lowering--.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \mathsf{\_.f64}\left(\frac{1}{2}, \color{blue}{\left(\mathsf{neg}\left(\frac{1}{6} \cdot b\right)\right)}\right)\right)\right)\right)\right)\right) \]

      9. *-commutative N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \mathsf{\_.f64}\left(\frac{1}{2}, \left(\mathsf{neg}\left(b \cdot \frac{1}{6}\right)\right)\right)\right)\right)\right)\right)\right) \]

      10. distribute-rgt-neg-in N/A

          \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \mathsf{\_.f64}\left(\frac{1}{2}, \left(b \cdot \color{blue}{\left(\mathsf{neg}\left(\frac{1}{6}\right)\right)}\right)\right)\right)\right)\right)\right)\right) \]

      11. *-lowering-*.f64 N/A

          \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \mathsf{\_.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(b, \color{blue}{\left(\mathsf{neg}\left(\frac{1}{6}\right)\right)}\right)\right)\right)\right)\right)\right)\right) \]

      12. metadata-eval 96.6%

          \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \mathsf{\_.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(b, \frac{-1}{6}\right)\right)\right)\right)\right)\right)\right) \]

   8. Simplified 96.6%

      \[\leadsto \frac{1}{\color{blue}{2 + b \cdot \left(1 + b \cdot \left(0.5 - b \cdot -0.16666666666666666\right)\right)}} \]

   9. Taylor expanded in b around inf

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

       1. /-lowering-/.f64 N/A

          \[\leadsto \mathsf{/.f64}\left(6, \color{blue}{\left({b}^{3}\right)}\right) \]

       2. cube-mult N/A

          \[\leadsto \mathsf{/.f64}\left(6, \left(b \cdot \color{blue}{\left(b \cdot b\right)}\right)\right) \]

       3. unpow2 N/A

          \[\leadsto \mathsf{/.f64}\left(6, \left(b \cdot {b}^{\color{blue}{2}}\right)\right) \]

       4. *-lowering-*.f64 N/A

          \[\leadsto \mathsf{/.f64}\left(6, \mathsf{*.f64}\left(b, \color{blue}{\left({b}^{2}\right)}\right)\right) \]

       5. unpow2 N/A

          \[\leadsto \mathsf{/.f64}\left(6, \mathsf{*.f64}\left(b, \left(b \cdot \color{blue}{b}\right)\right)\right) \]

       6. *-lowering-*.f64 96.6%

          \[\leadsto \mathsf{/.f64}\left(6, \mathsf{*.f64}\left(b, \mathsf{*.f64}\left(b, \color{blue}{b}\right)\right)\right) \]

   11. Simplified 96.6%

       \[\leadsto \color{blue}{\frac{6}{b \cdot \left(b \cdot b\right)}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 7: 60.9% accurate, 17.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 330:\\ \;\;\;\;0.5 + a \cdot 0.25\\ \mathbf{elif}\;b \leq 4.3 \cdot 10^{+89}:\\ \;\;\;\;-0.020833333333333332 \cdot \left(a \cdot \left(a \cdot a\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{6}{b \cdot \left(b \cdot b\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= b 330.0)
   (+ 0.5 (* a 0.25))
   (if (<= b 4.3e+89)
     (* -0.020833333333333332 (* a (* a a)))
     (/ 6.0 (* b (* b b))))))

C

double code(double a, double b) {
	double tmp;
	if (b <= 330.0) {
		tmp = 0.5 + (a * 0.25);
	} else if (b <= 4.3e+89) {
		tmp = -0.020833333333333332 * (a * (a * a));
	} else {
		tmp = 6.0 / (b * (b * b));
	}
	return tmp;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (b <= 330.0d0) then
        tmp = 0.5d0 + (a * 0.25d0)
    else if (b <= 4.3d+89) then
        tmp = (-0.020833333333333332d0) * (a * (a * a))
    else
        tmp = 6.0d0 / (b * (b * b))
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double tmp;
	if (b <= 330.0) {
		tmp = 0.5 + (a * 0.25);
	} else if (b <= 4.3e+89) {
		tmp = -0.020833333333333332 * (a * (a * a));
	} else {
		tmp = 6.0 / (b * (b * b));
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if b <= 330.0:
		tmp = 0.5 + (a * 0.25)
	elif b <= 4.3e+89:
		tmp = -0.020833333333333332 * (a * (a * a))
	else:
		tmp = 6.0 / (b * (b * b))
	return tmp

Julia

function code(a, b)
	tmp = 0.0
	if (b <= 330.0)
		tmp = Float64(0.5 + Float64(a * 0.25));
	elseif (b <= 4.3e+89)
		tmp = Float64(-0.020833333333333332 * Float64(a * Float64(a * a)));
	else
		tmp = Float64(6.0 / Float64(b * Float64(b * b)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	tmp = 0.0;
	if (b <= 330.0)
		tmp = 0.5 + (a * 0.25);
	elseif (b <= 4.3e+89)
		tmp = -0.020833333333333332 * (a * (a * a));
	else
		tmp = 6.0 / (b * (b * b));
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := If[LessEqual[b, 330.0], N[(0.5 + N[(a * 0.25), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 4.3e+89], N[(-0.020833333333333332 * N[(a * N[(a * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(6.0 / N[(b * N[(b * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < 330

   1. Initial program 98.9%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in b around 0

      \[\leadsto \mathsf{/.f64}\left(\mathsf{exp.f64}\left(a\right), \mathsf{+.f64}\left(\mathsf{exp.f64}\left(a\right), \color{blue}{1}\right)\right) \]
   4. Step-by-step derivation

   5. Simplified 77.8%

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]

   6. Taylor expanded in a around 0

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

      1. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \color{blue}{\left(\frac{1}{4} \cdot a\right)}\right) \]

      2. *-lowering-*.f64 48.5%

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(\frac{1}{4}, \color{blue}{a}\right)\right) \]

   8. Simplified 48.5%

      \[\leadsto \color{blue}{0.5 + 0.25 \cdot a} \]

   if 330 < b < 4.3000000000000002e89

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in b around 0

      \[\leadsto \mathsf{/.f64}\left(\mathsf{exp.f64}\left(a\right), \mathsf{+.f64}\left(\mathsf{exp.f64}\left(a\right), \color{blue}{1}\right)\right) \]
   4. Step-by-step derivation

   5. Simplified 38.4%

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]

   6. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\frac{1}{2} + a \cdot \left(\frac{1}{4} + \frac{-1}{48} \cdot {a}^{2}\right)} \]
   7. Step-by-step derivation

      1. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \color{blue}{\left(a \cdot \left(\frac{1}{4} + \frac{-1}{48} \cdot {a}^{2}\right)\right)}\right) \]

      2. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(a, \color{blue}{\left(\frac{1}{4} + \frac{-1}{48} \cdot {a}^{2}\right)}\right)\right) \]

      3. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(\frac{1}{4}, \color{blue}{\left(\frac{-1}{48} \cdot {a}^{2}\right)}\right)\right)\right) \]

      4. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(\frac{1}{4}, \mathsf{*.f64}\left(\frac{-1}{48}, \color{blue}{\left({a}^{2}\right)}\right)\right)\right)\right) \]

      5. unpow2 N/A

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(\frac{1}{4}, \mathsf{*.f64}\left(\frac{-1}{48}, \left(a \cdot \color{blue}{a}\right)\right)\right)\right)\right) \]

      6. *-lowering-*.f64 2.7%

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(\frac{1}{4}, \mathsf{*.f64}\left(\frac{-1}{48}, \mathsf{*.f64}\left(a, \color{blue}{a}\right)\right)\right)\right)\right) \]

   8. Simplified 2.7%

      \[\leadsto \color{blue}{0.5 + a \cdot \left(0.25 + -0.020833333333333332 \cdot \left(a \cdot a\right)\right)} \]

   9. Taylor expanded in a around inf

      \[\leadsto \color{blue}{\frac{-1}{48} \cdot {a}^{3}} \]
   10. Step-by-step derivation

       1. *-lowering-*.f64 N/A

          \[\leadsto \mathsf{*.f64}\left(\frac{-1}{48}, \color{blue}{\left({a}^{3}\right)}\right) \]

       2. cube-mult N/A

          \[\leadsto \mathsf{*.f64}\left(\frac{-1}{48}, \left(a \cdot \color{blue}{\left(a \cdot a\right)}\right)\right) \]

       3. unpow2 N/A

          \[\leadsto \mathsf{*.f64}\left(\frac{-1}{48}, \left(a \cdot {a}^{\color{blue}{2}}\right)\right) \]

       4. *-lowering-*.f64 N/A

          \[\leadsto \mathsf{*.f64}\left(\frac{-1}{48}, \mathsf{*.f64}\left(a, \color{blue}{\left({a}^{2}\right)}\right)\right) \]

       5. unpow2 N/A

          \[\leadsto \mathsf{*.f64}\left(\frac{-1}{48}, \mathsf{*.f64}\left(a, \left(a \cdot \color{blue}{a}\right)\right)\right) \]

       6. *-lowering-*.f64 34.2%

          \[\leadsto \mathsf{*.f64}\left(\frac{-1}{48}, \mathsf{*.f64}\left(a, \mathsf{*.f64}\left(a, \color{blue}{a}\right)\right)\right) \]

   11. Simplified 34.2%

       \[\leadsto \color{blue}{-0.020833333333333332 \cdot \left(a \cdot \left(a \cdot a\right)\right)} \]

   if 4.3000000000000002e89 < b

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b}}} \]
   4. Step-by-step derivation

      1. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \color{blue}{\left(1 + e^{b}\right)}\right) \]

      2. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(1, \color{blue}{\left(e^{b}\right)}\right)\right) \]

      3. exp-lowering-exp.f64 100.0%

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(1, \mathsf{exp.f64}\left(b\right)\right)\right) \]

   5. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b}}} \]

   6. Taylor expanded in b around 0

      \[\leadsto \mathsf{/.f64}\left(1, \color{blue}{\left(2 + b \cdot \left(1 + b \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot b\right)\right)\right)}\right) \]
   7. Step-by-step derivation

      1. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \color{blue}{\left(b \cdot \left(1 + b \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot b\right)\right)\right)}\right)\right) \]

      2. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \color{blue}{\left(1 + b \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot b\right)\right)}\right)\right)\right) \]

      3. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \color{blue}{\left(b \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot b\right)\right)}\right)\right)\right)\right) \]

      4. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \color{blue}{\left(\frac{1}{2} + \frac{1}{6} \cdot b\right)}\right)\right)\right)\right)\right) \]

      5. metadata-eval N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \left(\left(\frac{1}{2} - 0\right) + \color{blue}{\frac{1}{6}} \cdot b\right)\right)\right)\right)\right)\right) \]

      6. associate--r- N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \left(\frac{1}{2} - \color{blue}{\left(0 - \frac{1}{6} \cdot b\right)}\right)\right)\right)\right)\right)\right) \]

      7. neg-sub0 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \left(\frac{1}{2} - \left(\mathsf{neg}\left(\frac{1}{6} \cdot b\right)\right)\right)\right)\right)\right)\right)\right) \]

      8. --lowering--.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \mathsf{\_.f64}\left(\frac{1}{2}, \color{blue}{\left(\mathsf{neg}\left(\frac{1}{6} \cdot b\right)\right)}\right)\right)\right)\right)\right)\right) \]

      9. *-commutative N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \mathsf{\_.f64}\left(\frac{1}{2}, \left(\mathsf{neg}\left(b \cdot \frac{1}{6}\right)\right)\right)\right)\right)\right)\right)\right) \]

      10. distribute-rgt-neg-in N/A

          \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \mathsf{\_.f64}\left(\frac{1}{2}, \left(b \cdot \color{blue}{\left(\mathsf{neg}\left(\frac{1}{6}\right)\right)}\right)\right)\right)\right)\right)\right)\right) \]

      11. *-lowering-*.f64 N/A

          \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \mathsf{\_.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(b, \color{blue}{\left(\mathsf{neg}\left(\frac{1}{6}\right)\right)}\right)\right)\right)\right)\right)\right)\right) \]

      12. metadata-eval 96.6%

          \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(b, \mathsf{\_.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(b, \frac{-1}{6}\right)\right)\right)\right)\right)\right)\right) \]

   8. Simplified 96.6%

      \[\leadsto \frac{1}{\color{blue}{2 + b \cdot \left(1 + b \cdot \left(0.5 - b \cdot -0.16666666666666666\right)\right)}} \]

   9. Taylor expanded in b around inf

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

       1. /-lowering-/.f64 N/A

          \[\leadsto \mathsf{/.f64}\left(6, \color{blue}{\left({b}^{3}\right)}\right) \]

       2. cube-mult N/A

          \[\leadsto \mathsf{/.f64}\left(6, \left(b \cdot \color{blue}{\left(b \cdot b\right)}\right)\right) \]

       3. unpow2 N/A

          \[\leadsto \mathsf{/.f64}\left(6, \left(b \cdot {b}^{\color{blue}{2}}\right)\right) \]

       4. *-lowering-*.f64 N/A

          \[\leadsto \mathsf{/.f64}\left(6, \mathsf{*.f64}\left(b, \color{blue}{\left({b}^{2}\right)}\right)\right) \]

       5. unpow2 N/A

          \[\leadsto \mathsf{/.f64}\left(6, \mathsf{*.f64}\left(b, \left(b \cdot \color{blue}{b}\right)\right)\right) \]

       6. *-lowering-*.f64 96.6%

          \[\leadsto \mathsf{/.f64}\left(6, \mathsf{*.f64}\left(b, \mathsf{*.f64}\left(b, \color{blue}{b}\right)\right)\right) \]

   11. Simplified 96.6%

       \[\leadsto \color{blue}{\frac{6}{b \cdot \left(b \cdot b\right)}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 57.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq 330:\\ \;\;\;\;0.5 + a \cdot 0.25\\ \mathbf{elif}\;b \leq 4.3 \cdot 10^{+89}:\\ \;\;\;\;-0.020833333333333332 \cdot \left(a \cdot \left(a \cdot a\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{6}{b \cdot \left(b \cdot b\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 58.7% accurate, 17.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 360:\\ \;\;\;\;0.5 + a \cdot 0.25\\ \mathbf{elif}\;b \leq 1.35 \cdot 10^{+154}:\\ \;\;\;\;-0.020833333333333332 \cdot \left(a \cdot \left(a \cdot a\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{2}{b \cdot b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= b 360.0)
   (+ 0.5 (* a 0.25))
   (if (<= b 1.35e+154)
     (* -0.020833333333333332 (* a (* a a)))
     (/ 2.0 (* b b)))))

C

double code(double a, double b) {
	double tmp;
	if (b <= 360.0) {
		tmp = 0.5 + (a * 0.25);
	} else if (b <= 1.35e+154) {
		tmp = -0.020833333333333332 * (a * (a * a));
	} else {
		tmp = 2.0 / (b * b);
	}
	return tmp;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (b <= 360.0d0) then
        tmp = 0.5d0 + (a * 0.25d0)
    else if (b <= 1.35d+154) then
        tmp = (-0.020833333333333332d0) * (a * (a * a))
    else
        tmp = 2.0d0 / (b * b)
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double tmp;
	if (b <= 360.0) {
		tmp = 0.5 + (a * 0.25);
	} else if (b <= 1.35e+154) {
		tmp = -0.020833333333333332 * (a * (a * a));
	} else {
		tmp = 2.0 / (b * b);
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if b <= 360.0:
		tmp = 0.5 + (a * 0.25)
	elif b <= 1.35e+154:
		tmp = -0.020833333333333332 * (a * (a * a))
	else:
		tmp = 2.0 / (b * b)
	return tmp

Julia

function code(a, b)
	tmp = 0.0
	if (b <= 360.0)
		tmp = Float64(0.5 + Float64(a * 0.25));
	elseif (b <= 1.35e+154)
		tmp = Float64(-0.020833333333333332 * Float64(a * Float64(a * a)));
	else
		tmp = Float64(2.0 / Float64(b * b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	tmp = 0.0;
	if (b <= 360.0)
		tmp = 0.5 + (a * 0.25);
	elseif (b <= 1.35e+154)
		tmp = -0.020833333333333332 * (a * (a * a));
	else
		tmp = 2.0 / (b * b);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := If[LessEqual[b, 360.0], N[(0.5 + N[(a * 0.25), $MachinePrecision]), $MachinePrecision], If[LessEqual[b, 1.35e+154], N[(-0.020833333333333332 * N[(a * N[(a * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(2.0 / N[(b * b), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < 360

   1. Initial program 98.9%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in b around 0

      \[\leadsto \mathsf{/.f64}\left(\mathsf{exp.f64}\left(a\right), \mathsf{+.f64}\left(\mathsf{exp.f64}\left(a\right), \color{blue}{1}\right)\right) \]
   4. Step-by-step derivation

   5. Simplified 77.8%

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]

   6. Taylor expanded in a around 0

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

      1. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \color{blue}{\left(\frac{1}{4} \cdot a\right)}\right) \]

      2. *-lowering-*.f64 48.5%

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(\frac{1}{4}, \color{blue}{a}\right)\right) \]

   8. Simplified 48.5%

      \[\leadsto \color{blue}{0.5 + 0.25 \cdot a} \]

   if 360 < b < 1.35000000000000003e154

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in b around 0

      \[\leadsto \mathsf{/.f64}\left(\mathsf{exp.f64}\left(a\right), \mathsf{+.f64}\left(\mathsf{exp.f64}\left(a\right), \color{blue}{1}\right)\right) \]
   4. Step-by-step derivation

   5. Simplified 36.3%

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]

   6. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\frac{1}{2} + a \cdot \left(\frac{1}{4} + \frac{-1}{48} \cdot {a}^{2}\right)} \]
   7. Step-by-step derivation

      1. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \color{blue}{\left(a \cdot \left(\frac{1}{4} + \frac{-1}{48} \cdot {a}^{2}\right)\right)}\right) \]

      2. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(a, \color{blue}{\left(\frac{1}{4} + \frac{-1}{48} \cdot {a}^{2}\right)}\right)\right) \]

      3. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(\frac{1}{4}, \color{blue}{\left(\frac{-1}{48} \cdot {a}^{2}\right)}\right)\right)\right) \]

      4. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(\frac{1}{4}, \mathsf{*.f64}\left(\frac{-1}{48}, \color{blue}{\left({a}^{2}\right)}\right)\right)\right)\right) \]

      5. unpow2 N/A

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(\frac{1}{4}, \mathsf{*.f64}\left(\frac{-1}{48}, \left(a \cdot \color{blue}{a}\right)\right)\right)\right)\right) \]

      6. *-lowering-*.f64 2.7%

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(a, \mathsf{+.f64}\left(\frac{1}{4}, \mathsf{*.f64}\left(\frac{-1}{48}, \mathsf{*.f64}\left(a, \color{blue}{a}\right)\right)\right)\right)\right) \]

   8. Simplified 2.7%

      \[\leadsto \color{blue}{0.5 + a \cdot \left(0.25 + -0.020833333333333332 \cdot \left(a \cdot a\right)\right)} \]

   9. Taylor expanded in a around inf

      \[\leadsto \color{blue}{\frac{-1}{48} \cdot {a}^{3}} \]
   10. Step-by-step derivation

       1. *-lowering-*.f64 N/A

          \[\leadsto \mathsf{*.f64}\left(\frac{-1}{48}, \color{blue}{\left({a}^{3}\right)}\right) \]

       2. cube-mult N/A

          \[\leadsto \mathsf{*.f64}\left(\frac{-1}{48}, \left(a \cdot \color{blue}{\left(a \cdot a\right)}\right)\right) \]

       3. unpow2 N/A

          \[\leadsto \mathsf{*.f64}\left(\frac{-1}{48}, \left(a \cdot {a}^{\color{blue}{2}}\right)\right) \]

       4. *-lowering-*.f64 N/A

          \[\leadsto \mathsf{*.f64}\left(\frac{-1}{48}, \mathsf{*.f64}\left(a, \color{blue}{\left({a}^{2}\right)}\right)\right) \]

       5. unpow2 N/A

          \[\leadsto \mathsf{*.f64}\left(\frac{-1}{48}, \mathsf{*.f64}\left(a, \left(a \cdot \color{blue}{a}\right)\right)\right) \]

       6. *-lowering-*.f64 36.4%

          \[\leadsto \mathsf{*.f64}\left(\frac{-1}{48}, \mathsf{*.f64}\left(a, \mathsf{*.f64}\left(a, \color{blue}{a}\right)\right)\right) \]

   11. Simplified 36.4%

       \[\leadsto \color{blue}{-0.020833333333333332 \cdot \left(a \cdot \left(a \cdot a\right)\right)} \]

   if 1.35000000000000003e154 < b

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b}}} \]
   4. Step-by-step derivation

      1. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \color{blue}{\left(1 + e^{b}\right)}\right) \]

      2. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(1, \color{blue}{\left(e^{b}\right)}\right)\right) \]

      3. exp-lowering-exp.f64 100.0%

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(1, \mathsf{exp.f64}\left(b\right)\right)\right) \]

   5. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b}}} \]

   6. Taylor expanded in b around 0

      \[\leadsto \mathsf{/.f64}\left(1, \color{blue}{\left(2 + b \cdot \left(1 + \frac{1}{2} \cdot b\right)\right)}\right) \]
   7. Step-by-step derivation

      1. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \color{blue}{\left(b \cdot \left(1 + \frac{1}{2} \cdot b\right)\right)}\right)\right) \]

      2. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \color{blue}{\left(1 + \frac{1}{2} \cdot b\right)}\right)\right)\right) \]

      3. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \color{blue}{\left(\frac{1}{2} \cdot b\right)}\right)\right)\right)\right) \]

      4. *-lowering-*.f64 100.0%

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\frac{1}{2}, \color{blue}{b}\right)\right)\right)\right)\right) \]

   8. Simplified 100.0%

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

   9. Taylor expanded in b around inf

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

       1. /-lowering-/.f64 N/A

          \[\leadsto \mathsf{/.f64}\left(2, \color{blue}{\left({b}^{2}\right)}\right) \]

       2. unpow2 N/A

          \[\leadsto \mathsf{/.f64}\left(2, \left(b \cdot \color{blue}{b}\right)\right) \]

       3. *-lowering-*.f64 100.0%

          \[\leadsto \mathsf{/.f64}\left(2, \mathsf{*.f64}\left(b, \color{blue}{b}\right)\right) \]

   11. Simplified 100.0%

       \[\leadsto \color{blue}{\frac{2}{b \cdot b}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 55.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq 360:\\ \;\;\;\;0.5 + a \cdot 0.25\\ \mathbf{elif}\;b \leq 1.35 \cdot 10^{+154}:\\ \;\;\;\;-0.020833333333333332 \cdot \left(a \cdot \left(a \cdot a\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{2}{b \cdot b}\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 53.3% accurate, 30.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 3.3 \cdot 10^{-7}:\\ \;\;\;\;0.5 + a \cdot 0.25\\ \mathbf{else}:\\ \;\;\;\;\frac{2}{b \cdot b}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= b 3.3e-7) (+ 0.5 (* a 0.25)) (/ 2.0 (* b b))))

C

double code(double a, double b) {
	double tmp;
	if (b <= 3.3e-7) {
		tmp = 0.5 + (a * 0.25);
	} else {
		tmp = 2.0 / (b * b);
	}
	return tmp;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (b <= 3.3d-7) then
        tmp = 0.5d0 + (a * 0.25d0)
    else
        tmp = 2.0d0 / (b * b)
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double tmp;
	if (b <= 3.3e-7) {
		tmp = 0.5 + (a * 0.25);
	} else {
		tmp = 2.0 / (b * b);
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if b <= 3.3e-7:
		tmp = 0.5 + (a * 0.25)
	else:
		tmp = 2.0 / (b * b)
	return tmp

Julia

function code(a, b)
	tmp = 0.0
	if (b <= 3.3e-7)
		tmp = Float64(0.5 + Float64(a * 0.25));
	else
		tmp = Float64(2.0 / Float64(b * b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	tmp = 0.0;
	if (b <= 3.3e-7)
		tmp = 0.5 + (a * 0.25);
	else
		tmp = 2.0 / (b * b);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := If[LessEqual[b, 3.3e-7], N[(0.5 + N[(a * 0.25), $MachinePrecision]), $MachinePrecision], N[(2.0 / N[(b * b), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < 3.3000000000000002e-7

   1. Initial program 98.9%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in b around 0

      \[\leadsto \mathsf{/.f64}\left(\mathsf{exp.f64}\left(a\right), \mathsf{+.f64}\left(\mathsf{exp.f64}\left(a\right), \color{blue}{1}\right)\right) \]
   4. Step-by-step derivation

   5. Simplified 77.6%

      \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]

   6. Taylor expanded in a around 0

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

      1. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \color{blue}{\left(\frac{1}{4} \cdot a\right)}\right) \]

      2. *-lowering-*.f64 49.1%

         \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(\frac{1}{4}, \color{blue}{a}\right)\right) \]

   8. Simplified 49.1%

      \[\leadsto \color{blue}{0.5 + 0.25 \cdot a} \]

   if 3.3000000000000002e-7 < b

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b}}} \]
   4. Step-by-step derivation

      1. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \color{blue}{\left(1 + e^{b}\right)}\right) \]

      2. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(1, \color{blue}{\left(e^{b}\right)}\right)\right) \]

      3. exp-lowering-exp.f64 97.5%

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(1, \mathsf{exp.f64}\left(b\right)\right)\right) \]

   5. Simplified 97.5%

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b}}} \]

   6. Taylor expanded in b around 0

      \[\leadsto \mathsf{/.f64}\left(1, \color{blue}{\left(2 + b \cdot \left(1 + \frac{1}{2} \cdot b\right)\right)}\right) \]
   7. Step-by-step derivation

      1. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \color{blue}{\left(b \cdot \left(1 + \frac{1}{2} \cdot b\right)\right)}\right)\right) \]

      2. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \color{blue}{\left(1 + \frac{1}{2} \cdot b\right)}\right)\right)\right) \]

      3. +-lowering-+.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \color{blue}{\left(\frac{1}{2} \cdot b\right)}\right)\right)\right)\right) \]

      4. *-lowering-*.f64 54.8%

         \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(2, \mathsf{*.f64}\left(b, \mathsf{+.f64}\left(1, \mathsf{*.f64}\left(\frac{1}{2}, \color{blue}{b}\right)\right)\right)\right)\right) \]

   8. Simplified 54.8%

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

   9. Taylor expanded in b around inf

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

       1. /-lowering-/.f64 N/A

          \[\leadsto \mathsf{/.f64}\left(2, \color{blue}{\left({b}^{2}\right)}\right) \]

       2. unpow2 N/A

          \[\leadsto \mathsf{/.f64}\left(2, \left(b \cdot \color{blue}{b}\right)\right) \]

       3. *-lowering-*.f64 54.8%

          \[\leadsto \mathsf{/.f64}\left(2, \mathsf{*.f64}\left(b, \color{blue}{b}\right)\right) \]

   11. Simplified 54.8%

       \[\leadsto \color{blue}{\frac{2}{b \cdot b}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 50.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq 3.3 \cdot 10^{-7}:\\ \;\;\;\;0.5 + a \cdot 0.25\\ \mathbf{else}:\\ \;\;\;\;\frac{2}{b \cdot b}\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 39.5% accurate, 61.0× speedup

Math

\[\begin{array}{l} \\ 0.5 + a \cdot 0.25 \end{array} \]

FPCore

(FPCore (a b) :precision binary64 (+ 0.5 (* a 0.25)))

C

double code(double a, double b) {
	return 0.5 + (a * 0.25);
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = 0.5d0 + (a * 0.25d0)
end function

Java

public static double code(double a, double b) {
	return 0.5 + (a * 0.25);
}

Python

def code(a, b):
	return 0.5 + (a * 0.25)

Julia

function code(a, b)
	return Float64(0.5 + Float64(a * 0.25))
end

MATLAB

function tmp = code(a, b)
	tmp = 0.5 + (a * 0.25);
end

Wolfram

code[a_, b_] := N[(0.5 + N[(a * 0.25), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.2%

   \[\frac{e^{a}}{e^{a} + e^{b}} \]
2. Add Preprocessing

3. Taylor expanded in b around 0

   \[\leadsto \mathsf{/.f64}\left(\mathsf{exp.f64}\left(a\right), \mathsf{+.f64}\left(\mathsf{exp.f64}\left(a\right), \color{blue}{1}\right)\right) \]
4. Step-by-step derivation

5. Simplified 65.1%

   \[\leadsto \frac{e^{a}}{e^{a} + \color{blue}{1}} \]

6. Taylor expanded in a around 0

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

   1. +-lowering-+.f64 N/A

      \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \color{blue}{\left(\frac{1}{4} \cdot a\right)}\right) \]

   2. *-lowering-*.f64 35.0%

      \[\leadsto \mathsf{+.f64}\left(\frac{1}{2}, \mathsf{*.f64}\left(\frac{1}{4}, \color{blue}{a}\right)\right) \]

8. Simplified 35.0%

   \[\leadsto \color{blue}{0.5 + 0.25 \cdot a} \]

9. Final simplification 35.0%

   \[\leadsto 0.5 + a \cdot 0.25 \]
10. Add Preprocessing

Alternative 11: 39.4% accurate, 305.0× speedup

Math

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

FPCore

(FPCore (a b) :precision binary64 0.5)

C

double code(double a, double b) {
	return 0.5;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = 0.5d0
end function

Java

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

Python

def code(a, b):
	return 0.5

Julia

function code(a, b)
	return 0.5
end

MATLAB

function tmp = code(a, b)
	tmp = 0.5;
end

Wolfram

code[a_, b_] := 0.5

Derivation

1. Initial program 99.2%

   \[\frac{e^{a}}{e^{a} + e^{b}} \]
2. Add Preprocessing

3. Taylor expanded in a around 0

   \[\leadsto \color{blue}{\frac{1}{1 + e^{b}}} \]
4. Step-by-step derivation

   1. /-lowering-/.f64 N/A

      \[\leadsto \mathsf{/.f64}\left(1, \color{blue}{\left(1 + e^{b}\right)}\right) \]

   2. +-lowering-+.f64 N/A

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(1, \color{blue}{\left(e^{b}\right)}\right)\right) \]

   3. exp-lowering-exp.f64 79.0%

      \[\leadsto \mathsf{/.f64}\left(1, \mathsf{+.f64}\left(1, \mathsf{exp.f64}\left(b\right)\right)\right) \]

5. Simplified 79.0%

   \[\leadsto \color{blue}{\frac{1}{1 + e^{b}}} \]

6. Taylor expanded in b around 0

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

8. Simplified 34.7%

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

Developer Target 1: 100.0% accurate, 2.9× speedup

Math

\[\begin{array}{l} \\ \frac{1}{1 + e^{b - a}} \end{array} \]

FPCore

(FPCore (a b) :precision binary64 (/ 1.0 (+ 1.0 (exp (- b a)))))

C

double code(double a, double b) {
	return 1.0 / (1.0 + exp((b - a)));
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = 1.0d0 / (1.0d0 + exp((b - a)))
end function

Java

public static double code(double a, double b) {
	return 1.0 / (1.0 + Math.exp((b - a)));
}

Python

def code(a, b):
	return 1.0 / (1.0 + math.exp((b - a)))

Julia

function code(a, b)
	return Float64(1.0 / Float64(1.0 + exp(Float64(b - a))))
end

MATLAB

function tmp = code(a, b)
	tmp = 1.0 / (1.0 + exp((b - a)));
end

Wolfram

code[a_, b_] := N[(1.0 / N[(1.0 + N[Exp[N[(b - a), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Reproduce

herbie shell --seed 2024185 
(FPCore (a b)
  :name "Quotient of sum of exps"
  :precision binary64

  :alt
  (! :herbie-platform default (/ 1 (+ 1 (exp (- b a)))))

  (/ (exp a) (+ (exp a) (exp b))))