Numeric.SpecFunctions:incompleteGamma from math-functions-0.1.5.2, B

Percentage Accurate: 99.4% → 99.4%

Time: 6.4s

Alternatives: 7

Speedup: N/A×

Specification

Math

\[\begin{array}{l} \\ \left(3 \cdot \sqrt{x}\right) \cdot \left(\left(y + \frac{1}{x \cdot 9}\right) - 1\right) \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (* (* 3.0 (sqrt x)) (- (+ y (/ 1.0 (* x 9.0))) 1.0)))

C

double code(double x, double y) {
	return (3.0 * sqrt(x)) * ((y + (1.0 / (x * 9.0))) - 1.0);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (3.0d0 * sqrt(x)) * ((y + (1.0d0 / (x * 9.0d0))) - 1.0d0)
end function

Java

public static double code(double x, double y) {
	return (3.0 * Math.sqrt(x)) * ((y + (1.0 / (x * 9.0))) - 1.0);
}

Python

def code(x, y):
	return (3.0 * math.sqrt(x)) * ((y + (1.0 / (x * 9.0))) - 1.0)

Julia

function code(x, y)
	return Float64(Float64(3.0 * sqrt(x)) * Float64(Float64(y + Float64(1.0 / Float64(x * 9.0))) - 1.0))
end

MATLAB

function tmp = code(x, y)
	tmp = (3.0 * sqrt(x)) * ((y + (1.0 / (x * 9.0))) - 1.0);
end

Wolfram

code[x_, y_] := N[(N[(3.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] * N[(N[(y + N[(1.0 / N[(x * 9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision]

Initial Program: 99.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(3 \cdot \sqrt{x}\right) \cdot \left(\left(y + \frac{1}{x \cdot 9}\right) - 1\right) \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (* (* 3.0 (sqrt x)) (- (+ y (/ 1.0 (* x 9.0))) 1.0)))

C

double code(double x, double y) {
	return (3.0 * sqrt(x)) * ((y + (1.0 / (x * 9.0))) - 1.0);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (3.0d0 * sqrt(x)) * ((y + (1.0d0 / (x * 9.0d0))) - 1.0d0)
end function

Java

public static double code(double x, double y) {
	return (3.0 * Math.sqrt(x)) * ((y + (1.0 / (x * 9.0))) - 1.0);
}

Python

def code(x, y):
	return (3.0 * math.sqrt(x)) * ((y + (1.0 / (x * 9.0))) - 1.0)

Julia

function code(x, y)
	return Float64(Float64(3.0 * sqrt(x)) * Float64(Float64(y + Float64(1.0 / Float64(x * 9.0))) - 1.0))
end

MATLAB

function tmp = code(x, y)
	tmp = (3.0 * sqrt(x)) * ((y + (1.0 / (x * 9.0))) - 1.0);
end

Wolfram

code[x_, y_] := N[(N[(3.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] * N[(N[(y + N[(1.0 / N[(x * 9.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.4% accurate, 1.1× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (* (- (- y (/ -0.1111111111111111 x)) 1.0) (* (sqrt x) 3.0)))

C

double code(double x, double y) {
	return ((y - (-0.1111111111111111 / x)) - 1.0) * (sqrt(x) * 3.0);
}

Fortran

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

Java

public static double code(double x, double y) {
	return ((y - (-0.1111111111111111 / x)) - 1.0) * (Math.sqrt(x) * 3.0);
}

Python

def code(x, y):
	return ((y - (-0.1111111111111111 / x)) - 1.0) * (math.sqrt(x) * 3.0)

Julia

function code(x, y)
	return Float64(Float64(Float64(y - Float64(-0.1111111111111111 / x)) - 1.0) * Float64(sqrt(x) * 3.0))
end

MATLAB

function tmp = code(x, y)
	tmp = ((y - (-0.1111111111111111 / x)) - 1.0) * (sqrt(x) * 3.0);
end

Wolfram

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

Derivation

1. Initial program 99.4%

   \[\left(3 \cdot \sqrt{x}\right) \cdot \left(\left(y + \frac{1}{x \cdot 9}\right) - 1\right) \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-*.f64 N/A

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

   2. *-commutative N/A

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

   3. lower-*.f64 99.4

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

4. Applied rewrites 99.5%

   \[\leadsto \color{blue}{\left(\left(y - \frac{-0.1111111111111111}{x}\right) - 1\right) \cdot \left(\sqrt{x} \cdot 3\right)} \]
5. Add Preprocessing

Alternative 2: 91.8% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(3 \cdot \sqrt{x}\right) \cdot \left(\left(y + {\left(x \cdot 9\right)}^{-1}\right) - 1\right)\\ \mathbf{if}\;t\_0 \leq -100000000:\\ \;\;\;\;\left(\left(y - 1\right) \cdot \sqrt{x}\right) \cdot 3\\ \mathbf{elif}\;t\_0 \leq 2 \cdot 10^{+152}:\\ \;\;\;\;\left(\left(\frac{0.1111111111111111}{x} - 1\right) \cdot 3\right) \cdot \sqrt{x}\\ \mathbf{else}:\\ \;\;\;\;\left(\sqrt{x} \cdot y\right) \cdot 3\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (* (* 3.0 (sqrt x)) (- (+ y (pow (* x 9.0) -1.0)) 1.0))))
   (if (<= t_0 -100000000.0)
     (* (* (- y 1.0) (sqrt x)) 3.0)
     (if (<= t_0 2e+152)
       (* (* (- (/ 0.1111111111111111 x) 1.0) 3.0) (sqrt x))
       (* (* (sqrt x) y) 3.0)))))

C

double code(double x, double y) {
	double t_0 = (3.0 * sqrt(x)) * ((y + pow((x * 9.0), -1.0)) - 1.0);
	double tmp;
	if (t_0 <= -100000000.0) {
		tmp = ((y - 1.0) * sqrt(x)) * 3.0;
	} else if (t_0 <= 2e+152) {
		tmp = (((0.1111111111111111 / x) - 1.0) * 3.0) * sqrt(x);
	} else {
		tmp = (sqrt(x) * y) * 3.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 = (3.0d0 * sqrt(x)) * ((y + ((x * 9.0d0) ** (-1.0d0))) - 1.0d0)
    if (t_0 <= (-100000000.0d0)) then
        tmp = ((y - 1.0d0) * sqrt(x)) * 3.0d0
    else if (t_0 <= 2d+152) then
        tmp = (((0.1111111111111111d0 / x) - 1.0d0) * 3.0d0) * sqrt(x)
    else
        tmp = (sqrt(x) * y) * 3.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = (3.0 * Math.sqrt(x)) * ((y + Math.pow((x * 9.0), -1.0)) - 1.0);
	double tmp;
	if (t_0 <= -100000000.0) {
		tmp = ((y - 1.0) * Math.sqrt(x)) * 3.0;
	} else if (t_0 <= 2e+152) {
		tmp = (((0.1111111111111111 / x) - 1.0) * 3.0) * Math.sqrt(x);
	} else {
		tmp = (Math.sqrt(x) * y) * 3.0;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = (3.0 * math.sqrt(x)) * ((y + math.pow((x * 9.0), -1.0)) - 1.0)
	tmp = 0
	if t_0 <= -100000000.0:
		tmp = ((y - 1.0) * math.sqrt(x)) * 3.0
	elif t_0 <= 2e+152:
		tmp = (((0.1111111111111111 / x) - 1.0) * 3.0) * math.sqrt(x)
	else:
		tmp = (math.sqrt(x) * y) * 3.0
	return tmp

Julia

function code(x, y)
	t_0 = Float64(Float64(3.0 * sqrt(x)) * Float64(Float64(y + (Float64(x * 9.0) ^ -1.0)) - 1.0))
	tmp = 0.0
	if (t_0 <= -100000000.0)
		tmp = Float64(Float64(Float64(y - 1.0) * sqrt(x)) * 3.0);
	elseif (t_0 <= 2e+152)
		tmp = Float64(Float64(Float64(Float64(0.1111111111111111 / x) - 1.0) * 3.0) * sqrt(x));
	else
		tmp = Float64(Float64(sqrt(x) * y) * 3.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = (3.0 * sqrt(x)) * ((y + ((x * 9.0) ^ -1.0)) - 1.0);
	tmp = 0.0;
	if (t_0 <= -100000000.0)
		tmp = ((y - 1.0) * sqrt(x)) * 3.0;
	elseif (t_0 <= 2e+152)
		tmp = (((0.1111111111111111 / x) - 1.0) * 3.0) * sqrt(x);
	else
		tmp = (sqrt(x) * y) * 3.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(3.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] * N[(N[(y + N[Power[N[(x * 9.0), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -100000000.0], N[(N[(N[(y - 1.0), $MachinePrecision] * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] * 3.0), $MachinePrecision], If[LessEqual[t$95$0, 2e+152], N[(N[(N[(N[(0.1111111111111111 / x), $MachinePrecision] - 1.0), $MachinePrecision] * 3.0), $MachinePrecision] * N[Sqrt[x], $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[x], $MachinePrecision] * y), $MachinePrecision] * 3.0), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 #s(literal 3 binary64) (sqrt.f64 x)) (-.f64 (+.f64 y (/.f64 #s(literal 1 binary64) (*.f64 x #s(literal 9 binary64)))) #s(literal 1 binary64))) < -1e8

   1. Initial program 99.6%

      \[\left(3 \cdot \sqrt{x}\right) \cdot \left(\left(y + \frac{1}{x \cdot 9}\right) - 1\right) \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-*l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

   4. Applied rewrites 99.6%

      \[\leadsto \color{blue}{\left(\left(\left(y - \frac{-0.1111111111111111}{x}\right) - 1\right) \cdot \sqrt{x}\right) \cdot 3} \]

   5. Taylor expanded in x around inf

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

      1. lower--.f64 98.9

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

   7. Applied rewrites 98.9%

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

   if -1e8 < (*.f64 (*.f64 #s(literal 3 binary64) (sqrt.f64 x)) (-.f64 (+.f64 y (/.f64 #s(literal 1 binary64) (*.f64 x #s(literal 9 binary64)))) #s(literal 1 binary64))) < 2.0000000000000001e152

   1. Initial program 99.2%

      \[\left(3 \cdot \sqrt{x}\right) \cdot \left(\left(y + \frac{1}{x \cdot 9}\right) - 1\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower--.f64 N/A

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

      7. associate-*r/ N/A

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

      8. metadata-eval N/A

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

      9. lower-/.f64 N/A

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

      10. lower-sqrt.f64 86.7

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

   5. Applied rewrites 86.7%

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

   if 2.0000000000000001e152 < (*.f64 (*.f64 #s(literal 3 binary64) (sqrt.f64 x)) (-.f64 (+.f64 y (/.f64 #s(literal 1 binary64) (*.f64 x #s(literal 9 binary64)))) #s(literal 1 binary64)))

   1. Initial program 99.7%

      \[\left(3 \cdot \sqrt{x}\right) \cdot \left(\left(y + \frac{1}{x \cdot 9}\right) - 1\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-sqrt.f64 99.8

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

   5. Applied rewrites 99.8%

      \[\leadsto \color{blue}{\left(\sqrt{x} \cdot y\right) \cdot 3} \]
3. Recombined 3 regimes into one program.

4. Final simplification 93.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(3 \cdot \sqrt{x}\right) \cdot \left(\left(y + {\left(x \cdot 9\right)}^{-1}\right) - 1\right) \leq -100000000:\\ \;\;\;\;\left(\left(y - 1\right) \cdot \sqrt{x}\right) \cdot 3\\ \mathbf{elif}\;\left(3 \cdot \sqrt{x}\right) \cdot \left(\left(y + {\left(x \cdot 9\right)}^{-1}\right) - 1\right) \leq 2 \cdot 10^{+152}:\\ \;\;\;\;\left(\left(\frac{0.1111111111111111}{x} - 1\right) \cdot 3\right) \cdot \sqrt{x}\\ \mathbf{else}:\\ \;\;\;\;\left(\sqrt{x} \cdot y\right) \cdot 3\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 90.8% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(3 \cdot \sqrt{x}\right) \cdot \left(\left(y + {\left(x \cdot 9\right)}^{-1}\right) - 1\right)\\ \mathbf{if}\;t\_0 \leq -100:\\ \;\;\;\;\left(\left(y - 1\right) \cdot \sqrt{x}\right) \cdot 3\\ \mathbf{elif}\;t\_0 \leq 2 \cdot 10^{+152}:\\ \;\;\;\;\frac{0.3333333333333333}{\sqrt{x}}\\ \mathbf{else}:\\ \;\;\;\;\left(\sqrt{x} \cdot y\right) \cdot 3\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (* (* 3.0 (sqrt x)) (- (+ y (pow (* x 9.0) -1.0)) 1.0))))
   (if (<= t_0 -100.0)
     (* (* (- y 1.0) (sqrt x)) 3.0)
     (if (<= t_0 2e+152)
       (/ 0.3333333333333333 (sqrt x))
       (* (* (sqrt x) y) 3.0)))))

C

double code(double x, double y) {
	double t_0 = (3.0 * sqrt(x)) * ((y + pow((x * 9.0), -1.0)) - 1.0);
	double tmp;
	if (t_0 <= -100.0) {
		tmp = ((y - 1.0) * sqrt(x)) * 3.0;
	} else if (t_0 <= 2e+152) {
		tmp = 0.3333333333333333 / sqrt(x);
	} else {
		tmp = (sqrt(x) * y) * 3.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 = (3.0d0 * sqrt(x)) * ((y + ((x * 9.0d0) ** (-1.0d0))) - 1.0d0)
    if (t_0 <= (-100.0d0)) then
        tmp = ((y - 1.0d0) * sqrt(x)) * 3.0d0
    else if (t_0 <= 2d+152) then
        tmp = 0.3333333333333333d0 / sqrt(x)
    else
        tmp = (sqrt(x) * y) * 3.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = (3.0 * Math.sqrt(x)) * ((y + Math.pow((x * 9.0), -1.0)) - 1.0);
	double tmp;
	if (t_0 <= -100.0) {
		tmp = ((y - 1.0) * Math.sqrt(x)) * 3.0;
	} else if (t_0 <= 2e+152) {
		tmp = 0.3333333333333333 / Math.sqrt(x);
	} else {
		tmp = (Math.sqrt(x) * y) * 3.0;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = (3.0 * math.sqrt(x)) * ((y + math.pow((x * 9.0), -1.0)) - 1.0)
	tmp = 0
	if t_0 <= -100.0:
		tmp = ((y - 1.0) * math.sqrt(x)) * 3.0
	elif t_0 <= 2e+152:
		tmp = 0.3333333333333333 / math.sqrt(x)
	else:
		tmp = (math.sqrt(x) * y) * 3.0
	return tmp

Julia

function code(x, y)
	t_0 = Float64(Float64(3.0 * sqrt(x)) * Float64(Float64(y + (Float64(x * 9.0) ^ -1.0)) - 1.0))
	tmp = 0.0
	if (t_0 <= -100.0)
		tmp = Float64(Float64(Float64(y - 1.0) * sqrt(x)) * 3.0);
	elseif (t_0 <= 2e+152)
		tmp = Float64(0.3333333333333333 / sqrt(x));
	else
		tmp = Float64(Float64(sqrt(x) * y) * 3.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = (3.0 * sqrt(x)) * ((y + ((x * 9.0) ^ -1.0)) - 1.0);
	tmp = 0.0;
	if (t_0 <= -100.0)
		tmp = ((y - 1.0) * sqrt(x)) * 3.0;
	elseif (t_0 <= 2e+152)
		tmp = 0.3333333333333333 / sqrt(x);
	else
		tmp = (sqrt(x) * y) * 3.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(3.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] * N[(N[(y + N[Power[N[(x * 9.0), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -100.0], N[(N[(N[(y - 1.0), $MachinePrecision] * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] * 3.0), $MachinePrecision], If[LessEqual[t$95$0, 2e+152], N[(0.3333333333333333 / N[Sqrt[x], $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[x], $MachinePrecision] * y), $MachinePrecision] * 3.0), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 #s(literal 3 binary64) (sqrt.f64 x)) (-.f64 (+.f64 y (/.f64 #s(literal 1 binary64) (*.f64 x #s(literal 9 binary64)))) #s(literal 1 binary64))) < -100

   1. Initial program 99.6%

      \[\left(3 \cdot \sqrt{x}\right) \cdot \left(\left(y + \frac{1}{x \cdot 9}\right) - 1\right) \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-*l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

   4. Applied rewrites 99.6%

      \[\leadsto \color{blue}{\left(\left(\left(y - \frac{-0.1111111111111111}{x}\right) - 1\right) \cdot \sqrt{x}\right) \cdot 3} \]

   5. Taylor expanded in x around inf

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

      1. lower--.f64 97.6

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

   7. Applied rewrites 97.6%

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

   if -100 < (*.f64 (*.f64 #s(literal 3 binary64) (sqrt.f64 x)) (-.f64 (+.f64 y (/.f64 #s(literal 1 binary64) (*.f64 x #s(literal 9 binary64)))) #s(literal 1 binary64))) < 2.0000000000000001e152

   1. Initial program 99.2%

      \[\left(3 \cdot \sqrt{x}\right) \cdot \left(\left(y + \frac{1}{x \cdot 9}\right) - 1\right) \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 99.2

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

   4. Applied rewrites 99.3%

      \[\leadsto \color{blue}{\left(\left(y - \frac{-0.1111111111111111}{x}\right) - 1\right) \cdot \left(\sqrt{x} \cdot 3\right)} \]

   5. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{1}{3} \cdot \sqrt{\frac{1}{x}}} \]
   6. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-/.f64 85.3

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

   7. Applied rewrites 85.3%

      \[\leadsto \color{blue}{\sqrt{\frac{1}{x}} \cdot 0.3333333333333333} \]
   8. Step-by-step derivation

   9. Applied rewrites 85.3%

      \[\leadsto \color{blue}{\frac{0.3333333333333333}{\sqrt{x}}} \]

   if 2.0000000000000001e152 < (*.f64 (*.f64 #s(literal 3 binary64) (sqrt.f64 x)) (-.f64 (+.f64 y (/.f64 #s(literal 1 binary64) (*.f64 x #s(literal 9 binary64)))) #s(literal 1 binary64)))

   1. Initial program 99.7%

      \[\left(3 \cdot \sqrt{x}\right) \cdot \left(\left(y + \frac{1}{x \cdot 9}\right) - 1\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-sqrt.f64 99.8

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

   5. Applied rewrites 99.8%

      \[\leadsto \color{blue}{\left(\sqrt{x} \cdot y\right) \cdot 3} \]
3. Recombined 3 regimes into one program.

4. Final simplification 92.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(3 \cdot \sqrt{x}\right) \cdot \left(\left(y + {\left(x \cdot 9\right)}^{-1}\right) - 1\right) \leq -100:\\ \;\;\;\;\left(\left(y - 1\right) \cdot \sqrt{x}\right) \cdot 3\\ \mathbf{elif}\;\left(3 \cdot \sqrt{x}\right) \cdot \left(\left(y + {\left(x \cdot 9\right)}^{-1}\right) - 1\right) \leq 2 \cdot 10^{+152}:\\ \;\;\;\;\frac{0.3333333333333333}{\sqrt{x}}\\ \mathbf{else}:\\ \;\;\;\;\left(\sqrt{x} \cdot y\right) \cdot 3\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 90.8% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(3 \cdot \sqrt{x}\right) \cdot \left(\left(y + {\left(x \cdot 9\right)}^{-1}\right) - 1\right)\\ \mathbf{if}\;t\_0 \leq -100:\\ \;\;\;\;\left(\left(y - 1\right) \cdot 3\right) \cdot \sqrt{x}\\ \mathbf{elif}\;t\_0 \leq 2 \cdot 10^{+152}:\\ \;\;\;\;\frac{0.3333333333333333}{\sqrt{x}}\\ \mathbf{else}:\\ \;\;\;\;\left(\sqrt{x} \cdot y\right) \cdot 3\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (* (* 3.0 (sqrt x)) (- (+ y (pow (* x 9.0) -1.0)) 1.0))))
   (if (<= t_0 -100.0)
     (* (* (- y 1.0) 3.0) (sqrt x))
     (if (<= t_0 2e+152)
       (/ 0.3333333333333333 (sqrt x))
       (* (* (sqrt x) y) 3.0)))))

C

double code(double x, double y) {
	double t_0 = (3.0 * sqrt(x)) * ((y + pow((x * 9.0), -1.0)) - 1.0);
	double tmp;
	if (t_0 <= -100.0) {
		tmp = ((y - 1.0) * 3.0) * sqrt(x);
	} else if (t_0 <= 2e+152) {
		tmp = 0.3333333333333333 / sqrt(x);
	} else {
		tmp = (sqrt(x) * y) * 3.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 = (3.0d0 * sqrt(x)) * ((y + ((x * 9.0d0) ** (-1.0d0))) - 1.0d0)
    if (t_0 <= (-100.0d0)) then
        tmp = ((y - 1.0d0) * 3.0d0) * sqrt(x)
    else if (t_0 <= 2d+152) then
        tmp = 0.3333333333333333d0 / sqrt(x)
    else
        tmp = (sqrt(x) * y) * 3.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = (3.0 * Math.sqrt(x)) * ((y + Math.pow((x * 9.0), -1.0)) - 1.0);
	double tmp;
	if (t_0 <= -100.0) {
		tmp = ((y - 1.0) * 3.0) * Math.sqrt(x);
	} else if (t_0 <= 2e+152) {
		tmp = 0.3333333333333333 / Math.sqrt(x);
	} else {
		tmp = (Math.sqrt(x) * y) * 3.0;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = (3.0 * math.sqrt(x)) * ((y + math.pow((x * 9.0), -1.0)) - 1.0)
	tmp = 0
	if t_0 <= -100.0:
		tmp = ((y - 1.0) * 3.0) * math.sqrt(x)
	elif t_0 <= 2e+152:
		tmp = 0.3333333333333333 / math.sqrt(x)
	else:
		tmp = (math.sqrt(x) * y) * 3.0
	return tmp

Julia

function code(x, y)
	t_0 = Float64(Float64(3.0 * sqrt(x)) * Float64(Float64(y + (Float64(x * 9.0) ^ -1.0)) - 1.0))
	tmp = 0.0
	if (t_0 <= -100.0)
		tmp = Float64(Float64(Float64(y - 1.0) * 3.0) * sqrt(x));
	elseif (t_0 <= 2e+152)
		tmp = Float64(0.3333333333333333 / sqrt(x));
	else
		tmp = Float64(Float64(sqrt(x) * y) * 3.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = (3.0 * sqrt(x)) * ((y + ((x * 9.0) ^ -1.0)) - 1.0);
	tmp = 0.0;
	if (t_0 <= -100.0)
		tmp = ((y - 1.0) * 3.0) * sqrt(x);
	elseif (t_0 <= 2e+152)
		tmp = 0.3333333333333333 / sqrt(x);
	else
		tmp = (sqrt(x) * y) * 3.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(3.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] * N[(N[(y + N[Power[N[(x * 9.0), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -100.0], N[(N[(N[(y - 1.0), $MachinePrecision] * 3.0), $MachinePrecision] * N[Sqrt[x], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 2e+152], N[(0.3333333333333333 / N[Sqrt[x], $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[x], $MachinePrecision] * y), $MachinePrecision] * 3.0), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 #s(literal 3 binary64) (sqrt.f64 x)) (-.f64 (+.f64 y (/.f64 #s(literal 1 binary64) (*.f64 x #s(literal 9 binary64)))) #s(literal 1 binary64))) < -100

   1. Initial program 99.6%

      \[\left(3 \cdot \sqrt{x}\right) \cdot \left(\left(y + \frac{1}{x \cdot 9}\right) - 1\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. associate-*l* N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. lower--.f64 N/A

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

      7. lower-sqrt.f64 97.6

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

   5. Applied rewrites 97.6%

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

   if -100 < (*.f64 (*.f64 #s(literal 3 binary64) (sqrt.f64 x)) (-.f64 (+.f64 y (/.f64 #s(literal 1 binary64) (*.f64 x #s(literal 9 binary64)))) #s(literal 1 binary64))) < 2.0000000000000001e152

   1. Initial program 99.2%

      \[\left(3 \cdot \sqrt{x}\right) \cdot \left(\left(y + \frac{1}{x \cdot 9}\right) - 1\right) \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 99.2

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

   4. Applied rewrites 99.3%

      \[\leadsto \color{blue}{\left(\left(y - \frac{-0.1111111111111111}{x}\right) - 1\right) \cdot \left(\sqrt{x} \cdot 3\right)} \]

   5. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{1}{3} \cdot \sqrt{\frac{1}{x}}} \]
   6. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-/.f64 85.3

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

   7. Applied rewrites 85.3%

      \[\leadsto \color{blue}{\sqrt{\frac{1}{x}} \cdot 0.3333333333333333} \]
   8. Step-by-step derivation

   9. Applied rewrites 85.3%

      \[\leadsto \color{blue}{\frac{0.3333333333333333}{\sqrt{x}}} \]

   if 2.0000000000000001e152 < (*.f64 (*.f64 #s(literal 3 binary64) (sqrt.f64 x)) (-.f64 (+.f64 y (/.f64 #s(literal 1 binary64) (*.f64 x #s(literal 9 binary64)))) #s(literal 1 binary64)))

   1. Initial program 99.7%

      \[\left(3 \cdot \sqrt{x}\right) \cdot \left(\left(y + \frac{1}{x \cdot 9}\right) - 1\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-sqrt.f64 99.8

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

   5. Applied rewrites 99.8%

      \[\leadsto \color{blue}{\left(\sqrt{x} \cdot y\right) \cdot 3} \]
3. Recombined 3 regimes into one program.

4. Final simplification 92.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(3 \cdot \sqrt{x}\right) \cdot \left(\left(y + {\left(x \cdot 9\right)}^{-1}\right) - 1\right) \leq -100:\\ \;\;\;\;\left(\left(y - 1\right) \cdot 3\right) \cdot \sqrt{x}\\ \mathbf{elif}\;\left(3 \cdot \sqrt{x}\right) \cdot \left(\left(y + {\left(x \cdot 9\right)}^{-1}\right) - 1\right) \leq 2 \cdot 10^{+152}:\\ \;\;\;\;\frac{0.3333333333333333}{\sqrt{x}}\\ \mathbf{else}:\\ \;\;\;\;\left(\sqrt{x} \cdot y\right) \cdot 3\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 68.0% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(3 \cdot \sqrt{x}\right) \cdot \left(\left(y + {\left(x \cdot 9\right)}^{-1}\right) - 1\right)\\ \mathbf{if}\;t\_0 \leq -100:\\ \;\;\;\;\left(3 \cdot y\right) \cdot \sqrt{x}\\ \mathbf{elif}\;t\_0 \leq 2 \cdot 10^{+152}:\\ \;\;\;\;\frac{0.3333333333333333}{\sqrt{x}}\\ \mathbf{else}:\\ \;\;\;\;\left(\sqrt{x} \cdot y\right) \cdot 3\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (* (* 3.0 (sqrt x)) (- (+ y (pow (* x 9.0) -1.0)) 1.0))))
   (if (<= t_0 -100.0)
     (* (* 3.0 y) (sqrt x))
     (if (<= t_0 2e+152)
       (/ 0.3333333333333333 (sqrt x))
       (* (* (sqrt x) y) 3.0)))))

C

double code(double x, double y) {
	double t_0 = (3.0 * sqrt(x)) * ((y + pow((x * 9.0), -1.0)) - 1.0);
	double tmp;
	if (t_0 <= -100.0) {
		tmp = (3.0 * y) * sqrt(x);
	} else if (t_0 <= 2e+152) {
		tmp = 0.3333333333333333 / sqrt(x);
	} else {
		tmp = (sqrt(x) * y) * 3.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 = (3.0d0 * sqrt(x)) * ((y + ((x * 9.0d0) ** (-1.0d0))) - 1.0d0)
    if (t_0 <= (-100.0d0)) then
        tmp = (3.0d0 * y) * sqrt(x)
    else if (t_0 <= 2d+152) then
        tmp = 0.3333333333333333d0 / sqrt(x)
    else
        tmp = (sqrt(x) * y) * 3.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = (3.0 * Math.sqrt(x)) * ((y + Math.pow((x * 9.0), -1.0)) - 1.0);
	double tmp;
	if (t_0 <= -100.0) {
		tmp = (3.0 * y) * Math.sqrt(x);
	} else if (t_0 <= 2e+152) {
		tmp = 0.3333333333333333 / Math.sqrt(x);
	} else {
		tmp = (Math.sqrt(x) * y) * 3.0;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = (3.0 * math.sqrt(x)) * ((y + math.pow((x * 9.0), -1.0)) - 1.0)
	tmp = 0
	if t_0 <= -100.0:
		tmp = (3.0 * y) * math.sqrt(x)
	elif t_0 <= 2e+152:
		tmp = 0.3333333333333333 / math.sqrt(x)
	else:
		tmp = (math.sqrt(x) * y) * 3.0
	return tmp

Julia

function code(x, y)
	t_0 = Float64(Float64(3.0 * sqrt(x)) * Float64(Float64(y + (Float64(x * 9.0) ^ -1.0)) - 1.0))
	tmp = 0.0
	if (t_0 <= -100.0)
		tmp = Float64(Float64(3.0 * y) * sqrt(x));
	elseif (t_0 <= 2e+152)
		tmp = Float64(0.3333333333333333 / sqrt(x));
	else
		tmp = Float64(Float64(sqrt(x) * y) * 3.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = (3.0 * sqrt(x)) * ((y + ((x * 9.0) ^ -1.0)) - 1.0);
	tmp = 0.0;
	if (t_0 <= -100.0)
		tmp = (3.0 * y) * sqrt(x);
	elseif (t_0 <= 2e+152)
		tmp = 0.3333333333333333 / sqrt(x);
	else
		tmp = (sqrt(x) * y) * 3.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(3.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] * N[(N[(y + N[Power[N[(x * 9.0), $MachinePrecision], -1.0], $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -100.0], N[(N[(3.0 * y), $MachinePrecision] * N[Sqrt[x], $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, 2e+152], N[(0.3333333333333333 / N[Sqrt[x], $MachinePrecision]), $MachinePrecision], N[(N[(N[Sqrt[x], $MachinePrecision] * y), $MachinePrecision] * 3.0), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (*.f64 #s(literal 3 binary64) (sqrt.f64 x)) (-.f64 (+.f64 y (/.f64 #s(literal 1 binary64) (*.f64 x #s(literal 9 binary64)))) #s(literal 1 binary64))) < -100

   1. Initial program 99.6%

      \[\left(3 \cdot \sqrt{x}\right) \cdot \left(\left(y + \frac{1}{x \cdot 9}\right) - 1\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-sqrt.f64 44.7

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

   5. Applied rewrites 44.7%

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

   7. Applied rewrites 44.7%

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

   if -100 < (*.f64 (*.f64 #s(literal 3 binary64) (sqrt.f64 x)) (-.f64 (+.f64 y (/.f64 #s(literal 1 binary64) (*.f64 x #s(literal 9 binary64)))) #s(literal 1 binary64))) < 2.0000000000000001e152

   1. Initial program 99.2%

      \[\left(3 \cdot \sqrt{x}\right) \cdot \left(\left(y + \frac{1}{x \cdot 9}\right) - 1\right) \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 99.2

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

   4. Applied rewrites 99.3%

      \[\leadsto \color{blue}{\left(\left(y - \frac{-0.1111111111111111}{x}\right) - 1\right) \cdot \left(\sqrt{x} \cdot 3\right)} \]

   5. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{1}{3} \cdot \sqrt{\frac{1}{x}}} \]
   6. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-sqrt.f64 N/A

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

      4. lower-/.f64 85.3

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

   7. Applied rewrites 85.3%

      \[\leadsto \color{blue}{\sqrt{\frac{1}{x}} \cdot 0.3333333333333333} \]
   8. Step-by-step derivation

   9. Applied rewrites 85.3%

      \[\leadsto \color{blue}{\frac{0.3333333333333333}{\sqrt{x}}} \]

   if 2.0000000000000001e152 < (*.f64 (*.f64 #s(literal 3 binary64) (sqrt.f64 x)) (-.f64 (+.f64 y (/.f64 #s(literal 1 binary64) (*.f64 x #s(literal 9 binary64)))) #s(literal 1 binary64)))

   1. Initial program 99.7%

      \[\left(3 \cdot \sqrt{x}\right) \cdot \left(\left(y + \frac{1}{x \cdot 9}\right) - 1\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. lower-sqrt.f64 99.8

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

   5. Applied rewrites 99.8%

      \[\leadsto \color{blue}{\left(\sqrt{x} \cdot y\right) \cdot 3} \]
3. Recombined 3 regimes into one program.

4. Final simplification 69.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(3 \cdot \sqrt{x}\right) \cdot \left(\left(y + {\left(x \cdot 9\right)}^{-1}\right) - 1\right) \leq -100:\\ \;\;\;\;\left(3 \cdot y\right) \cdot \sqrt{x}\\ \mathbf{elif}\;\left(3 \cdot \sqrt{x}\right) \cdot \left(\left(y + {\left(x \cdot 9\right)}^{-1}\right) - 1\right) \leq 2 \cdot 10^{+152}:\\ \;\;\;\;\frac{0.3333333333333333}{\sqrt{x}}\\ \mathbf{else}:\\ \;\;\;\;\left(\sqrt{x} \cdot y\right) \cdot 3\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 99.4% accurate, 1.1× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (* (* (- (- y (/ -0.1111111111111111 x)) 1.0) (sqrt x)) 3.0))

C

double code(double x, double y) {
	return (((y - (-0.1111111111111111 / x)) - 1.0) * sqrt(x)) * 3.0;
}

Fortran

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

Java

public static double code(double x, double y) {
	return (((y - (-0.1111111111111111 / x)) - 1.0) * Math.sqrt(x)) * 3.0;
}

Python

def code(x, y):
	return (((y - (-0.1111111111111111 / x)) - 1.0) * math.sqrt(x)) * 3.0

Julia

function code(x, y)
	return Float64(Float64(Float64(Float64(y - Float64(-0.1111111111111111 / x)) - 1.0) * sqrt(x)) * 3.0)
end

MATLAB

function tmp = code(x, y)
	tmp = (((y - (-0.1111111111111111 / x)) - 1.0) * sqrt(x)) * 3.0;
end

Wolfram

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

Derivation

1. Initial program 99.4%

   \[\left(3 \cdot \sqrt{x}\right) \cdot \left(\left(y + \frac{1}{x \cdot 9}\right) - 1\right) \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-*.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. associate-*l* N/A

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

   4. *-commutative N/A

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

   5. lower-*.f64 N/A

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

4. Applied rewrites 99.5%

   \[\leadsto \color{blue}{\left(\left(\left(y - \frac{-0.1111111111111111}{x}\right) - 1\right) \cdot \sqrt{x}\right) \cdot 3} \]
5. Add Preprocessing

Alternative 7: 39.7% accurate, 2.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (* (* 3.0 y) (sqrt x)))

C

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

Fortran

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

Java

public static double code(double x, double y) {
	return (3.0 * y) * Math.sqrt(x);
}

Python

def code(x, y):
	return (3.0 * y) * math.sqrt(x)

Julia

function code(x, y)
	return Float64(Float64(3.0 * y) * sqrt(x))
end

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.4%

   \[\left(3 \cdot \sqrt{x}\right) \cdot \left(\left(y + \frac{1}{x \cdot 9}\right) - 1\right) \]
2. Add Preprocessing

3. Taylor expanded in y around inf

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. lower-*.f64 N/A

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

   4. lower-sqrt.f64 36.6

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

5. Applied rewrites 36.6%

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

7. Applied rewrites 36.6%

   \[\leadsto \left(3 \cdot y\right) \cdot \color{blue}{\sqrt{x}} \]
8. Add Preprocessing

Developer Target 1: 99.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ 3 \cdot \left(y \cdot \sqrt{x} + \left(\frac{1}{x \cdot 9} - 1\right) \cdot \sqrt{x}\right) \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (* 3.0 (+ (* y (sqrt x)) (* (- (/ 1.0 (* x 9.0)) 1.0) (sqrt x)))))

C

double code(double x, double y) {
	return 3.0 * ((y * sqrt(x)) + (((1.0 / (x * 9.0)) - 1.0) * sqrt(x)));
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = 3.0d0 * ((y * sqrt(x)) + (((1.0d0 / (x * 9.0d0)) - 1.0d0) * sqrt(x)))
end function

Java

public static double code(double x, double y) {
	return 3.0 * ((y * Math.sqrt(x)) + (((1.0 / (x * 9.0)) - 1.0) * Math.sqrt(x)));
}

Python

def code(x, y):
	return 3.0 * ((y * math.sqrt(x)) + (((1.0 / (x * 9.0)) - 1.0) * math.sqrt(x)))

Julia

function code(x, y)
	return Float64(3.0 * Float64(Float64(y * sqrt(x)) + Float64(Float64(Float64(1.0 / Float64(x * 9.0)) - 1.0) * sqrt(x))))
end

MATLAB

function tmp = code(x, y)
	tmp = 3.0 * ((y * sqrt(x)) + (((1.0 / (x * 9.0)) - 1.0) * sqrt(x)));
end

Wolfram

code[x_, y_] := N[(3.0 * N[(N[(y * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] + N[(N[(N[(1.0 / N[(x * 9.0), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision] * N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Reproduce

herbie shell --seed 2024326 
(FPCore (x y)
  :name "Numeric.SpecFunctions:incompleteGamma from math-functions-0.1.5.2, B"
  :precision binary64

  :alt
  (! :herbie-platform default (* 3 (+ (* y (sqrt x)) (* (- (/ 1 (* x 9)) 1) (sqrt x)))))

  (* (* 3.0 (sqrt x)) (- (+ y (/ 1.0 (* x 9.0))) 1.0)))