Asymptote A

Percentage Accurate: 77.1% → 99.9%

Time: 5.3s

Alternatives: 5

Speedup: 1.2×

Specification

Math

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

FPCore

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

C

double code(double x) {
	return (1.0 / (x + 1.0)) - (1.0 / (x - 1.0));
}

Fortran

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

Java

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

Python

def code(x):
	return (1.0 / (x + 1.0)) - (1.0 / (x - 1.0))

Julia

function code(x)
	return Float64(Float64(1.0 / Float64(x + 1.0)) - Float64(1.0 / Float64(x - 1.0)))
end

MATLAB

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

Wolfram

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

Initial Program: 77.1% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x) {
	return (1.0 / (x + 1.0)) - (1.0 / (x - 1.0));
}

Fortran

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

Java

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

Python

def code(x):
	return (1.0 / (x + 1.0)) - (1.0 / (x - 1.0))

Julia

function code(x)
	return Float64(Float64(1.0 / Float64(x + 1.0)) - Float64(1.0 / Float64(x - 1.0)))
end

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 1.2× speedup

Math

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

FPCore

(FPCore (x) :precision binary64 (/ (/ 2.0 (- -1.0 x)) (+ -1.0 x)))

C

double code(double x) {
	return (2.0 / (-1.0 - x)) / (-1.0 + x);
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = (2.0d0 / ((-1.0d0) - x)) / ((-1.0d0) + x)
end function

Java

public static double code(double x) {
	return (2.0 / (-1.0 - x)) / (-1.0 + x);
}

Python

def code(x):
	return (2.0 / (-1.0 - x)) / (-1.0 + x)

Julia

function code(x)
	return Float64(Float64(2.0 / Float64(-1.0 - x)) / Float64(-1.0 + x))
end

MATLAB

function tmp = code(x)
	tmp = (2.0 / (-1.0 - x)) / (-1.0 + x);
end

Wolfram

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

Derivation

1. Initial program 77.5%

   \[\frac{1}{x + 1} - \frac{1}{x - 1} \]
2. Step-by-step derivation

   1. frac-sub 78.1%

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

   2. associate-/r* 78.1%

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

   3. *-un-lft-identity 78.1%

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

   4. *-rgt-identity 78.1%

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

   5. associate--l- 78.4%

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

   6. +-commutative 78.4%

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

   7. +-commutative 78.4%

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

   8. sub-neg 78.4%

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

   9. metadata-eval 78.4%

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

3. Applied egg-rr 78.4%

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

   1. div-sub 77.4%

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

   2. div-sub 77.4%

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

   3. +-commutative 77.4%

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

   4. +-commutative 77.4%

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

   5. associate-+l+ 77.5%

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

   6. metadata-eval 77.5%

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

5. Applied egg-rr 77.5%

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

7. Simplified 99.9%

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

8. Final simplification 99.9%

   \[\leadsto \frac{\frac{2}{-1 - x}}{-1 + x} \]

Alternative 2: 74.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 1.55:\\ \;\;\;\;\left(1 - x\right) + \frac{-1}{-1 + x}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{-2}{x}}{x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x 1.55) (+ (- 1.0 x) (/ -1.0 (+ -1.0 x))) (/ (/ -2.0 x) x)))

C

