Codec.Picture.Types:toneMapping from JuicyPixels-3.2.6.1

Percentage Accurate: 88.2% → 99.9%

Time: 6.7s

Alternatives: 12

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ \frac{x \cdot \left(\frac{x}{y} + 1\right)}{x + 1} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (/ (* x (+ (/ x y) 1.0)) (+ x 1.0)))

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return (x * ((x / y) + 1.0)) / (x + 1.0)

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 88.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x \cdot \left(\frac{x}{y} + 1\right)}{x + 1} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (/ (* x (+ (/ x y) 1.0)) (+ x 1.0)))

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return (x * ((x / y) + 1.0)) / (x + 1.0)

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{x \cdot \left(1 + \frac{x}{y}\right)}{x + 1}\\ \mathbf{if}\;t_0 \leq -2 \cdot 10^{+53} \lor \neg \left(t_0 \leq 5 \cdot 10^{+15}\right):\\ \;\;\;\;\frac{\frac{x}{y}}{1 + \frac{1}{x}}\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (/ (* x (+ 1.0 (/ x y))) (+ x 1.0))))
   (if (or (<= t_0 -2e+53) (not (<= t_0 5e+15)))
     (/ (/ x y) (+ 1.0 (/ 1.0 x)))
     t_0)))

C

double code(double x, double y) {
	double t_0 = (x * (1.0 + (x / y))) / (x + 1.0);
	double tmp;
	if ((t_0 <= -2e+53) || !(t_0 <= 5e+15)) {
		tmp = (x / y) / (1.0 + (1.0 / x));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

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

Java

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

Python

def code(x, y):
	t_0 = (x * (1.0 + (x / y))) / (x + 1.0)
	tmp = 0
	if (t_0 <= -2e+53) or not (t_0 <= 5e+15):
		tmp = (x / y) / (1.0 + (1.0 / x))
	else:
		tmp = t_0
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y)
	t_0 = (x * (1.0 + (x / y))) / (x + 1.0);
	tmp = 0.0;
	if ((t_0 <= -2e+53) || ~((t_0 <= 5e+15)))
		tmp = (x / y) / (1.0 + (1.0 / x));
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(x * N[(1.0 + N[(x / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$0, -2e+53], N[Not[LessEqual[t$95$0, 5e+15]], $MachinePrecision]], N[(N[(x / y), $MachinePrecision] / N[(1.0 + N[(1.0 / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$0]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 x (+.f64 (/.f64 x y) 1)) (+.f64 x 1)) < -2e53 or 5e15 < (/.f64 (*.f64 x (+.f64 (/.f64 x y) 1)) (+.f64 x 1))

   1. Initial program 70.6%

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

      1. *-commutative 70.6%

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

      2. associate-/l* 100.0%

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

      3. remove-double-neg 100.0%

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

      4. neg-mul-1 100.0%

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

      5. *-commutative 100.0%

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

      6. associate-/r* 100.0%

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

      7. +-commutative 100.0%

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

      8. remove-double-neg 100.0%

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

      9. unsub-neg 100.0%

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

      10. div-sub 100.0%

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

      11. *-inverses 100.0%

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

      12. div-sub 100.0%

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

      13. associate-/r* 100.0%

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

      14. *-commutative 100.0%

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

      15. neg-mul-1 100.0%

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

      16. remove-double-neg 100.0%

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

      17. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in y around 0 99.9%

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

      1. associate-/r* 100.0%

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

   6. Simplified 100.0%

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

   if -2e53 < (/.f64 (*.f64 x (+.f64 (/.f64 x y) 1)) (+.f64 x 1)) < 5e15

   1. Initial program 99.9%

      \[\frac{x \cdot \left(\frac{x}{y} + 1\right)}{x + 1} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.9%

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

Alternative 2: 99.8% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 89.0%

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

   1. *-commutative 89.0%

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

   2. associate-/l* 99.8%

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

   3. remove-double-neg 99.8%

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

   4. neg-mul-1 99.8%

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

   5. *-commutative 99.8%

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

   6. associate-/r* 99.8%

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

   7. +-commutative 99.8%

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

   8. remove-double-neg 99.8%

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

   9. unsub-neg 99.8%

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

   10. div-sub 99.8%

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

   11. *-inverses 99.8%

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

   12. div-sub 99.8%

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

   13. associate-/r* 99.8%

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

   14. *-commutative 99.8%

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

   15. neg-mul-1 99.8%

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

   16. remove-double-neg 99.8%

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

   17. metadata-eval 99.8%

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

3. Simplified 99.8%

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

4. Taylor expanded in y around 0 99.8%

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

   1. +-commutative 99.8%

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

   2. distribute-lft-in 99.8%

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

   3. *-rgt-identity 99.8%

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

   4. associate-*r/ 99.8%

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

   5. *-rgt-identity 99.8%

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

6. Simplified 99.8%

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

7. Final simplification 99.8%

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

Alternative 3: 73.1% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{x}{x + 1}\\ \mathbf{if}\;x \leq -2 \cdot 10^{+20}:\\ \;\;\;\;\frac{x}{y}\\ \mathbf{elif}\;x \leq 3.1 \cdot 10^{-79}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;x \leq 2.3 \cdot 10^{-6}:\\ \;\;\;\;x \cdot \frac{x}{y}\\ \mathbf{elif}\;x \leq 5.5 \cdot 10^{+101}:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (/ x (+ x 1.0))))
   (if (<= x -2e+20)
     (/ x y)
     (if (<= x 3.1e-79)
       t_0
       (if (<= x 2.3e-6) (* x (/ x y)) (if (<= x 5.5e+101) t_0 (/ x y)))))))

C

double code(double x, double y) {
	double t_0 = x / (x + 1.0);
	double tmp;
	if (x <= -2e+20) {
		tmp = x / y;
	} else if (x <= 3.1e-79) {
		tmp = t_0;
	} else if (x <= 2.3e-6) {
		tmp = x * (x / y);
	} else if (x <= 5.5e+101) {
		tmp = t_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) :: t_0
    real(8) :: tmp
    t_0 = x / (x + 1.0d0)
    if (x <= (-2d+20)) then
        tmp = x / y
    else if (x <= 3.1d-79) then
        tmp = t_0
    else if (x <= 2.3d-6) then
        tmp = x * (x / y)
    else if (x <= 5.5d+101) then
        tmp = t_0
    else
        tmp = x / y
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = x / (x + 1.0);
	double tmp;
	if (x <= -2e+20) {
		tmp = x / y;
	} else if (x <= 3.1e-79) {
		tmp = t_0;
	} else if (x <= 2.3e-6) {
		tmp = x * (x / y);
	} else if (x <= 5.5e+101) {
		tmp = t_0;
	} else {
		tmp = x / y;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = x / (x + 1.0)
	tmp = 0
	if x <= -2e+20:
		tmp = x / y
	elif x <= 3.1e-79:
		tmp = t_0
	elif x <= 2.3e-6:
		tmp = x * (x / y)
	elif x <= 5.5e+101:
		tmp = t_0
	else:
		tmp = x / y
	return tmp

Julia

function code(x, y)
	t_0 = Float64(x / Float64(x + 1.0))
	tmp = 0.0
	if (x <= -2e+20)
		tmp = Float64(x / y);
	elseif (x <= 3.1e-79)
		tmp = t_0;
	elseif (x <= 2.3e-6)
		tmp = Float64(x * Float64(x / y));
	elseif (x <= 5.5e+101)
		tmp = t_0;
	else
		tmp = Float64(x / y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = x / (x + 1.0);
	tmp = 0.0;
	if (x <= -2e+20)
		tmp = x / y;
	elseif (x <= 3.1e-79)
		tmp = t_0;
	elseif (x <= 2.3e-6)
		tmp = x * (x / y);
	elseif (x <= 5.5e+101)
		tmp = t_0;
	else
		tmp = x / y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(x / N[(x + 1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -2e+20], N[(x / y), $MachinePrecision], If[LessEqual[x, 3.1e-79], t$95$0, If[LessEqual[x, 2.3e-6], N[(x * N[(x / y), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 5.5e+101], t$95$0, N[(x / y), $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

2. if x < -2e20 or 5.50000000000000018e101 < x

   1. Initial program 72.4%

      \[\frac{x \cdot \left(\frac{x}{y} + 1\right)}{x + 1} \]

   2. Taylor expanded in x around inf 82.7%

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

   if -2e20 < x < 3.0999999999999999e-79 or 2.3e-6 < x < 5.50000000000000018e101

   1. Initial program 99.3%

      \[\frac{x \cdot \left(\frac{x}{y} + 1\right)}{x + 1} \]

   2. Taylor expanded in y around inf 78.3%

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

      1. +-commutative 78.3%

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

   4. Simplified 78.3%

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

   if 3.0999999999999999e-79 < x < 2.3e-6

   1. Initial program 99.9%

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

      1. *-commutative 99.9%

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

      2. associate-/l* 99.9%

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

      3. remove-double-neg 99.9%

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

      4. neg-mul-1 99.9%

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

      5. *-commutative 99.9%

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

      6. associate-/r* 99.9%

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

      7. +-commutative 99.9%

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

      8. remove-double-neg 99.9%

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

      9. unsub-neg 99.9%

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

      10. div-sub 99.9%

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

      11. *-inverses 99.9%

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

      12. div-sub 99.9%

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

      13. associate-/r* 99.9%

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

      14. *-commutative 99.9%

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

      15. neg-mul-1 99.9%

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

      16. remove-double-neg 99.9%

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

      17. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in y around 0 64.9%

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

      1. distribute-lft-in 64.8%

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

      2. *-rgt-identity 64.8%

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

      3. associate-*r/ 64.8%

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

      4. *-rgt-identity 64.8%

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

   6. Simplified 64.8%

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

   7. Taylor expanded in x around 0 60.7%

      \[\leadsto \frac{x}{\color{blue}{\frac{y}{x}}} \]
   8. Step-by-step derivation

      1. associate-/r/ 60.8%

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

   9. Applied egg-rr 60.8%

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

4. Final simplification 78.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2 \cdot 10^{+20}:\\ \;\;\;\;\frac{x}{y}\\ \mathbf{elif}\;x \leq 3.1 \cdot 10^{-79}:\\ \;\;\;\;\frac{x}{x + 1}\\ \mathbf{elif}\;x \leq 2.3 \cdot 10^{-6}:\\ \;\;\;\;x \cdot \frac{x}{y}\\ \mathbf{elif}\;x \leq 5.5 \cdot 10^{+101}:\\ \;\;\;\;\frac{x}{x + 1}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y}\\ \end{array} \]

Alternative 4: 98.6% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -7.8e10 or 1.4e8 < x

   1. Initial program 77.6%

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

      1. *-commutative 77.6%

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

      2. associate-/l* 100.0%

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

      3. remove-double-neg 100.0%

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

      4. neg-mul-1 100.0%

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

      5. *-commutative 100.0%

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

      6. associate-/r* 100.0%

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

      7. +-commutative 100.0%

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

      8. remove-double-neg 100.0%

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

      9. unsub-neg 100.0%

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

      10. div-sub 100.0%

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

      11. *-inverses 100.0%

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

      12. div-sub 100.0%

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

      13. associate-/r* 100.0%

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

      14. *-commutative 100.0%

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

      15. neg-mul-1 100.0%

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

      16. remove-double-neg 100.0%

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

      17. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in x around inf 99.3%

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

   if -7.8e10 < x < 1.4e8

   1. Initial program 99.3%

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

      1. *-commutative 99.3%

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

      2. associate-/l* 99.7%

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

      3. remove-double-neg 99.7%

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

      4. neg-mul-1 99.7%

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

      5. *-commutative 99.7%

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

      6. associate-/r* 99.7%

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

      7. +-commutative 99.7%

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

      8. remove-double-neg 99.7%

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

      9. unsub-neg 99.7%

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

      10. div-sub 99.7%

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

      11. *-inverses 99.7%

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

      12. div-sub 99.7%

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

      13. associate-/r* 99.7%

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

      14. *-commutative 99.7%

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

      15. neg-mul-1 99.7%

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

      16. remove-double-neg 99.7%

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

      17. metadata-eval 99.7%

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

   3. Simplified 99.7%

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

   4. Taylor expanded in y around 0 99.7%

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

      1. +-commutative 99.7%

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

      2. distribute-lft-in 99.6%

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

      3. *-rgt-identity 99.6%

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

      4. associate-*r/ 99.7%

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

      5. *-rgt-identity 99.7%

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

   6. Simplified 99.7%

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

   7. Taylor expanded in x around 0 98.9%

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

4. Final simplification 99.1%

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

Alternative 5: 72.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1:\\ \;\;\;\;\frac{x}{y}\\ \mathbf{elif}\;x \leq 3.1 \cdot 10^{-79}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 2900000:\\ \;\;\;\;x \cdot \frac{x}{y}\\ \mathbf{elif}\;x \leq 4.2 \cdot 10^{+101}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -1.0)
   (/ x y)
   (if (<= x 3.1e-79)
     x
     (if (<= x 2900000.0) (* x (/ x y)) (if (<= x 4.2e+101) 1.0 (/ x y))))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -1.0) {
		tmp = x / y;
	} else if (x <= 3.1e-79) {
		tmp = x;
	} else if (x <= 2900000.0) {
		tmp = x * (x / y);
	} else if (x <= 4.2e+101) {
		tmp = 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 (x <= (-1.0d0)) then
        tmp = x / y
    else if (x <= 3.1d-79) then
        tmp = x
    else if (x <= 2900000.0d0) then
        tmp = x * (x / y)
    else if (x <= 4.2d+101) then
        tmp = 1.0d0
    else
        tmp = x / y
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -1.0) {
		tmp = x / y;
	} else if (x <= 3.1e-79) {
		tmp = x;
	} else if (x <= 2900000.0) {
		tmp = x * (x / y);
	} else if (x <= 4.2e+101) {
		tmp = 1.0;
	} else {
		tmp = x / y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -1.0:
		tmp = x / y
	elif x <= 3.1e-79:
		tmp = x
	elif x <= 2900000.0:
		tmp = x * (x / y)
	elif x <= 4.2e+101:
		tmp = 1.0
	else:
		tmp = x / y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -1.0)
		tmp = Float64(x / y);
	elseif (x <= 3.1e-79)
		tmp = x;
	elseif (x <= 2900000.0)
		tmp = Float64(x * Float64(x / y));
	elseif (x <= 4.2e+101)
		tmp = 1.0;
	else
		tmp = Float64(x / y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -1.0)
		tmp = x / y;
	elseif (x <= 3.1e-79)
		tmp = x;
	elseif (x <= 2900000.0)
		tmp = x * (x / y);
	elseif (x <= 4.2e+101)
		tmp = 1.0;
	else
		tmp = x / y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -1.0], N[(x / y), $MachinePrecision], If[LessEqual[x, 3.1e-79], x, If[LessEqual[x, 2900000.0], N[(x * N[(x / y), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 4.2e+101], 1.0, N[(x / y), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if x < -1 or 4.2e101 < x

   1. Initial program 73.4%

      \[\frac{x \cdot \left(\frac{x}{y} + 1\right)}{x + 1} \]

   2. Taylor expanded in x around inf 79.0%

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

   if -1 < x < 3.0999999999999999e-79

   1. Initial program 99.9%

      \[\frac{x \cdot \left(\frac{x}{y} + 1\right)}{x + 1} \]

   2. Taylor expanded in x around 0 81.4%

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

   if 3.0999999999999999e-79 < x < 2.9e6

   1. Initial program 99.9%

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

      1. *-commutative 99.9%

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

      2. associate-/l* 99.8%

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

      3. remove-double-neg 99.8%

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

      4. neg-mul-1 99.8%

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

      5. *-commutative 99.8%

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

      6. associate-/r* 99.8%

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

      7. +-commutative 99.8%

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

      8. remove-double-neg 99.8%

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

      9. unsub-neg 99.8%

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

      10. div-sub 99.8%

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

      11. *-inverses 99.8%

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

      12. div-sub 99.8%

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

      13. associate-/r* 99.8%

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

      14. *-commutative 99.8%

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

      15. neg-mul-1 99.8%

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

      16. remove-double-neg 99.8%

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

      17. metadata-eval 99.8%

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

   3. Simplified 99.8%

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

   4. Taylor expanded in y around 0 66.7%

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

      1. distribute-lft-in 66.7%

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

      2. *-rgt-identity 66.7%

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

      3. associate-*r/ 66.7%

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

      4. *-rgt-identity 66.7%

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

   6. Simplified 66.7%

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

   7. Taylor expanded in x around 0 53.0%

      \[\leadsto \frac{x}{\color{blue}{\frac{y}{x}}} \]
   8. Step-by-step derivation

      1. associate-/r/ 53.1%

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

   9. Applied egg-rr 53.1%

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

   if 2.9e6 < x < 4.2e101

   1. Initial program 100.0%

      \[\frac{x \cdot \left(\frac{x}{y} + 1\right)}{x + 1} \]

   2. Taylor expanded in y around inf 78.9%

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

      1. +-commutative 78.9%

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

   4. Simplified 78.9%

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

   5. Taylor expanded in x around inf 77.2%

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

4. Final simplification 77.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1:\\ \;\;\;\;\frac{x}{y}\\ \mathbf{elif}\;x \leq 3.1 \cdot 10^{-79}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 2900000:\\ \;\;\;\;x \cdot \frac{x}{y}\\ \mathbf{elif}\;x \leq 4.2 \cdot 10^{+101}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y}\\ \end{array} \]

Alternative 6: 85.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1:\\ \;\;\;\;\frac{x}{y}\\ \mathbf{elif}\;x \leq 1.45 \cdot 10^{-6}:\\ \;\;\;\;x \cdot \left(1 + \frac{x}{y}\right)\\ \mathbf{elif}\;x \leq 4.3 \cdot 10^{+101}:\\ \;\;\;\;\frac{x}{x + 1}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -1.0)
   (/ x y)
   (if (<= x 1.45e-6)
     (* x (+ 1.0 (/ x y)))
     (if (<= x 4.3e+101) (/ x (+ x 1.0)) (/ x y)))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -1.0) {
		tmp = x / y;
	} else if (x <= 1.45e-6) {
		tmp = x * (1.0 + (x / y));
	} else if (x <= 4.3e+101) {
		tmp = x / (x + 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 (x <= (-1.0d0)) then
        tmp = x / y
    else if (x <= 1.45d-6) then
        tmp = x * (1.0d0 + (x / y))
    else if (x <= 4.3d+101) then
        tmp = x / (x + 1.0d0)
    else
        tmp = x / y
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -1.0) {
		tmp = x / y;
	} else if (x <= 1.45e-6) {
		tmp = x * (1.0 + (x / y));
	} else if (x <= 4.3e+101) {
		tmp = x / (x + 1.0);
	} else {
		tmp = x / y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -1.0:
		tmp = x / y
	elif x <= 1.45e-6:
		tmp = x * (1.0 + (x / y))
	elif x <= 4.3e+101:
		tmp = x / (x + 1.0)
	else:
		tmp = x / y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -1.0)
		tmp = Float64(x / y);
	elseif (x <= 1.45e-6)
		tmp = Float64(x * Float64(1.0 + Float64(x / y)));
	elseif (x <= 4.3e+101)
		tmp = Float64(x / Float64(x + 1.0));
	else
		tmp = Float64(x / y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -1.0)
		tmp = x / y;
	elseif (x <= 1.45e-6)
		tmp = x * (1.0 + (x / y));
	elseif (x <= 4.3e+101)
		tmp = x / (x + 1.0);
	else
		tmp = x / y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -1.0], N[(x / y), $MachinePrecision], If[LessEqual[x, 1.45e-6], N[(x * N[(1.0 + N[(x / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 4.3e+101], N[(x / N[(x + 1.0), $MachinePrecision]), $MachinePrecision], N[(x / y), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if x < -1 or 4.3000000000000001e101 < x

   1. Initial program 73.4%

      \[\frac{x \cdot \left(\frac{x}{y} + 1\right)}{x + 1} \]

   2. Taylor expanded in x around inf 79.0%

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

   if -1 < x < 1.4500000000000001e-6

   1. Initial program 99.9%

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

      1. *-commutative 99.9%

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

      2. associate-/l* 99.7%

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

      3. remove-double-neg 99.7%

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

      4. neg-mul-1 99.7%

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

      5. *-commutative 99.7%

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

      6. associate-/r* 99.7%

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

      7. +-commutative 99.7%

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

      8. remove-double-neg 99.7%

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

      9. unsub-neg 99.7%

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

      10. div-sub 99.7%

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

      11. *-inverses 99.7%

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

      12. div-sub 99.7%

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

      13. associate-/r* 99.7%

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

      14. *-commutative 99.7%

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

      15. neg-mul-1 99.7%

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

      16. remove-double-neg 99.7%

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

      17. metadata-eval 99.7%

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

   3. Simplified 99.7%

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

   4. Taylor expanded in x around 0 98.2%

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

      1. associate-/r/ 98.4%

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

      2. /-rgt-identity 98.4%

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

      3. +-commutative 98.4%

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

   6. Applied egg-rr 98.4%

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

   if 1.4500000000000001e-6 < x < 4.3000000000000001e101

   1. Initial program 99.9%

      \[\frac{x \cdot \left(\frac{x}{y} + 1\right)}{x + 1} \]

   2. Taylor expanded in y around inf 69.9%

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

      1. +-commutative 69.9%

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

   4. Simplified 69.9%

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

4. Final simplification 87.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1:\\ \;\;\;\;\frac{x}{y}\\ \mathbf{elif}\;x \leq 1.45 \cdot 10^{-6}:\\ \;\;\;\;x \cdot \left(1 + \frac{x}{y}\right)\\ \mathbf{elif}\;x \leq 4.3 \cdot 10^{+101}:\\ \;\;\;\;\frac{x}{x + 1}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y}\\ \end{array} \]

Alternative 7: 85.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -4.5 \cdot 10^{-8}:\\ \;\;\;\;\frac{x}{y + \frac{y}{x}}\\ \mathbf{elif}\;x \leq 8 \cdot 10^{-7}:\\ \;\;\;\;x \cdot \left(1 + \frac{x}{y}\right)\\ \mathbf{elif}\;x \leq 8 \cdot 10^{+101}:\\ \;\;\;\;\frac{x}{x + 1}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -4.5e-8)
   (/ x (+ y (/ y x)))
   (if (<= x 8e-7)
     (* x (+ 1.0 (/ x y)))
     (if (<= x 8e+101) (/ x (+ x 1.0)) (/ x y)))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -4.5e-8) {
		tmp = x / (y + (y / x));
	} else if (x <= 8e-7) {
		tmp = x * (1.0 + (x / y));
	} else if (x <= 8e+101) {
		tmp = x / (x + 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 (x <= (-4.5d-8)) then
        tmp = x / (y + (y / x))
    else if (x <= 8d-7) then
        tmp = x * (1.0d0 + (x / y))
    else if (x <= 8d+101) then
        tmp = x / (x + 1.0d0)
    else
        tmp = x / y
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -4.5e-8) {
		tmp = x / (y + (y / x));
	} else if (x <= 8e-7) {
		tmp = x * (1.0 + (x / y));
	} else if (x <= 8e+101) {
		tmp = x / (x + 1.0);
	} else {
		tmp = x / y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -4.5e-8:
		tmp = x / (y + (y / x))
	elif x <= 8e-7:
		tmp = x * (1.0 + (x / y))
	elif x <= 8e+101:
		tmp = x / (x + 1.0)
	else:
		tmp = x / y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -4.5e-8)
		tmp = Float64(x / Float64(y + Float64(y / x)));
	elseif (x <= 8e-7)
		tmp = Float64(x * Float64(1.0 + Float64(x / y)));
	elseif (x <= 8e+101)
		tmp = Float64(x / Float64(x + 1.0));
	else
		tmp = Float64(x / y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -4.5e-8)
		tmp = x / (y + (y / x));
	elseif (x <= 8e-7)
		tmp = x * (1.0 + (x / y));
	elseif (x <= 8e+101)
		tmp = x / (x + 1.0);
	else
		tmp = x / y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -4.5e-8], N[(x / N[(y + N[(y / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 8e-7], N[(x * N[(1.0 + N[(x / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 8e+101], N[(x / N[(x + 1.0), $MachinePrecision]), $MachinePrecision], N[(x / y), $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if x < -4.49999999999999993e-8

   1. Initial program 73.9%

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

      1. *-commutative 73.9%

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

      2. associate-/l* 100.0%

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

      3. remove-double-neg 100.0%

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

      4. neg-mul-1 100.0%

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

      5. *-commutative 100.0%

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

      6. associate-/r* 100.0%

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

      7. +-commutative 100.0%

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

      8. remove-double-neg 100.0%

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

      9. unsub-neg 100.0%

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

      10. div-sub 100.0%

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

      11. *-inverses 100.0%

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

      12. div-sub 100.0%

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

      13. associate-/r* 100.0%

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

      14. *-commutative 100.0%

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

      15. neg-mul-1 100.0%

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

      16. remove-double-neg 100.0%

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

      17. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in y around 0 76.4%

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

      1. distribute-lft-in 76.4%

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

      2. *-rgt-identity 76.4%

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

      3. associate-*r/ 76.4%

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

      4. *-rgt-identity 76.4%

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

   6. Simplified 76.4%

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

   if -4.49999999999999993e-8 < x < 7.9999999999999996e-7

   1. Initial program 99.9%

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

      1. *-commutative 99.9%

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

      2. associate-/l* 99.7%

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

      3. remove-double-neg 99.7%

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

      4. neg-mul-1 99.7%

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

      5. *-commutative 99.7%

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

      6. associate-/r* 99.7%

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

      7. +-commutative 99.7%

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

      8. remove-double-neg 99.7%

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

      9. unsub-neg 99.7%

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

      10. div-sub 99.7%

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

      11. *-inverses 99.7%

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

      12. div-sub 99.7%

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

      13. associate-/r* 99.7%

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

      14. *-commutative 99.7%

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

      15. neg-mul-1 99.7%

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

      16. remove-double-neg 99.7%

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

      17. metadata-eval 99.7%

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

   3. Simplified 99.7%

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

   4. Taylor expanded in x around 0 99.0%

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

      1. associate-/r/ 99.3%

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

      2. /-rgt-identity 99.3%

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

      3. +-commutative 99.3%

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

   6. Applied egg-rr 99.3%

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

   if 7.9999999999999996e-7 < x < 7.9999999999999998e101

   1. Initial program 99.9%

      \[\frac{x \cdot \left(\frac{x}{y} + 1\right)}{x + 1} \]

   2. Taylor expanded in y around inf 69.9%

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

      1. +-commutative 69.9%

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

   4. Simplified 69.9%

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

   if 7.9999999999999998e101 < x

   1. Initial program 74.0%

      \[\frac{x \cdot \left(\frac{x}{y} + 1\right)}{x + 1} \]

   2. Taylor expanded in x around inf 83.5%

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

4. Final simplification 88.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -4.5 \cdot 10^{-8}:\\ \;\;\;\;\frac{x}{y + \frac{y}{x}}\\ \mathbf{elif}\;x \leq 8 \cdot 10^{-7}:\\ \;\;\;\;x \cdot \left(1 + \frac{x}{y}\right)\\ \mathbf{elif}\;x \leq 8 \cdot 10^{+101}:\\ \;\;\;\;\frac{x}{x + 1}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y}\\ \end{array} \]

Alternative 8: 98.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1 or 1 < x

   1. Initial program 77.9%

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

      1. *-commutative 77.9%

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

      2. associate-/l* 100.0%

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

      3. remove-double-neg 100.0%

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

      4. neg-mul-1 100.0%

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

      5. *-commutative 100.0%

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

      6. associate-/r* 100.0%

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

      7. +-commutative 100.0%

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

      8. remove-double-neg 100.0%

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

      9. unsub-neg 100.0%

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

      10. div-sub 100.0%

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

      11. *-inverses 100.0%

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

      12. div-sub 100.0%

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

      13. associate-/r* 100.0%

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

      14. *-commutative 100.0%

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

      15. neg-mul-1 100.0%

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

      16. remove-double-neg 100.0%

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

      17. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in x around inf 97.4%

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

   if -1 < x < 1

   1. Initial program 99.9%

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

      1. *-commutative 99.9%

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

      2. associate-/l* 99.7%

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

      3. remove-double-neg 99.7%

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

      4. neg-mul-1 99.7%

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

      5. *-commutative 99.7%

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

      6. associate-/r* 99.7%

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

      7. +-commutative 99.7%

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

      8. remove-double-neg 99.7%

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

      9. unsub-neg 99.7%

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

      10. div-sub 99.7%

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

      11. *-inverses 99.7%

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

      12. div-sub 99.7%

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

      13. associate-/r* 99.7%

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

      14. *-commutative 99.7%

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

      15. neg-mul-1 99.7%

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

      16. remove-double-neg 99.7%

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

      17. metadata-eval 99.7%

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

   3. Simplified 99.7%

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

   4. Taylor expanded in x around 0 97.3%

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

      1. associate-/r/ 97.5%

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

      2. /-rgt-identity 97.5%

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

      3. +-commutative 97.5%

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

   6. Applied egg-rr 97.5%

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

4. Final simplification 97.5%

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

Alternative 9: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 89.0%

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

   1. *-commutative 89.0%

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

   2. associate-/l* 99.8%

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

   3. remove-double-neg 99.8%

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

   4. neg-mul-1 99.8%

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

   5. *-commutative 99.8%

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

   6. associate-/r* 99.8%

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

   7. +-commutative 99.8%

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

   8. remove-double-neg 99.8%

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

   9. unsub-neg 99.8%

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

   10. div-sub 99.8%

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

   11. *-inverses 99.8%

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

   12. div-sub 99.8%

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

   13. associate-/r* 99.8%

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

   14. *-commutative 99.8%

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

   15. neg-mul-1 99.8%

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

   16. remove-double-neg 99.8%

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

   17. metadata-eval 99.8%

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

3. Simplified 99.8%

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

4. Final simplification 99.8%

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

Alternative 10: 73.1% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1:\\ \;\;\;\;\frac{x}{y}\\ \mathbf{elif}\;x \leq 2900000:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 1.5 \cdot 10^{+102}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -1.0)
   (/ x y)
   (if (<= x 2900000.0) x (if (<= x 1.5e+102) 1.0 (/ x y)))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -1.0) {
		tmp = x / y;
	} else if (x <= 2900000.0) {
		tmp = x;
	} else if (x <= 1.5e+102) {
		tmp = 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 (x <= (-1.0d0)) then
        tmp = x / y
    else if (x <= 2900000.0d0) then
        tmp = x
    else if (x <= 1.5d+102) then
        tmp = 1.0d0
    else
        tmp = x / y
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -1.0) {
		tmp = x / y;
	} else if (x <= 2900000.0) {
		tmp = x;
	} else if (x <= 1.5e+102) {
		tmp = 1.0;
	} else {
		tmp = x / y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -1.0:
		tmp = x / y
	elif x <= 2900000.0:
		tmp = x
	elif x <= 1.5e+102:
		tmp = 1.0
	else:
		tmp = x / y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -1.0)
		tmp = Float64(x / y);
	elseif (x <= 2900000.0)
		tmp = x;
	elseif (x <= 1.5e+102)
		tmp = 1.0;
	else
		tmp = Float64(x / y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -1.0)
		tmp = x / y;
	elseif (x <= 2900000.0)
		tmp = x;
	elseif (x <= 1.5e+102)
		tmp = 1.0;
	else
		tmp = x / y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -1.0], N[(x / y), $MachinePrecision], If[LessEqual[x, 2900000.0], x, If[LessEqual[x, 1.5e+102], 1.0, N[(x / y), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if x < -1 or 1.4999999999999999e102 < x

   1. Initial program 73.4%

      \[\frac{x \cdot \left(\frac{x}{y} + 1\right)}{x + 1} \]

   2. Taylor expanded in x around inf 79.0%

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

   if -1 < x < 2.9e6

   1. Initial program 99.9%

      \[\frac{x \cdot \left(\frac{x}{y} + 1\right)}{x + 1} \]

   2. Taylor expanded in x around 0 73.2%

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

   if 2.9e6 < x < 1.4999999999999999e102

   1. Initial program 100.0%

      \[\frac{x \cdot \left(\frac{x}{y} + 1\right)}{x + 1} \]

   2. Taylor expanded in y around inf 78.9%

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

      1. +-commutative 78.9%

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

   4. Simplified 78.9%

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

   5. Taylor expanded in x around inf 77.2%

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

4. Final simplification 75.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1:\\ \;\;\;\;\frac{x}{y}\\ \mathbf{elif}\;x \leq 2900000:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 1.5 \cdot 10^{+102}:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y}\\ \end{array} \]

Alternative 11: 49.8% accurate, 2.1× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	double tmp;
	if (x <= -78000000000.0) {
		tmp = 1.0;
	} else if (x <= 2900000.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 (x <= (-78000000000.0d0)) then
        tmp = 1.0d0
    else if (x <= 2900000.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 (x <= -78000000000.0) {
		tmp = 1.0;
	} else if (x <= 2900000.0) {
		tmp = x;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_] := If[LessEqual[x, -78000000000.0], 1.0, If[LessEqual[x, 2900000.0], x, 1.0]]

Derivation

1. Split input into 2 regimes

2. if x < -7.8e10 or 2.9e6 < x

   1. Initial program 77.6%

      \[\frac{x \cdot \left(\frac{x}{y} + 1\right)}{x + 1} \]

   2. Taylor expanded in y around inf 29.5%

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

      1. +-commutative 29.5%

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

   4. Simplified 29.5%

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

   5. Taylor expanded in x around inf 29.0%

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

   if -7.8e10 < x < 2.9e6

   1. Initial program 99.3%

      \[\frac{x \cdot \left(\frac{x}{y} + 1\right)}{x + 1} \]

   2. Taylor expanded in x around 0 71.6%

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

4. Final simplification 51.5%

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

Alternative 12: 14.3% accurate, 11.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 89.0%

   \[\frac{x \cdot \left(\frac{x}{y} + 1\right)}{x + 1} \]

2. Taylor expanded in y around inf 52.2%

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

   1. +-commutative 52.2%

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

4. Simplified 52.2%

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

5. Taylor expanded in x around inf 15.7%

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

6. Final simplification 15.7%

   \[\leadsto 1 \]

Developer target: 99.9% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (* (/ x 1.0) (/ (+ (/ x y) 1.0) (+ x 1.0))))

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return (x / 1.0) * (((x / y) + 1.0) / (x + 1.0))

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2023334 
(FPCore (x y)
  :name "Codec.Picture.Types:toneMapping from JuicyPixels-3.2.6.1"
  :precision binary64

  :herbie-target
  (* (/ x 1.0) (/ (+ (/ x y) 1.0) (+ x 1.0)))

  (/ (* x (+ (/ x y) 1.0)) (+ x 1.0)))