sqrt D (should all be same)

Percentage Accurate: 54.2% → 99.3%

Time: 12.2s

Alternatives: 6

Speedup: 4.9×

Specification

Math

\[\begin{array}{l} \\ \sqrt{2 \cdot {x}^{2}} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (sqrt (* 2.0 (pow x 2.0))))

C

double code(double x) {
	return sqrt((2.0 * pow(x, 2.0)));
}

Fortran

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

Java

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

Python

def code(x):
	return math.sqrt((2.0 * math.pow(x, 2.0)))

Julia

function code(x)
	return sqrt(Float64(2.0 * (x ^ 2.0)))
end

MATLAB

function tmp = code(x)
	tmp = sqrt((2.0 * (x ^ 2.0)));
end

Wolfram

code[x_] := N[Sqrt[N[(2.0 * N[Power[x, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]

Initial Program: 54.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \sqrt{2 \cdot {x}^{2}} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (sqrt (* 2.0 (pow x 2.0))))

C

double code(double x) {
	return sqrt((2.0 * pow(x, 2.0)));
}

Fortran

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

Java

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

Python

def code(x):
	return math.sqrt((2.0 * math.pow(x, 2.0)))

Julia

function code(x)
	return sqrt(Float64(2.0 * (x ^ 2.0)))
end

MATLAB

function tmp = code(x)
	tmp = sqrt((2.0 * (x ^ 2.0)));
end

Wolfram

code[x_] := N[Sqrt[N[(2.0 * N[Power[x, 2.0], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]

Alternative 1: 99.3% accurate, 3.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2 \cdot 10^{-310}:\\ \;\;\;\;\sqrt{2} \cdot \left(-x\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{2}{\frac{\sqrt{2}}{x}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x -2e-310) (* (sqrt 2.0) (- x)) (/ 2.0 (/ (sqrt 2.0) x))))

C

double code(double x) {
	double tmp;
	if (x <= -2e-310) {
		tmp = sqrt(2.0) * -x;
	} else {
		tmp = 2.0 / (sqrt(2.0) / x);
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= (-2d-310)) then
        tmp = sqrt(2.0d0) * -x
    else
        tmp = 2.0d0 / (sqrt(2.0d0) / x)
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= -2e-310) {
		tmp = Math.sqrt(2.0) * -x;
	} else {
		tmp = 2.0 / (Math.sqrt(2.0) / x);
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= -2e-310:
		tmp = math.sqrt(2.0) * -x
	else:
		tmp = 2.0 / (math.sqrt(2.0) / x)
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= -2e-310)
		tmp = Float64(sqrt(2.0) * Float64(-x));
	else
		tmp = Float64(2.0 / Float64(sqrt(2.0) / x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= -2e-310)
		tmp = sqrt(2.0) * -x;
	else
		tmp = 2.0 / (sqrt(2.0) / x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, -2e-310], N[(N[Sqrt[2.0], $MachinePrecision] * (-x)), $MachinePrecision], N[(2.0 / N[(N[Sqrt[2.0], $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.999999999999994e-310

   1. Initial program 61.1%

      \[\sqrt{2 \cdot {x}^{2}} \]
   2. Add Preprocessing

   3. Taylor expanded in x around -inf

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

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(x \cdot \sqrt{2}\right)} \]

      2. lower-neg.f64 N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(x \cdot \sqrt{2}\right)} \]

      3. lower-*.f64 N/A

         \[\leadsto \mathsf{neg}\left(\color{blue}{x \cdot \sqrt{2}}\right) \]

      4. lower-sqrt.f64 99.5

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

   5. Applied rewrites 99.5%

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

   if -1.999999999999994e-310 < x

   1. Initial program 53.3%

      \[\sqrt{2 \cdot {x}^{2}} \]
   2. Add Preprocessing

   3. Taylor expanded in x around -inf

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

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(x \cdot \sqrt{2}\right)} \]

      2. lower-neg.f64 N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(x \cdot \sqrt{2}\right)} \]

      3. lower-*.f64 N/A

         \[\leadsto \mathsf{neg}\left(\color{blue}{x \cdot \sqrt{2}}\right) \]

      4. lower-sqrt.f64 2.7

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

   5. Applied rewrites 2.7%

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

   7. Applied rewrites 2.7%

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

   9. Applied rewrites 99.4%

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

4. Final simplification 99.4%

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

Alternative 2: 99.4% accurate, 3.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2 \cdot 10^{-310}:\\ \;\;\;\;\sqrt{2} \cdot \left(-x\right)\\ \mathbf{else}:\\ \;\;\;\;\sqrt{x \cdot 2} \cdot \sqrt{x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x -2e-310) (* (sqrt 2.0) (- x)) (* (sqrt (* x 2.0)) (sqrt x))))

C

double code(double x) {
	double tmp;
	if (x <= -2e-310) {
		tmp = sqrt(2.0) * -x;
	} else {
		tmp = sqrt((x * 2.0)) * sqrt(x);
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= (-2d-310)) then
        tmp = sqrt(2.0d0) * -x
    else
        tmp = sqrt((x * 2.0d0)) * sqrt(x)
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= -2e-310) {
		tmp = Math.sqrt(2.0) * -x;
	} else {
		tmp = Math.sqrt((x * 2.0)) * Math.sqrt(x);
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= -2e-310:
		tmp = math.sqrt(2.0) * -x
	else:
		tmp = math.sqrt((x * 2.0)) * math.sqrt(x)
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= -2e-310)
		tmp = Float64(sqrt(2.0) * Float64(-x));
	else
		tmp = Float64(sqrt(Float64(x * 2.0)) * sqrt(x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= -2e-310)
		tmp = sqrt(2.0) * -x;
	else
		tmp = sqrt((x * 2.0)) * sqrt(x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, -2e-310], N[(N[Sqrt[2.0], $MachinePrecision] * (-x)), $MachinePrecision], N[(N[Sqrt[N[(x * 2.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[x], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.999999999999994e-310

   1. Initial program 61.1%

      \[\sqrt{2 \cdot {x}^{2}} \]
   2. Add Preprocessing

   3. Taylor expanded in x around -inf

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

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(x \cdot \sqrt{2}\right)} \]

      2. lower-neg.f64 N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(x \cdot \sqrt{2}\right)} \]

      3. lower-*.f64 N/A

         \[\leadsto \mathsf{neg}\left(\color{blue}{x \cdot \sqrt{2}}\right) \]

      4. lower-sqrt.f64 99.5

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

   5. Applied rewrites 99.5%

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

   if -1.999999999999994e-310 < x

   1. Initial program 53.3%

      \[\sqrt{2 \cdot {x}^{2}} \]
   2. Add Preprocessing

   3. Taylor expanded in x around -inf

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

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(x \cdot \sqrt{2}\right)} \]

      2. lower-neg.f64 N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(x \cdot \sqrt{2}\right)} \]

      3. lower-*.f64 N/A

         \[\leadsto \mathsf{neg}\left(\color{blue}{x \cdot \sqrt{2}}\right) \]

      4. lower-sqrt.f64 2.7

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

   5. Applied rewrites 2.7%

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

   7. Applied rewrites 99.4%

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

4. Final simplification 99.4%

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

Alternative 3: 99.3% accurate, 3.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2 \cdot 10^{-310}:\\ \;\;\;\;\sqrt{2} \cdot \left(-x\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{x \cdot 2}{\sqrt{2}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x -2e-310) (* (sqrt 2.0) (- x)) (/ (* x 2.0) (sqrt 2.0))))

C

double code(double x) {
	double tmp;
	if (x <= -2e-310) {
		tmp = sqrt(2.0) * -x;
	} else {
		tmp = (x * 2.0) / sqrt(2.0);
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= (-2d-310)) then
        tmp = sqrt(2.0d0) * -x
    else
        tmp = (x * 2.0d0) / sqrt(2.0d0)
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= -2e-310) {
		tmp = Math.sqrt(2.0) * -x;
	} else {
		tmp = (x * 2.0) / Math.sqrt(2.0);
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= -2e-310:
		tmp = math.sqrt(2.0) * -x
	else:
		tmp = (x * 2.0) / math.sqrt(2.0)
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= -2e-310)
		tmp = Float64(sqrt(2.0) * Float64(-x));
	else
		tmp = Float64(Float64(x * 2.0) / sqrt(2.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= -2e-310)
		tmp = sqrt(2.0) * -x;
	else
		tmp = (x * 2.0) / sqrt(2.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, -2e-310], N[(N[Sqrt[2.0], $MachinePrecision] * (-x)), $MachinePrecision], N[(N[(x * 2.0), $MachinePrecision] / N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.999999999999994e-310

   1. Initial program 61.1%

      \[\sqrt{2 \cdot {x}^{2}} \]
   2. Add Preprocessing

   3. Taylor expanded in x around -inf

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

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(x \cdot \sqrt{2}\right)} \]

      2. lower-neg.f64 N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(x \cdot \sqrt{2}\right)} \]

      3. lower-*.f64 N/A

         \[\leadsto \mathsf{neg}\left(\color{blue}{x \cdot \sqrt{2}}\right) \]

      4. lower-sqrt.f64 99.5

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

   5. Applied rewrites 99.5%

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

   if -1.999999999999994e-310 < x

   1. Initial program 53.3%

      \[\sqrt{2 \cdot {x}^{2}} \]
   2. Add Preprocessing

   3. Taylor expanded in x around -inf

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

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(x \cdot \sqrt{2}\right)} \]

      2. lower-neg.f64 N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(x \cdot \sqrt{2}\right)} \]

      3. lower-*.f64 N/A

         \[\leadsto \mathsf{neg}\left(\color{blue}{x \cdot \sqrt{2}}\right) \]

      4. lower-sqrt.f64 2.7

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

   5. Applied rewrites 2.7%

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

   7. Applied rewrites 2.7%

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

   9. Applied rewrites 99.3%

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

