2frac (problem 3.3.1)

Percentage Accurate: 77.1% → 99.4%

Time: 3.7s

Alternatives: 7

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.4% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 79.7%

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

   1. sub-neg 79.7%

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

   2. +-commutative 79.7%

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

   3. distribute-neg-frac 79.7%

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

   4. metadata-eval 79.7%

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

3. Applied egg-rr 79.7%

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

5. Simplified 99.3%

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

   1. distribute-rgt-in 99.3%

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

   2. *-un-lft-identity 99.3%

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

7. Applied egg-rr 99.3%

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

8. Final simplification 99.3%

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

Alternative 2: 97.1% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Derivation

1. Split input into 2 regimes

2. if x < -1 or 1 < x

   1. Initial program 52.7%

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

   2. Taylor expanded in x around inf 97.6%

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

      1. unpow2 97.6%

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

   4. Simplified 97.6%

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

   if -1 < x < 1

   1. Initial program 100.0%

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

   2. Taylor expanded in x around 0 96.8%

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

4. Final simplification 97.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1 \lor \neg \left(x \leq 1\right):\\ \;\;\;\;\frac{-1}{x \cdot x}\\ \mathbf{else}:\\ \;\;\;\;\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.75\right):\\ \;\;\;\;\frac{-1}{x \cdot x}\\ \mathbf{else}:\\ \;\;\;\;\frac{-1 + x}{x}\\ \end{array} \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1 or 0.75 < x

   1. Initial program 52.7%

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

   2. Taylor expanded in x around inf 97.6%

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

      1. unpow2 97.6%

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

   4. Simplified 97.6%

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

   if -1 < x < 0.75

   1. Initial program 100.0%

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

   2. Taylor expanded in x around 0 98.2%

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

      1. *-inverses 98.2%

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

      2. div-sub 98.2%

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

      3. sub-neg 98.2%

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

      4. metadata-eval 98.2%

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

      5. +-commutative 98.2%

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

   4. Simplified 98.2%

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

4. Final simplification 97.9%

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

Alternative 4: 98.2% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1 or 0.75 < x

   1. Initial program 52.7%

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

   2. Taylor expanded in x around inf 97.6%

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

      1. unpow2 97.6%

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

   4. Simplified 97.6%

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

      1. associate-/r* 99.0%

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

      2. div-inv 98.8%

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

   6. Applied egg-rr 98.8%

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

      1. un-div-inv 99.0%

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

   8. Applied egg-rr 99.0%

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

   if -1 < x < 0.75

   1. Initial program 100.0%

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

   2. Taylor expanded in x around 0 98.2%

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

      1. *-inverses 98.2%

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

      2. div-sub 98.2%

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

      3. sub-neg 98.2%

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

      4. metadata-eval 98.2%

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

      5. +-commutative 98.2%

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

   4. Simplified 98.2%

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

Alternative 5: 99.4% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 79.7%

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

   1. sub-neg 79.7%

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

   2. +-commutative 79.7%

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

   3. distribute-neg-frac 79.7%

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

   4. metadata-eval 79.7%

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

3. Applied egg-rr 79.7%

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

5. Simplified 99.3%

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

6. Final simplification 99.3%

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

Alternative 6: 52.0% 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 79.7%

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

2. Taylor expanded in x around 0 57.7%

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

3. Final simplification 57.7%

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

Alternative 7: 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 79.7%

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

2. Taylor expanded in x around 0 57.2%

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

   1. *-inverses 57.2%

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

   2. div-sub 57.2%

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

   3. sub-neg 57.2%

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

   4. metadata-eval 57.2%

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

   5. +-commutative 57.2%

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

4. Simplified 57.2%

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

5. Taylor expanded in x around inf 3.1%

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

6. Final simplification 3.1%

   \[\leadsto 1 \]

Reproduce

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