Asymptote B

Percentage Accurate: 100.0% → 100.0%

Time: 4.3s

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}{1 + x} + \frac{1}{x + -1} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_] := N[(N[(x / N[(1.0 + x), $MachinePrecision]), $MachinePrecision] + N[(1.0 / 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{x}{1 + x} + \frac{1}{x + -1} \]
4. Add Preprocessing

Alternative 2: 98.4% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{x}{1 + x}\\ \mathbf{if}\;x \leq -62000 \lor \neg \left(x \leq 6.5 \cdot 10^{-10}\right):\\ \;\;\;\;t\_0 + \frac{1}{x}\\ \mathbf{else}:\\ \;\;\;\;t\_0 + \left(-1 - x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (/ x (+ 1.0 x))))
   (if (or (<= x -62000.0) (not (<= x 6.5e-10)))
     (+ t_0 (/ 1.0 x))
     (+ t_0 (- -1.0 x)))))

C

double code(double x) {
	double t_0 = x / (1.0 + x);
	double tmp;
	if ((x <= -62000.0) || !(x <= 6.5e-10)) {
		tmp = t_0 + (1.0 / x);
	} else {
		tmp = t_0 + (-1.0 - x);
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: t_0
    real(8) :: tmp
    t_0 = x / (1.0d0 + x)
    if ((x <= (-62000.0d0)) .or. (.not. (x <= 6.5d-10))) then
        tmp = t_0 + (1.0d0 / x)
    else
        tmp = t_0 + ((-1.0d0) - x)
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double t_0 = x / (1.0 + x);
	double tmp;
	if ((x <= -62000.0) || !(x <= 6.5e-10)) {
		tmp = t_0 + (1.0 / x);
	} else {
		tmp = t_0 + (-1.0 - x);
	}
	return tmp;
}

Python

def code(x):
	t_0 = x / (1.0 + x)
	tmp = 0
	if (x <= -62000.0) or not (x <= 6.5e-10):
		tmp = t_0 + (1.0 / x)
	else:
		tmp = t_0 + (-1.0 - x)
	return tmp

Julia

function code(x)
	t_0 = Float64(x / Float64(1.0 + x))
	tmp = 0.0
	if ((x <= -62000.0) || !(x <= 6.5e-10))
		tmp = Float64(t_0 + Float64(1.0 / x));
	else
		tmp = Float64(t_0 + Float64(-1.0 - x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	t_0 = x / (1.0 + x);
	tmp = 0.0;
	if ((x <= -62000.0) || ~((x <= 6.5e-10)))
		tmp = t_0 + (1.0 / x);
	else
		tmp = t_0 + (-1.0 - x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := Block[{t$95$0 = N[(x / N[(1.0 + x), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[x, -62000.0], N[Not[LessEqual[x, 6.5e-10]], $MachinePrecision]], N[(t$95$0 + N[(1.0 / x), $MachinePrecision]), $MachinePrecision], N[(t$95$0 + N[(-1.0 - x), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x < -62000 or 6.5000000000000003e-10 < 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 95.5%

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

   if -62000 < x < 6.5000000000000003e-10

   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.0%

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

      1. sub-neg 99.0%

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

      2. metadata-eval 99.0%

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

      3. neg-mul-1 99.0%

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

      4. +-commutative 99.0%

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

      5. unsub-neg 99.0%

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

   7. Simplified 99.0%

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

4. Final simplification 97.4%

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

Alternative 3: 98.4% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -62000:\\ \;\;\;\;1\\ \mathbf{elif}\;x \leq 6.5 \cdot 10^{-10}:\\ \;\;\;\;\frac{x}{1 + x} + \left(-1 - x\right)\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x -62000.0)
   1.0
   (if (<= x 6.5e-10) (+ (/ x (+ 1.0 x)) (- -1.0 x)) 1.0)))

C

double code(double x) {
	double tmp;
	if (x <= -62000.0) {
		tmp = 1.0;
	} else if (x <= 6.5e-10) {
		tmp = (x / (1.0 + 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 <= (-62000.0d0)) then
        tmp = 1.0d0
    else if (x <= 6.5d-10) then
        tmp = (x / (1.0d0 + 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 <= -62000.0) {
		tmp = 1.0;
	} else if (x <= 6.5e-10) {
		tmp = (x / (1.0 + x)) + (-1.0 - x);
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= -62000.0:
		tmp = 1.0
	elif x <= 6.5e-10:
		tmp = (x / (1.0 + x)) + (-1.0 - x)
	else:
		tmp = 1.0
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= -62000.0)
		tmp = 1.0;
	elseif (x <= 6.5e-10)
		tmp = Float64(Float64(x / Float64(1.0 + x)) + Float64(-1.0 - x));
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= -62000.0)
		tmp = 1.0;
	elseif (x <= 6.5e-10)
		tmp = (x / (1.0 + x)) + (-1.0 - x);
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, -62000.0], 1.0, If[LessEqual[x, 6.5e-10], N[(N[(x / N[(1.0 + x), $MachinePrecision]), $MachinePrecision] + N[(-1.0 - x), $MachinePrecision]), $MachinePrecision], 1.0]]

Derivation

1. Split input into 2 regimes

2. if x < -62000 or 6.5000000000000003e-10 < 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 95.5%

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

   if -62000 < x < 6.5000000000000003e-10

   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.0%

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

      1. sub-neg 99.0%

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

      2. metadata-eval 99.0%

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

      3. neg-mul-1 99.0%

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

      4. +-commutative 99.0%

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

      5. unsub-neg 99.0%

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

   7. Simplified 99.0%

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

Alternative 4: 98.3% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -62000:\\ \;\;\;\;1\\ \mathbf{elif}\;x \leq 6.5 \cdot 10^{-10}:\\ \;\;\;\;x + \frac{1}{x + -1}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x -62000.0) 1.0 (if (<= x 6.5e-10) (+ x (/ 1.0 (+ x -1.0))) 1.0)))

C

double code(double x) {
	double tmp;
	if (x <= -62000.0) {
		tmp = 1.0;
	} else if (x <= 6.5e-10) {
		tmp = x + (1.0 / (x + -1.0));
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= (-62000.0d0)) then
        tmp = 1.0d0
    else if (x <= 6.5d-10) then
        tmp = x + (1.0d0 / (x + (-1.0d0)))
    else
        tmp = 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= -62000.0) {
		tmp = 1.0;
	} else if (x <= 6.5e-10) {
		tmp = x + (1.0 / (x + -1.0));
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= -62000.0:
		tmp = 1.0
	elif x <= 6.5e-10:
		tmp = x + (1.0 / (x + -1.0))
	else:
		tmp = 1.0
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= -62000.0)
		tmp = 1.0;
	elseif (x <= 6.5e-10)
		tmp = Float64(x + Float64(1.0 / Float64(x + -1.0)));
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= -62000.0)
		tmp = 1.0;
	elseif (x <= 6.5e-10)
		tmp = x + (1.0 / (x + -1.0));
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, -62000.0], 1.0, If[LessEqual[x, 6.5e-10], N[(x + N[(1.0 / N[(x + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1.0]]

Derivation

1. Split input into 2 regimes

2. if x < -62000 or 6.5000000000000003e-10 < 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 95.5%

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

   if -62000 < x < 6.5000000000000003e-10

   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 98.9%

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

Alternative 5: 98.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x) {
	double tmp;
	if (x <= -62000.0) {
		tmp = 1.0;
	} else if (x <= 0.65) {
		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 <= (-62000.0d0)) then
        tmp = 1.0d0
    else if (x <= 0.65d0) 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 <= -62000.0) {
		tmp = 1.0;
	} else if (x <= 0.65) {
		tmp = -1.0;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -62000 or 0.650000000000000022 < 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.8%

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

   if -62000 < x < 0.650000000000000022

   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 97.6%

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

Alternative 6: 50.8% 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 54.5%

   \[\leadsto \color{blue}{-1} \]
6. Add Preprocessing

Reproduce

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