3frac (problem 3.3.3)

Percentage Accurate: 69.9% → 99.4%

Time: 7.2s

Alternatives: 5

Speedup: 1.0×

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

Math

\[\begin{array}{l} \\ 2 \cdot \left({x}^{-3} + {x}^{-5}\right) \end{array} \]

FPCore

(FPCore (x) :precision binary64 (* 2.0 (+ (pow x -3.0) (pow x -5.0))))

C

double code(double x) {
	return 2.0 * (pow(x, -3.0) + pow(x, -5.0));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = 2.0d0 * ((x ** (-3.0d0)) + (x ** (-5.0d0)))
end function

Java

public static double code(double x) {
	return 2.0 * (Math.pow(x, -3.0) + Math.pow(x, -5.0));
}

Python

def code(x):
	return 2.0 * (math.pow(x, -3.0) + math.pow(x, -5.0))

Julia

function code(x)
	return Float64(2.0 * Float64((x ^ -3.0) + (x ^ -5.0)))
end

MATLAB

function tmp = code(x)
	tmp = 2.0 * ((x ^ -3.0) + (x ^ -5.0));
end

Wolfram

code[x_] := N[(2.0 * N[(N[Power[x, -3.0], $MachinePrecision] + N[Power[x, -5.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 70.0%

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

   1. +-commutative 70.0%

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

   2. associate-+r- 69.9%

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

   3. sub-neg 69.9%

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

   4. remove-double-neg 69.9%

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

   5. neg-sub0 69.9%

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

   6. associate-+l- 69.9%

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

   7. neg-sub0 69.9%

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

   8. distribute-neg-frac2 69.9%

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

   9. distribute-frac-neg2 69.9%

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

   10. associate-+r+ 70.0%

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

   11. +-commutative 70.0%

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

   12. remove-double-neg 70.0%

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

   13. distribute-neg-frac2 70.0%

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

   14. sub0-neg 70.0%

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

   15. associate-+l- 70.0%

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

   16. neg-sub0 70.0%

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

3. Simplified 70.0%

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

5. Taylor expanded in x around inf 99.5%

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

   1. associate-*r/ 99.5%

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

   2. metadata-eval 99.5%

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

   3. associate-*r/ 99.5%

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

   4. metadata-eval 99.5%

      \[\leadsto \frac{2}{{x}^{3}} + \frac{\color{blue}{2}}{{x}^{5}} \]

7. Simplified 99.5%

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

   1. *-un-lft-identity 99.5%

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

   2. div-inv 99.5%

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

   3. fma-define 99.5%

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

   4. pow-flip 99.8%

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

   5. metadata-eval 99.8%

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

   6. div-inv 99.8%

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

   7. pow-flip 99.8%

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

   8. metadata-eval 99.8%

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

9. Applied egg-rr 99.8%

   \[\leadsto \color{blue}{1 \cdot \mathsf{fma}\left(2, {x}^{-3}, 2 \cdot {x}^{-5}\right)} \]
10. Step-by-step derivation

    1. *-lft-identity 99.8%

       \[\leadsto \color{blue}{\mathsf{fma}\left(2, {x}^{-3}, 2 \cdot {x}^{-5}\right)} \]

    2. fma-undefine 99.8%

       \[\leadsto \color{blue}{2 \cdot {x}^{-3} + 2 \cdot {x}^{-5}} \]

    3. distribute-lft-out 99.8%

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

11. Simplified 99.8%

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

12. Final simplification 99.8%

    \[\leadsto 2 \cdot \left({x}^{-3} + {x}^{-5}\right) \]
13. Add Preprocessing

Alternative 2: 98.9% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ 2 \cdot {x}^{-3} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (* 2.0 (pow x -3.0)))

C

double code(double x) {
	return 2.0 * pow(x, -3.0);
}

Fortran

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

Java

public static double code(double x) {
	return 2.0 * Math.pow(x, -3.0);
}

Python

def code(x):
	return 2.0 * math.pow(x, -3.0)

Julia

function code(x)
	return Float64(2.0 * (x ^ -3.0))
end

MATLAB

function tmp = code(x)
	tmp = 2.0 * (x ^ -3.0);
end

Wolfram

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

Derivation

1. Initial program 70.0%

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

   1. +-commutative 70.0%

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

   2. associate-+r- 69.9%

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

   3. sub-neg 69.9%

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

   4. remove-double-neg 69.9%

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

   5. neg-sub0 69.9%

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

   6. associate-+l- 69.9%

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

   7. neg-sub0 69.9%

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

   8. distribute-neg-frac2 69.9%

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

   9. distribute-frac-neg2 69.9%

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

   10. associate-+r+ 70.0%

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

   11. +-commutative 70.0%

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

   12. remove-double-neg 70.0%

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

   13. distribute-neg-frac2 70.0%

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

   14. sub0-neg 70.0%

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

   15. associate-+l- 70.0%

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

   16. neg-sub0 70.0%

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

3. Simplified 70.0%

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

5. Taylor expanded in x around inf 99.2%

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

   1. div-inv 99.2%

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

   2. pow-flip 99.5%

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

   3. metadata-eval 99.5%

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

7. Applied egg-rr 99.5%

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

8. Final simplification 99.5%

   \[\leadsto 2 \cdot {x}^{-3} \]
9. Add Preprocessing

Alternative 3: 69.9% 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]

Derivation

1. Initial program 70.0%

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

3. Final simplification 70.0%

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

Alternative 4: 68.5% accurate, 1.7× 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]

Derivation

1. Initial program 70.0%

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

   1. +-commutative 70.0%

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

   2. associate-+r- 69.9%

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

   3. sub-neg 69.9%

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

   4. remove-double-neg 69.9%

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

   5. neg-sub0 69.9%

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

   6. associate-+l- 69.9%

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

   7. neg-sub0 69.9%

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

   8. distribute-neg-frac2 69.9%

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

   9. distribute-frac-neg2 69.9%

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

   10. associate-+r+ 70.0%

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

   11. +-commutative 70.0%

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

   12. remove-double-neg 70.0%

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

   13. distribute-neg-frac2 70.0%

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

   14. sub0-neg 70.0%

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

   15. associate-+l- 70.0%

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

   16. neg-sub0 70.0%

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

3. Simplified 70.0%

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

5. Taylor expanded in x around inf 69.4%

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

6. Final simplification 69.4%

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

Alternative 5: 68.3% accurate, 15.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 70.0%

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

   1. +-commutative 70.0%

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

   2. associate-+r- 69.9%

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

   3. sub-neg 69.9%

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

   4. remove-double-neg 69.9%

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

   5. neg-sub0 69.9%

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

   6. associate-+l- 69.9%

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

   7. neg-sub0 69.9%

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

   8. distribute-neg-frac2 69.9%

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

   9. distribute-frac-neg2 69.9%

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

   10. associate-+r+ 70.0%

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

   11. +-commutative 70.0%

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

   12. remove-double-neg 70.0%

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

   13. distribute-neg-frac2 70.0%

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

   14. sub0-neg 70.0%

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

   15. associate-+l- 70.0%

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

   16. neg-sub0 70.0%

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

3. Simplified 70.0%

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

5. Taylor expanded in x around inf 69.4%

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

   1. frac-add 69.4%

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

   2. *-un-lft-identity 69.4%

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

   3. *-commutative 69.4%

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

   4. neg-mul-1 69.4%

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

   5. +-commutative 69.4%

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

   6. distribute-neg-in 69.4%

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

   7. metadata-eval 69.4%

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

   8. *-commutative 69.4%

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

7. Applied egg-rr 69.4%

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

9. Applied egg-rr 69.1%

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

10. Final simplification 69.1%

    \[\leadsto 0 \]
11. 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 2024040 
(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))))