Asymptote A

Percentage Accurate: 78.4% → 99.9%

Time: 2.0s

Alternatives: 8

Speedup: 1.7×

Specification

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 78.4% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 1.2× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \frac{\frac{-2}{x\_m - -1}}{x\_m - 1} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m) :precision binary64 (/ (/ -2.0 (- x_m -1.0)) (- x_m 1.0)))

C

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

Fortran

x_m =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x_m)
use fmin_fmax_functions
    real(8), intent (in) :: x_m
    code = ((-2.0d0) / (x_m - (-1.0d0))) / (x_m - 1.0d0)
end function

Java

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

Python

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

Julia

x_m = abs(x)
function code(x_m)
	return Float64(Float64(-2.0 / Float64(x_m - -1.0)) / Float64(x_m - 1.0))
end

MATLAB

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

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_] := N[(N[(-2.0 / N[(x$95$m - -1.0), $MachinePrecision]), $MachinePrecision] / N[(x$95$m - 1.0), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 78.4%

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

   1. lift--.f64 N/A

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

   2. lift-+.f64 N/A

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

   3. lift-/.f64 N/A

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

   4. lift--.f64 N/A

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

   5. lift-/.f64 N/A

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

   6. frac-sub N/A

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

   7. difference-of-squares-rev N/A

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

   8. lower-/.f64 N/A

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

   9. *-lft-identity N/A

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

   10. *-rgt-identity N/A

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

   11. lower--.f64 N/A

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

   12. lift--.f64 N/A

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

   13. metadata-eval N/A

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

   14. fp-cancel-sign-sub-inv N/A

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

   15. metadata-eval N/A

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

   16. metadata-eval N/A

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

   17. lower--.f64 N/A

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

   18. difference-of-squares-rev N/A

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

   19. difference-of-sqr--1-rev N/A

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

   20. lower-fma.f64 79.3

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

3. Applied rewrites 79.3%

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

4. Taylor expanded in x around 0

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

6. Applied rewrites 99.4%

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

   1. lift-/.f64 N/A

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

   2. lift-fma.f64 N/A

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

   3. difference-of-sqr--1 N/A

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

   4. metadata-eval N/A

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

   5. metadata-eval N/A

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

   6. fp-cancel-sub-sign N/A

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

   7. metadata-eval N/A

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

   8. associate-/r* N/A

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

   9. lower-/.f64 N/A

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

   10. lower-/.f64 N/A

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

   11. lift--.f64 N/A

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

   12. lift--.f64 99.9

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

8. Applied rewrites 99.9%

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

Alternative 2: 99.4% accurate, 1.7× speedup

Math

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

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m) :precision binary64 (/ -2.0 (fma x_m x_m -1.0)))

C

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

Julia

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

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_] := N[(-2.0 / N[(x$95$m * x$95$m + -1.0), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 78.4%

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

   1. lift--.f64 N/A

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

   2. lift-+.f64 N/A

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

   3. lift-/.f64 N/A

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

   4. lift--.f64 N/A

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

   5. lift-/.f64 N/A

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

   6. frac-sub N/A

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

   7. difference-of-squares-rev N/A

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

   8. lower-/.f64 N/A

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

   9. *-lft-identity N/A

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

   10. *-rgt-identity N/A

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

   11. lower--.f64 N/A

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

   12. lift--.f64 N/A

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

   13. metadata-eval N/A

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

   14. fp-cancel-sign-sub-inv N/A

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

   15. metadata-eval N/A

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

   16. metadata-eval N/A

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

   17. lower--.f64 N/A

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

   18. difference-of-squares-rev N/A

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

   19. difference-of-sqr--1-rev N/A

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

   20. lower-fma.f64 79.3

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

3. Applied rewrites 79.3%

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

4. Taylor expanded in x around 0

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

6. Applied rewrites 99.4%

   \[\leadsto \frac{\color{blue}{-2}}{\mathsf{fma}\left(x, x, -1\right)} \]
7. Add Preprocessing

Alternative 3: 99.3% accurate, 1.3× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} \mathbf{if}\;x\_m \leq 1:\\ \;\;\;\;\mathsf{fma}\left(x\_m, x\_m + x\_m, 2\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{-2}{x\_m}}{x\_m}\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m)
 :precision binary64
 (if (<= x_m 1.0) (fma x_m (+ x_m x_m) 2.0) (/ (/ -2.0 x_m) x_m)))

C

x_m = fabs(x);
double code(double x_m) {
	double tmp;
	if (x_m <= 1.0) {
		tmp = fma(x_m, (x_m + x_m), 2.0);
	} else {
		tmp = (-2.0 / x_m) / x_m;
	}
	return tmp;
}

Julia

