Asymptote B

Percentage Accurate: 100.0% → 100.0%

Time: 4.7s

Alternatives: 6

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

   1. +-commutative 100.0%

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

   2. +-commutative 100.0%

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

   3. sub-neg 100.0%

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

   4. metadata-eval 100.0%

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

3. Simplified 100.0%

   \[\leadsto \color{blue}{\frac{x}{1 + x} + \frac{1}{x + -1}} \]
4. Add Preprocessing
5. Step-by-step derivation

   1. +-commutative 100.0%

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

   2. clear-num 100.0%

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

   3. frac-add 100.0%

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

   4. *-un-lft-identity 100.0%

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

   5. +-commutative 100.0%

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

   6. *-commutative 100.0%

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

   7. *-un-lft-identity 100.0%

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

   8. +-commutative 100.0%

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

6. Applied egg-rr 100.0%

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

7. Taylor expanded in x around 0 100.0%

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

8. Taylor expanded in x around 0 100.0%

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

9. Final simplification 100.0%

   \[\leadsto \frac{x + \frac{1}{x}}{x - \frac{1}{x}} \]
10. Add Preprocessing

Alternative 2: 99.2% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x)
 :precision binary64
 (if (or (<= x -1.65) (not (<= x 0.75)))
   (/ x (- x (/ 1.0 x)))
   (+ (/ x (+ x 1.0)) (- -1.0 x))))

C

