2frac (problem 3.3.1)

Percentage Accurate: 77.3% → 99.9%

Time: 11.6s

Alternatives: 8

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.3% 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 79.5%

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

   1. frac-sub 80.6%

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

   2. *-rgt-identity 80.6%

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

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

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

   5. associate-/r* 80.6%

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

   6. *-un-lft-identity 80.6%

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

   7. *-rgt-identity 80.6%

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

   8. +-commutative 80.6%

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

   9. div-inv 80.6%

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

   10. metadata-eval 80.6%

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

   11. *-rgt-identity 80.6%

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

   12. +-commutative 80.6%

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

4. Applied egg-rr 80.6%

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

   1. div-inv 80.6%

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

   2. +-commutative 80.6%

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

   3. +-commutative 80.6%

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

6. Applied egg-rr 80.6%

   \[\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/ 80.6%

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

   2. *-rgt-identity 80.6%

      \[\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. Add Preprocessing

Alternative 2: 98.5% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1 \lor \neg \left(x \leq 1\right):\\ \;\;\;\;\frac{\frac{-1}{x}}{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 1.0)))
   (/ (/ -1.0 x) x)
   (- (- 1.0 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) - (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) - (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) - (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) - (1.0 / x)
	return tmp

Julia

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

   1. Initial program 58.3%

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

   3. Taylor expanded in x around inf 98.0%

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

      1. unpow2 98.0%

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

      2. associate-/r* 99.1%

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

      3. *-lft-identity 99.1%

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

      4. associate-*l/ 98.9%

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

      5. metadata-eval 98.9%

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

      6. distribute-neg-frac 98.9%

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

      7. distribute-rgt-neg-out 98.9%

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

      8. unpow-1 98.9%

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

      9. unpow-1 98.9%

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

      10. pow-sqr 99.2%

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

      11. metadata-eval 99.2%

          \[\leadsto -{x}^{\color{blue}{-2}} \]

   5. Simplified 99.2%

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

      1. add-sqr-sqrt 54.0%

         \[\leadsto \color{blue}{\sqrt{-{x}^{-2}} \cdot \sqrt{-{x}^{-2}}} \]

      2. sqrt-unprod 56.4%

         \[\leadsto \color{blue}{\sqrt{\left(-{x}^{-2}\right) \cdot \left(-{x}^{-2}\right)}} \]

      3. sqr-neg 56.4%

         \[\leadsto \sqrt{\color{blue}{{x}^{-2} \cdot {x}^{-2}}} \]

      4. sqrt-unprod 56.1%

         \[\leadsto \color{blue}{\sqrt{{x}^{-2}} \cdot \sqrt{{x}^{-2}}} \]

      5. pow2 56.1%

         \[\leadsto \color{blue}{{\left(\sqrt{{x}^{-2}}\right)}^{2}} \]

      6. sqrt-pow1 56.1%

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

      7. metadata-eval 56.1%

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

      8. inv-pow 56.1%

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

      9. pow2 56.1%

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

      10. un-div-inv 56.1%

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

      11. add-sqr-sqrt 26.2%

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

      12. sqrt-prod 80.5%

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

      13. frac-times 80.0%

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

      14. metadata-eval 80.0%

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

      15. metadata-eval 80.0%

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

      16. frac-times 80.5%

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

      17. sqrt-unprod 54.2%

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

      18. add-sqr-sqrt 99.1%

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

   7. Applied egg-rr 99.1%

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

   if -1 < x < 1

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 99.4%

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

      1. neg-mul-1 99.4%

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

      2. sub-neg 99.4%

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

   5. Simplified 99.4%

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

4. Final simplification 99.2%

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

Alternative 3: 98.3% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1 \lor \neg \left(x \leq 0.76\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.76))) (/ (/ -1.0 x) x) (/ (+ -1.0 x) x)))

C

