2frac (problem 3.3.1)

Percentage Accurate: 78.7% → 99.9%

Time: 4.6s

Alternatives: 5

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: 78.7% 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 / Float64(x + 1.0)) / x)
end

MATLAB

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

Wolfram

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

Derivation

1. Initial program 81.9%

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

   1. frac-sub 82.5%

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

   2. *-rgt-identity 82.5%

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

   3. metadata-eval 82.5%

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

   4. div-inv 82.5%

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

   5. associate-/r* 82.5%

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

   6. *-un-lft-identity 82.5%

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

   7. *-rgt-identity 82.5%

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

   8. +-commutative 82.5%

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

   9. div-inv 82.5%

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

   10. metadata-eval 82.5%

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

   11. *-rgt-identity 82.5%

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

   12. +-commutative 82.5%

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

4. Applied egg-rr 82.5%

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

   1. div-inv 82.5%

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

   2. +-commutative 82.5%

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

   3. +-commutative 82.5%

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

6. Applied egg-rr 82.5%

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

   1. associate-*r/ 82.5%

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

   2. *-rgt-identity 82.5%

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

   3. associate--r+ 99.9%

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

   4. +-inverses 99.9%

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

   5. metadata-eval 99.9%

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

8. Simplified 99.9%

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

9. Final simplification 99.9%

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

Alternative 2: 76.9% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1 or 3.89999999999999987e61 < x

   1. Initial program 69.0%

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

   3. Taylor expanded in x around inf 67.9%

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

   if -1 < x < 3.89999999999999987e61

   1. Initial program 92.7%

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

   3. Taylor expanded in x around 0 91.0%

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

      1. neg-mul-1 91.0%

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

      2. unsub-neg 91.0%

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

   5. Simplified 91.0%

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

4. Final simplification 80.5%

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

Alternative 3: 99.5% 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 81.9%

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

   1. clear-num 81.9%

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

   2. frac-sub 82.5%

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

   3. *-un-lft-identity 82.5%

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

   4. div-inv 82.5%

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

   5. metadata-eval 82.5%

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

   6. *-rgt-identity 82.5%

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

   7. *-rgt-identity 82.5%

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

   8. +-commutative 82.5%

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

   9. *-commutative 82.5%

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

   10. div-inv 82.5%

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

   11. metadata-eval 82.5%

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

   12. *-rgt-identity 82.5%

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

   13. +-commutative 82.5%

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

4. Applied egg-rr 82.5%

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

5. Taylor expanded in x around 0 99.3%

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

6. Final simplification 99.3%

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

Alternative 4: 53.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 81.9%

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

3. Taylor expanded in x around 0 52.0%

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

4. Final simplification 52.0%

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

Alternative 5: 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 81.9%

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

3. Taylor expanded in x around 0 50.7%

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

4. Taylor expanded in x around inf 3.0%

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

5. Final simplification 3.0%

   \[\leadsto 1 \]
6. Add Preprocessing

Reproduce

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