double code(double x) {
	double tmp;
	if ((x <= -1.65) || !(x <= 0.75)) {
		tmp = x / (x - (1.0 / x));
	} else {
		tmp = (x / (x + 1.0)) + (-1.0 - x);
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if ((x <= (-1.65d0)) .or. (.not. (x <= 0.75d0))) then
        tmp = x / (x - (1.0d0 / x))
    else
        tmp = (x / (x + 1.0d0)) + ((-1.0d0) - x)
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if ((x <= -1.65) || !(x <= 0.75)) {
		tmp = x / (x - (1.0 / x));
	} else {
		tmp = (x / (x + 1.0)) + (-1.0 - x);
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if (x <= -1.65) or not (x <= 0.75):
		tmp = x / (x - (1.0 / x))
	else:
		tmp = (x / (x + 1.0)) + (-1.0 - x)
	return tmp

Julia

function code(x)
	tmp = 0.0
	if ((x <= -1.65) || !(x <= 0.75))
		tmp = Float64(x / Float64(x - Float64(1.0 / x)));
	else
		tmp = Float64(Float64(x / Float64(x + 1.0)) + Float64(-1.0 - x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if ((x <= -1.65) || ~((x <= 0.75)))
		tmp = x / (x - (1.0 / x));
	else
		tmp = (x / (x + 1.0)) + (-1.0 - x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[Or[LessEqual[x, -1.65], N[Not[LessEqual[x, 0.75]], $MachinePrecision]], N[(x / N[(x - N[(1.0 / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(x / N[(x + 1.0), $MachinePrecision]), $MachinePrecision] + N[(-1.0 - x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.6499999999999999 or 0.75 < x

   1. Initial program 100.0%

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

      1. +-commutative 100.0%

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

      2. +-commutative 100.0%

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

      3. sub-neg 100.0%

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

      4. metadata-eval 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{x}{1 + x} + \frac{1}{x + -1}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. +-commutative 100.0%

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

      2. clear-num 100.0%

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

      3. frac-add 100.0%

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

      4. *-un-lft-identity 100.0%

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

      5. +-commutative 100.0%

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

      6. *-commutative 100.0%

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

      7. *-un-lft-identity 100.0%

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

      8. +-commutative 100.0%

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

   6. Applied egg-rr 100.0%

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

   7. Taylor expanded in x around 0 100.0%

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

   8. Taylor expanded in x around 0 100.0%

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

   9. Taylor expanded in x around inf 98.4%

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

   if -1.6499999999999999 < x < 0.75

   1. Initial program 100.0%

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

      1. +-commutative 100.0%

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

      2. +-commutative 100.0%

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

      3. sub-neg 100.0%

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

      4. metadata-eval 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{x}{1 + x} + \frac{1}{x + -1}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 99.9%

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

      1. sub-neg 99.9%

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

      2. metadata-eval 99.9%

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

      3. neg-mul-1 99.9%

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

      4. +-commutative 99.9%

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

      5. unsub-neg 99.9%

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

   7. Simplified 99.9%

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

4. Final simplification 99.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.65 \lor \neg \left(x \leq 0.75\right):\\ \;\;\;\;\frac{x}{x - \frac{1}{x}}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{x + 1} + \left(-1 - x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 99.2% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -0.72 \lor \neg \left(x \leq 0.7\right):\\ \;\;\;\;\frac{x}{x - \frac{1}{x}}\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (or (<= x -0.72) (not (<= x 0.7))) (/ x (- x (/ 1.0 x))) -1.0))

C

double code(double x) {
	double tmp;
	if ((x <= -0.72) || !(x <= 0.7)) {
		tmp = x / (x - (1.0 / x));
	} else {
		tmp = -1.0;
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if ((x <= (-0.72d0)) .or. (.not. (x <= 0.7d0))) then
        tmp = x / (x - (1.0d0 / x))
    else
        tmp = -1.0d0
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if ((x <= -0.72) || !(x <= 0.7)) {
		tmp = x / (x - (1.0 / x));
	} else {
		tmp = -1.0;
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if (x <= -0.72) or not (x <= 0.7):
		tmp = x / (x - (1.0 / x))
	else:
		tmp = -1.0
	return tmp

Julia

function code(x)
	tmp = 0.0
	if ((x <= -0.72) || !(x <= 0.7))
		tmp = Float64(x / Float64(x - Float64(1.0 / x)));
	else
		tmp = -1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if ((x <= -0.72) || ~((x <= 0.7)))
		tmp = x / (x - (1.0 / x));
	else
		tmp = -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[Or[LessEqual[x, -0.72], N[Not[LessEqual[x, 0.7]], $MachinePrecision]], N[(x / N[(x - N[(1.0 / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], -1.0]

Derivation

1. Split input into 2 regimes

2. if x < -0.71999999999999997 or 0.69999999999999996 < x

   1. Initial program 100.0%

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

      1. +-commutative 100.0%

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

      2. +-commutative 100.0%

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

      3. sub-neg 100.0%

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

      4. metadata-eval 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{x}{1 + x} + \frac{1}{x + -1}} \]
   4. Add Preprocessing
   5. Step-by-step derivation

      1. +-commutative 100.0%

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

      2. clear-num 100.0%

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

      3. frac-add 100.0%

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

      4. *-un-lft-identity 100.0%

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

      5. +-commutative 100.0%

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

      6. *-commutative 100.0%

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

      7. *-un-lft-identity 100.0%

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

      8. +-commutative 100.0%

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

   6. Applied egg-rr 100.0%

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

   7. Taylor expanded in x around 0 100.0%

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

   8. Taylor expanded in x around 0 100.0%

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

   9. Taylor expanded in x around inf 98.4%

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

   if -0.71999999999999997 < x < 0.69999999999999996

   1. Initial program 100.0%

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

      1. +-commutative 100.0%

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

      2. +-commutative 100.0%

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

      3. sub-neg 100.0%

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

      4. metadata-eval 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{x}{1 + x} + \frac{1}{x + -1}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 99.9%

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

4. Final simplification 99.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -0.72 \lor \neg \left(x \leq 0.7\right):\\ \;\;\;\;\frac{x}{x - \frac{1}{x}}\\ \mathbf{else}:\\ \;\;\;\;-1\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 99.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1:\\ \;\;\;\;1\\ \mathbf{elif}\;x \leq 1:\\ \;\;\;\;-1\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (if (<= x -1.0) 1.0 (if (<= x 1.0) -1.0 1.0)))

C

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

Fortran

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

Java

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

Python

def code(x):
	tmp = 0
	if x <= -1.0:
		tmp = 1.0
	elif x <= 1.0:
		tmp = -1.0
	else:
		tmp = 1.0
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= -1.0)
		tmp = 1.0;
	elseif (x <= 1.0)
		tmp = -1.0;
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= -1.0)
		tmp = 1.0;
	elseif (x <= 1.0)
		tmp = -1.0;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, -1.0], 1.0, If[LessEqual[x, 1.0], -1.0, 1.0]]

Derivation

1. Split input into 2 regimes

2. if x < -1 or 1 < x

   1. Initial program 100.0%

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

      1. +-commutative 100.0%

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

      2. +-commutative 100.0%

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

      3. sub-neg 100.0%

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

      4. metadata-eval 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{x}{1 + x} + \frac{1}{x + -1}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 98.4%

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

   if -1 < x < 1

   1. Initial program 100.0%

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

      1. +-commutative 100.0%

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

      2. +-commutative 100.0%

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

      3. sub-neg 100.0%

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

      4. metadata-eval 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{x}{1 + x} + \frac{1}{x + -1}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 99.9%

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

4. Final simplification 99.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1:\\ \;\;\;\;1\\ \mathbf{elif}\;x \leq 1:\\ \;\;\;\;-1\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[\frac{1}{x - 1} + \frac{x}{x + 1} \]
2. Add Preprocessing

3. Final simplification 100.0%

   \[\leadsto \frac{1}{x + -1} + \frac{x}{x + 1} \]
4. Add Preprocessing

Alternative 6: 50.2% accurate, 11.0× speedup

Math

\[\begin{array}{l} \\ -1 \end{array} \]

FPCore

(FPCore (x) :precision binary64 -1.0)

C

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

Fortran

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

Java

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

Python

def code(x):
	return -1.0

Julia

function code(x)
	return -1.0
end

MATLAB

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

Wolfram

code[x_] := -1.0

Derivation

1. Initial program 100.0%

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

   1. +-commutative 100.0%

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

   2. +-commutative 100.0%

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

   3. sub-neg 100.0%

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

   4. metadata-eval 100.0%

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

3. Simplified 100.0%

   \[\leadsto \color{blue}{\frac{x}{1 + x} + \frac{1}{x + -1}} \]
4. Add Preprocessing

5. Taylor expanded in x around 0 50.4%

   \[\leadsto \color{blue}{-1} \]

6. Final simplification 50.4%

   \[\leadsto -1 \]
7. Add Preprocessing

Reproduce

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