Diagrams.Trail:splitAtParam from diagrams-lib-1.3.0.3, C

Percentage Accurate: 100.0% → 100.0%

Time: 6.3s

Alternatives: 9

Speedup: 1.0×

Specification

Math

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

FPCore

(FPCore (x y) :precision binary64 (/ (- x y) (- 1.0 y)))

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return (x - y) / (1.0 - y)

Julia

function code(x, y)
	return Float64(Float64(x - y) / Float64(1.0 - y))
end

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (/ (- x y) (- 1.0 y)))

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return (x - y) / (1.0 - y)

Julia

function code(x, y)
	return Float64(Float64(x - y) / Float64(1.0 - y))
end

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (/ (- x y) (- 1.0 y)))

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return (x - y) / (1.0 - y)

Julia

function code(x, y)
	return Float64(Float64(x - y) / Float64(1.0 - y))
end

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[\frac{x - y}{1 - y} \]

2. Final simplification 100.0%

   \[\leadsto \frac{x - y}{1 - y} \]

Alternative 2: 86.3% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -38000000000:\\ \;\;\;\;1\\ \mathbf{elif}\;y \leq 2.8 \cdot 10^{-6}:\\ \;\;\;\;x - y\\ \mathbf{elif}\;y \leq 5.2 \cdot 10^{+39}:\\ \;\;\;\;\frac{x}{1 - y}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -38000000000.0)
   1.0
   (if (<= y 2.8e-6) (- x y) (if (<= y 5.2e+39) (/ x (- 1.0 y)) 1.0))))

C

double code(double x, double y) {
	double tmp;
	if (y <= -38000000000.0) {
		tmp = 1.0;
	} else if (y <= 2.8e-6) {
		tmp = x - y;
	} else if (y <= 5.2e+39) {
		tmp = x / (1.0 - y);
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= (-38000000000.0d0)) then
        tmp = 1.0d0
    else if (y <= 2.8d-6) then
        tmp = x - y
    else if (y <= 5.2d+39) then
        tmp = x / (1.0d0 - y)
    else
        tmp = 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= -38000000000.0) {
		tmp = 1.0;
	} else if (y <= 2.8e-6) {
		tmp = x - y;
	} else if (y <= 5.2e+39) {
		tmp = x / (1.0 - y);
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -38000000000.0:
		tmp = 1.0
	elif y <= 2.8e-6:
		tmp = x - y
	elif y <= 5.2e+39:
		tmp = x / (1.0 - y)
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -38000000000.0)
		tmp = 1.0;
	elseif (y <= 2.8e-6)
		tmp = Float64(x - y);
	elseif (y <= 5.2e+39)
		tmp = Float64(x / Float64(1.0 - y));
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -38000000000.0)
		tmp = 1.0;
	elseif (y <= 2.8e-6)
		tmp = x - y;
	elseif (y <= 5.2e+39)
		tmp = x / (1.0 - y);
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -38000000000.0], 1.0, If[LessEqual[y, 2.8e-6], N[(x - y), $MachinePrecision], If[LessEqual[y, 5.2e+39], N[(x / N[(1.0 - y), $MachinePrecision]), $MachinePrecision], 1.0]]]

Derivation

1. Split input into 3 regimes

2. if y < -3.8e10 or 5.2e39 < y

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]

   2. Taylor expanded in y around inf 78.5%

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

   if -3.8e10 < y < 2.79999999999999987e-6

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]

   2. Taylor expanded in y around 0 97.5%

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

      1. mul-1-neg 97.5%

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

      2. *-commutative 97.5%

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

      3. distribute-lft-neg-in 97.5%

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

      4. cancel-sign-sub 97.5%

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

      5. +-commutative 97.5%

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

      6. metadata-eval 97.5%

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

      7. distribute-lft-in 97.5%

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

      8. metadata-eval 97.5%

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

      9. sub-neg 97.5%

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

      10. mul-1-neg 97.5%

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

      11. remove-double-neg 97.5%

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

      12. sub-neg 97.5%

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

      13. metadata-eval 97.5%

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

      14. +-commutative 97.5%

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

      15. distribute-neg-in 97.5%

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

      16. metadata-eval 97.5%

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

      17. mul-1-neg 97.5%

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

      18. *-commutative 97.5%

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

      19. mul-1-neg 97.5%

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

      20. unsub-neg 97.5%

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

   4. Simplified 97.5%

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

   5. Taylor expanded in x around 0 97.5%

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

   if 2.79999999999999987e-6 < y < 5.2e39

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]

   2. Taylor expanded in x around inf 84.4%

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

