Statistics.Correlation.Kendall:numOfTiesBy from math-functions-0.1.5.2

Percentage Accurate: 100.0% → 100.0%

Time: 3.7s

Alternatives: 5

Speedup: 1.0×

• 24.7% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x) :precision binary64 (- (* x x) x))

C

double code(double x) {
	return (x * x) - x;
}

Fortran

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

Java

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

Python

def code(x):
	return (x * x) - x

Julia

function code(x)
	return Float64(Float64(x * x) - x)
end

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[x \cdot \left(x - 1\right) \]
2. Add Preprocessing
3. Step-by-step derivation

   1. distribute-lft-out-- N/A

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

   2. *-rgt-identity N/A

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

   3. --lowering--.f64 N/A

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

   4. *-lowering-*.f64 100.0

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

4. Applied egg-rr 100.0%

   \[\leadsto \color{blue}{x \cdot x - x} \]
5. Add Preprocessing

Alternative 2: 98.0% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \cdot \left(x + -1\right) \leq 0.001:\\ \;\;\;\;0 - x\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= (* x (+ x -1.0)) 0.001) (- 0.0 x) (* x x)))

C

double code(double x) {
	double tmp;
	if ((x * (x + -1.0)) <= 0.001) {
		tmp = 0.0 - x;
	} else {
		tmp = x * x;
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if ((x * (x + (-1.0d0))) <= 0.001d0) then
        tmp = 0.0d0 - x
    else
        tmp = x * x
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if ((x * (x + -1.0)) <= 0.001) {
		tmp = 0.0 - x;
	} else {
		tmp = x * x;
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if (x * (x + -1.0)) <= 0.001:
		tmp = 0.0 - x
	else:
		tmp = x * x
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (Float64(x * Float64(x + -1.0)) <= 0.001)
		tmp = Float64(0.0 - x);
	else
		tmp = Float64(x * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if ((x * (x + -1.0)) <= 0.001)
		tmp = 0.0 - x;
	else
		tmp = x * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[N[(x * N[(x + -1.0), $MachinePrecision]), $MachinePrecision], 0.001], N[(0.0 - x), $MachinePrecision], N[(x * x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x (-.f64 x #s(literal 1 binary64))) < 1e-3

   1. Initial program 99.9%

      \[x \cdot \left(x - 1\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{-1 \cdot x} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(x\right)} \]

      2. neg-sub0 N/A

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

      3. --lowering--.f64 97.7

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

   5. Simplified 97.7%

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

      1. sub0-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(x\right)} \]

      2. neg-lowering-neg.f64 97.7

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

   7. Applied egg-rr 97.7%

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

   if 1e-3 < (*.f64 x (-.f64 x #s(literal 1 binary64)))

   1. Initial program 100.0%

      \[x \cdot \left(x - 1\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

   5. Simplified 96.2%

      \[\leadsto x \cdot \color{blue}{x} \]
3. Recombined 2 regimes into one program.

4. Final simplification 96.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \cdot \left(x + -1\right) \leq 0.001:\\ \;\;\;\;0 - x\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 52.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 1:\\ \;\;\;\;0 - x\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (if (<= x 1.0) (- 0.0 x) x))

C

double code(double x) {
	double tmp;
	if (x <= 1.0) {
		tmp = 0.0 - x;
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= 1.0d0) then
        tmp = 0.0d0 - x
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= 1.0) {
		tmp = 0.0 - x;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= 1.0:
		tmp = 0.0 - x
	else:
		tmp = x
	return tmp

Julia

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

MATLAB

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

Wolfram

code[x_] := If[LessEqual[x, 1.0], N[(0.0 - x), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if x < 1

   1. Initial program 100.0%

      \[x \cdot \left(x - 1\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{-1 \cdot x} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(x\right)} \]

      2. neg-sub0 N/A

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

      3. --lowering--.f64 61.3

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

   5. Simplified 61.3%

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

      1. sub0-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(x\right)} \]

      2. neg-lowering-neg.f64 61.3

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

   7. Applied egg-rr 61.3%

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

   if 1 < x

   1. Initial program 100.0%

      \[x \cdot \left(x - 1\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{-1 \cdot x} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(x\right)} \]

      2. neg-sub0 N/A

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

      3. --lowering--.f64 0.5

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

   5. Simplified 0.5%

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

      1. flip3-- N/A

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

      2. metadata-eval N/A

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

      3. sub0-neg N/A

         \[\leadsto \frac{\color{blue}{\mathsf{neg}\left({x}^{3}\right)}}{0 \cdot 0 + \left(x \cdot x + 0 \cdot x\right)} \]

      4. cube-neg N/A

         \[\leadsto \frac{\color{blue}{{\left(\mathsf{neg}\left(x\right)\right)}^{3}}}{0 \cdot 0 + \left(x \cdot x + 0 \cdot x\right)} \]

      5. sqr-pow N/A

         \[\leadsto \frac{\color{blue}{{\left(\mathsf{neg}\left(x\right)\right)}^{\left(\frac{3}{2}\right)} \cdot {\left(\mathsf{neg}\left(x\right)\right)}^{\left(\frac{3}{2}\right)}}}{0 \cdot 0 + \left(x \cdot x + 0 \cdot x\right)} \]

      6. unpow-prod-down N/A

         \[\leadsto \frac{\color{blue}{{\left(\left(\mathsf{neg}\left(x\right)\right) \cdot \left(\mathsf{neg}\left(x\right)\right)\right)}^{\left(\frac{3}{2}\right)}}}{0 \cdot 0 + \left(x \cdot x + 0 \cdot x\right)} \]

      7. sqr-neg N/A

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

      8. unpow-prod-down N/A

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

      9. sqr-pow N/A

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

      10. metadata-eval N/A

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

      11. +-lft-identity N/A

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

      12. mul0-lft N/A

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

      13. +-rgt-identity N/A

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

      14. pow2 N/A

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

      15. pow-div N/A

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

      16. metadata-eval N/A

          \[\leadsto {x}^{\color{blue}{1}} \]

      17. unpow1 7.3

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

   7. Applied egg-rr 7.3%

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

4. Final simplification 46.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 1:\\ \;\;\;\;0 - x\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[x \cdot \left(x - 1\right) \]
2. Add Preprocessing

3. Final simplification 100.0%

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

Alternative 5: 3.8% accurate, 9.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 100.0%

   \[x \cdot \left(x - 1\right) \]
2. Add Preprocessing

3. Taylor expanded in x around 0

   \[\leadsto \color{blue}{-1 \cdot x} \]
4. Step-by-step derivation

   1. mul-1-neg N/A

      \[\leadsto \color{blue}{\mathsf{neg}\left(x\right)} \]

   2. neg-sub0 N/A

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

   3. --lowering--.f64 44.2

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

5. Simplified 44.2%

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

   1. flip3-- N/A

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

   2. metadata-eval N/A

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

   3. sub0-neg N/A

      \[\leadsto \frac{\color{blue}{\mathsf{neg}\left({x}^{3}\right)}}{0 \cdot 0 + \left(x \cdot x + 0 \cdot x\right)} \]

   4. cube-neg N/A

      \[\leadsto \frac{\color{blue}{{\left(\mathsf{neg}\left(x\right)\right)}^{3}}}{0 \cdot 0 + \left(x \cdot x + 0 \cdot x\right)} \]

   5. sqr-pow N/A

      \[\leadsto \frac{\color{blue}{{\left(\mathsf{neg}\left(x\right)\right)}^{\left(\frac{3}{2}\right)} \cdot {\left(\mathsf{neg}\left(x\right)\right)}^{\left(\frac{3}{2}\right)}}}{0 \cdot 0 + \left(x \cdot x + 0 \cdot x\right)} \]

   6. unpow-prod-down N/A

      \[\leadsto \frac{\color{blue}{{\left(\left(\mathsf{neg}\left(x\right)\right) \cdot \left(\mathsf{neg}\left(x\right)\right)\right)}^{\left(\frac{3}{2}\right)}}}{0 \cdot 0 + \left(x \cdot x + 0 \cdot x\right)} \]

   7. sqr-neg N/A

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

   8. unpow-prod-down N/A

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

   9. sqr-pow N/A

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

   10. metadata-eval N/A

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

   11. +-lft-identity N/A

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

   12. mul0-lft N/A

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

   13. +-rgt-identity N/A

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

   14. pow2 N/A

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

   15. pow-div N/A

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

   16. metadata-eval N/A

       \[\leadsto {x}^{\color{blue}{1}} \]

   17. unpow1 4.0

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

7. Applied egg-rr 4.0%

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

Developer Target 1: 100.0% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x) :precision binary64 (- (* x x) x))

C

double code(double x) {
	return (x * x) - x;
}

Fortran

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

Java

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

Python

def code(x):
	return (x * x) - x

Julia

function code(x)
	return Float64(Float64(x * x) - x)
end

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024195 
(FPCore (x)
  :name "Statistics.Correlation.Kendall:numOfTiesBy from math-functions-0.1.5.2"
  :precision binary64

  :alt
  (! :herbie-platform default (- (* x x) x))

  (* x (- x 1.0)))