cos2 (problem 3.4.1)

Percentage Accurate: 50.7% → 99.6%

Time: 11.0s

Alternatives: 6

Speedup: 17.8×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

def code(x):
	return (1.0 - math.cos(x)) / (x * x)

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 50.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

def code(x):
	return (1.0 - math.cos(x)) / (x * x)

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.6% accurate, 0.5× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} \mathbf{if}\;x\_m \leq 0.0035:\\ \;\;\;\;0.5 + \left(x\_m \cdot x\_m\right) \cdot -0.041666666666666664\\ \mathbf{else}:\\ \;\;\;\;{x\_m}^{-2} \cdot \left(1 - \cos x\_m\right)\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m)
 :precision binary64
 (if (<= x_m 0.0035)
   (+ 0.5 (* (* x_m x_m) -0.041666666666666664))
   (* (pow x_m -2.0) (- 1.0 (cos x_m)))))

C

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

Python

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

Julia

x_m = abs(x)
function code(x_m)
	tmp = 0.0
	if (x_m <= 0.0035)
		tmp = Float64(0.5 + Float64(Float64(x_m * x_m) * -0.041666666666666664));
	else
		tmp = Float64((x_m ^ -2.0) * Float64(1.0 - cos(x_m)));
	end
	return tmp
end

MATLAB