4. Final simplification 89.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -38000000000:\\ \;\;\;\;1\\ \mathbf{elif}\;y \leq 2.8 \cdot 10^{-6}:\\ \;\;\;\;x - y\\ \mathbf{elif}\;y \leq 5.2 \cdot 10^{+39}:\\ \;\;\;\;\frac{x}{1 - y}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]

Alternative 3: 98.1% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.22 \lor \neg \left(y \leq 1\right):\\ \;\;\;\;1 + \frac{1 - x}{y}\\ \mathbf{else}:\\ \;\;\;\;x - y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -1.22) (not (<= y 1.0))) (+ 1.0 (/ (- 1.0 x) y)) (- x y)))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -1.22) || !(y <= 1.0)) {
		tmp = 1.0 + ((1.0 - x) / y);
	} else {
		tmp = x - y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y <= (-1.22d0)) .or. (.not. (y <= 1.0d0))) then
        tmp = 1.0d0 + ((1.0d0 - x) / y)
    else
        tmp = x - y
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y <= -1.22) || !(y <= 1.0)) {
		tmp = 1.0 + ((1.0 - x) / y);
	} else {
		tmp = x - y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -1.22) or not (y <= 1.0):
		tmp = 1.0 + ((1.0 - x) / y)
	else:
		tmp = x - y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -1.22) || !(y <= 1.0))
		tmp = Float64(1.0 + Float64(Float64(1.0 - x) / y));
	else
		tmp = Float64(x - y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -1.22) || ~((y <= 1.0)))
		tmp = 1.0 + ((1.0 - x) / y);
	else
		tmp = x - y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -1.22], N[Not[LessEqual[y, 1.0]], $MachinePrecision]], N[(1.0 + N[(N[(1.0 - x), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], N[(x - y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1.21999999999999997 or 1 < y

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]

   2. Taylor expanded in y around inf 96.5%

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

      1. +-commutative 96.5%

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

      2. mul-1-neg 96.5%

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

      3. unsub-neg 96.5%

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

      4. div-sub 96.5%

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

   4. Simplified 96.5%

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

   if -1.21999999999999997 < y < 1

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]

   2. Taylor expanded in y around 0 99.5%

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

      1. mul-1-neg 99.5%

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

      2. *-commutative 99.5%

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

      3. distribute-lft-neg-in 99.5%

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

      4. cancel-sign-sub 99.5%

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

      5. +-commutative 99.5%

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

      6. metadata-eval 99.5%

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

      7. distribute-lft-in 99.5%

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

      8. metadata-eval 99.5%

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

      9. sub-neg 99.5%

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

      10. mul-1-neg 99.5%

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

      11. remove-double-neg 99.5%

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

      12. sub-neg 99.5%

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

      13. metadata-eval 99.5%

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

      14. +-commutative 99.5%

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

      15. distribute-neg-in 99.5%

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

      16. metadata-eval 99.5%

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

      17. mul-1-neg 99.5%

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

      18. *-commutative 99.5%

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

      19. mul-1-neg 99.5%

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

      20. unsub-neg 99.5%

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

   4. Simplified 99.5%

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

   5. Taylor expanded in x around 0 99.3%

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

4. Final simplification 98.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.22 \lor \neg \left(y \leq 1\right):\\ \;\;\;\;1 + \frac{1 - x}{y}\\ \mathbf{else}:\\ \;\;\;\;x - y\\ \end{array} \]

Alternative 4: 98.4% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -1.0) (not (<= y 1.0)))
   (+ 1.0 (/ (- 1.0 x) y))
   (+ x (* y (+ x -1.0)))))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -1.0) || !(y <= 1.0)) {
		tmp = 1.0 + ((1.0 - x) / y);
	} else {
		tmp = x + (y * (x + -1.0));
	}
	return tmp;
}

Fortran

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

Java

