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

Percentage Accurate: 100.0% → 100.0%

Time: 4.5s

Alternatives: 8

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: 98.2% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.26 \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.26) (not (<= y 1.0))) (+ 1.0 (/ (- 1.0 x) y)) (- x y)))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -1.26) || !(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.26d0)) .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.26) || !(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.26) 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.26) || !(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.26) || ~((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.26], 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.26000000000000001 or 1 < y

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]
   2. Step-by-step derivation

      1. sub-neg 100.0%

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

      2. +-commutative 100.0%

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

      3. neg-sub0 100.0%

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

      4. associate-+l- 100.0%

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

      5. sub0-neg 100.0%

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

      6. neg-mul-1 100.0%

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

      7. sub-neg 100.0%

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

      8. +-commutative 100.0%

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

      9. neg-sub0 100.0%

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

      10. associate-+l- 100.0%

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

      11. sub0-neg 100.0%

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

      12. neg-mul-1 100.0%

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

      13. times-frac 100.0%

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

      14. metadata-eval 100.0%

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

      15. *-lft-identity 100.0%

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

      16. sub-neg 100.0%

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

      17. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in y around inf 98.9%

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

      1. +-commutative 98.9%

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

      2. associate-+r+ 98.9%

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

      3. mul-1-neg 98.9%

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

      4. unsub-neg 98.9%

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

      5. div-sub 98.9%

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

      6. unsub-neg 98.9%

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

      7. mul-1-neg 98.9%

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

      8. +-commutative 98.9%

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

      9. metadata-eval 98.9%

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

      10. distribute-lft-in 98.9%

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

      11. metadata-eval 98.9%

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

      12. sub-neg 98.9%

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

      13. associate-*r/ 98.9%

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

      14. +-commutative 98.9%

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

      15. associate-*r/ 98.9%

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

      16. sub-neg 98.9%

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

      17. metadata-eval 98.9%

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

      18. distribute-lft-in 98.9%

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

      19. metadata-eval 98.9%

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

      20. +-commutative 98.9%

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

      21. mul-1-neg 98.9%

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

      22. unsub-neg 98.9%

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

   6. Simplified 98.9%

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

   if -1.26000000000000001 < y < 1

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]
   2. Step-by-step derivation

      1. sub-neg 100.0%

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

      2. +-commutative 100.0%

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

      3. neg-sub0 100.0%

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

      4. associate-+l- 100.0%

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

      5. sub0-neg 100.0%

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

      6. neg-mul-1 100.0%

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

      7. sub-neg 100.0%

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

      8. +-commutative 100.0%

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

      9. neg-sub0 100.0%

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

      10. associate-+l- 100.0%

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

      11. sub0-neg 100.0%

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

      12. neg-mul-1 100.0%

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

      13. times-frac 100.0%

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

      14. metadata-eval 100.0%

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

      15. *-lft-identity 100.0%

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

      16. sub-neg 100.0%

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

      17. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in y around 0 97.9%

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

      1. +-commutative 97.9%

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

      2. mul-1-neg 97.9%

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

      3. unsub-neg 97.9%

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

      4. mul-1-neg 97.9%

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

      5. unsub-neg 97.9%

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

   6. Simplified 97.9%

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

   7. Taylor expanded in x around 0 97.5%

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

4. Final simplification 98.2%

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

Alternative 3: 98.5% 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. Step-by-step derivation

      1. sub-neg 100.0%

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

      2. +-commutative 100.0%

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

      3. neg-sub0 100.0%

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

      4. associate-+l- 100.0%

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

      5. sub0-neg 100.0%

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

      6. neg-mul-1 100.0%

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

      7. sub-neg 100.0%

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

      8. +-commutative 100.0%

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

      9. neg-sub0 100.0%

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

      10. associate-+l- 100.0%

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

      11. sub0-neg 100.0%

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

      12. neg-mul-1 100.0%

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

      13. times-frac 100.0%

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

      14. metadata-eval 100.0%

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

      15. *-lft-identity 100.0%

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

      16. sub-neg 100.0%

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

      17. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in y around inf 98.9%

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

      1. +-commutative 98.9%

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

      2. associate-+r+ 98.9%

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

      3. mul-1-neg 98.9%

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

      4. unsub-neg 98.9%

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

      5. div-sub 98.9%

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

      6. unsub-neg 98.9%

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

      7. mul-1-neg 98.9%

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

      8. +-commutative 98.9%

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

      9. metadata-eval 98.9%

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

      10. distribute-lft-in 98.9%

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

      11. metadata-eval 98.9%

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

      12. sub-neg 98.9%

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

      13. associate-*r/ 98.9%

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

      14. +-commutative 98.9%

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

      15. associate-*r/ 98.9%

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

      16. sub-neg 98.9%

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

      17. metadata-eval 98.9%

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

      18. distribute-lft-in 98.9%

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

      19. metadata-eval 98.9%

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

      20. +-commutative 98.9%

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

      21. mul-1-neg 98.9%

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

      22. unsub-neg 98.9%

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

   6. Simplified 98.9%

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

   if -1 < y < 1

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]
   2. Step-by-step derivation

      1. sub-neg 100.0%

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

      2. +-commutative 100.0%

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

      3. neg-sub0 100.0%

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

      4. associate-+l- 100.0%

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

      5. sub0-neg 100.0%

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

      6. neg-mul-1 100.0%

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

      7. sub-neg 100.0%

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

      8. +-commutative 100.0%

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

      9. neg-sub0 100.0%

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

      10. associate-+l- 100.0%

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

      11. sub0-neg 100.0%

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

      12. neg-mul-1 100.0%

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

      13. times-frac 100.0%

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

      14. metadata-eval 100.0%

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

      15. *-lft-identity 100.0%

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

      16. sub-neg 100.0%

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

      17. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in y around 0 97.9%

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

      1. +-commutative 97.9%

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

      2. mul-1-neg 97.9%

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

      3. unsub-neg 97.9%

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

      4. mul-1-neg 97.9%

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

      5. unsub-neg 97.9%

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

   6. Simplified 97.9%

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

