Main:bigenough3 from C

Percentage Accurate: 54.1% → 99.4%

Time: 8.2s

Alternatives: 9

Speedup: 1.9×

Specification

Math

\[\begin{array}{l} \\ \sqrt{x + 1} - \sqrt{x} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (- (sqrt (+ x 1.0)) (sqrt x)))

C

double code(double x) {
	return sqrt((x + 1.0)) - sqrt(x);
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = sqrt((x + 1.0d0)) - sqrt(x)
end function

Java

public static double code(double x) {
	return Math.sqrt((x + 1.0)) - Math.sqrt(x);
}

Python

def code(x):
	return math.sqrt((x + 1.0)) - math.sqrt(x)

Julia

function code(x)
	return Float64(sqrt(Float64(x + 1.0)) - sqrt(x))
end

MATLAB

function tmp = code(x)
	tmp = sqrt((x + 1.0)) - sqrt(x);
end

Wolfram

code[x_] := N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]

Initial Program: 54.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \sqrt{x + 1} - \sqrt{x} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (- (sqrt (+ x 1.0)) (sqrt x)))

C

double code(double x) {
	return sqrt((x + 1.0)) - sqrt(x);
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = sqrt((x + 1.0d0)) - sqrt(x)
end function

Java

public static double code(double x) {
	return Math.sqrt((x + 1.0)) - Math.sqrt(x);
}

Python

def code(x):
	return math.sqrt((x + 1.0)) - math.sqrt(x)

Julia

function code(x)
	return Float64(sqrt(Float64(x + 1.0)) - sqrt(x))
end

MATLAB

function tmp = code(x)
	tmp = sqrt((x + 1.0)) - sqrt(x);
end

Wolfram

code[x_] := N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.4% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{1 + x} - \sqrt{x}\\ \mathbf{if}\;t\_0 \leq 5 \cdot 10^{-6}:\\ \;\;\;\;0.5 \cdot \sqrt{\frac{1}{x}}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (- (sqrt (+ 1.0 x)) (sqrt x))))
   (if (<= t_0 5e-6) (* 0.5 (sqrt (/ 1.0 x))) t_0)))

C