public static double code(double x, double y) {
	double tmp;
	if ((y <= -1.0) || !(y <= 1.0)) {
		tmp = 1.0 + ((1.0 - x) / y);
	} else {
		tmp = x + (y * (x + -1.0));
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -1.0) or not (y <= 1.0):
		tmp = 1.0 + ((1.0 - x) / y)
	else:
		tmp = x + (y * (x + -1.0))
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -1.0) || !(y <= 1.0))
		tmp = Float64(1.0 + Float64(Float64(1.0 - x) / y));
	else
		tmp = Float64(x + Float64(y * Float64(x + -1.0)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -1.0) || ~((y <= 1.0)))
		tmp = 1.0 + ((1.0 - x) / y);
	else
		tmp = x + (y * (x + -1.0));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -1.0], N[Not[LessEqual[y, 1.0]], $MachinePrecision]], N[(1.0 + N[(N[(1.0 - x), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision], N[(x + N[(y * N[(x + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1 or 1 < y

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]

   2. Taylor expanded in y around inf 96.5%

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

      1. +-commutative 96.5%

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

      2. mul-1-neg 96.5%

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

      3. unsub-neg 96.5%

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

      4. div-sub 96.5%

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

   4. Simplified 96.5%

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

   if -1 < y < 1

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]

   2. Taylor expanded in y around 0 99.5%

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

      1. mul-1-neg 99.5%

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

      2. *-commutative 99.5%

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

      3. distribute-lft-neg-in 99.5%

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

      4. cancel-sign-sub 99.5%

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

      5. +-commutative 99.5%

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

      6. metadata-eval 99.5%

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

      7. distribute-lft-in 99.5%

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

      8. metadata-eval 99.5%

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

      9. sub-neg 99.5%

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

      10. mul-1-neg 99.5%

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

      11. remove-double-neg 99.5%

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

      12. sub-neg 99.5%

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

      13. metadata-eval 99.5%

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

      14. +-commutative 99.5%

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

      15. distribute-neg-in 99.5%

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

      16. metadata-eval 99.5%

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

      17. mul-1-neg 99.5%

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

      18. *-commutative 99.5%

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

      19. mul-1-neg 99.5%

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

      20. unsub-neg 99.5%

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

   4. Simplified 99.5%

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

4. Final simplification 98.1%

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

Alternative 5: 73.3% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -5.8 \cdot 10^{-12}:\\ \;\;\;\;1\\ \mathbf{elif}\;y \leq -2.25 \cdot 10^{-41}:\\ \;\;\;\;-y\\ \mathbf{elif}\;y \leq 1.48 \cdot 10^{-56}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 11.5:\\ \;\;\;\;-y\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -5.8e-12)
   1.0
   (if (<= y -2.25e-41)
     (- y)
     (if (<= y 1.48e-56) x (if (<= y 11.5) (- y) 1.0)))))

C

double code(double x, double y) {
	double tmp;
	if (y <= -5.8e-12) {
		tmp = 1.0;
	} else if (y <= -2.25e-41) {
		tmp = -y;
	} else if (y <= 1.48e-56) {
		tmp = x;
	} else if (y <= 11.5) {
		tmp = -y;
	} else {
		tmp = 1.0;
	}
	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.8d-12)) then
        tmp = 1.0d0
    else if (y <= (-2.25d-41)) then
        tmp = -y
    else if (y <= 1.48d-56) then
        tmp = x
    else if (y <= 11.5d0) then
        tmp = -y
    else
        tmp = 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= -5.8e-12) {
		tmp = 1.0;
	} else if (y <= -2.25e-41) {
		tmp = -y;
	} else if (y <= 1.48e-56) {
		tmp = x;
	} else if (y <= 11.5) {
		tmp = -y;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -5.8e-12:
		tmp = 1.0
	elif y <= -2.25e-41:
		tmp = -y
	elif y <= 1.48e-56:
		tmp = x
	elif y <= 11.5:
		tmp = -y
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -5.8e-12)
		tmp = 1.0;
	elseif (y <= -2.25e-41)
		tmp = Float64(-y);
	elseif (y <= 1.48e-56)
		tmp = x;
	elseif (y <= 11.5)
		tmp = Float64(-y);
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -5.8e-12)
		tmp = 1.0;
	elseif (y <= -2.25e-41)
		tmp = -y;
	elseif (y <= 1.48e-56)
		tmp = x;
	elseif (y <= 11.5)
		tmp = -y;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -5.8e-12], 1.0, If[LessEqual[y, -2.25e-41], (-y), If[LessEqual[y, 1.48e-56], x, If[LessEqual[y, 11.5], (-y), 1.0]]]]

Derivation

1. Split input into 3 regimes

