Linear.Quaternion:$csin from linear-1.19.1.3

Percentage Accurate: 100.0% → 100.0%

Time: 9.1s

Alternatives: 6

Speedup: 1.0×

• Could not converge on a ground truth

  1. reg0 = (bf "2.581602127188603564692636185742382587966e125")
  2. reg1 = (bf #e80560.27817607086035422980785369873046875)

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

Specification

Math

\[\begin{array}{l} \\ \cos x \cdot \frac{\sinh y}{y} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* (cos x) (/ (sinh y) y)))

C

double code(double x, double y) {
	return cos(x) * (sinh(y) / y);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = cos(x) * (sinh(y) / y)
end function

Java

public static double code(double x, double y) {
	return Math.cos(x) * (Math.sinh(y) / y);
}

Python

def code(x, y):
	return math.cos(x) * (math.sinh(y) / y)

Julia

function code(x, y)
	return Float64(cos(x) * Float64(sinh(y) / y))
end

MATLAB

function tmp = code(x, y)
	tmp = cos(x) * (sinh(y) / y);
end

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \cos x \cdot \frac{\sinh y}{y} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* (cos x) (/ (sinh y) y)))

C

double code(double x, double y) {
	return cos(x) * (sinh(y) / y);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = cos(x) * (sinh(y) / y)
end function

Java

public static double code(double x, double y) {
	return Math.cos(x) * (Math.sinh(y) / y);
}

Python

def code(x, y):
	return math.cos(x) * (math.sinh(y) / y)

Julia

function code(x, y)
	return Float64(cos(x) * Float64(sinh(y) / y))
end

MATLAB

function tmp = code(x, y)
	tmp = cos(x) * (sinh(y) / y);
end

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{\cos x}{\frac{y}{\sinh y}} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (/ (cos x) (/ y (sinh y))))

C

double code(double x, double y) {
	return cos(x) / (y / sinh(y));
}

Fortran

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

Java

public static double code(double x, double y) {
	return Math.cos(x) / (y / Math.sinh(y));
}

Python

def code(x, y):
	return math.cos(x) / (y / math.sinh(y))

Julia

function code(x, y)
	return Float64(cos(x) / Float64(y / sinh(y)))
end

MATLAB

function tmp = code(x, y)
	tmp = cos(x) / (y / sinh(y));
end

Wolfram

code[x_, y_] := N[(N[Cos[x], $MachinePrecision] / N[(y / N[Sinh[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 100.0%

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

   1. clear-num 100.0%

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

   2. un-div-inv 100.0%

      \[\leadsto \color{blue}{\frac{\cos x}{\frac{y}{\sinh y}}} \]

4. Applied egg-rr 100.0%

   \[\leadsto \color{blue}{\frac{\cos x}{\frac{y}{\sinh y}}} \]
5. Add Preprocessing

Alternative 2: 86.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{\sinh y}{y}\\ \mathbf{if}\;t\_0 \leq 2:\\ \;\;\;\;\cos x\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (/ (sinh y) y))) (if (<= t_0 2.0) (cos x) t_0)))

C

double code(double x, double y) {
	double t_0 = sinh(y) / y;
	double tmp;
	if (t_0 <= 2.0) {
		tmp = cos(x);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: t_0
    real(8) :: tmp
    t_0 = sinh(y) / y
    if (t_0 <= 2.0d0) then
        tmp = cos(x)
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = Math.sinh(y) / y;
	double tmp;
	if (t_0 <= 2.0) {
		tmp = Math.cos(x);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = math.sinh(y) / y
	tmp = 0
	if t_0 <= 2.0:
		tmp = math.cos(x)
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y)
	t_0 = Float64(sinh(y) / y)
	tmp = 0.0
	if (t_0 <= 2.0)
		tmp = cos(x);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = sinh(y) / y;
	tmp = 0.0;
	if (t_0 <= 2.0)
		tmp = cos(x);
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[Sinh[y], $MachinePrecision] / y), $MachinePrecision]}, If[LessEqual[t$95$0, 2.0], N[Cos[x], $MachinePrecision], t$95$0]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (sinh.f64 y) y) < 2

   1. Initial program 99.9%

      \[\cos x \cdot \frac{\sinh y}{y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 99.0%

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

   if 2 < (/.f64 (sinh.f64 y) y)

   1. Initial program 100.0%

      \[\cos x \cdot \frac{\sinh y}{y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 74.8%

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

      1. expm1-log1p-u 74.8%

         \[\leadsto 1 \cdot \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(\frac{\sinh y}{y}\right)\right)} \]

      2. *-un-lft-identity 74.8%

         \[\leadsto \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(\frac{\sinh y}{y}\right)\right)} \]

      3. expm1-undefine 74.8%

         \[\leadsto \color{blue}{e^{\mathsf{log1p}\left(\frac{\sinh y}{y}\right)} - 1} \]

      4. sub-neg 74.8%

         \[\leadsto \color{blue}{e^{\mathsf{log1p}\left(\frac{\sinh y}{y}\right)} + \left(-1\right)} \]

      5. log1p-undefine 74.8%

         \[\leadsto e^{\color{blue}{\log \left(1 + \frac{\sinh y}{y}\right)}} + \left(-1\right) \]

      6. rem-exp-log 74.8%

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

      7. metadata-eval 74.8%

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

   5. Applied egg-rr 74.8%

      \[\leadsto \color{blue}{\left(1 + \frac{\sinh y}{y}\right) + -1} \]
   6. Step-by-step derivation

      1. +-commutative 74.8%

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

      2. associate-+r+ 74.8%

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

      3. metadata-eval 74.8%

         \[\leadsto \color{blue}{0} + \frac{\sinh y}{y} \]

      4. +-lft-identity 74.8%

         \[\leadsto \color{blue}{\frac{\sinh y}{y}} \]

   7. Simplified 74.8%

      \[\leadsto \color{blue}{\frac{\sinh y}{y}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \cos x \cdot \frac{\sinh y}{y} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* (cos x) (/ (sinh y) y)))

