Asymptote C

Percentage Accurate: 54.8% → 99.0%

Time: 5.6s

Alternatives: 6

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 54.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.0% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x)
 :precision binary64
 (if (<= (- (/ x (+ x 1.0)) (/ (+ x 1.0) (+ x -1.0))) 2e-5)
   (/ (+ -3.0 (/ (+ -1.0 (/ (+ -3.0 (/ -1.0 x)) x)) x)) x)
   (+ 1.0 (* x 3.0))))

C

double code(double x) {
	double tmp;
	if (((x / (x + 1.0)) - ((x + 1.0) / (x + -1.0))) <= 2e-5) {
		tmp = (-3.0 + ((-1.0 + ((-3.0 + (-1.0 / x)) / x)) / x)) / x;
	} else {
		tmp = 1.0 + (x * 3.0);
	}
	return tmp;
}

Fortran

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

Java

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

Python

def code(x):
	tmp = 0
	if ((x / (x + 1.0)) - ((x + 1.0) / (x + -1.0))) <= 2e-5:
		tmp = (-3.0 + ((-1.0 + ((-3.0 + (-1.0 / x)) / x)) / x)) / x
	else:
		tmp = 1.0 + (x * 3.0)
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (((x / (x + 1.0)) - ((x + 1.0) / (x + -1.0))) <= 2e-5)
		tmp = (-3.0 + ((-1.0 + ((-3.0 + (-1.0 / x)) / x)) / x)) / x;
	else
		tmp = 1.0 + (x * 3.0);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (-.f64 (/.f64 x (+.f64 x #s(literal 1 binary64))) (/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64)))) < 2.00000000000000016e-5

   1. Initial program 8.0%

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

      1. remove-double-neg 8.0%

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

      2. distribute-neg-frac 8.0%

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

      3. distribute-neg-in 8.0%

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

      4. sub-neg 8.0%

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

      5. distribute-frac-neg2 8.0%

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

      6. sub-neg 8.0%

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

      7. +-commutative 8.0%

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

      8. unsub-neg 8.0%

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

      9. metadata-eval 8.0%

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

      10. neg-sub0 8.0%

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

      11. associate-+l- 8.0%

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

      12. neg-sub0 8.0%

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

      13. +-commutative 8.0%

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

      14. unsub-neg 8.0%

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

   3. Simplified 8.0%

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

   5. Taylor expanded in x around inf 100.0%

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

   7. Simplified 100.0%

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

   if 2.00000000000000016e-5 < (-.f64 (/.f64 x (+.f64 x #s(literal 1 binary64))) (/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))))

   1. Initial program 100.0%

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

      1. remove-double-neg 100.0%

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

      2. distribute-neg-frac 100.0%

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

      3. distribute-neg-in 100.0%

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

      4. sub-neg 100.0%

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

      5. distribute-frac-neg2 100.0%

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

      6. sub-neg 100.0%

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

      7. +-commutative 100.0%

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

      8. unsub-neg 100.0%

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

      9. metadata-eval 100.0%

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

      10. neg-sub0 100.0%

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

      11. associate-+l- 100.0%

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

      12. neg-sub0 100.0%

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

      13. +-commutative 100.0%

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

      14. unsub-neg 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in x around 0 100.0%

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

4. Final simplification 100.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{x}{x + 1} - \frac{x + 1}{x + -1} \leq 2 \cdot 10^{-5}:\\ \;\;\;\;\frac{-3 + \frac{-1 + \frac{-3 + \frac{-1}{x}}{x}}{x}}{x}\\ \mathbf{else}:\\ \;\;\;\;1 + x \cdot 3\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 98.9% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (x)
 :precision binary64
 (if (<= (- (/ x (+ x 1.0)) (/ (+ x 1.0) (+ x -1.0))) 2e-5)
   (/ (- -3.0 (/ (+ 1.0 (/ 3.0 x)) x)) x)
   (+ 1.0 (* x 3.0))))

C

double code(double x) {
	double tmp;
	if (((x / (x + 1.0)) - ((x + 1.0) / (x + -1.0))) <= 2e-5) {
		tmp = (-3.0 - ((1.0 + (3.0 / x)) / x)) / x;
	} else {
		tmp = 1.0 + (x * 3.0);
	}
	return tmp;
}

Fortran

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

Java

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

Python

def code(x):
	tmp = 0
	if ((x / (x + 1.0)) - ((x + 1.0) / (x + -1.0))) <= 2e-5:
		tmp = (-3.0 - ((1.0 + (3.0 / x)) / x)) / x
	else:
		tmp = 1.0 + (x * 3.0)
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (((x / (x + 1.0)) - ((x + 1.0) / (x + -1.0))) <= 2e-5)
		tmp = (-3.0 - ((1.0 + (3.0 / x)) / x)) / x;
	else
		tmp = 1.0 + (x * 3.0);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (-.f64 (/.f64 x (+.f64 x #s(literal 1 binary64))) (/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64)))) < 2.00000000000000016e-5

   1. Initial program 8.0%

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

      1. remove-double-neg 8.0%

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

      2. distribute-neg-frac 8.0%

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

      3. distribute-neg-in 8.0%

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

      4. sub-neg 8.0%

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

      5. distribute-frac-neg2 8.0%

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

      6. sub-neg 8.0%

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

      7. +-commutative 8.0%

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

      8. unsub-neg 8.0%

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

      9. metadata-eval 8.0%

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

      10. neg-sub0 8.0%

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

      11. associate-+l- 8.0%

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

      12. neg-sub0 8.0%

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

      13. +-commutative 8.0%

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

      14. unsub-neg 8.0%

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

   3. Simplified 8.0%

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

   5. Taylor expanded in x around inf 99.8%

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

      1. sub-neg 99.8%

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

      2. metadata-eval 99.8%

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

      3. +-commutative 99.8%

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

      4. mul-1-neg 99.8%

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

      5. unsub-neg 99.8%

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

      6. associate-*r/ 99.8%

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

      7. metadata-eval 99.8%

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

   7. Simplified 99.8%

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

   if 2.00000000000000016e-5 < (-.f64 (/.f64 x (+.f64 x #s(literal 1 binary64))) (/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))))

   1. Initial program 100.0%

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

      1. remove-double-neg 100.0%

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

      2. distribute-neg-frac 100.0%

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

      3. distribute-neg-in 100.0%

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

      4. sub-neg 100.0%

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

      5. distribute-frac-neg2 100.0%

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

      6. sub-neg 100.0%

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

      7. +-commutative 100.0%

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

      8. unsub-neg 100.0%

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

      9. metadata-eval 100.0%

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

      10. neg-sub0 100.0%

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

      11. associate-+l- 100.0%

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

      12. neg-sub0 100.0%

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

      13. +-commutative 100.0%

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

      14. unsub-neg 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in x around 0 100.0%

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

4. Final simplification 99.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{x}{x + 1} - \frac{x + 1}{x + -1} \leq 2 \cdot 10^{-5}:\\ \;\;\;\;\frac{-3 - \frac{1 + \frac{3}{x}}{x}}{x}\\ \mathbf{else}:\\ \;\;\;\;1 + x \cdot 3\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 99.0% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1 or 1 < x

   1. Initial program 8.0%

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

      1. remove-double-neg 8.0%

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

      2. distribute-neg-frac 8.0%

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

      3. distribute-neg-in 8.0%

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

      4. sub-neg 8.0%

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

      5. distribute-frac-neg2 8.0%

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

      6. sub-neg 8.0%

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

      7. +-commutative 8.0%

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

      8. unsub-neg 8.0%

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

      9. metadata-eval 8.0%

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

      10. neg-sub0 8.0%

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

      11. associate-+l- 8.0%

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

      12. neg-sub0 8.0%

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

      13. +-commutative 8.0%

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

      14. unsub-neg 8.0%

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

   3. Simplified 8.0%

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

   5. Taylor expanded in x around inf 99.5%

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

      1. associate-*r/ 99.5%

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

      2. distribute-lft-in 99.5%

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

      3. metadata-eval 99.5%

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

      4. neg-mul-1 99.5%

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

      5. distribute-neg-frac 99.5%

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

      6. metadata-eval 99.5%

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

   7. Simplified 99.5%

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

   if -1 < x < 1

   1. Initial program 100.0%

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

      1. remove-double-neg 100.0%

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

      2. distribute-neg-frac 100.0%

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

      3. distribute-neg-in 100.0%

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

      4. sub-neg 100.0%

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

      5. distribute-frac-neg2 100.0%

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

      6. sub-neg 100.0%

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

      7. +-commutative 100.0%

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

      8. unsub-neg 100.0%

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

      9. metadata-eval 100.0%

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

      10. neg-sub0 100.0%

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

      11. associate-+l- 100.0%

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

      12. neg-sub0 100.0%

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

      13. +-commutative 100.0%

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

      14. unsub-neg 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in x around 0 100.0%

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

4. Final simplification 99.7%

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

Alternative 4: 98.6% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1 or 1 < x

   1. Initial program 8.0%

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

      1. remove-double-neg 8.0%

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

      2. distribute-neg-frac 8.0%

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

      3. distribute-neg-in 8.0%

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

      4. sub-neg 8.0%

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

      5. distribute-frac-neg2 8.0%

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

      6. sub-neg 8.0%

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

      7. +-commutative 8.0%

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

      8. unsub-neg 8.0%

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

      9. metadata-eval 8.0%

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

      10. neg-sub0 8.0%

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

      11. associate-+l- 8.0%

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

      12. neg-sub0 8.0%

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

      13. +-commutative 8.0%

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

      14. unsub-neg 8.0%

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

   3. Simplified 8.0%

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

   5. Taylor expanded in x around inf 98.4%

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

   if -1 < x < 1

   1. Initial program 100.0%

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

      1. remove-double-neg 100.0%

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

      2. distribute-neg-frac 100.0%

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

      3. distribute-neg-in 100.0%

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

      4. sub-neg 100.0%

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

      5. distribute-frac-neg2 100.0%

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

      6. sub-neg 100.0%

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

      7. +-commutative 100.0%

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

      8. unsub-neg 100.0%

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

      9. metadata-eval 100.0%

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

      10. neg-sub0 100.0%

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

      11. associate-+l- 100.0%

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

      12. neg-sub0 100.0%

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

      13. +-commutative 100.0%

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

      14. unsub-neg 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in x around 0 100.0%

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

4. Final simplification 99.2%

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

Alternative 5: 98.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1 or 1 < x

   1. Initial program 8.0%

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

      1. remove-double-neg 8.0%

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

      2. distribute-neg-frac 8.0%

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

      3. distribute-neg-in 8.0%

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

      4. sub-neg 8.0%

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

      5. distribute-frac-neg2 8.0%

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

      6. sub-neg 8.0%

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

      7. +-commutative 8.0%

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

      8. unsub-neg 8.0%

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

      9. metadata-eval 8.0%

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

      10. neg-sub0 8.0%

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

      11. associate-+l- 8.0%

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

      12. neg-sub0 8.0%

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

      13. +-commutative 8.0%

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

      14. unsub-neg 8.0%

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

   3. Simplified 8.0%

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

   5. Taylor expanded in x around inf 98.4%

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

   if -1 < x < 1

   1. Initial program 100.0%

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

      1. remove-double-neg 100.0%

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

      2. distribute-neg-frac 100.0%

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

      3. distribute-neg-in 100.0%

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

      4. sub-neg 100.0%

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

      5. distribute-frac-neg2 100.0%

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

      6. sub-neg 100.0%

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

      7. +-commutative 100.0%

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

      8. unsub-neg 100.0%

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

      9. metadata-eval 100.0%

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

      10. neg-sub0 100.0%

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

      11. associate-+l- 100.0%

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

      12. neg-sub0 100.0%

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

      13. +-commutative 100.0%

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

      14. unsub-neg 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in x around 0 99.7%

      \[\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 \lor \neg \left(x \leq 1\right):\\ \;\;\;\;\frac{-3}{x}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 51.4% accurate, 13.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 55.1%

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

   1. remove-double-neg 55.1%

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

   2. distribute-neg-frac 55.1%

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

   3. distribute-neg-in 55.1%

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

   4. sub-neg 55.1%

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

   5. distribute-frac-neg2 55.1%

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

   6. sub-neg 55.1%

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

   7. +-commutative 55.1%

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

   8. unsub-neg 55.1%

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

   9. metadata-eval 55.1%

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

   10. neg-sub0 55.1%

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

   11. associate-+l- 55.1%

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

   12. neg-sub0 55.1%

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

   13. +-commutative 55.1%

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

   14. unsub-neg 55.1%

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

3. Simplified 55.1%

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

5. Taylor expanded in x around 0 52.9%

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

6. Final simplification 52.9%

   \[\leadsto 1 \]
7. Add Preprocessing

Reproduce

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