sintan (problem 3.4.5)

Percentage Accurate: 51.0% → 99.9%

Time: 17.2s

Alternatives: 7

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: 51.0% 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, 0.7× speedup

Math

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

FPCore

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

C

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

Fortran

x_m = abs(x)
real(8) function code(x_m)
    real(8), intent (in) :: x_m
    real(8) :: t_0
    real(8) :: tmp
    t_0 = x_m - sin(x_m)
    if (x_m <= 0.0039d0) then
        tmp = (0.225d0 * (x_m ** 2.0d0)) - 0.5d0
    else
        tmp = 1.0d0 / ((x_m / t_0) - (tan(x_m) / t_0))
    end if
    code = tmp
end function

Java

x_m = Math.abs(x);
public static double code(double x_m) {
	double t_0 = x_m - Math.sin(x_m);
	double tmp;
	if (x_m <= 0.0039) {
		tmp = (0.225 * Math.pow(x_m, 2.0)) - 0.5;
	} else {
		tmp = 1.0 / ((x_m / t_0) - (Math.tan(x_m) / t_0));
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < 0.0038999999999999998

   1. Initial program 31.3%

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

   3. Taylor expanded in x around 0 70.1%

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

   if 0.0038999999999999998 < x

   1. Initial program 99.9%

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

      1. clear-num 100.0%

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

      2. inv-pow 100.0%

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

   4. Applied egg-rr 100.0%

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

      1. unpow-1 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}}} \]
   7. Step-by-step derivation

      1. div-sub 100.0%

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

   8. Applied egg-rr 100.0%

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

4. Final simplification 77.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 0.0039:\\ \;\;\;\;0.225 \cdot {x}^{2} - 0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\frac{x}{x - \sin x} - \frac{\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.0042:\\ \;\;\;\;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.0042)
   (- (* 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.0042) {
		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.0042d0) 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.0042) {
		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.0042:
		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.0042)
		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.0042)
		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.0042], 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.00419999999999999974

   1. Initial program 31.3%

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

   3. Taylor expanded in x around 0 70.1%

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

   if 0.00419999999999999974 < x

   1. Initial program 99.9%

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

      1. clear-num 100.0%

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

      2. inv-pow 100.0%

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

   4. Applied egg-rr 100.0%

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

      1. unpow-1 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 77.8%

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

Alternative 3: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} \mathbf{if}\;x_m \leq 0.0042:\\ \;\;\;\;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.0042)
   (- (* 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.0042) {
		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.0042d0) 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.0042) {
		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.0042:
		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.0042)
		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.0042)
		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.0042], 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.00419999999999999974

   1. Initial program 31.3%

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

   3. Taylor expanded in x around 0 70.1%

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

   if 0.00419999999999999974 < x

   1. Initial program 99.9%

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

4. Final simplification 77.8%

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

Alternative 4: 98.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} \mathbf{if}\;x_m \leq 2.5:\\ \;\;\;\;{\left(x_m \cdot \sqrt{0.225}\right)}^{2} - 0.5\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m)
 :precision binary64
 (if (<= x_m 2.5) (- (pow (* x_m (sqrt 0.225)) 2.0) 0.5) 1.0))

C

