3frac (problem 3.3.3)

Percentage Accurate: 69.7% → 99.1%

Time: 10.7s

Alternatives: 3

Speedup: 1.4×

Specification

\[\left|x\right| > 1\]

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 69.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.1% accurate, 1.4× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ x_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \frac{-2}{\left(x\_m \cdot \left(x\_m + -1\right)\right) \cdot \left(-1 - x\_m\right)} \end{array} \]

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
(FPCore (x_s x_m)
 :precision binary64
 (* x_s (/ -2.0 (* (* x_m (+ x_m -1.0)) (- -1.0 x_m)))))

C

x_m = fabs(x);
x_s = copysign(1.0, x);
double code(double x_s, double x_m) {
	return x_s * (-2.0 / ((x_m * (x_m + -1.0)) * (-1.0 - x_m)));
}

Fortran

x_m = abs(x)
x_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    code = x_s * ((-2.0d0) / ((x_m * (x_m + (-1.0d0))) * ((-1.0d0) - x_m)))
end function

Java

x_m = Math.abs(x);
x_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m) {
	return x_s * (-2.0 / ((x_m * (x_m + -1.0)) * (-1.0 - x_m)));
}

Python

x_m = math.fabs(x)
x_s = math.copysign(1.0, x)
def code(x_s, x_m):
	return x_s * (-2.0 / ((x_m * (x_m + -1.0)) * (-1.0 - x_m)))

Julia

x_m = abs(x)
x_s = copysign(1.0, x)
function code(x_s, x_m)
	return Float64(x_s * Float64(-2.0 / Float64(Float64(x_m * Float64(x_m + -1.0)) * Float64(-1.0 - x_m))))
end

MATLAB

