Hyperbolic arc-(co)tangent

Percentage Accurate: 8.5% → 99.6%

Time: 6.9s

Alternatives: 5

Speedup: 111.0×

• Could not converge on a ground truth

  1. reg0 = (bf "8.128725342168213045393502029479262843933e-253")

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

def code(x):
	return (1.0 / 2.0) * math.log(((1.0 + x) / (1.0 - x)))

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 8.5% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

def code(x):
	return (1.0 / 2.0) * math.log(((1.0 + x) / (1.0 - x)))

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x + 0.3333333333333333 \cdot {x}^{3} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (+ x (* 0.3333333333333333 (pow x 3.0))))

C

double code(double x) {
	return x + (0.3333333333333333 * pow(x, 3.0));
}

Fortran

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

Java

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

Python

def code(x):
	return x + (0.3333333333333333 * math.pow(x, 3.0))

Julia

function code(x)
	return Float64(x + Float64(0.3333333333333333 * (x ^ 3.0)))
end

MATLAB

function tmp = code(x)
	tmp = x + (0.3333333333333333 * (x ^ 3.0));
end

Wolfram

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

Derivation

1. Initial program 8.2%

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

   1. metadata-eval 8.2%

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

3. Simplified 8.2%

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

5. Taylor expanded in x around 0 100.0%

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

   1. distribute-rgt-in 100.0%

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

   2. *-lft-identity 100.0%

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

   3. associate-*l* 100.0%

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

   4. unpow2 100.0%

      \[\leadsto x + 0.3333333333333333 \cdot \left(\color{blue}{\left(x \cdot x\right)} \cdot x\right) \]

   5. unpow3 100.0%

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

7. Simplified 100.0%

   \[\leadsto \color{blue}{x + 0.3333333333333333 \cdot {x}^{3}} \]
8. Add Preprocessing

Alternative 2: 99.6% accurate, 4.4× speedup

Math

\[\begin{array}{l} \\ 0.5 \cdot \left(x \cdot \left(1 + x \cdot \left(x \cdot 0.3333333333333333 - 0.5\right)\right) - x \cdot \left(x \cdot \left(x \cdot -0.3333333333333333 - 0.5\right) + -1\right)\right) \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (*
  0.5
  (-
   (* x (+ 1.0 (* x (- (* x 0.3333333333333333) 0.5))))
   (* x (+ (* x (- (* x -0.3333333333333333) 0.5)) -1.0)))))

C

