Asymptote C

Percentage Accurate: 53.6% → 99.8%

Time: 6.4s

Alternatives: 9

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: 53.6% 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.8% accurate, 0.4× speedup

Math

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

FPCore

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

C

double code(double x) {
	double tmp;
	if (((x / (x + 1.0)) - ((x + 1.0) / (x + -1.0))) <= 0.0) {
		tmp = (((-1.0 + ((-3.0 + (-1.0 / x)) / x)) / x) - 3.0) / x;
	} else {
		tmp = (1.0 + (x * 3.0)) / ((x + -1.0) * (-1.0 - x));
	}
	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)))) <= 0.0d0) then
        tmp = ((((-1.0d0) + (((-3.0d0) + ((-1.0d0) / x)) / x)) / x) - 3.0d0) / x
    else
        tmp = (1.0d0 + (x * 3.0d0)) / ((x + (-1.0d0)) * ((-1.0d0) - x))
    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))) <= 0.0) {
		tmp = (((-1.0 + ((-3.0 + (-1.0 / x)) / x)) / x) - 3.0) / x;
	} else {
		tmp = (1.0 + (x * 3.0)) / ((x + -1.0) * (-1.0 - x));
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if ((x / (x + 1.0)) - ((x + 1.0) / (x + -1.0))) <= 0.0:
		tmp = (((-1.0 + ((-3.0 + (-1.0 / x)) / x)) / x) - 3.0) / x
	else:
		tmp = (1.0 + (x * 3.0)) / ((x + -1.0) * (-1.0 - x))
	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))) <= 0.0)
		tmp = Float64(Float64(Float64(Float64(-1.0 + Float64(Float64(-3.0 + Float64(-1.0 / x)) / x)) / x) - 3.0) / x);
	else
		tmp = Float64(Float64(1.0 + Float64(x * 3.0)) / Float64(Float64(x + -1.0) * Float64(-1.0 - x)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (((x / (x + 1.0)) - ((x + 1.0) / (x + -1.0))) <= 0.0)
		tmp = (((-1.0 + ((-3.0 + (-1.0 / x)) / x)) / x) - 3.0) / x;
	else
		tmp = (1.0 + (x * 3.0)) / ((x + -1.0) * (-1.0 - x));
	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], 0.0], N[(N[(N[(N[(-1.0 + N[(N[(-3.0 + N[(-1.0 / x), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision] - 3.0), $MachinePrecision] / x), $MachinePrecision], N[(N[(1.0 + N[(x * 3.0), $MachinePrecision]), $MachinePrecision] / N[(N[(x + -1.0), $MachinePrecision] * N[(-1.0 - x), $MachinePrecision]), $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)))) < 0.0

   1. Initial program 7.1%

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

      1. remove-double-neg 7.1%

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

      2. distribute-neg-frac 7.1%

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

      3. distribute-neg-in 7.1%

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

      4. sub-neg 7.1%

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

      5. distribute-frac-neg2 7.1%

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

      6. sub-neg 7.1%

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

      7. +-commutative 7.1%

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

      8. unsub-neg 7.1%

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

      9. metadata-eval 7.1%

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

      10. neg-sub0 7.1%

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

      11. associate-+l- 7.1%

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

      12. neg-sub0 7.1%

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

      13. +-commutative 7.1%

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

      14. unsub-neg 7.1%

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

   3. Simplified 7.1%

      \[\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{3 + \frac{1}{x}}{{x}^{2}} - \left(3 + \frac{1}{x}\right)}{x}} \]
   6. Step-by-step derivation

   7. Simplified 99.8%

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

   if 0.0 < (-.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 99.1%

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

      1. remove-double-neg 99.1%

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

      2. distribute-neg-frac 99.1%

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

      3. distribute-neg-in 99.1%

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

      4. sub-neg 99.1%

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

      5. distribute-frac-neg2 99.1%

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

      6. sub-neg 99.1%

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

      7. +-commutative 99.1%

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

      8. unsub-neg 99.1%

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

      9. metadata-eval 99.1%

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

      10. neg-sub0 99.1%

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

      11. associate-+l- 99.1%

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

      12. neg-sub0 99.1%

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

      13. +-commutative 99.1%

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

      14. unsub-neg 99.1%

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

   3. Simplified 99.1%

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

      1. frac-2neg 99.1%

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

      2. frac-2neg 99.1%

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

      3. frac-sub 99.1%

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

   6. Applied egg-rr 99.1%

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

   7. Taylor expanded in x around inf 99.7%

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

      1. distribute-rgt-in 99.7%

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

      2. *-commutative 99.7%

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

      3. lft-mult-inverse 100.0%

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

   9. Applied egg-rr 100.0%

      \[\leadsto \frac{\color{blue}{x \cdot 3 + 1}}{\left(-1 - x\right) \cdot \left(x + -1\right)} \]
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 0:\\ \;\;\;\;\frac{\frac{-1 + \frac{-3 + \frac{-1}{x}}{x}}{x} - 3}{x}\\ \mathbf{else}:\\ \;\;\;\;\frac{1 + x \cdot 3}{\left(x + -1\right) \cdot \left(-1 - x\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 99.8% accurate, 0.4× speedup

Math

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

FPCore

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

C

double code(double x) {
	double tmp;
	if (((x / (x + 1.0)) - ((x + 1.0) / (x + -1.0))) <= 0.0) {
		tmp = (-3.0 - ((1.0 + (3.0 / x)) / x)) / x;
	} else {
		tmp = (1.0 + (x * 3.0)) / ((x + -1.0) * (-1.0 - x));
	}
	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)))) <= 0.0d0) then
        tmp = ((-3.0d0) - ((1.0d0 + (3.0d0 / x)) / x)) / x
    else
        tmp = (1.0d0 + (x * 3.0d0)) / ((x + (-1.0d0)) * ((-1.0d0) - x))
    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))) <= 0.0) {
		tmp = (-3.0 - ((1.0 + (3.0 / x)) / x)) / x;
	} else {
		tmp = (1.0 + (x * 3.0)) / ((x + -1.0) * (-1.0 - x));
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if ((x / (x + 1.0)) - ((x + 1.0) / (x + -1.0))) <= 0.0:
		tmp = (-3.0 - ((1.0 + (3.0 / x)) / x)) / x
	else:
		tmp = (1.0 + (x * 3.0)) / ((x + -1.0) * (-1.0 - x))
	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))) <= 0.0)
		tmp = Float64(Float64(-3.0 - Float64(Float64(1.0 + Float64(3.0 / x)) / x)) / x);
	else
		tmp = Float64(Float64(1.0 + Float64(x * 3.0)) / Float64(Float64(x + -1.0) * Float64(-1.0 - x)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (((x / (x + 1.0)) - ((x + 1.0) / (x + -1.0))) <= 0.0)
		tmp = (-3.0 - ((1.0 + (3.0 / x)) / x)) / x;
	else
		tmp = (1.0 + (x * 3.0)) / ((x + -1.0) * (-1.0 - x));
	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], 0.0], N[(N[(-3.0 - N[(N[(1.0 + N[(3.0 / x), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision], N[(N[(1.0 + N[(x * 3.0), $MachinePrecision]), $MachinePrecision] / N[(N[(x + -1.0), $MachinePrecision] * N[(-1.0 - x), $MachinePrecision]), $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)))) < 0.0

   1. Initial program 7.1%

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

      1. remove-double-neg 7.1%

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

      2. distribute-neg-frac 7.1%

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

      3. distribute-neg-in 7.1%

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

      4. sub-neg 7.1%

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

      5. distribute-frac-neg2 7.1%

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

      6. sub-neg 7.1%

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

      7. +-commutative 7.1%

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

      8. unsub-neg 7.1%

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

      9. metadata-eval 7.1%

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

      10. neg-sub0 7.1%

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

      11. associate-+l- 7.1%

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

      12. neg-sub0 7.1%

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

      13. +-commutative 7.1%

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

      14. unsub-neg 7.1%

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

   3. Simplified 7.1%

      \[\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}{\frac{-1 \cdot \frac{1 + 3 \cdot \frac{1}{x}}{x} - 3}{x}} \]
   6. Step-by-step derivation

      1. sub-neg 99.5%

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

      2. metadata-eval 99.5%

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

      3. +-commutative 99.5%

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

      4. mul-1-neg 99.5%

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

      5. unsub-neg 99.5%

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

      6. associate-*r/ 99.5%

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

      7. metadata-eval 99.5%

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

   7. Simplified 99.5%

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

   if 0.0 < (-.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 99.1%

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

      1. remove-double-neg 99.1%

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

      2. distribute-neg-frac 99.1%

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

      3. distribute-neg-in 99.1%

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

      4. sub-neg 99.1%

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

      5. distribute-frac-neg2 99.1%

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

      6. sub-neg 99.1%

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

      7. +-commutative 99.1%

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

      8. unsub-neg 99.1%

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

      9. metadata-eval 99.1%

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

      10. neg-sub0 99.1%

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

      11. associate-+l- 99.1%

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

      12. neg-sub0 99.1%

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

      13. +-commutative 99.1%

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

      14. unsub-neg 99.1%

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

   3. Simplified 99.1%

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

      1. frac-2neg 99.1%

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

      2. frac-2neg 99.1%

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

      3. frac-sub 99.1%

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

   6. Applied egg-rr 99.1%

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

   7. Taylor expanded in x around inf 99.7%

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

      1. distribute-rgt-in 99.7%

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

      2. *-commutative 99.7%

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

      3. lft-mult-inverse 100.0%

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

   9. Applied egg-rr 100.0%

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

4. Final simplification 99.8%

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

Alternative 3: 99.8% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_] := Block[{t$95$0 = N[(N[(x / N[(x + 1.0), $MachinePrecision]), $MachinePrecision] - N[(N[(x + 1.0), $MachinePrecision] / N[(x + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 2e-5], N[(N[(-3.0 - N[(N[(1.0 + N[(3.0 / x), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision], t$95$0]]

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

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

      1. remove-double-neg 8.5%

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

      2. distribute-neg-frac 8.5%

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

      3. distribute-neg-in 8.5%

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

      4. sub-neg 8.5%

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

      5. distribute-frac-neg2 8.5%

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

      6. sub-neg 8.5%

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

      7. +-commutative 8.5%

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

      8. unsub-neg 8.5%

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

      9. metadata-eval 8.5%

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

      10. neg-sub0 8.5%

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

      11. associate-+l- 8.5%

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

      12. neg-sub0 8.5%

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

      13. +-commutative 8.5%

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

      14. unsub-neg 8.5%

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

   3. Simplified 8.5%

      \[\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}{\frac{-1 \cdot \frac{1 + 3 \cdot \frac{1}{x}}{x} - 3}{x}} \]
   6. Step-by-step derivation

      1. sub-neg 99.5%

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

      2. metadata-eval 99.5%

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

      3. +-commutative 99.5%

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

      4. mul-1-neg 99.5%

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

      5. unsub-neg 99.5%

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

      6. associate-*r/ 99.5%

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

      7. metadata-eval 99.5%

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

   7. Simplified 99.5%

      \[\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 99.9%

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

4. Final simplification 99.7%

   \[\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}:\\ \;\;\;\;\frac{x}{x + 1} - \frac{x + 1}{x + -1}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 99.3% accurate, 0.6× speedup

Math

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

FPCore

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

C

double code(double x) {
	double tmp;
	if ((x <= -1.0) || !(x <= 1.0)) {
		tmp = (-3.0 - ((1.0 + (3.0 / x)) / x)) / x;
	} else {
		tmp = 1.0 + (x * (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 + (3.0d0 / x)) / x)) / x
    else
        tmp = 1.0d0 + (x * (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 + (3.0 / x)) / x)) / x;
	} else {
		tmp = 1.0 + (x * (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 + (3.0 / x)) / x)) / x
	else:
		tmp = 1.0 + (x * (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(Float64(1.0 + Float64(3.0 / x)) / x)) / x);
	else
		tmp = Float64(1.0 + Float64(x * 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 + (3.0 / x)) / x)) / x;
	else
		tmp = 1.0 + (x * (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[(N[(1.0 + N[(3.0 / x), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision], N[(1.0 + N[(x * N[(x + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1 or 1 < x

   1. Initial program 10.1%

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

      1. remove-double-neg 10.1%

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

      2. distribute-neg-frac 10.1%

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

      3. distribute-neg-in 10.1%

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

      4. sub-neg 10.1%

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

      5. distribute-frac-neg2 10.1%

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

      6. sub-neg 10.1%

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

      7. +-commutative 10.1%

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

      8. unsub-neg 10.1%

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

      9. metadata-eval 10.1%

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

      10. neg-sub0 10.1%

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

      11. associate-+l- 10.1%

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

      12. neg-sub0 10.1%

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

      13. +-commutative 10.1%

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

      14. unsub-neg 10.1%

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

   3. Simplified 10.1%

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

   5. Taylor expanded in x around inf 98.6%

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

      1. sub-neg 98.6%

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

      2. metadata-eval 98.6%

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

      3. +-commutative 98.6%

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

      4. mul-1-neg 98.6%

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

      5. unsub-neg 98.6%

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

      6. associate-*r/ 98.6%

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

      7. metadata-eval 98.6%

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

   7. Simplified 98.6%

      \[\leadsto \color{blue}{\frac{-3 - \frac{1 + \frac{3}{x}}{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 98.6%

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

4. Final simplification 98.6%

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

Alternative 5: 99.1% 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 \left(x + 3\right)\\ \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 (+ 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 * (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 * (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 * (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 * (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 * 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 * (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 * N[(x + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1 or 1 < x

   1. Initial program 10.1%

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

      1. remove-double-neg 10.1%

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

      2. distribute-neg-frac 10.1%

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

      3. distribute-neg-in 10.1%

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

      4. sub-neg 10.1%

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

      5. distribute-frac-neg2 10.1%

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

      6. sub-neg 10.1%

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

      7. +-commutative 10.1%

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

      8. unsub-neg 10.1%

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

      9. metadata-eval 10.1%

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

      10. neg-sub0 10.1%

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

      11. associate-+l- 10.1%

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

      12. neg-sub0 10.1%

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

      13. +-commutative 10.1%

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

      14. unsub-neg 10.1%

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

   3. Simplified 10.1%

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

   5. Taylor expanded in x around inf 97.8%

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

      1. associate-*r/ 97.8%

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

      2. neg-mul-1 97.8%

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

      3. distribute-neg-in 97.8%

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

      4. metadata-eval 97.8%

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

      5. distribute-neg-frac 97.8%

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

      6. metadata-eval 97.8%

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

   7. Simplified 97.8%

      \[\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 98.6%

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

4. Final simplification 98.2%

   \[\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 \left(x + 3\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 98.6% 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}{x}\\ \mathbf{else}:\\ \;\;\;\;1 + x \cdot \left(x + 3\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (or (<= x -1.0) (not (<= x 1.0))) (/ -3.0 x) (+ 1.0 (* x (+ 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 * (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 * (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 * (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 * (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 * 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 * (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 * N[(x + 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1 or 1 < x

   1. Initial program 10.1%

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

      1. remove-double-neg 10.1%

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

      2. distribute-neg-frac 10.1%

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

      3. distribute-neg-in 10.1%

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

      4. sub-neg 10.1%

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

      5. distribute-frac-neg2 10.1%

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

      6. sub-neg 10.1%

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

      7. +-commutative 10.1%

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

      8. unsub-neg 10.1%

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

      9. metadata-eval 10.1%

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

      10. neg-sub0 10.1%

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

      11. associate-+l- 10.1%

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

      12. neg-sub0 10.1%

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

      13. +-commutative 10.1%

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

      14. unsub-neg 10.1%

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

   3. Simplified 10.1%

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

   5. Taylor expanded in x around inf 96.7%

      \[\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 98.6%

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

4. Final simplification 97.8%

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

Alternative 7: 98.5% 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 10.1%

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

      1. remove-double-neg 10.1%

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

      2. distribute-neg-frac 10.1%

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

      3. distribute-neg-in 10.1%

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

      4. sub-neg 10.1%

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

      5. distribute-frac-neg2 10.1%

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

      6. sub-neg 10.1%

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

      7. +-commutative 10.1%

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

      8. unsub-neg 10.1%

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

      9. metadata-eval 10.1%

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

      10. neg-sub0 10.1%

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

      11. associate-+l- 10.1%

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

      12. neg-sub0 10.1%

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

      13. +-commutative 10.1%

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

      14. unsub-neg 10.1%

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

   3. Simplified 10.1%

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

   5. Taylor expanded in x around inf 96.7%

      \[\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 98.4%

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

4. Final simplification 97.6%

   \[\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 8: 97.8% 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 10.1%

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

      1. remove-double-neg 10.1%

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

      2. distribute-neg-frac 10.1%

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

      3. distribute-neg-in 10.1%

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

      4. sub-neg 10.1%

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

      5. distribute-frac-neg2 10.1%

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

      6. sub-neg 10.1%

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

      7. +-commutative 10.1%

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

      8. unsub-neg 10.1%

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

      9. metadata-eval 10.1%

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

      10. neg-sub0 10.1%

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

      11. associate-+l- 10.1%

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

      12. neg-sub0 10.1%

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

      13. +-commutative 10.1%

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

      14. unsub-neg 10.1%

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

   3. Simplified 10.1%

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

   5. Taylor expanded in x around inf 96.7%

      \[\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 96.9%

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

4. Final simplification 96.8%

   \[\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 9: 50.2% 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 60.3%

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

   1. remove-double-neg 60.3%

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

   2. distribute-neg-frac 60.3%

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

   3. distribute-neg-in 60.3%

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

   4. sub-neg 60.3%

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

   5. distribute-frac-neg2 60.3%

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

   6. sub-neg 60.3%

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

   7. +-commutative 60.3%

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

   8. unsub-neg 60.3%

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

   9. metadata-eval 60.3%

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

   10. neg-sub0 60.3%

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

   11. associate-+l- 60.3%

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

   12. neg-sub0 60.3%

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

   13. +-commutative 60.3%

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

   14. unsub-neg 60.3%

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

3. Simplified 60.3%

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

5. Taylor expanded in x around 0 55.9%

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

Reproduce

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