x_m = abs(x);
function tmp_2 = code(x_m)
	tmp = 0.0;
	if (x_m <= 0.0035)
		tmp = 0.5 + ((x_m * x_m) * -0.041666666666666664);
	else
		tmp = (x_m ^ -2.0) * (1.0 - cos(x_m));
	end
	tmp_2 = tmp;
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_] := If[LessEqual[x$95$m, 0.0035], N[(0.5 + N[(N[(x$95$m * x$95$m), $MachinePrecision] * -0.041666666666666664), $MachinePrecision]), $MachinePrecision], N[(N[Power[x$95$m, -2.0], $MachinePrecision] * N[(1.0 - N[Cos[x$95$m], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 0.00350000000000000007

   1. Initial program 34.8%

      \[\frac{1 - \cos x}{x \cdot x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 66.2%

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

      1. *-commutative 66.2%

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

   5. Simplified 66.2%

      \[\leadsto \color{blue}{0.5 + {x}^{2} \cdot -0.041666666666666664} \]
   6. Step-by-step derivation

      1. pow2 66.2%

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

   7. Applied egg-rr 66.2%

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

   if 0.00350000000000000007 < x

   1. Initial program 99.2%

      \[\frac{1 - \cos x}{x \cdot x} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. clear-num 99.1%

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

      2. associate-/r/ 99.2%

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

      3. pow2 99.2%

         \[\leadsto \frac{1}{\color{blue}{{x}^{2}}} \cdot \left(1 - \cos x\right) \]

      4. pow-flip 99.2%

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

      5. metadata-eval 99.2%

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

   4. Applied egg-rr 99.2%

      \[\leadsto \color{blue}{{x}^{-2} \cdot \left(1 - \cos x\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 73.7%

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

Alternative 2: 99.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} \mathbf{if}\;x\_m \leq 0.0035:\\ \;\;\;\;0.5 + \left(x\_m \cdot x\_m\right) \cdot -0.041666666666666664\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(1 - \cos x\_m\right) \cdot \frac{1}{x\_m}}{x\_m}\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m)
 :precision binary64
 (if (<= x_m 0.0035)
   (+ 0.5 (* (* x_m x_m) -0.041666666666666664))
   (/ (* (- 1.0 (cos x_m)) (/ 1.0 x_m)) x_m)))

C

x_m = fabs(x);
double code(double x_m) {
	double tmp;
	if (x_m <= 0.0035) {
		tmp = 0.5 + ((x_m * x_m) * -0.041666666666666664);
	} else {
		tmp = ((1.0 - cos(x_m)) * (1.0 / x_m)) / 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.0035d0) then
        tmp = 0.5d0 + ((x_m * x_m) * (-0.041666666666666664d0))
    else
        tmp = ((1.0d0 - cos(x_m)) * (1.0d0 / x_m)) / 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.0035) {
		tmp = 0.5 + ((x_m * x_m) * -0.041666666666666664);
	} else {
		tmp = ((1.0 - Math.cos(x_m)) * (1.0 / x_m)) / x_m;
	}
	return tmp;
}

Python

x_m = math.fabs(x)
def code(x_m):
	tmp = 0
	if x_m <= 0.0035:
		tmp = 0.5 + ((x_m * x_m) * -0.041666666666666664)
	else:
		tmp = ((1.0 - math.cos(x_m)) * (1.0 / x_m)) / x_m
	return tmp

Julia

x_m = abs(x)
function code(x_m)
	tmp = 0.0
	if (x_m <= 0.0035)
		tmp = Float64(0.5 + Float64(Float64(x_m * x_m) * -0.041666666666666664));
	else
		tmp = Float64(Float64(Float64(1.0 - cos(x_m)) * Float64(1.0 / x_m)) / x_m);
	end
	return tmp
end

MATLAB

x_m = abs(x);
function tmp_2 = code(x_m)
	tmp = 0.0;
	if (x_m <= 0.0035)
		tmp = 0.5 + ((x_m * x_m) * -0.041666666666666664);
	else
		tmp = ((1.0 - cos(x_m)) * (1.0 / x_m)) / x_m;
	end
	tmp_2 = tmp;
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_] := If[LessEqual[x$95$m, 0.0035], N[(0.5 + N[(N[(x$95$m * x$95$m), $MachinePrecision] * -0.041666666666666664), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 - N[Cos[x$95$m], $MachinePrecision]), $MachinePrecision] * N[(1.0 / x$95$m), $MachinePrecision]), $MachinePrecision] / x$95$m), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 0.00350000000000000007

   1. Initial program 34.8%

      \[\frac{1 - \cos x}{x \cdot x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 66.2%

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

      1. *-commutative 66.2%

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

   5. Simplified 66.2%

      \[\leadsto \color{blue}{0.5 + {x}^{2} \cdot -0.041666666666666664} \]
   6. Step-by-step derivation

      1. pow2 66.2%

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

   7. Applied egg-rr 66.2%

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

   if 0.00350000000000000007 < x

   1. Initial program 99.2%

      \[\frac{1 - \cos x}{x \cdot x} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. associate-/r* 99.1%

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

      2. div-inv 99.0%

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

   4. Applied egg-rr 99.0%

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

      1. *-commutative 99.0%

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

      2. associate-*r/ 99.1%

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

   6. Applied egg-rr 99.1%

      \[\leadsto \color{blue}{\frac{\frac{1}{x} \cdot \left(1 - \cos x\right)}{x}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 73.7%

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

Alternative 3: 99.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} \mathbf{if}\;x\_m \leq 0.0035:\\ \;\;\;\;0.5 + \left(x\_m \cdot x\_m\right) \cdot -0.041666666666666664\\ \mathbf{else}:\\ \;\;\;\;\frac{1 - \cos x\_m}{x\_m \cdot x\_m}\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m)
 :precision binary64
 (if (<= x_m 0.0035)
   (+ 0.5 (* (* x_m x_m) -0.041666666666666664))
   (/ (- 1.0 (cos x_m)) (* x_m x_m))))

C

x_m = fabs(x);
double code(double x_m) {
	double tmp;
	if (x_m <= 0.0035) {
		tmp = 0.5 + ((x_m * x_m) * -0.041666666666666664);
	} else {
		tmp = (1.0 - cos(x_m)) / (x_m * 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.0035d0) then
        tmp = 0.5d0 + ((x_m * x_m) * (-0.041666666666666664d0))
    else
        tmp = (1.0d0 - cos(x_m)) / (x_m * 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.0035) {
		tmp = 0.5 + ((x_m * x_m) * -0.041666666666666664);
	} else {
		tmp = (1.0 - Math.cos(x_m)) / (x_m * x_m);
	}
	return tmp;
}

Python

x_m = math.fabs(x)
def code(x_m):
	tmp = 0
	if x_m <= 0.0035:
		tmp = 0.5 + ((x_m * x_m) * -0.041666666666666664)
	else:
		tmp = (1.0 - math.cos(x_m)) / (x_m * x_m)
	return tmp

Julia

x_m = abs(x)
function code(x_m)
	tmp = 0.0
	if (x_m <= 0.0035)
		tmp = Float64(0.5 + Float64(Float64(x_m * x_m) * -0.041666666666666664));
	else
		tmp = Float64(Float64(1.0 - cos(x_m)) / Float64(x_m * x_m));
	end
	return tmp
end

MATLAB

x_m = abs(x);
function tmp_2 = code(x_m)
	tmp = 0.0;
	if (x_m <= 0.0035)
		tmp = 0.5 + ((x_m * x_m) * -0.041666666666666664);
	else
		tmp = (1.0 - cos(x_m)) / (x_m * x_m);
	end
	tmp_2 = tmp;
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_] := If[LessEqual[x$95$m, 0.0035], N[(0.5 + N[(N[(x$95$m * x$95$m), $MachinePrecision] * -0.041666666666666664), $MachinePrecision]), $MachinePrecision], N[(N[(1.0 - N[Cos[x$95$m], $MachinePrecision]), $MachinePrecision] / N[(x$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 0.00350000000000000007

   1. Initial program 34.8%

      \[\frac{1 - \cos x}{x \cdot x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 66.2%

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

      1. *-commutative 66.2%

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

   5. Simplified 66.2%

      \[\leadsto \color{blue}{0.5 + {x}^{2} \cdot -0.041666666666666664} \]
   6. Step-by-step derivation

      1. pow2 66.2%

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

   7. Applied egg-rr 66.2%

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

   if 0.00350000000000000007 < x

   1. Initial program 99.2%

      \[\frac{1 - \cos x}{x \cdot x} \]
   2. Add Preprocessing
3. Recombined 2 regimes into one program.

4. Final simplification 73.7%

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

Alternative 4: 99.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} \mathbf{if}\;x\_m \leq 0.0035:\\ \;\;\;\;0.5 + \left(x\_m \cdot x\_m\right) \cdot -0.041666666666666664\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{1 - \cos x\_m}{x\_m}}{x\_m}\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m)
 :precision binary64
 (if (<= x_m 0.0035)
   (+ 0.5 (* (* x_m x_m) -0.041666666666666664))
   (/ (/ (- 1.0 (cos x_m)) x_m) x_m)))

C

x_m = fabs(x);
double code(double x_m) {
	double tmp;
	if (x_m <= 0.0035) {
		tmp = 0.5 + ((x_m * x_m) * -0.041666666666666664);
	} else {
		tmp = ((1.0 - cos(x_m)) / x_m) / 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.0035d0) then
        tmp = 0.5d0 + ((x_m * x_m) * (-0.041666666666666664d0))
    else
        tmp = ((1.0d0 - cos(x_m)) / x_m) / 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.0035) {
		tmp = 0.5 + ((x_m * x_m) * -0.041666666666666664);
	} else {
		tmp = ((1.0 - Math.cos(x_m)) / x_m) / x_m;
	}
	return tmp;
}

Python

x_m = math.fabs(x)
def code(x_m):
	tmp = 0
	if x_m <= 0.0035:
		tmp = 0.5 + ((x_m * x_m) * -0.041666666666666664)
	else:
		tmp = ((1.0 - math.cos(x_m)) / x_m) / x_m
	return tmp

Julia

x_m = abs(x)
function code(x_m)
	tmp = 0.0
	if (x_m <= 0.0035)
		tmp = Float64(0.5 + Float64(Float64(x_m * x_m) * -0.041666666666666664));
	else
		tmp = Float64(Float64(Float64(1.0 - cos(x_m)) / x_m) / x_m);
	end
	return tmp
end

MATLAB

x_m = abs(x);
function tmp_2 = code(x_m)
	tmp = 0.0;
	if (x_m <= 0.0035)
		tmp = 0.5 + ((x_m * x_m) * -0.041666666666666664);
	else
		tmp = ((1.0 - cos(x_m)) / x_m) / x_m;
	end
	tmp_2 = tmp;
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_] := If[LessEqual[x$95$m, 0.0035], N[(0.5 + N[(N[(x$95$m * x$95$m), $MachinePrecision] * -0.041666666666666664), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1.0 - N[Cos[x$95$m], $MachinePrecision]), $MachinePrecision] / x$95$m), $MachinePrecision] / x$95$m), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 0.00350000000000000007

   1. Initial program 34.8%

      \[\frac{1 - \cos x}{x \cdot x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 66.2%

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

      1. *-commutative 66.2%

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

   5. Simplified 66.2%

      \[\leadsto \color{blue}{0.5 + {x}^{2} \cdot -0.041666666666666664} \]
   6. Step-by-step derivation

      1. pow2 66.2%

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

   7. Applied egg-rr 66.2%

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

   if 0.00350000000000000007 < x

   1. Initial program 99.2%

      \[\frac{1 - \cos x}{x \cdot x} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. associate-/r* 99.1%

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

      2. div-inv 99.0%

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

   4. Applied egg-rr 99.0%

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

      1. un-div-inv 99.1%

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

   6. Applied egg-rr 99.1%

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

4. Final simplification 73.6%

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

Alternative 5: 75.6% accurate, 17.8× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} \mathbf{if}\;x\_m \leq 4.5 \cdot 10^{+76}:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m) :precision binary64 (if (<= x_m 4.5e+76) 0.5 0.0))

C

x_m = fabs(x);
double code(double x_m) {
	double tmp;
	if (x_m <= 4.5e+76) {
		tmp = 0.5;
	} else {
		tmp = 0.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.5d+76) then
        tmp = 0.5d0
    else
        tmp = 0.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.5e+76) {
		tmp = 0.5;
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

x_m = math.fabs(x)
def code(x_m):
	tmp = 0
	if x_m <= 4.5e+76:
		tmp = 0.5
	else:
		tmp = 0.0
	return tmp

Julia

x_m = abs(x)
function code(x_m)
	tmp = 0.0
	if (x_m <= 4.5e+76)
		tmp = 0.5;
	else
		tmp = 0.0;
	end
	return tmp
end

MATLAB

x_m = abs(x);
function tmp_2 = code(x_m)
	tmp = 0.0;
	if (x_m <= 4.5e+76)
		tmp = 0.5;
	else
		tmp = 0.0;
	end
	tmp_2 = tmp;
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_] := If[LessEqual[x$95$m, 4.5e+76], 0.5, 0.0]

Derivation

1. Split input into 2 regimes

2. if x < 4.4999999999999997e76

   1. Initial program 40.4%

      \[\frac{1 - \cos x}{x \cdot x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 61.9%

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

   if 4.4999999999999997e76 < x

   1. Initial program 99.7%

      \[\frac{1 - \cos x}{x \cdot x} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. add-log-exp 99.6%

         \[\leadsto \frac{\color{blue}{\log \left(e^{1 - \cos x}\right)}}{x \cdot x} \]

   4. Applied egg-rr 99.6%

      \[\leadsto \frac{\color{blue}{\log \left(e^{1 - \cos x}\right)}}{x \cdot x} \]

   5. Taylor expanded in x around 0 69.1%

      \[\leadsto \frac{\log \color{blue}{1}}{x \cdot x} \]

   6. Taylor expanded in x around 0 69.1%

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

4. Final simplification 63.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 4.5 \cdot 10^{+76}:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 27.2% accurate, 107.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

x_m = abs(x)
function code(x_m)
	return 0.0
end

MATLAB

x_m = abs(x);
function tmp = code(x_m)
	tmp = 0.0;
end

Wolfram

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

Derivation

1. Initial program 49.4%

   \[\frac{1 - \cos x}{x \cdot x} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. add-log-exp 49.3%

      \[\leadsto \frac{\color{blue}{\log \left(e^{1 - \cos x}\right)}}{x \cdot x} \]

4. Applied egg-rr 49.3%

   \[\leadsto \frac{\color{blue}{\log \left(e^{1 - \cos x}\right)}}{x \cdot x} \]

5. Taylor expanded in x around 0 25.2%

   \[\leadsto \frac{\log \color{blue}{1}}{x \cdot x} \]

6. Taylor expanded in x around 0 26.0%

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

7. Final simplification 26.0%

   \[\leadsto 0 \]
8. Add Preprocessing

Reproduce

herbie shell --seed 2024067 
(FPCore (x)
  :name "cos2 (problem 3.4.1)"
  :precision binary64
  (/ (- 1.0 (cos x)) (* x x)))