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

Percentage Accurate: 100.0% → 100.0%

Time: 5.1s

Alternatives: 7

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. Add Preprocessing

3. Final simplification 100.0%

   \[\leadsto \frac{x - y}{1 - y} \]
4. Add Preprocessing

Alternative 2: 98.2% accurate, 0.4× speedup

Math

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

C

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

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 97.8%

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

      1. +-commutative 97.8%

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

      2. mul-1-neg 97.8%

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

      3. unsub-neg 97.8%

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

      4. div-sub 97.8%

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

   5. Simplified 97.8%

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

   if -1.25 < y < 1

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 99.0%

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

      1. mul-1-neg 99.0%

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

      2. *-commutative 99.0%

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

      3. distribute-lft-neg-in 99.0%

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

      4. cancel-sign-sub 99.0%

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

      5. +-commutative 99.0%

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

      6. metadata-eval 99.0%

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

      7. distribute-lft-in 99.0%

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

      8. metadata-eval 99.0%

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

      9. sub-neg 99.0%

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

      10. mul-1-neg 99.0%

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

      11. remove-double-neg 99.0%

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

      12. sub-neg 99.0%

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

      13. metadata-eval 99.0%

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

      14. +-commutative 99.0%

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

      15. distribute-neg-in 99.0%

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

      16. metadata-eval 99.0%

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

      17. mul-1-neg 99.0%

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

      18. *-commutative 99.0%

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

      19. mul-1-neg 99.0%

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

      20. unsub-neg 99.0%

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

   5. Simplified 99.0%

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

   6. Taylor expanded in x around 0 97.9%

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

4. Final simplification 97.8%

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

Alternative 3: 98.5% accurate, 0.4× 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. Add Preprocessing

   3. Taylor expanded in y around inf 97.8%

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

      1. +-commutative 97.8%

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

      2. mul-1-neg 97.8%

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

      3. unsub-neg 97.8%

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

      4. div-sub 97.8%

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

   5. Simplified 97.8%

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

   if -1 < y < 1

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 99.0%

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

      1. mul-1-neg 99.0%

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

      2. *-commutative 99.0%

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

      3. distribute-lft-neg-in 99.0%

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

      4. cancel-sign-sub 99.0%

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

      5. +-commutative 99.0%

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

      6. metadata-eval 99.0%

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

      7. distribute-lft-in 99.0%

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

      8. metadata-eval 99.0%

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

      9. sub-neg 99.0%

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

      10. mul-1-neg 99.0%

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

      11. remove-double-neg 99.0%

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

      12. sub-neg 99.0%

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

      13. metadata-eval 99.0%

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

      14. +-commutative 99.0%

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

      15. distribute-neg-in 99.0%

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

      16. metadata-eval 99.0%

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

      17. mul-1-neg 99.0%

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

      18. *-commutative 99.0%

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

      19. mul-1-neg 99.0%

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

      20. unsub-neg 99.0%

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

   5. Simplified 99.0%

      \[\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} \]
5. Add Preprocessing

Alternative 4: 86.7% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -2.3) (not (<= y 3e-6))) (/ y (+ y -1.0)) (- x y)))

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -2.2999999999999998 or 3.0000000000000001e-6 < y

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 71.9%

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

      1. metadata-eval 71.9%

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

      2. times-frac 71.9%

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

      3. *-lft-identity 71.9%

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

      4. neg-mul-1 71.9%

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

      5. neg-sub0 71.9%

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

      6. associate--r- 71.9%

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

      7. metadata-eval 71.9%

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

   5. Simplified 71.9%

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

   if -2.2999999999999998 < y < 3.0000000000000001e-6

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 98.6%

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

      1. mul-1-neg 98.6%

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

      2. *-commutative 98.6%

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

      3. distribute-lft-neg-in 98.6%

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

      4. cancel-sign-sub 98.6%

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

      5. +-commutative 98.6%

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

      6. metadata-eval 98.6%

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

      7. distribute-lft-in 98.6%

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

      8. metadata-eval 98.6%

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

      9. sub-neg 98.6%

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

      10. mul-1-neg 98.6%

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

      11. remove-double-neg 98.6%

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

      12. sub-neg 98.6%

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

      13. metadata-eval 98.6%

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

      14. +-commutative 98.6%

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

      15. distribute-neg-in 98.6%

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

      16. metadata-eval 98.6%

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

      17. mul-1-neg 98.6%

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

      18. *-commutative 98.6%

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

      19. mul-1-neg 98.6%

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

      20. unsub-neg 98.6%

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

   5. Simplified 98.6%

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

   6. Taylor expanded in x around 0 97.7%

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

4. Final simplification 84.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2.3 \lor \neg \left(y \leq 3 \cdot 10^{-6}\right):\\ \;\;\;\;\frac{y}{y + -1}\\ \mathbf{else}:\\ \;\;\;\;x - y\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 86.2% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Derivation

1. Split input into 2 regimes

2. if y < -63 or 1 < y

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 70.5%

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

   if -63 < y < 1

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 98.2%

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

      1. mul-1-neg 98.2%

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

      2. *-commutative 98.2%

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

      3. distribute-lft-neg-in 98.2%

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

      4. cancel-sign-sub 98.2%

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

      5. +-commutative 98.2%

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

      6. metadata-eval 98.2%

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

      7. distribute-lft-in 98.2%

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

      8. metadata-eval 98.2%

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

      9. sub-neg 98.2%

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

      10. mul-1-neg 98.2%

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

      11. remove-double-neg 98.2%

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

      12. sub-neg 98.2%

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

      13. metadata-eval 98.2%

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

      14. +-commutative 98.2%

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

      15. distribute-neg-in 98.2%

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

      16. metadata-eval 98.2%

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

      17. mul-1-neg 98.2%

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

      18. *-commutative 98.2%

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

      19. mul-1-neg 98.2%

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

      20. unsub-neg 98.2%

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

   5. Simplified 98.2%

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

   6. Taylor expanded in x around 0 97.3%

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

4. Final simplification 84.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -63:\\ \;\;\;\;1\\ \mathbf{elif}\;y \leq 1:\\ \;\;\;\;x - y\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 74.8% accurate, 0.6× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	double tmp;
	if (y <= -48.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 <= (-48.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 <= -48.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 <= -48.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 <= -48.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 <= -48.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, -48.0], 1.0, If[LessEqual[y, 1.0], x, 1.0]]

Derivation

1. Split input into 2 regimes

2. if y < -48 or 1 < y

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 70.5%

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

   if -48 < y < 1

   1. Initial program 100.0%

      \[\frac{x - y}{1 - y} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 76.4%

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

4. Final simplification 73.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -48:\\ \;\;\;\;1\\ \mathbf{elif}\;y \leq 1:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 39.4% 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. Add Preprocessing

3. Taylor expanded in y around inf 36.6%

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

4. Final simplification 36.6%

   \[\leadsto 1 \]
5. Add Preprocessing

Reproduce

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