double code(double x) {
	double tmp;
	if ((x <= -1.0) || !(x <= 0.76)) {
		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.76d0))) 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.76)) {
		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.76):
		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.76))
		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.76)))
		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.76]], $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.76000000000000001 < x

   1. Initial program 58.3%

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

   3. Taylor expanded in x around inf 98.0%

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

      1. unpow2 98.0%

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

      2. associate-/r* 99.1%

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

      3. *-lft-identity 99.1%

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

      4. associate-*l/ 98.9%

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

      5. metadata-eval 98.9%

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

      6. distribute-neg-frac 98.9%

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

      7. distribute-rgt-neg-out 98.9%

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

      8. unpow-1 98.9%

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

      9. unpow-1 98.9%

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

      10. pow-sqr 99.2%

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

      11. metadata-eval 99.2%

          \[\leadsto -{x}^{\color{blue}{-2}} \]

   5. Simplified 99.2%

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

      1. add-sqr-sqrt 54.0%

         \[\leadsto \color{blue}{\sqrt{-{x}^{-2}} \cdot \sqrt{-{x}^{-2}}} \]

      2. sqrt-unprod 56.4%

         \[\leadsto \color{blue}{\sqrt{\left(-{x}^{-2}\right) \cdot \left(-{x}^{-2}\right)}} \]

      3. sqr-neg 56.4%

         \[\leadsto \sqrt{\color{blue}{{x}^{-2} \cdot {x}^{-2}}} \]

      4. sqrt-unprod 56.1%

         \[\leadsto \color{blue}{\sqrt{{x}^{-2}} \cdot \sqrt{{x}^{-2}}} \]

      5. pow2 56.1%

         \[\leadsto \color{blue}{{\left(\sqrt{{x}^{-2}}\right)}^{2}} \]

      6. sqrt-pow1 56.1%

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

      7. metadata-eval 56.1%

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

      8. inv-pow 56.1%

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

      9. pow2 56.1%

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

      10. un-div-inv 56.1%

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

      11. add-sqr-sqrt 26.2%

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

      12. sqrt-prod 80.5%

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

      13. frac-times 80.0%

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

      14. metadata-eval 80.0%

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

      15. metadata-eval 80.0%

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

      16. frac-times 80.5%

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

      17. sqrt-unprod 54.2%

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

      18. add-sqr-sqrt 99.1%

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

   7. Applied egg-rr 99.1%

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

   if -1 < x < 0.76000000000000001

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 98.9%

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

4. Final simplification 99.0%

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

Alternative 4: 75.2% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1:\\ \;\;\;\;0\\ \mathbf{elif}\;x \leq 1:\\ \;\;\;\;\frac{-1 + x}{x}\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= (-1.0d0)) then
        tmp = 0.0d0
    else if (x <= 1.0d0) then
        tmp = ((-1.0d0) + x) / x
    else
        tmp = 0.0d0
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1 or 1 < x

   1. Initial program 58.3%

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

   3. Taylor expanded in x around inf 56.8%

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

   4. Taylor expanded in x around 0 56.8%

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

   if -1 < x < 1

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 98.9%

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

4. Final simplification 78.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1:\\ \;\;\;\;0\\ \mathbf{elif}\;x \leq 1:\\ \;\;\;\;\frac{-1 + x}{x}\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 75.2% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1:\\ \;\;\;\;0\\ \mathbf{elif}\;x \leq 1:\\ \;\;\;\;1 - \frac{1}{x}\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= (-1.0d0)) then
        tmp = 0.0d0
    else if (x <= 1.0d0) then
        tmp = 1.0d0 - (1.0d0 / x)
    else
        tmp = 0.0d0
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= -1.0) {
		tmp = 0.0;
	} else if (x <= 1.0) {
		tmp = 1.0 - (1.0 / x);
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= -1.0:
		tmp = 0.0
	elif x <= 1.0:
		tmp = 1.0 - (1.0 / x)
	else:
		tmp = 0.0
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= -1.0)
		tmp = 0.0;
	elseif (x <= 1.0)
		tmp = 1.0 - (1.0 / x);
	else
		tmp = 0.0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1 or 1 < x

   1. Initial program 58.3%

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

   3. Taylor expanded in x around inf 56.8%

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

   4. Taylor expanded in x around 0 56.8%

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

   if -1 < x < 1

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 98.9%

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