4. Final simplification 98.4%

   \[\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 4: 86.9% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -3.6e-14) (not (<= y 0.0106))) (/ y (+ y -1.0)) (- x y)))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -3.6e-14) || !(y <= 0.0106)) {
		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 <= (-3.6d-14)) .or. (.not. (y <= 0.0106d0))) 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 <= -3.6e-14) || !(y <= 0.0106)) {
		tmp = y / (y + -1.0);
	} else {
		tmp = x - y;
	}
	return tmp;
}

Python

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

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -3.6e-14) || !(y <= 0.0106))
		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 <= -3.6e-14) || ~((y <= 0.0106)))
		tmp = y / (y + -1.0);
	else
		tmp = x - y;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -3.5999999999999998e-14 or 0.0106 < y

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]
   2. Step-by-step derivation

      1. sub-neg 100.0%

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

      2. +-commutative 100.0%

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

      3. neg-sub0 100.0%

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

      4. associate-+l- 100.0%

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

      5. sub0-neg 100.0%

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

      6. neg-mul-1 100.0%

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

      7. sub-neg 100.0%

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

      8. +-commutative 100.0%

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

      9. neg-sub0 100.0%

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

      10. associate-+l- 100.0%

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

      11. sub0-neg 100.0%

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

      12. neg-mul-1 100.0%

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

      13. times-frac 100.0%

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

      14. metadata-eval 100.0%

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

      15. *-lft-identity 100.0%

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

      16. sub-neg 100.0%

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

      17. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in x around 0 80.7%

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

   if -3.5999999999999998e-14 < y < 0.0106

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]
   2. Step-by-step derivation

      1. sub-neg 100.0%

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

      2. +-commutative 100.0%

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

      3. neg-sub0 100.0%

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

      4. associate-+l- 100.0%

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

      5. sub0-neg 100.0%

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

      6. neg-mul-1 100.0%

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

      7. sub-neg 100.0%

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

      8. +-commutative 100.0%

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

      9. neg-sub0 100.0%

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

      10. associate-+l- 100.0%

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

      11. sub0-neg 100.0%

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

      12. neg-mul-1 100.0%

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

      13. times-frac 100.0%

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

      14. metadata-eval 100.0%

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

      15. *-lft-identity 100.0%

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

      16. sub-neg 100.0%

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

      17. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in y around 0 99.2%

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

      1. +-commutative 99.2%

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

      2. mul-1-neg 99.2%

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

      3. unsub-neg 99.2%

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

      4. mul-1-neg 99.2%

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

      5. unsub-neg 99.2%

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

   6. Simplified 99.2%

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

   7. Taylor expanded in x around 0 98.7%

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

4. Final simplification 89.5%

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

Alternative 5: 73.2% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -4.4 \cdot 10^{-18}:\\ \;\;\;\;1\\ \mathbf{elif}\;y \leq 2.6 \cdot 10^{-91}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 1:\\ \;\;\;\;-y\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -4.4e-18) 1.0 (if (<= y 2.6e-91) x (if (<= y 1.0) (- y) 1.0))))

C