x_m = abs(x)
function code(x_m)
	tmp = 0.0
	if (x_m <= 1.0)
		tmp = fma(x_m, Float64(x_m + x_m), 2.0);
	else
		tmp = Float64(Float64(-2.0 / x_m) / x_m);
	end
	return tmp
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_] := If[LessEqual[x$95$m, 1.0], N[(x$95$m * N[(x$95$m + x$95$m), $MachinePrecision] + 2.0), $MachinePrecision], N[(N[(-2.0 / x$95$m), $MachinePrecision] / x$95$m), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 1

   1. Initial program 100.0%

      \[\frac{1}{x + 1} - \frac{1}{x - 1} \]

   2. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. count-2-rev N/A

         \[\leadsto \left({x}^{2} + {x}^{2}\right) + 2 \]

      3. unpow2 N/A

         \[\leadsto \left(x \cdot x + {x}^{2}\right) + 2 \]

      4. unpow2 N/A

         \[\leadsto \left(x \cdot x + x \cdot x\right) + 2 \]

      5. distribute-lft-out N/A

         \[\leadsto x \cdot \left(x + x\right) + 2 \]

      6. lower-fma.f64 N/A

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

      7. lower-+.f64 99.6

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

   4. Applied rewrites 99.6%

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

   if 1 < x

   1. Initial program 56.5%

      \[\frac{1}{x + 1} - \frac{1}{x - 1} \]

   2. Taylor expanded in x around inf

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

      1. lower-/.f64 N/A

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

      2. unpow2 N/A

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

      3. lower-*.f64 97.9

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

   4. Applied rewrites 97.9%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-/r* N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 98.9

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

   6. Applied rewrites 98.9%

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

Alternative 4: 99.0% accurate, 1.4× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} \mathbf{if}\;x\_m \leq 1:\\ \;\;\;\;2\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{-2}{x\_m}}{x\_m}\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m) :precision binary64 (if (<= x_m 1.0) 2.0 (/ (/ -2.0 x_m) x_m)))

C

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

Fortran

x_m =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x_m)
use fmin_fmax_functions
    real(8), intent (in) :: x_m
    real(8) :: tmp
    if (x_m <= 1.0d0) then
        tmp = 2.0d0
    else
        tmp = ((-2.0d0) / x_m) / x_m
    end if
    code = tmp
end function

Java

x_m = Math.abs(x);
public static double code(double x_m) {
	double tmp;
	if (x_m <= 1.0) {
		tmp = 2.0;
	} else {
		tmp = (-2.0 / x_m) / x_m;
	}
	return tmp;
}

Python

x_m = math.fabs(x)
def code(x_m):
	tmp = 0
	if x_m <= 1.0:
		tmp = 2.0
	else:
		tmp = (-2.0 / x_m) / x_m
	return tmp

Julia

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

MATLAB

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

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_] := If[LessEqual[x$95$m, 1.0], 2.0, N[(N[(-2.0 / x$95$m), $MachinePrecision] / x$95$m), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 1

   1. Initial program 100.0%

      \[\frac{1}{x + 1} - \frac{1}{x - 1} \]

   2. Taylor expanded in x around 0

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

   4. Applied rewrites 99.2%

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

   if 1 < x

   1. Initial program 56.5%

      \[\frac{1}{x + 1} - \frac{1}{x - 1} \]

   2. Taylor expanded in x around inf

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

      1. lower-/.f64 N/A

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

      2. unpow2 N/A

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

      3. lower-*.f64 97.9

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

   4. Applied rewrites 97.9%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-/r* N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 98.9

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

   6. Applied rewrites 98.9%

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

Alternative 5: 98.6% accurate, 1.4× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} \mathbf{if}\;x\_m \leq 1:\\ \;\;\;\;2\\ \mathbf{else}:\\ \;\;\;\;\frac{-2}{x\_m \cdot x\_m}\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m) :precision binary64 (if (<= x_m 1.0) 2.0 (/ -2.0 (* x_m x_m))))

C

x_m = fabs(x);
double code(double x_m) {
	double tmp;
	if (x_m <= 1.0) {
		tmp = 2.0;
	} else {
		tmp = -2.0 / (x_m * x_m);
	}
	return tmp;
}

Fortran

x_m =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x_m)
use fmin_fmax_functions
    real(8), intent (in) :: x_m
    real(8) :: tmp
    if (x_m <= 1.0d0) then
        tmp = 2.0d0
    else
        tmp = (-2.0d0) / (x_m * x_m)
    end if
    code = tmp
end function

Java

x_m = Math.abs(x);
public static double code(double x_m) {
	double tmp;
	if (x_m <= 1.0) {
		tmp = 2.0;
	} else {
		tmp = -2.0 / (x_m * x_m);
	}
	return tmp;
}

Python

x_m = math.fabs(x)
def code(x_m):
	tmp = 0
	if x_m <= 1.0:
		tmp = 2.0
	else:
		tmp = -2.0 / (x_m * x_m)
	return tmp

Julia

x_m = abs(x)
function code(x_m)
	tmp = 0.0
	if (x_m <= 1.0)
		tmp = 2.0;
	else
		tmp = Float64(-2.0 / Float64(x_m * x_m));
	end
	return tmp
end

MATLAB