x_m = fabs(x);
double code(double x_m) {
	double tmp;
	if (x_m <= 2.5) {
		tmp = pow((x_m * sqrt(0.225)), 2.0) - 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 <= 2.5d0) then
        tmp = ((x_m * sqrt(0.225d0)) ** 2.0d0) - 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 <= 2.5) {
		tmp = Math.pow((x_m * Math.sqrt(0.225)), 2.0) - 0.5;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

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

Julia

x_m = abs(x)
function code(x_m)
	tmp = 0.0
	if (x_m <= 2.5)
		tmp = Float64((Float64(x_m * sqrt(0.225)) ^ 2.0) - 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 <= 2.5)
		tmp = ((x_m * sqrt(0.225)) ^ 2.0) - 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, 2.5], N[(N[Power[N[(x$95$m * N[Sqrt[0.225], $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] - 0.5), $MachinePrecision], 1.0]

Derivation

1. Split input into 2 regimes

2. if x < 2.5

   1. Initial program 31.6%

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

   3. Taylor expanded in x around 0 69.9%

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

      1. add-sqr-sqrt 69.9%

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

      2. pow2 69.9%

         \[\leadsto \color{blue}{{\left(\sqrt{0.225 \cdot {x}^{2}}\right)}^{2}} - 0.5 \]

      3. *-commutative 69.9%

         \[\leadsto {\left(\sqrt{\color{blue}{{x}^{2} \cdot 0.225}}\right)}^{2} - 0.5 \]

      4. sqrt-prod 69.9%

         \[\leadsto {\color{blue}{\left(\sqrt{{x}^{2}} \cdot \sqrt{0.225}\right)}}^{2} - 0.5 \]

      5. unpow2 69.9%

         \[\leadsto {\left(\sqrt{\color{blue}{x \cdot x}} \cdot \sqrt{0.225}\right)}^{2} - 0.5 \]

      6. sqrt-prod 41.0%

         \[\leadsto {\left(\color{blue}{\left(\sqrt{x} \cdot \sqrt{x}\right)} \cdot \sqrt{0.225}\right)}^{2} - 0.5 \]

      7. add-sqr-sqrt 69.9%

         \[\leadsto {\left(\color{blue}{x} \cdot \sqrt{0.225}\right)}^{2} - 0.5 \]

   5. Applied egg-rr 69.9%

      \[\leadsto \color{blue}{{\left(x \cdot \sqrt{0.225}\right)}^{2}} - 0.5 \]

   if 2.5 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 99.4%

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

4. Final simplification 77.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 2.5:\\ \;\;\;\;{\left(x \cdot \sqrt{0.225}\right)}^{2} - 0.5\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 98.7% accurate, 1.9× speedup

Math

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

FPCore

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

C

x_m = fabs(x);
double code(double x_m) {
	double tmp;
	if (x_m <= 2.5) {
		tmp = (0.225 * pow(x_m, 2.0)) - 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 <= 2.5d0) then
        tmp = (0.225d0 * (x_m ** 2.0d0)) - 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 <= 2.5) {
		tmp = (0.225 * Math.pow(x_m, 2.0)) - 0.5;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

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

Julia

x_m = abs(x)
function code(x_m)
	tmp = 0.0
	if (x_m <= 2.5)
		tmp = Float64(Float64(0.225 * (x_m ^ 2.0)) - 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 <= 2.5)
		tmp = (0.225 * (x_m ^ 2.0)) - 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, 2.5], N[(N[(0.225 * N[Power[x$95$m, 2.0], $MachinePrecision]), $MachinePrecision] - 0.5), $MachinePrecision], 1.0]

Derivation

1. Split input into 2 regimes

2. if x < 2.5

   1. Initial program 31.6%

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

   3. Taylor expanded in x around 0 69.9%

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

   if 2.5 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 99.4%

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

4. Final simplification 77.4%

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

Alternative 6: 98.4% accurate, 34.4× speedup

Math

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

FPCore

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

C

x_m = fabs(x);
double code(double x_m) {
	double tmp;
	if (x_m <= 4.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 <= 4.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 <= 4.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 <= 4.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 <= 4.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 <= 4.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, 4.8], -0.5, 1.0]

Derivation

1. Split input into 2 regimes

2. if x < 4.79999999999999982

   1. Initial program 31.6%

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

   3. Taylor expanded in x around 0 69.0%

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

   if 4.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.4%

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

4. Final simplification 76.7%

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

Alternative 7: 50.2% 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 49.0%

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

3. Taylor expanded in x around 0 51.9%

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

4. Final simplification 51.9%

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

Reproduce

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