double code(double x) {
	double t_0 = sqrt((1.0 + x)) - sqrt(x);
	double tmp;
	if (t_0 <= 5e-6) {
		tmp = 0.5 * sqrt((1.0 / x));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: t_0
    real(8) :: tmp
    t_0 = sqrt((1.0d0 + x)) - sqrt(x)
    if (t_0 <= 5d-6) then
        tmp = 0.5d0 * sqrt((1.0d0 / x))
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double t_0 = Math.sqrt((1.0 + x)) - Math.sqrt(x);
	double tmp;
	if (t_0 <= 5e-6) {
		tmp = 0.5 * Math.sqrt((1.0 / x));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x):
	t_0 = math.sqrt((1.0 + x)) - math.sqrt(x)
	tmp = 0
	if t_0 <= 5e-6:
		tmp = 0.5 * math.sqrt((1.0 / x))
	else:
		tmp = t_0
	return tmp

Julia

function code(x)
	t_0 = Float64(sqrt(Float64(1.0 + x)) - sqrt(x))
	tmp = 0.0
	if (t_0 <= 5e-6)
		tmp = Float64(0.5 * sqrt(Float64(1.0 / x)));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	t_0 = sqrt((1.0 + x)) - sqrt(x);
	tmp = 0.0;
	if (t_0 <= 5e-6)
		tmp = 0.5 * sqrt((1.0 / x));
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := Block[{t$95$0 = N[(N[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 5e-6], N[(0.5 * N[Sqrt[N[(1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], t$95$0]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (sqrt.f64 (+.f64 x 1)) (sqrt.f64 x)) < 5.00000000000000041e-6

   1. Initial program 4.3%

      \[\sqrt{x + 1} - \sqrt{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 99.6%

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

   if 5.00000000000000041e-6 < (-.f64 (sqrt.f64 (+.f64 x 1)) (sqrt.f64 x))

   1. Initial program 99.9%

      \[\sqrt{x + 1} - \sqrt{x} \]
   2. Add Preprocessing
3. Recombined 2 regimes into one program.

4. Final simplification 99.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\sqrt{1 + x} - \sqrt{x} \leq 5 \cdot 10^{-6}:\\ \;\;\;\;0.5 \cdot \sqrt{\frac{1}{x}}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{1 + x} - \sqrt{x}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 99.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{1}{\sqrt{x} + \sqrt{1 + x}} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ 1.0 (+ (sqrt x) (sqrt (+ 1.0 x)))))

C

double code(double x) {
	return 1.0 / (sqrt(x) + sqrt((1.0 + x)));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = 1.0d0 / (sqrt(x) + sqrt((1.0d0 + x)))
end function

Java

public static double code(double x) {
	return 1.0 / (Math.sqrt(x) + Math.sqrt((1.0 + x)));
}

Python

def code(x):
	return 1.0 / (math.sqrt(x) + math.sqrt((1.0 + x)))

Julia

function code(x)
	return Float64(1.0 / Float64(sqrt(x) + sqrt(Float64(1.0 + x))))
end

MATLAB

function tmp = code(x)
	tmp = 1.0 / (sqrt(x) + sqrt((1.0 + x)));
end

Wolfram

code[x_] := N[(1.0 / N[(N[Sqrt[x], $MachinePrecision] + N[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 55.9%

   \[\sqrt{x + 1} - \sqrt{x} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. flip-- 55.8%

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

   2. div-inv 55.8%

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

   3. add-sqr-sqrt 56.4%

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

   4. add-sqr-sqrt 56.7%

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

   5. associate--l+ 56.7%

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

4. Applied egg-rr 56.7%

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

   1. +-commutative 56.7%

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

   2. associate-+l- 99.7%

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

   3. +-inverses 99.7%

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

   4. metadata-eval 99.7%

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

   5. associate-*r/ 99.7%

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

   6. metadata-eval 99.7%

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

   7. +-commutative 99.7%

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

   8. +-commutative 99.7%

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

6. Simplified 99.7%

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

7. Final simplification 99.7%

   \[\leadsto \frac{1}{\sqrt{x} + \sqrt{1 + x}} \]
8. Add Preprocessing

Alternative 3: 98.8% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 1.3:\\ \;\;\;\;\left(1 + x \cdot \left(0.5 + x \cdot \left(x \cdot 0.0625 - 0.125\right)\right)\right) - \sqrt{x}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \sqrt{\frac{1}{x}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x 1.3)
   (- (+ 1.0 (* x (+ 0.5 (* x (- (* x 0.0625) 0.125))))) (sqrt x))
   (* 0.5 (sqrt (/ 1.0 x)))))

C

double code(double x) {
	double tmp;
	if (x <= 1.3) {
		tmp = (1.0 + (x * (0.5 + (x * ((x * 0.0625) - 0.125))))) - sqrt(x);
	} else {
		tmp = 0.5 * sqrt((1.0 / x));
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= 1.3d0) then
        tmp = (1.0d0 + (x * (0.5d0 + (x * ((x * 0.0625d0) - 0.125d0))))) - sqrt(x)
    else
        tmp = 0.5d0 * sqrt((1.0d0 / x))
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= 1.3) {
		tmp = (1.0 + (x * (0.5 + (x * ((x * 0.0625) - 0.125))))) - Math.sqrt(x);
	} else {
		tmp = 0.5 * Math.sqrt((1.0 / x));
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= 1.3:
		tmp = (1.0 + (x * (0.5 + (x * ((x * 0.0625) - 0.125))))) - math.sqrt(x)
	else:
		tmp = 0.5 * math.sqrt((1.0 / x))
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= 1.3)
		tmp = Float64(Float64(1.0 + Float64(x * Float64(0.5 + Float64(x * Float64(Float64(x * 0.0625) - 0.125))))) - sqrt(x));
	else
		tmp = Float64(0.5 * sqrt(Float64(1.0 / x)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= 1.3)
		tmp = (1.0 + (x * (0.5 + (x * ((x * 0.0625) - 0.125))))) - sqrt(x);
	else
		tmp = 0.5 * sqrt((1.0 / x));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, 1.3], N[(N[(1.0 + N[(x * N[(0.5 + N[(x * N[(N[(x * 0.0625), $MachinePrecision] - 0.125), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision], N[(0.5 * N[Sqrt[N[(1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 1.30000000000000004

   1. Initial program 99.9%

      \[\sqrt{x + 1} - \sqrt{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 99.2%

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

   if 1.30000000000000004 < x

   1. Initial program 5.1%

      \[\sqrt{x + 1} - \sqrt{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 98.9%

      \[\leadsto \color{blue}{0.5 \cdot \sqrt{\frac{1}{x}}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.1%

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

Alternative 4: 98.7% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 1.2:\\ \;\;\;\;1 + \left(x \cdot \left(0.5 + x \cdot -0.125\right) - \sqrt{x}\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \sqrt{\frac{1}{x}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x 1.2)
   (+ 1.0 (- (* x (+ 0.5 (* x -0.125))) (sqrt x)))
   (* 0.5 (sqrt (/ 1.0 x)))))

C

double code(double x) {
	double tmp;
	if (x <= 1.2) {
		tmp = 1.0 + ((x * (0.5 + (x * -0.125))) - sqrt(x));
	} else {
		tmp = 0.5 * sqrt((1.0 / x));
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= 1.2d0) then
        tmp = 1.0d0 + ((x * (0.5d0 + (x * (-0.125d0)))) - sqrt(x))
    else
        tmp = 0.5d0 * sqrt((1.0d0 / x))
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= 1.2) {
		tmp = 1.0 + ((x * (0.5 + (x * -0.125))) - Math.sqrt(x));
	} else {
		tmp = 0.5 * Math.sqrt((1.0 / x));
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= 1.2:
		tmp = 1.0 + ((x * (0.5 + (x * -0.125))) - math.sqrt(x))
	else:
		tmp = 0.5 * math.sqrt((1.0 / x))
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= 1.2)
		tmp = Float64(1.0 + Float64(Float64(x * Float64(0.5 + Float64(x * -0.125))) - sqrt(x)));
	else
		tmp = Float64(0.5 * sqrt(Float64(1.0 / x)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= 1.2)
		tmp = 1.0 + ((x * (0.5 + (x * -0.125))) - sqrt(x));
	else
		tmp = 0.5 * sqrt((1.0 / x));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, 1.2], N[(1.0 + N[(N[(x * N[(0.5 + N[(x * -0.125), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[Sqrt[N[(1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 1.19999999999999996

   1. Initial program 99.9%

      \[\sqrt{x + 1} - \sqrt{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 98.7%

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

      1. associate--l+ 98.7%

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

      2. *-commutative 98.7%

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

   5. Simplified 98.7%

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

   if 1.19999999999999996 < x

   1. Initial program 5.1%

      \[\sqrt{x + 1} - \sqrt{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 98.9%

      \[\leadsto \color{blue}{0.5 \cdot \sqrt{\frac{1}{x}}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.8%

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

Alternative 5: 98.6% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 1:\\ \;\;\;\;1 + \left(x \cdot 0.5 - \sqrt{x}\right)\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \sqrt{\frac{1}{x}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x 1.0) (+ 1.0 (- (* x 0.5) (sqrt x))) (* 0.5 (sqrt (/ 1.0 x)))))

C

double code(double x) {
	double tmp;
	if (x <= 1.0) {
		tmp = 1.0 + ((x * 0.5) - sqrt(x));
	} else {
		tmp = 0.5 * sqrt((1.0 / x));
	}
	return tmp;
}

Fortran

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

Java

public static double code(double x) {
	double tmp;
	if (x <= 1.0) {
		tmp = 1.0 + ((x * 0.5) - Math.sqrt(x));
	} else {
		tmp = 0.5 * Math.sqrt((1.0 / x));
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= 1.0:
		tmp = 1.0 + ((x * 0.5) - math.sqrt(x))
	else:
		tmp = 0.5 * math.sqrt((1.0 / x))
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= 1.0)
		tmp = Float64(1.0 + Float64(Float64(x * 0.5) - sqrt(x)));
	else
		tmp = Float64(0.5 * sqrt(Float64(1.0 / x)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= 1.0)
		tmp = 1.0 + ((x * 0.5) - sqrt(x));
	else
		tmp = 0.5 * sqrt((1.0 / x));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, 1.0], N[(1.0 + N[(N[(x * 0.5), $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.5 * N[Sqrt[N[(1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 1

   1. Initial program 99.9%

      \[\sqrt{x + 1} - \sqrt{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 98.0%

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

      1. associate--l+ 98.0%

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

      2. *-commutative 98.0%

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

   5. Simplified 98.0%

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

   if 1 < x

   1. Initial program 5.1%

      \[\sqrt{x + 1} - \sqrt{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 98.9%

      \[\leadsto \color{blue}{0.5 \cdot \sqrt{\frac{1}{x}}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.4%

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

Alternative 6: 98.0% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 0.36:\\ \;\;\;\;1 - \sqrt{x}\\ \mathbf{else}:\\ \;\;\;\;0.5 \cdot \sqrt{\frac{1}{x}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x 0.36) (- 1.0 (sqrt x)) (* 0.5 (sqrt (/ 1.0 x)))))

C

double code(double x) {
	double tmp;
	if (x <= 0.36) {
		tmp = 1.0 - sqrt(x);
	} else {
		tmp = 0.5 * sqrt((1.0 / x));
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= 0.36d0) then
        tmp = 1.0d0 - sqrt(x)
    else
        tmp = 0.5d0 * sqrt((1.0d0 / x))
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= 0.36) {
		tmp = 1.0 - Math.sqrt(x);
	} else {
		tmp = 0.5 * Math.sqrt((1.0 / x));
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= 0.36:
		tmp = 1.0 - math.sqrt(x)
	else:
		tmp = 0.5 * math.sqrt((1.0 / x))
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= 0.36)
		tmp = Float64(1.0 - sqrt(x));
	else
		tmp = Float64(0.5 * sqrt(Float64(1.0 / x)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= 0.36)
		tmp = 1.0 - sqrt(x);
	else
		tmp = 0.5 * sqrt((1.0 / x));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, 0.36], N[(1.0 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision], N[(0.5 * N[Sqrt[N[(1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 0.35999999999999999

   1. Initial program 99.9%

      \[\sqrt{x + 1} - \sqrt{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 96.8%

      \[\leadsto \color{blue}{1 - \sqrt{x}} \]

   if 0.35999999999999999 < x

   1. Initial program 5.1%

      \[\sqrt{x + 1} - \sqrt{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 98.9%

      \[\leadsto \color{blue}{0.5 \cdot \sqrt{\frac{1}{x}}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 97.8%

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

Alternative 7: 59.1% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 0.65:\\ \;\;\;\;1 - \sqrt{x}\\ \mathbf{else}:\\ \;\;\;\;{x}^{-0.5}\\ \end{array} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (if (<= x 0.65) (- 1.0 (sqrt x)) (pow x -0.5)))

C

double code(double x) {
	double tmp;
	if (x <= 0.65) {
		tmp = 1.0 - sqrt(x);
	} else {
		tmp = pow(x, -0.5);
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= 0.65d0) then
        tmp = 1.0d0 - sqrt(x)
    else
        tmp = x ** (-0.5d0)
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= 0.65) {
		tmp = 1.0 - Math.sqrt(x);
	} else {
		tmp = Math.pow(x, -0.5);
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= 0.65:
		tmp = 1.0 - math.sqrt(x)
	else:
		tmp = math.pow(x, -0.5)
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= 0.65)
		tmp = Float64(1.0 - sqrt(x));
	else
		tmp = x ^ -0.5;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= 0.65)
		tmp = 1.0 - sqrt(x);
	else
		tmp = x ^ -0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, 0.65], N[(1.0 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision], N[Power[x, -0.5], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 0.650000000000000022

   1. Initial program 99.9%

      \[\sqrt{x + 1} - \sqrt{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 96.8%

      \[\leadsto \color{blue}{1 - \sqrt{x}} \]

   if 0.650000000000000022 < x

   1. Initial program 5.1%

      \[\sqrt{x + 1} - \sqrt{x} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. flip-- 5.1%

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

      2. div-inv 5.1%

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

      3. add-sqr-sqrt 6.3%

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

      4. add-sqr-sqrt 7.1%

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

      5. associate--l+ 7.1%

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

   4. Applied egg-rr 7.1%

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

      1. +-commutative 7.1%

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

      2. associate-+l- 99.5%

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

      3. +-inverses 99.5%

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

      4. metadata-eval 99.5%

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

      5. associate-*r/ 99.5%

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

      6. metadata-eval 99.5%

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

      7. +-commutative 99.5%

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

      8. +-commutative 99.5%

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

   6. Simplified 99.5%

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

   7. Taylor expanded in x around 0 18.8%

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

   8. Taylor expanded in x around inf 18.7%

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

      1. *-un-lft-identity 18.7%

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

      2. inv-pow 18.7%

         \[\leadsto 1 \cdot \sqrt{\color{blue}{{x}^{-1}}} \]

      3. sqrt-pow1 18.7%

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

      4. metadata-eval 18.7%

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

   10. Applied egg-rr 18.7%

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

       1. *-lft-identity 18.7%

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

   12. Simplified 18.7%

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

4. Final simplification 60.5%

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

Alternative 8: 1.7% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ -\sqrt{x} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (- (sqrt x)))

C

double code(double x) {
	return -sqrt(x);
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = -sqrt(x)
end function

Java

public static double code(double x) {
	return -Math.sqrt(x);
}

Python

def code(x):
	return -math.sqrt(x)

Julia

function code(x)
	return Float64(-sqrt(x))
end

MATLAB

function tmp = code(x)
	tmp = -sqrt(x);
end

Wolfram

code[x_] := (-N[Sqrt[x], $MachinePrecision])

Derivation

1. Initial program 55.9%

   \[\sqrt{x + 1} - \sqrt{x} \]
2. Add Preprocessing

3. Taylor expanded in x around 0 52.5%

   \[\leadsto \color{blue}{1 - \sqrt{x}} \]

4. Taylor expanded in x around inf 1.7%

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

   1. neg-mul-1 1.7%

      \[\leadsto \color{blue}{-\sqrt{x}} \]

6. Simplified 1.7%

   \[\leadsto \color{blue}{-\sqrt{x}} \]

7. Final simplification 1.7%

   \[\leadsto -\sqrt{x} \]
8. Add Preprocessing

Alternative 9: 12.7% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ {x}^{-0.5} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (pow x -0.5))

C

double code(double x) {
	return pow(x, -0.5);
}

Fortran

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

Java

public static double code(double x) {
	return Math.pow(x, -0.5);
}

Python

def code(x):
	return math.pow(x, -0.5)

Julia

function code(x)
	return x ^ -0.5
end

MATLAB

function tmp = code(x)
	tmp = x ^ -0.5;
end

Wolfram

code[x_] := N[Power[x, -0.5], $MachinePrecision]

Derivation

1. Initial program 55.9%

   \[\sqrt{x + 1} - \sqrt{x} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. flip-- 55.8%

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

   2. div-inv 55.8%

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

   3. add-sqr-sqrt 56.4%

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

   4. add-sqr-sqrt 56.7%

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

   5. associate--l+ 56.7%

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

4. Applied egg-rr 56.7%

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

   1. +-commutative 56.7%

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

   2. associate-+l- 99.7%

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

   3. +-inverses 99.7%

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

   4. metadata-eval 99.7%

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

   5. associate-*r/ 99.7%

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

   6. metadata-eval 99.7%

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

   7. +-commutative 99.7%

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

   8. +-commutative 99.7%

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

6. Simplified 99.7%

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

7. Taylor expanded in x around 0 60.5%

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

8. Taylor expanded in x around inf 12.4%

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

   1. *-un-lft-identity 12.4%

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

   2. inv-pow 12.4%

      \[\leadsto 1 \cdot \sqrt{\color{blue}{{x}^{-1}}} \]

   3. sqrt-pow1 12.4%

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

   4. metadata-eval 12.4%

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

10. Applied egg-rr 12.4%

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

    1. *-lft-identity 12.4%

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

12. Simplified 12.4%

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

13. Final simplification 12.4%

    \[\leadsto {x}^{-0.5} \]
14. Add Preprocessing

Developer target: 99.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{1}{\sqrt{x + 1} + \sqrt{x}} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ 1.0 (+ (sqrt (+ x 1.0)) (sqrt x))))

C

double code(double x) {
	return 1.0 / (sqrt((x + 1.0)) + sqrt(x));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = 1.0d0 / (sqrt((x + 1.0d0)) + sqrt(x))
end function

Java

public static double code(double x) {
	return 1.0 / (Math.sqrt((x + 1.0)) + Math.sqrt(x));
}

Python

def code(x):
	return 1.0 / (math.sqrt((x + 1.0)) + math.sqrt(x))

Julia

function code(x)
	return Float64(1.0 / Float64(sqrt(Float64(x + 1.0)) + sqrt(x)))
end

MATLAB

function tmp = code(x)
	tmp = 1.0 / (sqrt((x + 1.0)) + sqrt(x));
end

Wolfram

code[x_] := N[(1.0 / N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Reproduce

herbie shell --seed 2024053 
(FPCore (x)
  :name "Main:bigenough3 from C"
  :precision binary64

  :alt
  (/ 1.0 (+ (sqrt (+ x 1.0)) (sqrt x)))

  (- (sqrt (+ x 1.0)) (sqrt x)))