Numeric.SpecFunctions:log1p from math-functions-0.1.5.2, A

Percentage Accurate: 99.9% → 99.9%

Time: 5.2s

Alternatives: 4

Speedup: 1.0×

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

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

   1. sub-neg 99.9%

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

   2. distribute-rgt-in 99.9%

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

   3. *-un-lft-identity 99.9%

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

   4. distribute-rgt-neg-in 99.9%

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

4. Applied egg-rr 99.9%

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

5. Final simplification 99.9%

   \[\leadsto x - x \cdot \left(x \cdot y\right) \]
6. Add Preprocessing

Alternative 2: 74.6% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.8 \cdot 10^{+41} \lor \neg \left(x \leq 2.9 \cdot 10^{+32}\right):\\ \;\;\;\;x \cdot \left(x \cdot \left(-y\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -1.8e+41) (not (<= x 2.9e+32))) (* x (* x (- y))) x))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -1.8e+41) || !(x <= 2.9e+32)) {
		tmp = x * (x * -y);
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((x <= (-1.8d+41)) .or. (.not. (x <= 2.9d+32))) then
        tmp = x * (x * -y)
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((x <= -1.8e+41) || !(x <= 2.9e+32)) {
		tmp = x * (x * -y);
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x <= -1.8e+41) or not (x <= 2.9e+32):
		tmp = x * (x * -y)
	else:
		tmp = x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -1.8e+41) || !(x <= 2.9e+32))
		tmp = Float64(x * Float64(x * Float64(-y)));
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x <= -1.8e+41) || ~((x <= 2.9e+32)))
		tmp = x * (x * -y);
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -1.8e+41], N[Not[LessEqual[x, 2.9e+32]], $MachinePrecision]], N[(x * N[(x * (-y)), $MachinePrecision]), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if x < -1.80000000000000013e41 or 2.90000000000000003e32 < x

   1. Initial program 99.9%

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

   3. Taylor expanded in x around inf 81.5%

      \[\leadsto x \cdot \color{blue}{\left(-1 \cdot \left(x \cdot y\right)\right)} \]
   4. Step-by-step derivation

      1. mul-1-neg 81.5%

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

      2. *-commutative 81.5%

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

      3. distribute-rgt-neg-in 81.5%

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

   5. Simplified 81.5%

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

   if -1.80000000000000013e41 < x < 2.90000000000000003e32

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0 77.1%

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

4. Final simplification 79.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.8 \cdot 10^{+41} \lor \neg \left(x \leq 2.9 \cdot 10^{+32}\right):\\ \;\;\;\;x \cdot \left(x \cdot \left(-y\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

Alternative 4: 51.6% accurate, 7.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 x)

C

double code(double x, double y) {
	return x;
}

Fortran

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

Java

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

Python

def code(x, y):
	return x

Julia

function code(x, y)
	return x
end

MATLAB

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

Wolfram

code[x_, y_] := x

Derivation

1. Initial program 99.9%

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

3. Taylor expanded in x around 0 49.1%

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

Reproduce

herbie shell --seed 2024170 
(FPCore (x y)
  :name "Numeric.SpecFunctions:log1p from math-functions-0.1.5.2, A"
  :precision binary64
  (* x (- 1.0 (* x y))))