2. if y < -5.8000000000000003e-12 or 11.5 < y

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]

   2. Taylor expanded in y around inf 73.2%

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

   if -5.8000000000000003e-12 < y < -2.25e-41 or 1.48e-56 < y < 11.5

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]

   2. Taylor expanded in y around 0 91.4%

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

      1. mul-1-neg 91.4%

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

      2. *-commutative 91.4%

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

      3. distribute-lft-neg-in 91.4%

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

      4. cancel-sign-sub 91.4%

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

      5. +-commutative 91.4%

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

      6. metadata-eval 91.4%

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

      7. distribute-lft-in 91.4%

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

      8. metadata-eval 91.4%

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

      9. sub-neg 91.4%

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

      10. mul-1-neg 91.4%

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

      11. remove-double-neg 91.4%

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

      12. sub-neg 91.4%

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

      13. metadata-eval 91.4%

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

      14. +-commutative 91.4%

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

      15. distribute-neg-in 91.4%

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

      16. metadata-eval 91.4%

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

      17. mul-1-neg 91.4%

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

      18. *-commutative 91.4%

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

      19. mul-1-neg 91.4%

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

      20. unsub-neg 91.4%

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

   4. Simplified 91.4%

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

   5. Taylor expanded in x around 0 68.9%

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

      1. neg-mul-1 68.9%

         \[\leadsto \color{blue}{-y} \]

   7. Simplified 68.9%

      \[\leadsto \color{blue}{-y} \]

   if -2.25e-41 < y < 1.48e-56

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]

   2. Taylor expanded in y around 0 77.3%

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

4. Final simplification 74.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -5.8 \cdot 10^{-12}:\\ \;\;\;\;1\\ \mathbf{elif}\;y \leq -2.25 \cdot 10^{-41}:\\ \;\;\;\;-y\\ \mathbf{elif}\;y \leq 1.48 \cdot 10^{-56}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 11.5:\\ \;\;\;\;-y\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]

Alternative 6: 86.1% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -3 \cdot 10^{-11} \lor \neg \left(y \leq 1.3 \cdot 10^{-24}\right):\\ \;\;\;\;\frac{y}{y + -1}\\ \mathbf{else}:\\ \;\;\;\;x - y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -3e-11) (not (<= y 1.3e-24))) (/ y (+ y -1.0)) (- x y)))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -3e-11) || !(y <= 1.3e-24)) {
		tmp = y / (y + -1.0);
	} else {
		tmp = x - y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y <= (-3d-11)) .or. (.not. (y <= 1.3d-24))) then
        tmp = y / (y + (-1.0d0))
    else
        tmp = x - y
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y <= -3e-11) || !(y <= 1.3e-24)) {
		tmp = y / (y + -1.0);
	} else {
		tmp = x - y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -3e-11) or not (y <= 1.3e-24):
		tmp = y / (y + -1.0)
	else:
		tmp = x - y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -3e-11) || !(y <= 1.3e-24))
		tmp = Float64(y / Float64(y + -1.0));
	else
		tmp = Float64(x - y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -3e-11) || ~((y <= 1.3e-24)))
		tmp = y / (y + -1.0);
	else
		tmp = x - y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -3e-11], N[Not[LessEqual[y, 1.3e-24]], $MachinePrecision]], N[(y / N[(y + -1.0), $MachinePrecision]), $MachinePrecision], N[(x - y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -3e-11 or 1.3e-24 < y

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]

   2. Taylor expanded in x around 0 74.9%

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

      1. metadata-eval 74.9%

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

      2. times-frac 74.9%

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

      3. *-lft-identity 74.9%

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

      4. neg-mul-1 74.9%

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

      5. neg-sub0 74.9%

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

      6. associate--r- 74.9%

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

      7. metadata-eval 74.9%

         \[\leadsto \frac{y}{\color{blue}{-1} + y} \]

   4. Simplified 74.9%

      \[\leadsto \color{blue}{\frac{y}{-1 + y}} \]

   if -3e-11 < y < 1.3e-24

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]

   2. Taylor expanded in y around 0 99.9%

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

      1. mul-1-neg 99.9%

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

      2. *-commutative 99.9%

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

      3. distribute-lft-neg-in 99.9%

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

      4. cancel-sign-sub 99.9%

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

      5. +-commutative 99.9%

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

      6. metadata-eval 99.9%

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

      7. distribute-lft-in 99.9%

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

      8. metadata-eval 99.9%

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

      9. sub-neg 99.9%

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

      10. mul-1-neg 99.9%

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

      11. remove-double-neg 99.9%

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

      12. sub-neg 99.9%

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

      13. metadata-eval 99.9%

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

      14. +-commutative 99.9%

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

      15. distribute-neg-in 99.9%

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

      16. metadata-eval 99.9%

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

      17. mul-1-neg 99.9%

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

      18. *-commutative 99.9%

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

      19. mul-1-neg 99.9%

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

      20. unsub-neg 99.9%

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

   4. Simplified 99.9%

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

   5. Taylor expanded in x around 0 99.7%

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

4. Final simplification 88.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -3 \cdot 10^{-11} \lor \neg \left(y \leq 1.3 \cdot 10^{-24}\right):\\ \;\;\;\;\frac{y}{y + -1}\\ \mathbf{else}:\\ \;\;\;\;x - y\\ \end{array} \]

