Quotient of sum of exps

Percentage Accurate: 99.2% → 99.2%

Time: 3.6s

Alternatives: 10

Speedup: 1.0×

• could not determine a ground truth

  1. a = -2.00000000000000007e154
  2. b = -2.00000000000000007e154

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.2% 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.2% 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. Final simplification 99.2%

   \[\leadsto \frac{e^{a}}{e^{a} + e^{b}} \]

Alternative 2: 98.4% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double a, double b) {
	double tmp;
	if (exp(a) <= 0.999999999) {
		tmp = exp(a) / (exp(a) + 1.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.999999999d0) then
        tmp = exp(a) / (exp(a) + 1.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.999999999) {
		tmp = Math.exp(a) / (Math.exp(a) + 1.0);
	} else {
		tmp = 1.0 / (Math.exp(b) + 1.0);
	}
	return tmp;
}

Python

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

Julia

function code(a, b)
	tmp = 0.0
	if (exp(a) <= 0.999999999)
		tmp = Float64(exp(a) / Float64(exp(a) + 1.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.999999999)
		tmp = exp(a) / (exp(a) + 1.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.999999999], N[(N[Exp[a], $MachinePrecision] / N[(N[Exp[a], $MachinePrecision] + 1.0), $MachinePrecision]), $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.999999999000000028

   1. Initial program 97.5%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]

   2. Taylor expanded in b around 0 98.8%

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

   if 0.999999999000000028 < (exp.f64 a)

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]

   2. Taylor expanded in a around 0 99.4%

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

4. Final simplification 99.2%

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

Alternative 3: 98.4% accurate, 2.8× speedup

Math

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

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= a -9000000.0) (/ (exp a) a) (/ 1.0 (+ (exp b) 1.0))))

C

double code(double a, double b) {
	double tmp;
	if (a <= -9000000.0) {
		tmp = exp(a) / a;
	} 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 (a <= (-9000000.0d0)) then
        tmp = exp(a) / a
    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 (a <= -9000000.0) {
		tmp = Math.exp(a) / a;
	} else {
		tmp = 1.0 / (Math.exp(b) + 1.0);
	}
	return tmp;
}

Python

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

Julia

function code(a, b)
	tmp = 0.0
	if (a <= -9000000.0)
		tmp = Float64(exp(a) / a);
	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 (a <= -9000000.0)
		tmp = exp(a) / a;
	else
		tmp = 1.0 / (exp(b) + 1.0);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -9e6

   1. Initial program 98.6%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]

   2. Taylor expanded in b around 0 100.0%

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

   3. Taylor expanded in a around 0 100.0%

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

   4. Taylor expanded in a around inf 100.0%

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

   if -9e6 < a

   1. Initial program 99.5%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]

   2. Taylor expanded in a around 0 98.8%

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

4. Final simplification 99.1%

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

Alternative 4: 98.1% accurate, 2.8× speedup

Math

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

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= a -6.8e-10) (/ (exp a) (+ a 2.0)) (/ 1.0 (+ (exp b) 1.0))))

C

double code(double a, double b) {
	double tmp;
	if (a <= -6.8e-10) {
		tmp = exp(a) / (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 (a <= (-6.8d-10)) then
        tmp = exp(a) / (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 (a <= -6.8e-10) {
		tmp = Math.exp(a) / (a + 2.0);
	} else {
		tmp = 1.0 / (Math.exp(b) + 1.0);
	}
	return tmp;
}

Python

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

Julia

function code(a, b)
	tmp = 0.0
	if (a <= -6.8e-10)
		tmp = Float64(exp(a) / Float64(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 (a <= -6.8e-10)
		tmp = exp(a) / (a + 2.0);
	else
		tmp = 1.0 / (exp(b) + 1.0);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -6.8000000000000003e-10

   1. Initial program 97.5%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]

   2. Taylor expanded in b around 0 98.8%

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

   3. Taylor expanded in a around 0 98.6%

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

   if -6.8000000000000003e-10 < a

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]

   2. Taylor expanded in a around 0 99.4%

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

4. Final simplification 99.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -6.8 \cdot 10^{-10}:\\ \;\;\;\;\frac{e^{a}}{a + 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{e^{b} + 1}\\ \end{array} \]

Alternative 5: 73.1% accurate, 2.9× speedup

Math

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

FPCore

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

C

double code(double a, double b) {
	double tmp;
	if (a <= -700.0) {
		tmp = exp(a) / a;
	} else {
		tmp = 1.0 / ((b + 2.0) + (0.5 * (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 (a <= (-700.0d0)) then
        tmp = exp(a) / a
    else
        tmp = 1.0d0 / ((b + 2.0d0) + (0.5d0 * (b * b)))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -700

   1. Initial program 97.4%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]

   2. Taylor expanded in b around 0 98.7%

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

   3. Taylor expanded in a around 0 98.7%

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

   4. Taylor expanded in a around inf 98.7%

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

   if -700 < a

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]

   2. Taylor expanded in a around 0 98.8%

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

   3. Taylor expanded in b around 0 68.0%

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

      1. associate-+r+ 68.0%

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

      2. unpow2 68.0%

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

   5. Simplified 68.0%

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

4. Final simplification 77.1%

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

Alternative 6: 53.8% accurate, 23.3× speedup

Math

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

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= b 2.1e-236) (+ 0.5 (* a 0.25)) (/ 1.0 (+ (+ b 2.0) (* 0.5 (* b b))))))

C

double code(double a, double b) {
	double tmp;
	if (b <= 2.1e-236) {
		tmp = 0.5 + (a * 0.25);
	} else {
		tmp = 1.0 / ((b + 2.0) + (0.5 * (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.1d-236) then
        tmp = 0.5d0 + (a * 0.25d0)
    else
        tmp = 1.0d0 / ((b + 2.0d0) + (0.5d0 * (b * b)))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if b < 2.09999999999999979e-236

   1. Initial program 98.4%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]

   2. Taylor expanded in b around 0 75.1%

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

   3. Taylor expanded in a around 0 51.2%

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

   if 2.09999999999999979e-236 < b

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]

   2. Taylor expanded in a around 0 87.6%

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

   3. Taylor expanded in b around 0 63.6%

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

      1. associate-+r+ 63.6%

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

      2. unpow2 63.6%

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

   5. Simplified 63.6%

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

4. Final simplification 57.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq 2.1 \cdot 10^{-236}:\\ \;\;\;\;0.5 + a \cdot 0.25\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\left(b + 2\right) + 0.5 \cdot \left(b \cdot b\right)}\\ \end{array} \]

Alternative 7: 53.7% accurate, 27.6× speedup

Math

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

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= b 1.05) (+ 0.5 (* a 0.25)) (/ 1.0 (* b (+ 1.0 (* b 0.5))))))