x_m = abs(x);
x_s = sign(x) * abs(1.0);
function tmp = code(x_s, x_m)
	tmp = x_s * (-2.0 / ((x_m * (x_m + -1.0)) * (-1.0 - x_m)));
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
x_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_] := N[(x$95$s * N[(-2.0 / N[(N[(x$95$m * N[(x$95$m + -1.0), $MachinePrecision]), $MachinePrecision] * N[(-1.0 - x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 66.7%

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

   1. sub-neg 66.7%

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

   2. distribute-neg-frac 66.7%

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

   3. metadata-eval 66.7%

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

   4. metadata-eval 66.7%

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

   5. metadata-eval 66.7%

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

   6. associate-/r* 66.7%

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

   7. metadata-eval 66.7%

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

   8. neg-mul-1 66.7%

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

   9. +-commutative 66.7%

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

   10. associate-+l+ 66.6%

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

   11. +-commutative 66.6%

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

   12. neg-mul-1 66.6%

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

   13. metadata-eval 66.6%

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

   14. associate-/r* 66.6%

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

   15. metadata-eval 66.6%

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

   16. metadata-eval 66.6%

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

   17. +-commutative 66.6%

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

   18. +-commutative 66.6%

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

   19. sub-neg 66.6%

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

   20. metadata-eval 66.6%

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

3. Simplified 66.6%

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

   1. frac-2neg 66.6%

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

   2. frac-add 17.6%

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

   3. frac-add 20.0%

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

   4. metadata-eval 20.0%

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

   5. +-commutative 20.0%

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

   6. *-un-lft-identity 20.0%

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

   7. *-rgt-identity 20.0%

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

   8. +-commutative 20.0%

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

   9. +-commutative 20.0%

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

   10. +-commutative 20.0%

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

6. Applied egg-rr 20.0%

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

   1. fma-def 20.0%

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

   2. *-commutative 20.0%

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

   3. *-commutative 20.0%

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

   4. associate-+l+ 20.0%

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

   5. *-commutative 20.0%

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

   6. associate-*r* 20.0%

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

8. Simplified 20.0%

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

9. Taylor expanded in x around 0 99.1%

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

10. Final simplification 99.1%

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

Alternative 2: 68.0% accurate, 2.1× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ x_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \left(\frac{-2}{x\_m} + \frac{2}{x\_m}\right) \end{array} \]

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
(FPCore (x_s x_m) :precision binary64 (* x_s (+ (/ -2.0 x_m) (/ 2.0 x_m))))

C

x_m = fabs(x);
x_s = copysign(1.0, x);
double code(double x_s, double x_m) {
	return x_s * ((-2.0 / x_m) + (2.0 / x_m));
}

Fortran

x_m = abs(x)
x_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    code = x_s * (((-2.0d0) / x_m) + (2.0d0 / x_m))
end function

Java

x_m = Math.abs(x);
x_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m) {
	return x_s * ((-2.0 / x_m) + (2.0 / x_m));
}

Python

x_m = math.fabs(x)
x_s = math.copysign(1.0, x)
def code(x_s, x_m):
	return x_s * ((-2.0 / x_m) + (2.0 / x_m))

Julia

x_m = abs(x)
x_s = copysign(1.0, x)
function code(x_s, x_m)
	return Float64(x_s * Float64(Float64(-2.0 / x_m) + Float64(2.0 / x_m)))
end

MATLAB

x_m = abs(x);
x_s = sign(x) * abs(1.0);
function tmp = code(x_s, x_m)
	tmp = x_s * ((-2.0 / x_m) + (2.0 / x_m));
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
x_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_] := N[(x$95$s * N[(N[(-2.0 / x$95$m), $MachinePrecision] + N[(2.0 / x$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 66.7%

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

   1. sub-neg 66.7%

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

   2. distribute-neg-frac 66.7%

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

   3. metadata-eval 66.7%

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

   4. metadata-eval 66.7%

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

   5. metadata-eval 66.7%

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

   6. associate-/r* 66.7%

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

   7. metadata-eval 66.7%

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

   8. neg-mul-1 66.7%

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

   9. +-commutative 66.7%

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

   10. associate-+l+ 66.6%

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

   11. +-commutative 66.6%

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

   12. neg-mul-1 66.6%

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

   13. metadata-eval 66.6%

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

   14. associate-/r* 66.6%

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

   15. metadata-eval 66.6%

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

   16. metadata-eval 66.6%

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

   17. +-commutative 66.6%

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

   18. +-commutative 66.6%

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

   19. sub-neg 66.6%

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

   20. metadata-eval 66.6%

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

3. Simplified 66.6%

   \[\leadsto \color{blue}{\frac{-2}{x} + \left(\frac{1}{1 + x} + \frac{1}{x + -1}\right)} \]
4. Add Preprocessing

5. Taylor expanded in x around inf 65.0%

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

6. Final simplification 65.0%

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

Alternative 3: 5.0% accurate, 5.0× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ x_s = \mathsf{copysign}\left(1, x\right) \\ x\_s \cdot \frac{-2}{x\_m} \end{array} \]

FPCore

x_m = (fabs.f64 x)
x_s = (copysign.f64 1 x)
(FPCore (x_s x_m) :precision binary64 (* x_s (/ -2.0 x_m)))

C

x_m = fabs(x);
x_s = copysign(1.0, x);
double code(double x_s, double x_m) {
	return x_s * (-2.0 / x_m);
}

Fortran

x_m = abs(x)
x_s = copysign(1.0d0, x)
real(8) function code(x_s, x_m)
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    code = x_s * ((-2.0d0) / x_m)
end function

Java

x_m = Math.abs(x);
x_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m) {
	return x_s * (-2.0 / x_m);
}

Python

x_m = math.fabs(x)
x_s = math.copysign(1.0, x)
def code(x_s, x_m):
	return x_s * (-2.0 / x_m)

Julia

x_m = abs(x)
x_s = copysign(1.0, x)
function code(x_s, x_m)
	return Float64(x_s * Float64(-2.0 / x_m))
end

MATLAB

x_m = abs(x);
x_s = sign(x) * abs(1.0);
function tmp = code(x_s, x_m)
	tmp = x_s * (-2.0 / x_m);
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
x_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[x$95$s_, x$95$m_] := N[(x$95$s * N[(-2.0 / x$95$m), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 66.7%

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

   1. sub-neg 66.7%

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

   2. distribute-neg-frac 66.7%

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

   3. metadata-eval 66.7%

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

   4. metadata-eval 66.7%

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

   5. metadata-eval 66.7%

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

   6. associate-/r* 66.7%

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

   7. metadata-eval 66.7%

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

   8. neg-mul-1 66.7%

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

   9. +-commutative 66.7%

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

   10. associate-+l+ 66.6%

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

   11. +-commutative 66.6%

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

   12. neg-mul-1 66.6%

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

   13. metadata-eval 66.6%

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

   14. associate-/r* 66.6%

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

   15. metadata-eval 66.6%

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

   16. metadata-eval 66.6%

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

   17. +-commutative 66.6%

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

   18. +-commutative 66.6%

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

   19. sub-neg 66.6%

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

   20. metadata-eval 66.6%

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

3. Simplified 66.6%

   \[\leadsto \color{blue}{\frac{-2}{x} + \left(\frac{1}{1 + x} + \frac{1}{x + -1}\right)} \]
4. Add Preprocessing

5. Taylor expanded in x around 0 4.9%

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

6. Final simplification 4.9%

   \[\leadsto \frac{-2}{x} \]
7. Add Preprocessing

Developer target: 99.1% accurate, 1.7× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024031 
(FPCore (x)
  :name "3frac (problem 3.3.3)"
  :precision binary64
  :pre (> (fabs x) 1.0)

  :herbie-target
  (/ 2.0 (* x (- (* x x) 1.0)))

  (+ (- (/ 1.0 (+ x 1.0)) (/ 2.0 x)) (/ 1.0 (- x 1.0))))