sintan (problem 3.4.5)

Percentage Accurate: 50.9% → 99.9%

Time: 14.4s

Alternatives: 6

Speedup: 34.4×

Specification

Math

\[\begin{array}{l} \\ \frac{x - \sin x}{x - \tan x} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ (- x (sin x)) (- x (tan x))))

C

double code(double x) {
	return (x - sin(x)) / (x - tan(x));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = (x - sin(x)) / (x - tan(x))
end function

Java

public static double code(double x) {
	return (x - Math.sin(x)) / (x - Math.tan(x));
}

Python

def code(x):
	return (x - math.sin(x)) / (x - math.tan(x))

Julia

function code(x)
	return Float64(Float64(x - sin(x)) / Float64(x - tan(x)))
end

MATLAB

function tmp = code(x)
	tmp = (x - sin(x)) / (x - tan(x));
end

Wolfram

code[x_] := N[(N[(x - N[Sin[x], $MachinePrecision]), $MachinePrecision] / N[(x - N[Tan[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 50.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x - \sin x}{x - \tan x} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ (- x (sin x)) (- x (tan x))))

C

double code(double x) {
	return (x - sin(x)) / (x - tan(x));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = (x - sin(x)) / (x - tan(x))
end function

Java

public static double code(double x) {
	return (x - Math.sin(x)) / (x - Math.tan(x));
}

Python

def code(x):
	return (x - math.sin(x)) / (x - math.tan(x))

Julia

function code(x)
	return Float64(Float64(x - sin(x)) / Float64(x - tan(x)))
end

MATLAB

function tmp = code(x)
	tmp = (x - sin(x)) / (x - tan(x));
end

Wolfram

code[x_] := N[(N[(x - N[Sin[x], $MachinePrecision]), $MachinePrecision] / N[(x - N[Tan[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} \mathbf{if}\;x_m \leq 0.0048:\\ \;\;\;\;0.225 \cdot {x_m}^{2} - 0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\frac{x_m - \tan x_m}{x_m - \sin x_m}}\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m)
 :precision binary64
 (if (<= x_m 0.0048)
   (- (* 0.225 (pow x_m 2.0)) 0.5)
   (/ 1.0 (/ (- x_m (tan x_m)) (- x_m (sin x_m))))))

C

x_m = fabs(x);
double code(double x_m) {
	double tmp;
	if (x_m <= 0.0048) {
		tmp = (0.225 * pow(x_m, 2.0)) - 0.5;
	} else {
		tmp = 1.0 / ((x_m - tan(x_m)) / (x_m - sin(x_m)));
	}
	return tmp;
}

Fortran

x_m = abs(x)
real(8) function code(x_m)
    real(8), intent (in) :: x_m
    real(8) :: tmp
    if (x_m <= 0.0048d0) then
        tmp = (0.225d0 * (x_m ** 2.0d0)) - 0.5d0
    else
        tmp = 1.0d0 / ((x_m - tan(x_m)) / (x_m - sin(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 <= 0.0048) {
		tmp = (0.225 * Math.pow(x_m, 2.0)) - 0.5;
	} else {
		tmp = 1.0 / ((x_m - Math.tan(x_m)) / (x_m - Math.sin(x_m)));
	}
	return tmp;
}

Python

x_m = math.fabs(x)
def code(x_m):
	tmp = 0
	if x_m <= 0.0048:
		tmp = (0.225 * math.pow(x_m, 2.0)) - 0.5
	else:
		tmp = 1.0 / ((x_m - math.tan(x_m)) / (x_m - math.sin(x_m)))
	return tmp

Julia

x_m = abs(x)
function code(x_m)
	tmp = 0.0
	if (x_m <= 0.0048)
		tmp = Float64(Float64(0.225 * (x_m ^ 2.0)) - 0.5);
	else
		tmp = Float64(1.0 / Float64(Float64(x_m - tan(x_m)) / Float64(x_m - sin(x_m))));
	end
	return tmp
end

MATLAB

x_m = abs(x);
function tmp_2 = code(x_m)
	tmp = 0.0;
	if (x_m <= 0.0048)
		tmp = (0.225 * (x_m ^ 2.0)) - 0.5;
	else
		tmp = 1.0 / ((x_m - tan(x_m)) / (x_m - sin(x_m)));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < 0.00479999999999999958

   1. Initial program 38.1%

      \[\frac{x - \sin x}{x - \tan x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 64.2%

      \[\leadsto \color{blue}{0.225 \cdot {x}^{2} - 0.5} \]

   if 0.00479999999999999958 < x

   1. Initial program 100.0%

      \[\frac{x - \sin x}{x - \tan x} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. add-cube-cbrt 100.0%

         \[\leadsto \color{blue}{\left(\sqrt[3]{\frac{x - \sin x}{x - \tan x}} \cdot \sqrt[3]{\frac{x - \sin x}{x - \tan x}}\right) \cdot \sqrt[3]{\frac{x - \sin x}{x - \tan x}}} \]

      2. pow3 100.0%

         \[\leadsto \color{blue}{{\left(\sqrt[3]{\frac{x - \sin x}{x - \tan x}}\right)}^{3}} \]

   4. Applied egg-rr 100.0%

      \[\leadsto \color{blue}{{\left(\sqrt[3]{\frac{x - \sin x}{x - \tan x}}\right)}^{3}} \]
   5. Step-by-step derivation

      1. rem-cube-cbrt 100.0%

         \[\leadsto \color{blue}{\frac{x - \sin x}{x - \tan x}} \]

      2. clear-num 100.0%

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

   6. Applied egg-rr 100.0%

      \[\leadsto \color{blue}{\frac{1}{\frac{x - \tan x}{x - \sin x}}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 73.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 0.0048:\\ \;\;\;\;0.225 \cdot {x}^{2} - 0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\frac{x - \tan x}{x - \sin x}}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} \mathbf{if}\;x_m \leq 0.0048:\\ \;\;\;\;0.225 \cdot {x_m}^{2} - 0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{x_m - \sin x_m}{x_m - \tan x_m}\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m)
 :precision binary64
 (if (<= x_m 0.0048)
   (- (* 0.225 (pow x_m 2.0)) 0.5)
   (/ (- x_m (sin x_m)) (- x_m (tan x_m)))))

C

x_m = fabs(x);
double code(double x_m) {
	double tmp;
	if (x_m <= 0.0048) {
		tmp = (0.225 * pow(x_m, 2.0)) - 0.5;
	} else {
		tmp = (x_m - sin(x_m)) / (x_m - tan(x_m));
	}
	return tmp;
}

Fortran

x_m = abs(x)
real(8) function code(x_m)
    real(8), intent (in) :: x_m
    real(8) :: tmp
    if (x_m <= 0.0048d0) then
        tmp = (0.225d0 * (x_m ** 2.0d0)) - 0.5d0
    else
        tmp = (x_m - sin(x_m)) / (x_m - tan(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 <= 0.0048) {
		tmp = (0.225 * Math.pow(x_m, 2.0)) - 0.5;
	} else {
		tmp = (x_m - Math.sin(x_m)) / (x_m - Math.tan(x_m));
	}
	return tmp;
}

Python

x_m = math.fabs(x)
def code(x_m):
	tmp = 0
	if x_m <= 0.0048:
		tmp = (0.225 * math.pow(x_m, 2.0)) - 0.5
	else:
		tmp = (x_m - math.sin(x_m)) / (x_m - math.tan(x_m))
	return tmp

Julia

x_m = abs(x)
function code(x_m)
	tmp = 0.0
	if (x_m <= 0.0048)
		tmp = Float64(Float64(0.225 * (x_m ^ 2.0)) - 0.5);
	else
		tmp = Float64(Float64(x_m - sin(x_m)) / Float64(x_m - tan(x_m)));
	end
	return tmp
end

MATLAB

x_m = abs(x);
function tmp_2 = code(x_m)
	tmp = 0.0;
	if (x_m <= 0.0048)
		tmp = (0.225 * (x_m ^ 2.0)) - 0.5;
	else
		tmp = (x_m - sin(x_m)) / (x_m - tan(x_m));
	end
	tmp_2 = tmp;
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_] := If[LessEqual[x$95$m, 0.0048], N[(N[(0.225 * N[Power[x$95$m, 2.0], $MachinePrecision]), $MachinePrecision] - 0.5), $MachinePrecision], N[(N[(x$95$m - N[Sin[x$95$m], $MachinePrecision]), $MachinePrecision] / N[(x$95$m - N[Tan[x$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 0.00479999999999999958

   1. Initial program 38.1%

      \[\frac{x - \sin x}{x - \tan x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 64.2%

      \[\leadsto \color{blue}{0.225 \cdot {x}^{2} - 0.5} \]

   if 0.00479999999999999958 < x

   1. Initial program 100.0%

      \[\frac{x - \sin x}{x - \tan x} \]
   2. Add Preprocessing
3. Recombined 2 regimes into one program.

4. Final simplification 73.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 0.0048:\\ \;\;\;\;0.225 \cdot {x}^{2} - 0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{x - \sin x}{x - \tan x}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 98.6% accurate, 1.9× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} \mathbf{if}\;x_m \leq 1.45:\\ \;\;\;\;0.225 \cdot {x_m}^{2} - 0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{x_m}{x_m - \tan x_m}\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m)
 :precision binary64
 (if (<= x_m 1.45) (- (* 0.225 (pow x_m 2.0)) 0.5) (/ x_m (- x_m (tan x_m)))))

C

x_m = fabs(x);
double code(double x_m) {
	double tmp;
	if (x_m <= 1.45) {
		tmp = (0.225 * pow(x_m, 2.0)) - 0.5;
	} else {
		tmp = x_m / (x_m - tan(x_m));
	}
	return tmp;
}

Fortran

x_m = abs(x)
real(8) function code(x_m)
    real(8), intent (in) :: x_m
    real(8) :: tmp
    if (x_m <= 1.45d0) then
        tmp = (0.225d0 * (x_m ** 2.0d0)) - 0.5d0
    else
        tmp = x_m / (x_m - tan(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.45) {
		tmp = (0.225 * Math.pow(x_m, 2.0)) - 0.5;
	} else {
		tmp = x_m / (x_m - Math.tan(x_m));
	}
	return tmp;
}

Python

x_m = math.fabs(x)
def code(x_m):
	tmp = 0
	if x_m <= 1.45:
		tmp = (0.225 * math.pow(x_m, 2.0)) - 0.5
	else:
		tmp = x_m / (x_m - math.tan(x_m))
	return tmp

Julia

x_m = abs(x)
function code(x_m)
	tmp = 0.0
	if (x_m <= 1.45)
		tmp = Float64(Float64(0.225 * (x_m ^ 2.0)) - 0.5);
	else
		tmp = Float64(x_m / Float64(x_m - tan(x_m)));
	end
	return tmp
end

MATLAB

x_m = abs(x);
function tmp_2 = code(x_m)
	tmp = 0.0;
	if (x_m <= 1.45)
		tmp = (0.225 * (x_m ^ 2.0)) - 0.5;
	else
		tmp = x_m / (x_m - tan(x_m));
	end
	tmp_2 = tmp;
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_] := If[LessEqual[x$95$m, 1.45], N[(N[(0.225 * N[Power[x$95$m, 2.0], $MachinePrecision]), $MachinePrecision] - 0.5), $MachinePrecision], N[(x$95$m / N[(x$95$m - N[Tan[x$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 1.44999999999999996

   1. Initial program 38.1%

      \[\frac{x - \sin x}{x - \tan x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 64.2%

      \[\leadsto \color{blue}{0.225 \cdot {x}^{2} - 0.5} \]

   if 1.44999999999999996 < x

   1. Initial program 100.0%

      \[\frac{x - \sin x}{x - \tan x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 99.1%

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

4. Final simplification 72.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 1.45:\\ \;\;\;\;0.225 \cdot {x}^{2} - 0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{x - \tan x}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 98.3% accurate, 1.9× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} \mathbf{if}\;x_m \leq 1.3:\\ \;\;\;\;-0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{x_m}{x_m - \tan x_m}\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m)
 :precision binary64
 (if (<= x_m 1.3) -0.5 (/ x_m (- x_m (tan x_m)))))

C

x_m = fabs(x);
double code(double x_m) {
	double tmp;
	if (x_m <= 1.3) {
		tmp = -0.5;
	} else {
		tmp = x_m / (x_m - tan(x_m));
	}
	return tmp;
}

Fortran

x_m = abs(x)
real(8) function code(x_m)
    real(8), intent (in) :: x_m
    real(8) :: tmp
    if (x_m <= 1.3d0) then
        tmp = -0.5d0
    else
        tmp = x_m / (x_m - tan(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.3) {
		tmp = -0.5;
	} else {
		tmp = x_m / (x_m - Math.tan(x_m));
	}
	return tmp;
}

Python

x_m = math.fabs(x)
def code(x_m):
	tmp = 0
	if x_m <= 1.3:
		tmp = -0.5
	else:
		tmp = x_m / (x_m - math.tan(x_m))
	return tmp

Julia

x_m = abs(x)
function code(x_m)
	tmp = 0.0
	if (x_m <= 1.3)
		tmp = -0.5;
	else
		tmp = Float64(x_m / Float64(x_m - tan(x_m)));
	end
	return tmp
end

MATLAB

x_m = abs(x);
function tmp_2 = code(x_m)
	tmp = 0.0;
	if (x_m <= 1.3)
		tmp = -0.5;
	else
		tmp = x_m / (x_m - tan(x_m));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < 1.30000000000000004

   1. Initial program 38.1%

      \[\frac{x - \sin x}{x - \tan x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 62.8%

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

   if 1.30000000000000004 < x

   1. Initial program 100.0%

      \[\frac{x - \sin x}{x - \tan x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 99.1%

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

4. Final simplification 71.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 1.3:\\ \;\;\;\;-0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{x - \tan x}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 98.3% accurate, 34.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

x_m = abs(x)
function code(x_m)
	tmp = 0.0
	if (x_m <= 7.8)
		tmp = -0.5;
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

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

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_] := If[LessEqual[x$95$m, 7.8], -0.5, 1.0]

Derivation

1. Split input into 2 regimes

2. if x < 7.79999999999999982

   1. Initial program 38.1%

      \[\frac{x - \sin x}{x - \tan x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 62.8%

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

   if 7.79999999999999982 < x

   1. Initial program 100.0%

      \[\frac{x - \sin x}{x - \tan x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 99.1%

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

4. Final simplification 71.9%

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

Alternative 6: 50.3% accurate, 207.0× speedup

Math

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

FPCore

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

C

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

Fortran

x_m = abs(x)
real(8) function code(x_m)
    real(8), intent (in) :: x_m
    code = -0.5d0
end function

Java

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

Python

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

Julia

x_m = abs(x)
function code(x_m)
	return -0.5
end

MATLAB

x_m = abs(x);
function tmp = code(x_m)
	tmp = -0.5;
end

Wolfram

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

Derivation

1. Initial program 53.5%

   \[\frac{x - \sin x}{x - \tan x} \]
2. Add Preprocessing

3. Taylor expanded in x around 0 47.5%

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

4. Final simplification 47.5%

   \[\leadsto -0.5 \]
5. Add Preprocessing

Reproduce

herbie shell --seed 2024024 
(FPCore (x)
  :name "sintan (problem 3.4.5)"
  :precision binary64
  (/ (- x (sin x)) (- x (tan x))))