C

double code(double a, double b) {
	double tmp;
	if (b <= 1.05) {
		tmp = 0.5 + (a * 0.25);
	} else {
		tmp = 1.0 / (b * (1.0 + (b * 0.5)));
	}
	return tmp;
}

Fortran

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

Java

public static double code(double a, double b) {
	double tmp;
	if (b <= 1.05) {
		tmp = 0.5 + (a * 0.25);
	} else {
		tmp = 1.0 / (b * (1.0 + (b * 0.5)));
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if b <= 1.05:
		tmp = 0.5 + (a * 0.25)
	else:
		tmp = 1.0 / (b * (1.0 + (b * 0.5)))
	return tmp

Julia

function code(a, b)
	tmp = 0.0
	if (b <= 1.05)
		tmp = Float64(0.5 + Float64(a * 0.25));
	else
		tmp = Float64(1.0 / Float64(b * Float64(1.0 + Float64(b * 0.5))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	tmp = 0.0;
	if (b <= 1.05)
		tmp = 0.5 + (a * 0.25);
	else
		tmp = 1.0 / (b * (1.0 + (b * 0.5)));
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := If[LessEqual[b, 1.05], N[(0.5 + N[(a * 0.25), $MachinePrecision]), $MachinePrecision], N[(1.0 / N[(b * N[(1.0 + N[(b * 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if b < 1.05000000000000004

   1. Initial program 98.9%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]

   2. Taylor expanded in b around 0 82.3%

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

   3. Taylor expanded in a around 0 55.9%

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

   if 1.05000000000000004 < b

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]

   2. Taylor expanded in a around 0 100.0%

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

   3. Taylor expanded in b around 0 60.5%

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

      1. associate-+r+ 60.5%

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

      2. unpow2 60.5%

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

   5. Simplified 60.5%

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

   6. Taylor expanded in b around inf 60.5%

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

      1. unpow2 60.5%

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

   8. Simplified 60.5%

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

      1. associate-*r* 60.5%

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

      2. distribute-rgt1-in 60.5%

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

   10. Applied egg-rr 60.5%

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

4. Final simplification 57.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq 1.05:\\ \;\;\;\;0.5 + a \cdot 0.25\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{b \cdot \left(1 + b \cdot 0.5\right)}\\ \end{array} \]

Alternative 8: 53.7% accurate, 43.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 1.8:\\ \;\;\;\;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 1.8) (+ 0.5 (* a 0.25)) (/ 2.0 (* b b))))

C

double code(double a, double b) {
	double tmp;
	if (b <= 1.8) {
		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 <= 1.8d0) 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 <= 1.8) {
		tmp = 0.5 + (a * 0.25);
	} else {
		tmp = 2.0 / (b * b);
	}
	return tmp;
}

Python

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

Julia

function code(a, b)
	tmp = 0.0
	if (b <= 1.8)
		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 <= 1.8)
		tmp = 0.5 + (a * 0.25);
	else
		tmp = 2.0 / (b * b);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := If[LessEqual[b, 1.8], 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 < 1.80000000000000004

   1. Initial program 98.9%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]

   2. Taylor expanded in b around 0 82.3%

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

   3. Taylor expanded in a around 0 55.9%

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

   if 1.80000000000000004 < b

   1. Initial program 100.0%

      \[\frac{e^{a}}{e^{a} + e^{b}} \]

   2. Taylor expanded in a around 0 100.0%

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

   3. Taylor expanded in b around 0 60.5%

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

      1. associate-+r+ 60.5%

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

      2. unpow2 60.5%

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

   5. Simplified 60.5%

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

   6. Taylor expanded in b around inf 60.5%

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

      1. unpow2 60.5%

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

   8. Simplified 60.5%

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

4. Final simplification 57.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq 1.8:\\ \;\;\;\;0.5 + a \cdot 0.25\\ \mathbf{else}:\\ \;\;\;\;\frac{2}{b \cdot b}\\ \end{array} \]

Alternative 9: 40.2% 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. Taylor expanded in b around 0 67.8%

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

3. Taylor expanded in a around 0 39.1%

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

4. Final simplification 39.1%

   \[\leadsto 0.5 + a \cdot 0.25 \]

Alternative 10: 40.0% 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. Taylor expanded in a around 0 81.3%

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

3. Taylor expanded in b around 0 38.7%

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

4. Final simplification 38.7%

   \[\leadsto 0.5 \]

Developer target: 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 2023193 
(FPCore (a b)
  :name "Quotient of sum of exps"
  :precision binary64

  :herbie-target
  (/ 1.0 (+ 1.0 (exp (- b a))))

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