double code(double x) {
	return 0.5 * ((x * (1.0 + (x * ((x * 0.3333333333333333) - 0.5)))) - (x * ((x * ((x * -0.3333333333333333) - 0.5)) + -1.0)));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = 0.5d0 * ((x * (1.0d0 + (x * ((x * 0.3333333333333333d0) - 0.5d0)))) - (x * ((x * ((x * (-0.3333333333333333d0)) - 0.5d0)) + (-1.0d0))))
end function

Java

public static double code(double x) {
	return 0.5 * ((x * (1.0 + (x * ((x * 0.3333333333333333) - 0.5)))) - (x * ((x * ((x * -0.3333333333333333) - 0.5)) + -1.0)));
}

Python

def code(x):
	return 0.5 * ((x * (1.0 + (x * ((x * 0.3333333333333333) - 0.5)))) - (x * ((x * ((x * -0.3333333333333333) - 0.5)) + -1.0)))

Julia

function code(x)
	return Float64(0.5 * Float64(Float64(x * Float64(1.0 + Float64(x * Float64(Float64(x * 0.3333333333333333) - 0.5)))) - Float64(x * Float64(Float64(x * Float64(Float64(x * -0.3333333333333333) - 0.5)) + -1.0))))
end

MATLAB

function tmp = code(x)
	tmp = 0.5 * ((x * (1.0 + (x * ((x * 0.3333333333333333) - 0.5)))) - (x * ((x * ((x * -0.3333333333333333) - 0.5)) + -1.0)));
end

Wolfram

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

Derivation

1. Initial program 8.2%

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

   1. metadata-eval 8.2%

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

3. Simplified 8.2%

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

   1. log-pow 8.2%

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

   2. pow1/2 8.2%

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

   3. *-un-lft-identity 8.2%

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

   4. log-prod 8.2%

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

   5. metadata-eval 8.2%

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

   6. pow1/2 8.2%

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

   7. log-pow 8.2%

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

   8. log-div 8.2%

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

   9. log1p-define 20.8%

      \[\leadsto 0 + 0.5 \cdot \left(\color{blue}{\mathsf{log1p}\left(x\right)} - \log \left(1 - x\right)\right) \]

   10. sub-neg 20.8%

       \[\leadsto 0 + 0.5 \cdot \left(\mathsf{log1p}\left(x\right) - \log \color{blue}{\left(1 + \left(-x\right)\right)}\right) \]

   11. log1p-define 100.0%

       \[\leadsto 0 + 0.5 \cdot \left(\mathsf{log1p}\left(x\right) - \color{blue}{\mathsf{log1p}\left(-x\right)}\right) \]

6. Applied egg-rr 100.0%

   \[\leadsto \color{blue}{0 + 0.5 \cdot \left(\mathsf{log1p}\left(x\right) - \mathsf{log1p}\left(-x\right)\right)} \]
7. Step-by-step derivation

   1. +-lft-identity 100.0%

      \[\leadsto \color{blue}{0.5 \cdot \left(\mathsf{log1p}\left(x\right) - \mathsf{log1p}\left(-x\right)\right)} \]

8. Simplified 100.0%

   \[\leadsto \color{blue}{0.5 \cdot \left(\mathsf{log1p}\left(x\right) - \mathsf{log1p}\left(-x\right)\right)} \]

9. Taylor expanded in x around 0 100.0%

   \[\leadsto 0.5 \cdot \left(\mathsf{log1p}\left(x\right) - \color{blue}{x \cdot \left(x \cdot \left(x \cdot \left(-0.25 \cdot x - 0.3333333333333333\right) - 0.5\right) - 1\right)}\right) \]

10. Taylor expanded in x around 0 99.9%

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

11. Taylor expanded in x around 0 100.0%

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

12. Final simplification 100.0%

    \[\leadsto 0.5 \cdot \left(x \cdot \left(1 + x \cdot \left(x \cdot 0.3333333333333333 - 0.5\right)\right) - x \cdot \left(x \cdot \left(x \cdot -0.3333333333333333 - 0.5\right) + -1\right)\right) \]
13. Add Preprocessing

Alternative 3: 99.1% accurate, 4.4× speedup

Math

\[\begin{array}{l} \\ 0.5 \cdot \left(x \cdot \left(1 + x \cdot -0.5\right) - x \cdot \left(x \cdot \left(x \cdot \left(x \cdot -0.25 - 0.3333333333333333\right) - 0.5\right) + -1\right)\right) \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (*
  0.5
  (-
   (* x (+ 1.0 (* x -0.5)))
   (* x (+ (* x (- (* x (- (* x -0.25) 0.3333333333333333)) 0.5)) -1.0)))))

C

double code(double x) {
	return 0.5 * ((x * (1.0 + (x * -0.5))) - (x * ((x * ((x * ((x * -0.25) - 0.3333333333333333)) - 0.5)) + -1.0)));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = 0.5d0 * ((x * (1.0d0 + (x * (-0.5d0)))) - (x * ((x * ((x * ((x * (-0.25d0)) - 0.3333333333333333d0)) - 0.5d0)) + (-1.0d0))))
end function

Java

public static double code(double x) {
	return 0.5 * ((x * (1.0 + (x * -0.5))) - (x * ((x * ((x * ((x * -0.25) - 0.3333333333333333)) - 0.5)) + -1.0)));
}

Python

def code(x):
	return 0.5 * ((x * (1.0 + (x * -0.5))) - (x * ((x * ((x * ((x * -0.25) - 0.3333333333333333)) - 0.5)) + -1.0)))

Julia

function code(x)
	return Float64(0.5 * Float64(Float64(x * Float64(1.0 + Float64(x * -0.5))) - Float64(x * Float64(Float64(x * Float64(Float64(x * Float64(Float64(x * -0.25) - 0.3333333333333333)) - 0.5)) + -1.0))))
end

MATLAB

function tmp = code(x)
	tmp = 0.5 * ((x * (1.0 + (x * -0.5))) - (x * ((x * ((x * ((x * -0.25) - 0.3333333333333333)) - 0.5)) + -1.0)));
end

Wolfram

code[x_] := N[(0.5 * N[(N[(x * N[(1.0 + N[(x * -0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(x * N[(N[(x * N[(N[(x * N[(N[(x * -0.25), $MachinePrecision] - 0.3333333333333333), $MachinePrecision]), $MachinePrecision] - 0.5), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 8.2%

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

   1. metadata-eval 8.2%

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

3. Simplified 8.2%

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

   1. log-pow 8.2%

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

   2. pow1/2 8.2%

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

   3. *-un-lft-identity 8.2%

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

   4. log-prod 8.2%

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

   5. metadata-eval 8.2%

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

   6. pow1/2 8.2%

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

   7. log-pow 8.2%

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

   8. log-div 8.2%

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

   9. log1p-define 20.8%

      \[\leadsto 0 + 0.5 \cdot \left(\color{blue}{\mathsf{log1p}\left(x\right)} - \log \left(1 - x\right)\right) \]

   10. sub-neg 20.8%

       \[\leadsto 0 + 0.5 \cdot \left(\mathsf{log1p}\left(x\right) - \log \color{blue}{\left(1 + \left(-x\right)\right)}\right) \]

   11. log1p-define 100.0%

       \[\leadsto 0 + 0.5 \cdot \left(\mathsf{log1p}\left(x\right) - \color{blue}{\mathsf{log1p}\left(-x\right)}\right) \]

6. Applied egg-rr 100.0%

   \[\leadsto \color{blue}{0 + 0.5 \cdot \left(\mathsf{log1p}\left(x\right) - \mathsf{log1p}\left(-x\right)\right)} \]
7. Step-by-step derivation

   1. +-lft-identity 100.0%

      \[\leadsto \color{blue}{0.5 \cdot \left(\mathsf{log1p}\left(x\right) - \mathsf{log1p}\left(-x\right)\right)} \]

8. Simplified 100.0%

   \[\leadsto \color{blue}{0.5 \cdot \left(\mathsf{log1p}\left(x\right) - \mathsf{log1p}\left(-x\right)\right)} \]

9. Taylor expanded in x around 0 100.0%

   \[\leadsto 0.5 \cdot \left(\mathsf{log1p}\left(x\right) - \color{blue}{x \cdot \left(x \cdot \left(x \cdot \left(-0.25 \cdot x - 0.3333333333333333\right) - 0.5\right) - 1\right)}\right) \]

10. Taylor expanded in x around 0 99.6%

    \[\leadsto 0.5 \cdot \left(\color{blue}{x \cdot \left(1 + -0.5 \cdot x\right)} - x \cdot \left(x \cdot \left(x \cdot \left(-0.25 \cdot x - 0.3333333333333333\right) - 0.5\right) - 1\right)\right) \]
11. Step-by-step derivation

    1. *-commutative 99.6%

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

12. Simplified 99.6%

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

13. Final simplification 99.6%

    \[\leadsto 0.5 \cdot \left(x \cdot \left(1 + x \cdot -0.5\right) - x \cdot \left(x \cdot \left(x \cdot \left(x \cdot -0.25 - 0.3333333333333333\right) - 0.5\right) + -1\right)\right) \]
14. Add Preprocessing

Alternative 4: 99.1% accurate, 5.3× speedup

Math

\[\begin{array}{l} \\ 0.5 \cdot \left(x \cdot \left(1 + x \cdot -0.5\right) + x \cdot \left(1 - x \cdot \left(x \cdot -0.3333333333333333 - 0.5\right)\right)\right) \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (*
  0.5
  (+
   (* x (+ 1.0 (* x -0.5)))
   (* x (- 1.0 (* x (- (* x -0.3333333333333333) 0.5)))))))

C

double code(double x) {
	return 0.5 * ((x * (1.0 + (x * -0.5))) + (x * (1.0 - (x * ((x * -0.3333333333333333) - 0.5)))));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = 0.5d0 * ((x * (1.0d0 + (x * (-0.5d0)))) + (x * (1.0d0 - (x * ((x * (-0.3333333333333333d0)) - 0.5d0)))))
end function

Java

public static double code(double x) {
	return 0.5 * ((x * (1.0 + (x * -0.5))) + (x * (1.0 - (x * ((x * -0.3333333333333333) - 0.5)))));
}

Python

def code(x):
	return 0.5 * ((x * (1.0 + (x * -0.5))) + (x * (1.0 - (x * ((x * -0.3333333333333333) - 0.5)))))

Julia

function code(x)
	return Float64(0.5 * Float64(Float64(x * Float64(1.0 + Float64(x * -0.5))) + Float64(x * Float64(1.0 - Float64(x * Float64(Float64(x * -0.3333333333333333) - 0.5))))))
end

MATLAB

function tmp = code(x)
	tmp = 0.5 * ((x * (1.0 + (x * -0.5))) + (x * (1.0 - (x * ((x * -0.3333333333333333) - 0.5)))));
end

Wolfram

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

Derivation

1. Initial program 8.2%

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

   1. metadata-eval 8.2%

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

3. Simplified 8.2%

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

   1. log-pow 8.2%

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

   2. pow1/2 8.2%

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

   3. *-un-lft-identity 8.2%

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

   4. log-prod 8.2%

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

   5. metadata-eval 8.2%

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

   6. pow1/2 8.2%

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

   7. log-pow 8.2%

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

   8. log-div 8.2%

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

   9. log1p-define 20.8%

      \[\leadsto 0 + 0.5 \cdot \left(\color{blue}{\mathsf{log1p}\left(x\right)} - \log \left(1 - x\right)\right) \]

   10. sub-neg 20.8%

       \[\leadsto 0 + 0.5 \cdot \left(\mathsf{log1p}\left(x\right) - \log \color{blue}{\left(1 + \left(-x\right)\right)}\right) \]

   11. log1p-define 100.0%

       \[\leadsto 0 + 0.5 \cdot \left(\mathsf{log1p}\left(x\right) - \color{blue}{\mathsf{log1p}\left(-x\right)}\right) \]

6. Applied egg-rr 100.0%

   \[\leadsto \color{blue}{0 + 0.5 \cdot \left(\mathsf{log1p}\left(x\right) - \mathsf{log1p}\left(-x\right)\right)} \]
7. Step-by-step derivation

   1. +-lft-identity 100.0%

      \[\leadsto \color{blue}{0.5 \cdot \left(\mathsf{log1p}\left(x\right) - \mathsf{log1p}\left(-x\right)\right)} \]

8. Simplified 100.0%

   \[\leadsto \color{blue}{0.5 \cdot \left(\mathsf{log1p}\left(x\right) - \mathsf{log1p}\left(-x\right)\right)} \]

9. Taylor expanded in x around 0 100.0%

   \[\leadsto 0.5 \cdot \left(\mathsf{log1p}\left(x\right) - \color{blue}{x \cdot \left(x \cdot \left(x \cdot \left(-0.25 \cdot x - 0.3333333333333333\right) - 0.5\right) - 1\right)}\right) \]

10. Taylor expanded in x around 0 99.6%

    \[\leadsto 0.5 \cdot \left(\color{blue}{x \cdot \left(1 + -0.5 \cdot x\right)} - x \cdot \left(x \cdot \left(x \cdot \left(-0.25 \cdot x - 0.3333333333333333\right) - 0.5\right) - 1\right)\right) \]
11. Step-by-step derivation

    1. *-commutative 99.6%

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

12. Simplified 99.6%

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

13. Taylor expanded in x around 0 99.6%

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

14. Final simplification 99.6%

    \[\leadsto 0.5 \cdot \left(x \cdot \left(1 + x \cdot -0.5\right) + x \cdot \left(1 - x \cdot \left(x \cdot -0.3333333333333333 - 0.5\right)\right)\right) \]
15. Add Preprocessing

Alternative 5: 99.1% accurate, 111.0× speedup

Math

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

FPCore

(FPCore (x) :precision binary64 x)

C

double code(double x) {
	return x;
}

Fortran

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

Java

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

Python

def code(x):
	return x

Julia

function code(x)
	return x
end

MATLAB

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

Wolfram

code[x_] := x

Derivation

1. Initial program 8.2%

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

   1. metadata-eval 8.2%

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

3. Simplified 8.2%

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

5. Taylor expanded in x around 0 99.5%

   \[\leadsto \color{blue}{x} \]
6. Add Preprocessing

Reproduce

herbie shell --seed 2024137 
(FPCore (x)
  :name "Hyperbolic arc-(co)tangent"
  :precision binary64
  (* (/ 1.0 2.0) (log (/ (+ 1.0 x) (- 1.0 x)))))