double code(double x) {
	double tmp;
	if (x <= 1.55) {
		tmp = (1.0 - x) + (-1.0 / (-1.0 + x));
	} else {
		tmp = (-2.0 / x) / x;
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= 1.55d0) then
        tmp = (1.0d0 - x) + ((-1.0d0) / ((-1.0d0) + x))
    else
        tmp = ((-2.0d0) / x) / x
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= 1.55) {
		tmp = (1.0 - x) + (-1.0 / (-1.0 + x));
	} else {
		tmp = (-2.0 / x) / x;
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= 1.55:
		tmp = (1.0 - x) + (-1.0 / (-1.0 + x))
	else:
		tmp = (-2.0 / x) / x
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= 1.55)
		tmp = Float64(Float64(1.0 - x) + Float64(-1.0 / Float64(-1.0 + x)));
	else
		tmp = Float64(Float64(-2.0 / x) / x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= 1.55)
		tmp = (1.0 - x) + (-1.0 / (-1.0 + x));
	else
		tmp = (-2.0 / x) / x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, 1.55], N[(N[(1.0 - x), $MachinePrecision] + N[(-1.0 / N[(-1.0 + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(-2.0 / x), $MachinePrecision] / x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 1.55000000000000004

   1. Initial program 83.6%

      \[\frac{1}{x + 1} - \frac{1}{x - 1} \]

   2. Taylor expanded in x around 0 65.8%

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

      1. neg-mul-1 65.8%

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

      2. unsub-neg 65.8%

         \[\leadsto \color{blue}{\left(1 - x\right)} - \frac{1}{x - 1} \]

   4. Simplified 65.8%

      \[\leadsto \color{blue}{\left(1 - x\right)} - \frac{1}{x - 1} \]

   if 1.55000000000000004 < x

   1. Initial program 58.4%

      \[\frac{1}{x + 1} - \frac{1}{x - 1} \]

   2. Taylor expanded in x around inf 98.3%

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

      1. unpow2 98.3%

         \[\leadsto \frac{-2}{\color{blue}{x \cdot x}} \]

   4. Simplified 98.3%

      \[\leadsto \color{blue}{\frac{-2}{x \cdot x}} \]
   5. Step-by-step derivation

      1. frac-2neg 98.3%

         \[\leadsto \color{blue}{\frac{--2}{-x \cdot x}} \]

      2. metadata-eval 98.3%

         \[\leadsto \frac{\color{blue}{2}}{-x \cdot x} \]

      3. div-inv 98.3%

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

      4. distribute-rgt-neg-in 98.3%

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

   6. Applied egg-rr 98.3%

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

      1. metadata-eval 98.3%

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

      2. associate-/r* 99.8%

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

      3. times-frac 99.8%

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

      4. neg-mul-1 99.8%

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

      5. remove-double-neg 99.8%

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

      6. associate-*l/ 99.8%

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

      7. associate-*r/ 99.8%

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

      8. *-rgt-identity 99.8%

         \[\leadsto \frac{\color{blue}{\frac{-2}{x}}}{x} \]

   8. Simplified 99.8%

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

4. Final simplification 74.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 1.55:\\ \;\;\;\;\left(1 - x\right) + \frac{-1}{-1 + x}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{-2}{x}}{x}\\ \end{array} \]

Alternative 3: 74.1% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 1:\\ \;\;\;\;2 + x \cdot x\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{x \cdot x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x 1.0) (+ 2.0 (* x x)) (/ -2.0 (* x x))))

C

double code(double x) {
	double tmp;
	if (x <= 1.0) {
		tmp = 2.0 + (x * x);
	} else {
		tmp = -2.0 / (x * x);
	}
	return tmp;
}

Fortran

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

Java

public static double code(double x) {
	double tmp;
	if (x <= 1.0) {
		tmp = 2.0 + (x * x);
	} else {
		tmp = -2.0 / (x * x);
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= 1.0:
		tmp = 2.0 + (x * x)
	else:
		tmp = -2.0 / (x * x)
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= 1.0)
		tmp = Float64(2.0 + Float64(x * x));
	else
		tmp = Float64(-2.0 / Float64(x * x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= 1.0)
		tmp = 2.0 + (x * x);
	else
		tmp = -2.0 / (x * x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, 1.0], N[(2.0 + N[(x * x), $MachinePrecision]), $MachinePrecision], N[(-2.0 / N[(x * x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 1

   1. Initial program 83.6%

      \[\frac{1}{x + 1} - \frac{1}{x - 1} \]

   2. Taylor expanded in x around 0 65.8%

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

      1. neg-mul-1 65.8%

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

      2. unsub-neg 65.8%

         \[\leadsto \color{blue}{\left(1 - x\right)} - \frac{1}{x - 1} \]

   4. Simplified 65.8%

      \[\leadsto \color{blue}{\left(1 - x\right)} - \frac{1}{x - 1} \]

   5. Taylor expanded in x around 0 65.7%

      \[\leadsto \color{blue}{2 + {x}^{2}} \]
   6. Step-by-step derivation

      1. unpow2 65.7%

         \[\leadsto 2 + \color{blue}{x \cdot x} \]

   7. Simplified 65.7%

      \[\leadsto \color{blue}{2 + x \cdot x} \]

   if 1 < x

   1. Initial program 58.4%

      \[\frac{1}{x + 1} - \frac{1}{x - 1} \]

   2. Taylor expanded in x around inf 98.3%

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

      1. unpow2 98.3%

         \[\leadsto \frac{-2}{\color{blue}{x \cdot x}} \]

   4. Simplified 98.3%

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

4. Final simplification 73.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 1:\\ \;\;\;\;2 + x \cdot x\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{x \cdot x}\\ \end{array} \]

Alternative 4: 74.4% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 1:\\ \;\;\;\;2 + x \cdot x\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{-2}{x}}{x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x 1.0) (+ 2.0 (* x x)) (/ (/ -2.0 x) x)))

C

double code(double x) {
	double tmp;
	if (x <= 1.0) {
		tmp = 2.0 + (x * x);
	} else {
		tmp = (-2.0 / x) / x;
	}
	return tmp;
}

Fortran

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

Java

public static double code(double x) {
	double tmp;
	if (x <= 1.0) {
		tmp = 2.0 + (x * x);
	} else {
		tmp = (-2.0 / x) / x;
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= 1.0:
		tmp = 2.0 + (x * x)
	else:
		tmp = (-2.0 / x) / x
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= 1.0)
		tmp = Float64(2.0 + Float64(x * x));
	else
		tmp = Float64(Float64(-2.0 / x) / x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= 1.0)
		tmp = 2.0 + (x * x);
	else
		tmp = (-2.0 / x) / x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, 1.0], N[(2.0 + N[(x * x), $MachinePrecision]), $MachinePrecision], N[(N[(-2.0 / x), $MachinePrecision] / x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 1

   1. Initial program 83.6%

      \[\frac{1}{x + 1} - \frac{1}{x - 1} \]

   2. Taylor expanded in x around 0 65.8%

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

      1. neg-mul-1 65.8%

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

      2. unsub-neg 65.8%

         \[\leadsto \color{blue}{\left(1 - x\right)} - \frac{1}{x - 1} \]

   4. Simplified 65.8%

      \[\leadsto \color{blue}{\left(1 - x\right)} - \frac{1}{x - 1} \]

   5. Taylor expanded in x around 0 65.7%

      \[\leadsto \color{blue}{2 + {x}^{2}} \]
   6. Step-by-step derivation

      1. unpow2 65.7%

         \[\leadsto 2 + \color{blue}{x \cdot x} \]

   7. Simplified 65.7%

      \[\leadsto \color{blue}{2 + x \cdot x} \]

   if 1 < x

   1. Initial program 58.4%

      \[\frac{1}{x + 1} - \frac{1}{x - 1} \]

   2. Taylor expanded in x around inf 98.3%

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

      1. unpow2 98.3%

         \[\leadsto \frac{-2}{\color{blue}{x \cdot x}} \]

   4. Simplified 98.3%

      \[\leadsto \color{blue}{\frac{-2}{x \cdot x}} \]
   5. Step-by-step derivation

      1. frac-2neg 98.3%

         \[\leadsto \color{blue}{\frac{--2}{-x \cdot x}} \]

      2. metadata-eval 98.3%

         \[\leadsto \frac{\color{blue}{2}}{-x \cdot x} \]

      3. div-inv 98.3%

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

      4. distribute-rgt-neg-in 98.3%

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

   6. Applied egg-rr 98.3%

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

      1. metadata-eval 98.3%

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

      2. associate-/r* 99.8%

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

      3. times-frac 99.8%

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

      4. neg-mul-1 99.8%

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

      5. remove-double-neg 99.8%

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

      6. associate-*l/ 99.8%

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

      7. associate-*r/ 99.8%

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

      8. *-rgt-identity 99.8%

         \[\leadsto \frac{\color{blue}{\frac{-2}{x}}}{x} \]

   8. Simplified 99.8%

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

4. Final simplification 74.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 1:\\ \;\;\;\;2 + x \cdot x\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{-2}{x}}{x}\\ \end{array} \]

Alternative 5: 50.0% accurate, 11.0× speedup

Math

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

FPCore

(FPCore (x) :precision binary64 2.0)

C

double code(double x) {
	return 2.0;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = 2.0d0
end function

Java

public static double code(double x) {
	return 2.0;
}

Python

def code(x):
	return 2.0

Julia

function code(x)
	return 2.0
end

MATLAB

function tmp = code(x)
	tmp = 2.0;
end

Wolfram

code[x_] := 2.0

Derivation

1. Initial program 77.5%

   \[\frac{1}{x + 1} - \frac{1}{x - 1} \]

2. Taylor expanded in x around 0 50.7%

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

3. Final simplification 50.7%

   \[\leadsto 2 \]

Reproduce

herbie shell --seed 2023238 
(FPCore (x)
  :name "Asymptote A"
  :precision binary64
  (- (/ 1.0 (+ x 1.0)) (/ 1.0 (- x 1.0))))