x_m = abs(x);
function tmp_2 = code(x_m)
	tmp = 0.0;
	if (x_m <= 1.0)
		tmp = 2.0;
	else
		tmp = -2.0 / (x_m * x_m);
	end
	tmp_2 = tmp;
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_] := If[LessEqual[x$95$m, 1.0], 2.0, N[(-2.0 / N[(x$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 1

   1. Initial program 100.0%

      \[\frac{1}{x + 1} - \frac{1}{x - 1} \]

   2. Taylor expanded in x around 0

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

   4. Applied rewrites 99.2%

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

   if 1 < x

   1. Initial program 56.5%

      \[\frac{1}{x + 1} - \frac{1}{x - 1} \]

   2. Taylor expanded in x around inf

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

      1. lower-/.f64 N/A

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

      2. unpow2 N/A

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

      3. lower-*.f64 97.9

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

   4. Applied rewrites 97.9%

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

Alternative 6: 53.3% accurate, 0.7× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} \mathbf{if}\;\frac{1}{x\_m + 1} - \frac{1}{x\_m - 1} \leq 0:\\ \;\;\;\;\frac{-2}{x\_m}\\ \mathbf{else}:\\ \;\;\;\;2\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m)
 :precision binary64
 (if (<= (- (/ 1.0 (+ x_m 1.0)) (/ 1.0 (- x_m 1.0))) 0.0) (/ -2.0 x_m) 2.0))

C

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

Fortran

x_m =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

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

Java

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

Python

x_m = math.fabs(x)
def code(x_m):
	tmp = 0
	if ((1.0 / (x_m + 1.0)) - (1.0 / (x_m - 1.0))) <= 0.0:
		tmp = -2.0 / x_m
	else:
		tmp = 2.0
	return tmp

Julia

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

MATLAB

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

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_] := If[LessEqual[N[(N[(1.0 / N[(x$95$m + 1.0), $MachinePrecision]), $MachinePrecision] - N[(1.0 / N[(x$95$m - 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 0.0], N[(-2.0 / x$95$m), $MachinePrecision], 2.0]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (/.f64 #s(literal 1 binary64) (+.f64 x #s(literal 1 binary64))) (/.f64 #s(literal 1 binary64) (-.f64 x #s(literal 1 binary64)))) < 0.0

   1. Initial program 56.5%

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

      1. lift--.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift-/.f64 N/A

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

      6. frac-sub N/A

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

      7. associate-/r* N/A

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

      8. lower-/.f64 N/A

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

   3. Applied rewrites 58.3%

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

   4. Taylor expanded in x around 0

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

   6. Applied rewrites 6.9%

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

   7. Taylor expanded in x around inf

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

   9. Applied rewrites 6.9%

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

   if 0.0 < (-.f64 (/.f64 #s(literal 1 binary64) (+.f64 x #s(literal 1 binary64))) (/.f64 #s(literal 1 binary64) (-.f64 x #s(literal 1 binary64))))

   1. Initial program 100.0%

      \[\frac{1}{x + 1} - \frac{1}{x - 1} \]

   2. Taylor expanded in x around 0

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

   4. Applied rewrites 99.2%

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

Alternative 7: 52.8% accurate, 2.2× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \frac{-2}{x\_m - 1} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m) :precision binary64 (/ -2.0 (- x_m 1.0)))

C

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

Fortran

x_m =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x_m)
use fmin_fmax_functions
    real(8), intent (in) :: x_m
    code = (-2.0d0) / (x_m - 1.0d0)
end function

Java

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

Python

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

Julia

x_m = abs(x)
function code(x_m)
	return Float64(-2.0 / Float64(x_m - 1.0))
end

MATLAB

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

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_] := N[(-2.0 / N[(x$95$m - 1.0), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 78.4%

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

   1. lift--.f64 N/A

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

   2. lift-+.f64 N/A

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

   3. lift-/.f64 N/A

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

   4. lift--.f64 N/A

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

   5. lift-/.f64 N/A

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

   6. frac-sub N/A

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

   7. associate-/r* N/A

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

   8. lower-/.f64 N/A

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

3. Applied rewrites 79.3%

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

4. Taylor expanded in x around 0

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

6. Applied rewrites 52.8%

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

Alternative 8: 51.2% accurate, 15.7× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ 2 \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m) :precision binary64 2.0)

C

x_m = fabs(x);
double code(double x_m) {
	return 2.0;
}

Fortran

x_m =     private
module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x_m)
use fmin_fmax_functions
    real(8), intent (in) :: x_m
    code = 2.0d0
end function

Java

x_m = Math.abs(x);
public static double code(double x_m) {
	return 2.0;
}

Python

x_m = math.fabs(x)
def code(x_m):
	return 2.0

Julia

x_m = abs(x)
function code(x_m)
	return 2.0
end

MATLAB

x_m = abs(x);
function tmp = code(x_m)
	tmp = 2.0;
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_] := 2.0

Derivation

1. Initial program 78.4%

   \[\frac{1}{x + 1} - \frac{1}{x - 1} \]

2. Taylor expanded in x around 0

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

4. Applied rewrites 51.2%

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

Reproduce

herbie shell --seed 2025115 
(FPCore (x)
  :name "Asymptote A"
  :precision binary64
  (- (/ 1.0 (+ x 1.0)) (/ 1.0 (- x 1.0))))