Alternative 7: 86.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -38000000000:\\ \;\;\;\;1\\ \mathbf{elif}\;y \leq 1:\\ \;\;\;\;x - y\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -38000000000.0) 1.0 (if (<= y 1.0) (- x y) 1.0)))

C

double code(double x, double y) {
	double tmp;
	if (y <= -38000000000.0) {
		tmp = 1.0;
	} else if (y <= 1.0) {
		tmp = x - y;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= (-38000000000.0d0)) then
        tmp = 1.0d0
    else if (y <= 1.0d0) then
        tmp = x - y
    else
        tmp = 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= -38000000000.0) {
		tmp = 1.0;
	} else if (y <= 1.0) {
		tmp = x - y;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -38000000000.0:
		tmp = 1.0
	elif y <= 1.0:
		tmp = x - y
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -38000000000.0)
		tmp = 1.0;
	elseif (y <= 1.0)
		tmp = Float64(x - y);
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -38000000000.0)
		tmp = 1.0;
	elseif (y <= 1.0)
		tmp = x - y;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -38000000000.0], 1.0, If[LessEqual[y, 1.0], N[(x - y), $MachinePrecision], 1.0]]

Derivation

1. Split input into 2 regimes

2. if y < -3.8e10 or 1 < y

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]

   2. Taylor expanded in y around inf 74.9%

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

   if -3.8e10 < y < 1

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]

   2. Taylor expanded in y around 0 97.5%

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

      1. mul-1-neg 97.5%

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

      2. *-commutative 97.5%

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

      3. distribute-lft-neg-in 97.5%

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

      4. cancel-sign-sub 97.5%

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

      5. +-commutative 97.5%

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

      6. metadata-eval 97.5%

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

      7. distribute-lft-in 97.5%

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

      8. metadata-eval 97.5%

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

      9. sub-neg 97.5%

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

      10. mul-1-neg 97.5%

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

      11. remove-double-neg 97.5%

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

      12. sub-neg 97.5%

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

      13. metadata-eval 97.5%

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

      14. +-commutative 97.5%

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

      15. distribute-neg-in 97.5%

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

      16. metadata-eval 97.5%

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

      17. mul-1-neg 97.5%

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

      18. *-commutative 97.5%

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

      19. mul-1-neg 97.5%

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

      20. unsub-neg 97.5%

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

   4. Simplified 97.5%

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

   5. Taylor expanded in x around 0 97.5%

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

4. Final simplification 87.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -38000000000:\\ \;\;\;\;1\\ \mathbf{elif}\;y \leq 1:\\ \;\;\;\;x - y\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]

Alternative 8: 74.4% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -38000000000:\\ \;\;\;\;1\\ \mathbf{elif}\;y \leq 1:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -38000000000.0) 1.0 (if (<= y 1.0) x 1.0)))

C

double code(double x, double y) {
	double tmp;
	if (y <= -38000000000.0) {
		tmp = 1.0;
	} else if (y <= 1.0) {
		tmp = x;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= (-38000000000.0d0)) then
        tmp = 1.0d0
    else if (y <= 1.0d0) then
        tmp = x
    else
        tmp = 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= -38000000000.0) {
		tmp = 1.0;
	} else if (y <= 1.0) {
		tmp = x;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -38000000000.0:
		tmp = 1.0
	elif y <= 1.0:
		tmp = x
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -38000000000.0)
		tmp = 1.0;
	elseif (y <= 1.0)
		tmp = x;
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -38000000000.0)
		tmp = 1.0;
	elseif (y <= 1.0)
		tmp = x;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -38000000000.0], 1.0, If[LessEqual[y, 1.0], x, 1.0]]

Derivation

1. Split input into 2 regimes

2. if y < -3.8e10 or 1 < y

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]

   2. Taylor expanded in y around inf 74.9%

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

   if -3.8e10 < y < 1

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]

   2. Taylor expanded in y around 0 68.8%

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

4. Final simplification 71.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -38000000000:\\ \;\;\;\;1\\ \mathbf{elif}\;y \leq 1:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]

Alternative 9: 39.5% accurate, 7.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%

   \[\frac{x - y}{1 - y} \]

2. Taylor expanded in y around inf 35.1%

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

3. Final simplification 35.1%

   \[\leadsto 1 \]

Reproduce

herbie shell --seed 2023287 
(FPCore (x y)
  :name "Diagrams.Trail:splitAtParam  from diagrams-lib-1.3.0.3, C"
  :precision binary64
  (/ (- x y) (- 1.0 y)))