C

double code(double x, double y) {
	return cos(x) * (sinh(y) / y);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = cos(x) * (sinh(y) / y)
end function

Java

public static double code(double x, double y) {
	return Math.cos(x) * (Math.sinh(y) / y);
}

Python

def code(x, y):
	return math.cos(x) * (math.sinh(y) / y)

Julia

function code(x, y)
	return Float64(cos(x) * Float64(sinh(y) / y))
end

MATLAB

function tmp = code(x, y)
	tmp = cos(x) * (sinh(y) / y);
end

Wolfram

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

Derivation

1. Initial program 100.0%

   \[\cos x \cdot \frac{\sinh y}{y} \]
2. Add Preprocessing
3. Add Preprocessing

Alternative 4: 54.2% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 2 \cdot 10^{+43}:\\ \;\;\;\;\cos x\\ \mathbf{else}:\\ \;\;\;\;1 + \left(x \cdot x\right) \cdot -0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y 2e+43) (cos x) (+ 1.0 (* (* x x) -0.5))))

C

double code(double x, double y) {
	double tmp;
	if (y <= 2e+43) {
		tmp = cos(x);
	} else {
		tmp = 1.0 + ((x * x) * -0.5);
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= 2d+43) then
        tmp = cos(x)
    else
        tmp = 1.0d0 + ((x * x) * (-0.5d0))
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= 2e+43) {
		tmp = Math.cos(x);
	} else {
		tmp = 1.0 + ((x * x) * -0.5);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= 2e+43:
		tmp = math.cos(x)
	else:
		tmp = 1.0 + ((x * x) * -0.5)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= 2e+43)
		tmp = cos(x);
	else
		tmp = Float64(1.0 + Float64(Float64(x * x) * -0.5));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= 2e+43)
		tmp = cos(x);
	else
		tmp = 1.0 + ((x * x) * -0.5);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, 2e+43], N[Cos[x], $MachinePrecision], N[(1.0 + N[(N[(x * x), $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 2.00000000000000003e43

   1. Initial program 99.9%

      \[\cos x \cdot \frac{\sinh y}{y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 66.4%

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

   if 2.00000000000000003e43 < y

   1. Initial program 100.0%

      \[\cos x \cdot \frac{\sinh y}{y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 3.1%

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

   4. Taylor expanded in x around 0 23.5%

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

      1. *-commutative 23.5%

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

   6. Simplified 23.5%

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

      1. unpow2 23.5%

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

   8. Applied egg-rr 23.5%

      \[\leadsto 1 + \color{blue}{\left(x \cdot x\right)} \cdot -0.5 \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 31.4% accurate, 17.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 5.4 \cdot 10^{+41}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;1 + \left(x \cdot x\right) \cdot -0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y 5.4e+41) 1.0 (+ 1.0 (* (* x x) -0.5))))

C

double code(double x, double y) {
	double tmp;
	if (y <= 5.4e+41) {
		tmp = 1.0;
	} else {
		tmp = 1.0 + ((x * x) * -0.5);
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= 5.4d+41) then
        tmp = 1.0d0
    else
        tmp = 1.0d0 + ((x * x) * (-0.5d0))
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= 5.4e+41) {
		tmp = 1.0;
	} else {
		tmp = 1.0 + ((x * x) * -0.5);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= 5.4e+41:
		tmp = 1.0
	else:
		tmp = 1.0 + ((x * x) * -0.5)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= 5.4e+41)
		tmp = 1.0;
	else
		tmp = Float64(1.0 + Float64(Float64(x * x) * -0.5));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= 5.4e+41)
		tmp = 1.0;
	else
		tmp = 1.0 + ((x * x) * -0.5);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, 5.4e+41], 1.0, N[(1.0 + N[(N[(x * x), $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 5.39999999999999999e41

   1. Initial program 99.9%

      \[\cos x \cdot \frac{\sinh y}{y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 66.7%

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

   4. Taylor expanded in x around 0 32.5%

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

   if 5.39999999999999999e41 < y

   1. Initial program 100.0%

      \[\cos x \cdot \frac{\sinh y}{y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 3.1%

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

   4. Taylor expanded in x around 0 22.9%

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

      1. *-commutative 22.9%

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

   6. Simplified 22.9%

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

      1. unpow2 22.9%

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

   8. Applied egg-rr 22.9%

      \[\leadsto 1 + \color{blue}{\left(x \cdot x\right)} \cdot -0.5 \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 28.8% accurate, 205.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 1.0)

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return 1.0

Julia

function code(x, y)
	return 1.0
end

MATLAB

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

Wolfram

code[x_, y_] := 1.0

Derivation

1. Initial program 100.0%

   \[\cos x \cdot \frac{\sinh y}{y} \]
2. Add Preprocessing

3. Taylor expanded in y around 0 56.0%

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

4. Taylor expanded in x around 0 27.4%

   \[\leadsto \color{blue}{1} \]
5. Add Preprocessing

Reproduce

herbie shell --seed 2024139 
(FPCore (x y)
  :name "Linear.Quaternion:$csin from linear-1.19.1.3"
  :precision binary64
  (* (cos x) (/ (sinh y) y)))