4. Final simplification 99.4%

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

Alternative 4: 99.3% accurate, 4.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2 \cdot 10^{-310}:\\ \;\;\;\;\sqrt{2} \cdot \left(-x\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot \sqrt{2}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x -2e-310) (* (sqrt 2.0) (- x)) (* x (sqrt 2.0))))

C

double code(double x) {
	double tmp;
	if (x <= -2e-310) {
		tmp = sqrt(2.0) * -x;
	} else {
		tmp = x * sqrt(2.0);
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= (-2d-310)) then
        tmp = sqrt(2.0d0) * -x
    else
        tmp = x * sqrt(2.0d0)
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= -2e-310) {
		tmp = Math.sqrt(2.0) * -x;
	} else {
		tmp = x * Math.sqrt(2.0);
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= -2e-310:
		tmp = math.sqrt(2.0) * -x
	else:
		tmp = x * math.sqrt(2.0)
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= -2e-310)
		tmp = Float64(sqrt(2.0) * Float64(-x));
	else
		tmp = Float64(x * sqrt(2.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= -2e-310)
		tmp = sqrt(2.0) * -x;
	else
		tmp = x * sqrt(2.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, -2e-310], N[(N[Sqrt[2.0], $MachinePrecision] * (-x)), $MachinePrecision], N[(x * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.999999999999994e-310

   1. Initial program 61.1%

      \[\sqrt{2 \cdot {x}^{2}} \]
   2. Add Preprocessing

   3. Taylor expanded in x around -inf

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

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(x \cdot \sqrt{2}\right)} \]

      2. lower-neg.f64 N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(x \cdot \sqrt{2}\right)} \]

      3. lower-*.f64 N/A

         \[\leadsto \mathsf{neg}\left(\color{blue}{x \cdot \sqrt{2}}\right) \]

      4. lower-sqrt.f64 99.5

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

   5. Applied rewrites 99.5%

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

   if -1.999999999999994e-310 < x

   1. Initial program 53.3%

      \[\sqrt{2 \cdot {x}^{2}} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. lower-*.f64 N/A

         \[\leadsto \color{blue}{x \cdot \sqrt{2}} \]

      2. lower-sqrt.f64 99.3

         \[\leadsto x \cdot \color{blue}{\sqrt{2}} \]

   5. Applied rewrites 99.3%

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

4. Final simplification 99.4%

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

Alternative 5: 52.9% accurate, 5.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -4 \cdot 10^{-206}:\\ \;\;\;\;\sqrt{2}\\ \mathbf{else}:\\ \;\;\;\;x \cdot \sqrt{2}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x -4e-206) (sqrt 2.0) (* x (sqrt 2.0))))