Alternative 6: 75.0% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1:\\ \;\;\;\;0\\ \mathbf{elif}\;x \leq 4.5 \cdot 10^{+102}:\\ \;\;\;\;\frac{-1}{x}\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x -1.0) 0.0 (if (<= x 4.5e+102) (/ -1.0 x) 0.0)))

C

double code(double x) {
	double tmp;
	if (x <= -1.0) {
		tmp = 0.0;
	} else if (x <= 4.5e+102) {
		tmp = -1.0 / x;
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= (-1.0d0)) then
        tmp = 0.0d0
    else if (x <= 4.5d+102) then
        tmp = (-1.0d0) / x
    else
        tmp = 0.0d0
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= -1.0) {
		tmp = 0.0;
	} else if (x <= 4.5e+102) {
		tmp = -1.0 / x;
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= -1.0:
		tmp = 0.0
	elif x <= 4.5e+102:
		tmp = -1.0 / x
	else:
		tmp = 0.0
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= -1.0)
		tmp = 0.0;
	elseif (x <= 4.5e+102)
		tmp = Float64(-1.0 / x);
	else
		tmp = 0.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= -1.0)
		tmp = 0.0;
	elseif (x <= 4.5e+102)
		tmp = -1.0 / x;
	else
		tmp = 0.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, -1.0], 0.0, If[LessEqual[x, 4.5e+102], N[(-1.0 / x), $MachinePrecision], 0.0]]

Derivation

1. Split input into 2 regimes

2. if x < -1 or 4.50000000000000021e102 < x

   1. Initial program 67.7%

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

   3. Taylor expanded in x around inf 66.7%

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

   4. Taylor expanded in x around 0 66.7%

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

   if -1 < x < 4.50000000000000021e102

   1. Initial program 87.8%

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

   3. Taylor expanded in x around 0 85.5%

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

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

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

   1. sub-neg 79.5%

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

   2. +-commutative 79.5%

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

   3. distribute-neg-frac 79.5%

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

   4. metadata-eval 79.5%

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

4. Applied egg-rr 79.5%

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

   1. metadata-eval 79.5%

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

   2. distribute-neg-frac 79.5%

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

   3. unsub-neg 79.5%

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

   4. *-inverses 79.5%

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

   5. associate-/r* 54.6%

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

   6. *-commutative 54.6%

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

   7. associate-/r* 79.4%

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

   8. div-sub 79.5%

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

   9. *-inverses 79.5%

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

   10. div-sub 80.6%

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

   11. associate-/r* 80.6%

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

   12. +-commutative 80.6%

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

   13. associate--r+ 99.3%

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

   14. +-inverses 99.3%

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

   15. metadata-eval 99.3%

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

   16. distribute-lft-in 99.4%

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

   17. unpow2 99.4%

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

   18. *-rgt-identity 99.4%

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

6. Simplified 99.4%

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

   1. unpow2 99.4%

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

8. Applied egg-rr 99.4%

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

Alternative 8: 26.8% accurate, 9.0× speedup

Math

\[\begin{array}{l} \\ 0 \end{array} \]

FPCore

(FPCore (x) :precision binary64 0.0)

C

double code(double x) {
	return 0.0;
}

Fortran

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

Java

public static double code(double x) {
	return 0.0;
}

Python

def code(x):
	return 0.0

Julia

function code(x)
	return 0.0
end

MATLAB

function tmp = code(x)
	tmp = 0.0;
end

Wolfram

code[x_] := 0.0

Derivation

1. Initial program 79.5%

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

3. Taylor expanded in x around inf 29.1%

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

4. Taylor expanded in x around 0 29.1%

   \[\leadsto \color{blue}{0} \]
5. Add Preprocessing

Reproduce

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