3frac (problem 3.3.3)

Percentage Accurate: 69.9% → 99.8%

Time: 7.7s

Alternatives: 3

Speedup: 1.7×

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.8% accurate, 1.7× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 71.4%

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

   1. +-commutative 71.4%

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

   2. associate-+r- 71.4%

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

   3. sub-neg 71.4%

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

   4. remove-double-neg 71.4%

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

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

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

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

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

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

   10. associate-+r+ 71.4%

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

   11. +-commutative 71.4%

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

   12. remove-double-neg 71.4%

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

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

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

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

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

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

   1. frac-sub 20.6%

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

   2. frac-add 21.4%

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

   3. *-un-lft-identity 21.4%

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

   4. fma-define 20.0%

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

   5. *-rgt-identity 20.0%

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

   6. fmm-def 20.0%

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

6. Applied egg-rr 20.0%

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

8. Simplified 4.2%

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

9. Taylor expanded in x around 0 99.8%

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

    1. unpow2 99.8%

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

11. Applied egg-rr 99.8%

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

Alternative 2: 68.6% 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 71.4%

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

   1. +-commutative 71.4%

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

   2. associate-+r- 71.4%

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

   3. sub-neg 71.4%

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

   4. remove-double-neg 71.4%

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

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

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

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

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

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

   10. associate-+r+ 71.4%

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

   11. +-commutative 71.4%

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

   12. remove-double-neg 71.4%

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

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

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

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

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

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

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

Alternative 3: 68.4% 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 71.4%

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

   1. +-commutative 71.4%

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

   2. associate-+r- 71.4%

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

   3. sub-neg 71.4%

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

   4. remove-double-neg 71.4%

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

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

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

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

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

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

   10. associate-+r+ 71.4%

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

   11. +-commutative 71.4%

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

   12. remove-double-neg 71.4%

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

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

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

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

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

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

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

6. Taylor expanded in x around inf 69.5%

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

7. Taylor expanded in x around 0 69.5%

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

Developer Target 1: 99.2% 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 2024163 
(FPCore (x)
  :name "3frac (problem 3.3.3)"
  :precision binary64
  :pre (> (fabs x) 1.0)

  :alt
  (! :herbie-platform default (/ 2 (* x (- (* x x) 1))))

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