double code(double x, double y) {
	double tmp;
	if (y <= -4.4e-18) {
		tmp = 1.0;
	} else if (y <= 2.6e-91) {
		tmp = x;
	} else if (y <= 1.0) {
		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 <= (-4.4d-18)) then
        tmp = 1.0d0
    else if (y <= 2.6d-91) then
        tmp = x
    else if (y <= 1.0d0) 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 <= -4.4e-18) {
		tmp = 1.0;
	} else if (y <= 2.6e-91) {
		tmp = x;
	} else if (y <= 1.0) {
		tmp = -y;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -4.4e-18:
		tmp = 1.0
	elif y <= 2.6e-91:
		tmp = x
	elif y <= 1.0:
		tmp = -y
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -4.4e-18)
		tmp = 1.0;
	elseif (y <= 2.6e-91)
		tmp = x;
	elseif (y <= 1.0)
		tmp = Float64(-y);
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -4.4e-18)
		tmp = 1.0;
	elseif (y <= 2.6e-91)
		tmp = x;
	elseif (y <= 1.0)
		tmp = -y;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -4.4e-18], 1.0, If[LessEqual[y, 2.6e-91], x, If[LessEqual[y, 1.0], (-y), 1.0]]]

Derivation

1. Split input into 3 regimes

2. if y < -4.3999999999999997e-18 or 1 < y

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]
   2. Step-by-step derivation

      1. sub-neg 100.0%

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

      2. +-commutative 100.0%

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

      3. neg-sub0 100.0%

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

      4. associate-+l- 100.0%

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

      5. sub0-neg 100.0%

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

      6. neg-mul-1 100.0%

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

      7. sub-neg 100.0%

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

      8. +-commutative 100.0%

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

      9. neg-sub0 100.0%

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

      10. associate-+l- 100.0%

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

      11. sub0-neg 100.0%

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

      12. neg-mul-1 100.0%

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

      13. times-frac 100.0%

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

      14. metadata-eval 100.0%

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

      15. *-lft-identity 100.0%

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

      16. sub-neg 100.0%

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

      17. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in y around inf 77.6%

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

   if -4.3999999999999997e-18 < y < 2.60000000000000014e-91

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]
   2. Step-by-step derivation

      1. sub-neg 100.0%

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

      2. +-commutative 100.0%

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

      3. neg-sub0 100.0%

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

      4. associate-+l- 100.0%

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

      5. sub0-neg 100.0%

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

      6. neg-mul-1 100.0%

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

      7. sub-neg 100.0%

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

      8. +-commutative 100.0%

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

      9. neg-sub0 100.0%

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

      10. associate-+l- 100.0%

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

      11. sub0-neg 100.0%

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

      12. neg-mul-1 100.0%

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

      13. times-frac 100.0%

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

      14. metadata-eval 100.0%

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

      15. *-lft-identity 100.0%

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

      16. sub-neg 100.0%

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

      17. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in y around 0 80.4%

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

   if 2.60000000000000014e-91 < y < 1

   1. Initial program 99.8%

      \[\frac{x - y}{1 - y} \]
   2. Step-by-step derivation

      1. sub-neg 99.8%

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

      2. +-commutative 99.8%

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

      3. neg-sub0 99.8%

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

      4. associate-+l- 99.8%

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

      5. sub0-neg 99.8%

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

      6. neg-mul-1 99.8%

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

      7. sub-neg 99.8%

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

      8. +-commutative 99.8%

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

      9. neg-sub0 99.8%

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

      10. associate-+l- 99.8%

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

      11. sub0-neg 99.8%

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

      12. neg-mul-1 99.8%

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

      13. times-frac 99.8%

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

      14. metadata-eval 99.8%

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

      15. *-lft-identity 99.8%

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

      16. sub-neg 99.8%

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

      17. metadata-eval 99.8%

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

   3. Simplified 99.8%

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

   4. Taylor expanded in x around 0 74.0%

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

   5. Taylor expanded in y around 0 70.4%

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

      1. neg-mul-1 70.4%

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

   7. Simplified 70.4%

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

4. Final simplification 78.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -4.4 \cdot 10^{-18}:\\ \;\;\;\;1\\ \mathbf{elif}\;y \leq 2.6 \cdot 10^{-91}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 1:\\ \;\;\;\;-y\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]

Alternative 6: 86.4% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	double tmp;
	if (y <= -100.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 <= (-100.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 <= -100.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 <= -100.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 <= -100.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 <= -100.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, -100.0], 1.0, If[LessEqual[y, 1.0], N[(x - y), $MachinePrecision], 1.0]]

Derivation

1. Split input into 2 regimes

