Asymptote B

Percentage Accurate: 100.0% → 100.0%

Time: 5.0s

Alternatives: 5

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

3. Final simplification 100.0%

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

Alternative 2: 99.0% accurate, 0.6× speedup

Math

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

FPCore

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

C

double code(double x) {
	double tmp;
	if ((x <= -1.0) || !(x <= 1.92)) {
		tmp = (x + -1.0) / (x + -1.0);
	} else {
		tmp = x + (1.0 / (x + -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.92d0))) then
        tmp = (x + (-1.0d0)) / (x + (-1.0d0))
    else
        tmp = x + (1.0d0 / (x + (-1.0d0)))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1 or 1.9199999999999999 < x

   1. Initial program 100.0%

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

      1. +-commutative 100.0%

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

      2. +-commutative 100.0%

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

      3. sub-neg 100.0%

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

      4. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

      1. frac-add 48.7%

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

      2. associate-/r* 50.2%

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

      3. fma-define 50.2%

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

      4. *-rgt-identity 50.2%

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

      5. +-commutative 50.2%

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

      6. +-commutative 50.2%

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

   6. Applied egg-rr 50.2%

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

   8. Applied egg-rr 98.8%

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

   if -1 < x < 1.9199999999999999

   1. Initial program 100.0%

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

      1. +-commutative 100.0%

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

      2. +-commutative 100.0%

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

      3. sub-neg 100.0%

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

      4. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in x around 0 98.6%

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

4. Final simplification 98.7%

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

Alternative 3: 98.5% accurate, 0.6× speedup

Math

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

FPCore

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

C

double code(double x) {
	double tmp;
	if ((x <= -1.0) || !(x <= 1.6)) {
		tmp = 1.0 + (1.0 / x);
	} else {
		tmp = x + (1.0 / (x + -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.6d0))) then
        tmp = 1.0d0 + (1.0d0 / x)
    else
        tmp = x + (1.0d0 / (x + (-1.0d0)))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1 or 1.6000000000000001 < x

   1. Initial program 100.0%

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

      1. +-commutative 100.0%

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

      2. +-commutative 100.0%

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

      3. sub-neg 100.0%

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

      4. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in x around inf 97.7%

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

   6. Taylor expanded in x around inf 97.8%

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

   if -1 < x < 1.6000000000000001

   1. Initial program 100.0%

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

      1. +-commutative 100.0%

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

      2. +-commutative 100.0%

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

      3. sub-neg 100.0%

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

      4. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in x around 0 99.2%

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

4. Final simplification 98.5%

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

Alternative 4: 98.5% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if ((x <= (-1.0d0)) .or. (.not. (x <= 1.0d0))) then
        tmp = 1.0d0 + (1.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 = 1.0 + (1.0 / x);
	} else {
		tmp = -1.0;
	}
	return tmp;
}

Python

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

Julia

function code(x)
	tmp = 0.0
	if ((x <= -1.0) || !(x <= 1.0))
		tmp = Float64(1.0 + Float64(1.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 = 1.0 + (1.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[(1.0 + N[(1.0 / x), $MachinePrecision]), $MachinePrecision], -1.0]

Derivation

1. Split input into 2 regimes

2. if x < -1 or 1 < x

   1. Initial program 100.0%

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

      1. +-commutative 100.0%

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

      2. +-commutative 100.0%

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

      3. sub-neg 100.0%

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

      4. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in x around inf 97.7%

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

   6. Taylor expanded in x around inf 97.8%

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

   if -1 < x < 1

   1. Initial program 100.0%

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

      1. +-commutative 100.0%

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

      2. +-commutative 100.0%

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

      3. sub-neg 100.0%

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

      4. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in x around 0 99.2%

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

4. Final simplification 98.5%

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

Alternative 5: 51.3% accurate, 11.0× speedup

Math

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

FPCore

(FPCore (x) :precision binary64 -1.0)

C

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

Fortran

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

Java

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

Python

def code(x):
	return -1.0

Julia

function code(x)
	return -1.0
end

MATLAB

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

Wolfram

code[x_] := -1.0

Derivation

1. Initial program 100.0%

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

   1. +-commutative 100.0%

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

   2. +-commutative 100.0%

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

   3. sub-neg 100.0%

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

   4. metadata-eval 100.0%

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

3. Simplified 100.0%

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

5. Taylor expanded in x around 0 53.4%

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

Reproduce

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