C

double code(double x) {
	double tmp;
	if (x <= -4e-206) {
		tmp = sqrt(2.0);
	} else {
		tmp = x * sqrt(2.0);
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= (-4d-206)) then
        tmp = sqrt(2.0d0)
    else
        tmp = x * sqrt(2.0d0)
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= -4e-206) {
		tmp = Math.sqrt(2.0);
	} else {
		tmp = x * Math.sqrt(2.0);
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= -4e-206:
		tmp = math.sqrt(2.0)
	else:
		tmp = x * math.sqrt(2.0)
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= -4e-206)
		tmp = sqrt(2.0);
	else
		tmp = Float64(x * sqrt(2.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= -4e-206)
		tmp = sqrt(2.0);
	else
		tmp = x * sqrt(2.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, -4e-206], N[Sqrt[2.0], $MachinePrecision], N[(x * N[Sqrt[2.0], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -4.00000000000000011e-206

   1. Initial program 68.0%

      \[\sqrt{2 \cdot {x}^{2}} \]
   2. Add Preprocessing

   4. Applied rewrites 5.7%

      \[\leadsto \color{blue}{\sqrt{2}} \]

   if -4.00000000000000011e-206 < x

   1. Initial program 48.4%

      \[\sqrt{2 \cdot {x}^{2}} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. lower-*.f64 N/A

         \[\leadsto \color{blue}{x \cdot \sqrt{2}} \]

      2. lower-sqrt.f64 89.3

         \[\leadsto x \cdot \color{blue}{\sqrt{2}} \]

   5. Applied rewrites 89.3%

      \[\leadsto \color{blue}{x \cdot \sqrt{2}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 5.4% accurate, 10.6× speedup

Math

\[\begin{array}{l} \\ \sqrt{2} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

function code(x)
	return sqrt(2.0)
end

MATLAB

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

Wolfram

code[x_] := N[Sqrt[2.0], $MachinePrecision]

Derivation

1. Initial program 57.3%

   \[\sqrt{2 \cdot {x}^{2}} \]
2. Add Preprocessing

4. Applied rewrites 5.4%

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

Reproduce

herbie shell --seed 2024223 
(FPCore (x)
  :name "sqrt D (should all be same)"
  :precision binary64
  (sqrt (* 2.0 (pow x 2.0))))