2. if y < -100 or 1 < y

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]
   2. Step-by-step derivation

      1. sub-neg 100.0%

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

      2. +-commutative 100.0%

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

      3. neg-sub0 100.0%

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

      4. associate-+l- 100.0%

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

      5. sub0-neg 100.0%

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

      6. neg-mul-1 100.0%

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

      7. sub-neg 100.0%

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

      8. +-commutative 100.0%

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

      9. neg-sub0 100.0%

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

      10. associate-+l- 100.0%

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

      11. sub0-neg 100.0%

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

      12. neg-mul-1 100.0%

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

      13. times-frac 100.0%

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

      14. metadata-eval 100.0%

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

      15. *-lft-identity 100.0%

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

      16. sub-neg 100.0%

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

      17. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in y around inf 79.1%

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

   if -100 < y < 1

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]
   2. Step-by-step derivation

      1. sub-neg 100.0%

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

      2. +-commutative 100.0%

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

      3. neg-sub0 100.0%

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

      4. associate-+l- 100.0%

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

      5. sub0-neg 100.0%

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

      6. neg-mul-1 100.0%

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

      7. sub-neg 100.0%

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

      8. +-commutative 100.0%

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

      9. neg-sub0 100.0%

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

      10. associate-+l- 100.0%

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

      11. sub0-neg 100.0%

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

      12. neg-mul-1 100.0%

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

      13. times-frac 100.0%

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

      14. metadata-eval 100.0%

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

      15. *-lft-identity 100.0%

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

      16. sub-neg 100.0%

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

      17. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in y around 0 97.9%

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

      1. +-commutative 97.9%

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

      2. mul-1-neg 97.9%

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

      3. unsub-neg 97.9%

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

      4. mul-1-neg 97.9%

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

      5. unsub-neg 97.9%

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

   6. Simplified 97.9%

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

   7. Taylor expanded in x around 0 97.5%

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

4. Final simplification 88.3%

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

Alternative 7: 73.5% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -4.4 \cdot 10^{-18}:\\ \;\;\;\;1\\ \mathbf{elif}\;y \leq 1:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -4.4e-18) 1.0 (if (<= y 1.0) x 1.0)))

C

double code(double x, double y) {
	double tmp;
	if (y <= -4.4e-18) {
		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 <= (-4.4d-18)) 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 <= -4.4e-18) {
		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 <= -4.4e-18:
		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 <= -4.4e-18)
		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 <= -4.4e-18)
		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, -4.4e-18], 1.0, If[LessEqual[y, 1.0], x, 1.0]]

Derivation

1. Split input into 2 regimes

2. if y < -4.3999999999999997e-18 or 1 < y

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]
   2. Step-by-step derivation

      1. sub-neg 100.0%

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

      2. +-commutative 100.0%

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

      3. neg-sub0 100.0%

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

      4. associate-+l- 100.0%

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

      5. sub0-neg 100.0%

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

      6. neg-mul-1 100.0%

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

      7. sub-neg 100.0%

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

      8. +-commutative 100.0%

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

      9. neg-sub0 100.0%

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

      10. associate-+l- 100.0%

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

      11. sub0-neg 100.0%

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

      12. neg-mul-1 100.0%

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

      13. times-frac 100.0%

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

      14. metadata-eval 100.0%

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

      15. *-lft-identity 100.0%

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

      16. sub-neg 100.0%

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

      17. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in y around inf 77.6%

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

   if -4.3999999999999997e-18 < y < 1

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]
   2. Step-by-step derivation

      1. sub-neg 100.0%

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

      2. +-commutative 100.0%

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

      3. neg-sub0 100.0%

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

      4. associate-+l- 100.0%

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

      5. sub0-neg 100.0%

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

      6. neg-mul-1 100.0%

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

      7. sub-neg 100.0%

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

      8. +-commutative 100.0%

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

      9. neg-sub0 100.0%

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

      10. associate-+l- 100.0%

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

      11. sub0-neg 100.0%

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

      12. neg-mul-1 100.0%

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

      13. times-frac 100.0%

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

      14. metadata-eval 100.0%

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

      15. *-lft-identity 100.0%

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

      16. sub-neg 100.0%

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

      17. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in y around 0 70.7%

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

4. Final simplification 74.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -4.4 \cdot 10^{-18}:\\ \;\;\;\;1\\ \mathbf{elif}\;y \leq 1:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]

Alternative 8: 38.7% 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. Step-by-step derivation

   1. sub-neg 100.0%

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

   2. +-commutative 100.0%

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

   3. neg-sub0 100.0%

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

   4. associate-+l- 100.0%

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

   5. sub0-neg 100.0%

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

   6. neg-mul-1 100.0%

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

   7. sub-neg 100.0%

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

   8. +-commutative 100.0%

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

   9. neg-sub0 100.0%

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

   10. associate-+l- 100.0%

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

   11. sub0-neg 100.0%

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

   12. neg-mul-1 100.0%

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

   13. times-frac 100.0%

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

   14. metadata-eval 100.0%

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

   15. *-lft-identity 100.0%

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

   16. sub-neg 100.0%

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

   17. metadata-eval 100.0%

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

3. Simplified 100.0%

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

4. Taylor expanded in y around inf 41.5%

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

5. Final simplification 41.5%

   \[\leadsto 1 \]

Reproduce

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