2frac (problem 3.3.1)

Percentage Accurate: 77.1% → 99.9%

Time: 4.3s

Alternatives: 6

Speedup: 1.3×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 77.1% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 77.6%

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

   1. frac-sub 78.7%

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

   2. div-inv 78.7%

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

   3. *-un-lft-identity 78.7%

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

   4. *-rgt-identity 78.7%

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

   5. +-commutative 78.7%

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

   6. metadata-eval 78.7%

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

   7. frac-times 78.7%

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

   8. clear-num 78.7%

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

   9. associate-*l/ 78.7%

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

   10. *-un-lft-identity 78.7%

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

   11. div-inv 78.7%

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

   12. metadata-eval 78.7%

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

   13. *-rgt-identity 78.7%

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

   14. +-commutative 78.7%

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

3. Applied egg-rr 78.7%

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

4. Taylor expanded in x around 0 100.0%

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

5. Final simplification 100.0%

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

Alternative 2: 98.1% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1 or 0.76000000000000001 < x

   1. Initial program 57.6%

      \[\frac{1}{x + 1} - \frac{1}{x} \]

   2. Taylor expanded in x around inf 96.0%

      \[\leadsto \color{blue}{\frac{-1}{{x}^{2}}} \]
   3. Step-by-step derivation

      1. unpow2 96.0%

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

   4. Simplified 96.0%

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

      1. associate-/r* 97.4%

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

      2. div-inv 97.2%

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

      3. div-inv 97.2%

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

      4. neg-mul-1 97.2%

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

      5. distribute-lft-neg-in 97.2%

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

      6. distribute-rgt-neg-in 97.2%

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

      7. neg-mul-1 97.2%

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

      8. div-inv 97.2%

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

   6. Applied egg-rr 97.2%

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

   if -1 < x < 0.76000000000000001

   1. Initial program 100.0%

      \[\frac{1}{x + 1} - \frac{1}{x} \]

   2. Taylor expanded in x around 0 98.4%

      \[\leadsto \color{blue}{1 - \frac{1}{x}} \]
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 0.76\right):\\ \;\;\;\;\frac{1}{x} \cdot \frac{-1}{x}\\ \mathbf{else}:\\ \;\;\;\;1 + \frac{-1}{x}\\ \end{array} \]

Alternative 3: 97.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1 or 0.76000000000000001 < x

   1. Initial program 57.6%

      \[\frac{1}{x + 1} - \frac{1}{x} \]

   2. Taylor expanded in x around inf 96.0%

      \[\leadsto \color{blue}{\frac{-1}{{x}^{2}}} \]
   3. Step-by-step derivation

      1. unpow2 96.0%

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

   4. Simplified 96.0%

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

   if -1 < x < 0.76000000000000001

   1. Initial program 100.0%

      \[\frac{1}{x + 1} - \frac{1}{x} \]

   2. Taylor expanded in x around 0 98.4%

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

4. Final simplification 97.1%

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

Alternative 4: 99.4% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \frac{-1}{x \cdot \left(1 + x\right)} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 77.6%

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

   1. sub-neg 77.6%

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

   2. +-commutative 77.6%

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

   3. distribute-neg-frac 77.6%

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

   4. metadata-eval 77.6%

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

3. Applied egg-rr 77.6%

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

5. Simplified 99.2%

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

6. Final simplification 99.2%

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

Alternative 5: 52.1% accurate, 3.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

def code(x):
	return -1.0 / x

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 77.6%

   \[\frac{1}{x + 1} - \frac{1}{x} \]

2. Taylor expanded in x around 0 49.1%

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

3. Final simplification 49.1%

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

Alternative 6: 3.0% accurate, 9.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 77.6%

   \[\frac{1}{x + 1} - \frac{1}{x} \]

2. Taylor expanded in x around 0 47.9%

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

3. Taylor expanded in x around inf 3.0%

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

4. Final simplification 3.0%

   \[\leadsto 1 \]

Reproduce

herbie shell --seed 2023187 
(FPCore (x)
  :name "2frac (problem 3.3.1)"
  :precision binary64
  (- (/ 1.0 (+ x 1.0)) (/ 1.0 x)))