Development.Shake.Progress:message from shake-0.15.5

Percentage Accurate: 99.4% → 99.7%

Time: 4.2s

Alternatives: 7

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.4% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.0%

   \[\frac{x \cdot 100}{x + y} \]
2. Step-by-step derivation

   1. associate-/l* 99.7%

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

3. Simplified 99.7%

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

4. Final simplification 99.7%

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

Alternative 2: 74.0% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -7e+92) (not (<= y 2.3e-30))) (* 100.0 (/ x y)) 100.0))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -7e+92) || !(y <= 2.3e-30)) {
		tmp = 100.0 * (x / y);
	} else {
		tmp = 100.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 <= (-7d+92)) .or. (.not. (y <= 2.3d-30))) then
        tmp = 100.0d0 * (x / y)
    else
        tmp = 100.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y <= -7e+92) || !(y <= 2.3e-30)) {
		tmp = 100.0 * (x / y);
	} else {
		tmp = 100.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -7e+92) or not (y <= 2.3e-30):
		tmp = 100.0 * (x / y)
	else:
		tmp = 100.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -7e+92) || !(y <= 2.3e-30))
		tmp = Float64(100.0 * Float64(x / y));
	else
		tmp = 100.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -7e+92) || ~((y <= 2.3e-30)))
		tmp = 100.0 * (x / y);
	else
		tmp = 100.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -7e+92], N[Not[LessEqual[y, 2.3e-30]], $MachinePrecision]], N[(100.0 * N[(x / y), $MachinePrecision]), $MachinePrecision], 100.0]

Derivation

1. Split input into 2 regimes

2. if y < -6.99999999999999972e92 or 2.29999999999999984e-30 < y

   1. Initial program 98.9%

      \[\frac{x \cdot 100}{x + y} \]
   2. Step-by-step derivation

      1. associate-*r/ 99.7%

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

   3. Simplified 99.7%

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

   4. Taylor expanded in x around 0 82.7%

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

   if -6.99999999999999972e92 < y < 2.29999999999999984e-30

   1. Initial program 99.0%

      \[\frac{x \cdot 100}{x + y} \]
   2. Step-by-step derivation

      1. associate-*r/ 99.7%

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

   3. Simplified 99.7%

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

   4. Taylor expanded in x around inf 80.2%

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

4. Final simplification 81.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -7 \cdot 10^{+92} \lor \neg \left(y \leq 2.3 \cdot 10^{-30}\right):\\ \;\;\;\;100 \cdot \frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;100\\ \end{array} \]

Alternative 3: 74.1% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -6.8 \cdot 10^{+92} \lor \neg \left(y \leq 1.1 \cdot 10^{-32}\right):\\ \;\;\;\;x \cdot \frac{100}{y}\\ \mathbf{else}:\\ \;\;\;\;100\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -6.8e+92) (not (<= y 1.1e-32))) (* x (/ 100.0 y)) 100.0))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -6.8e+92) || !(y <= 1.1e-32)) {
		tmp = x * (100.0 / y);
	} else {
		tmp = 100.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 <= (-6.8d+92)) .or. (.not. (y <= 1.1d-32))) then
        tmp = x * (100.0d0 / y)
    else
        tmp = 100.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y <= -6.8e+92) || !(y <= 1.1e-32)) {
		tmp = x * (100.0 / y);
	} else {
		tmp = 100.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -6.8e+92) or not (y <= 1.1e-32):
		tmp = x * (100.0 / y)
	else:
		tmp = 100.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -6.8e+92) || !(y <= 1.1e-32))
		tmp = Float64(x * Float64(100.0 / y));
	else
		tmp = 100.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -6.8e+92) || ~((y <= 1.1e-32)))
		tmp = x * (100.0 / y);
	else
		tmp = 100.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -6.8e+92], N[Not[LessEqual[y, 1.1e-32]], $MachinePrecision]], N[(x * N[(100.0 / y), $MachinePrecision]), $MachinePrecision], 100.0]

Derivation

1. Split input into 2 regimes

2. if y < -6.7999999999999996e92 or 1.1e-32 < y

   1. Initial program 98.9%

      \[\frac{x \cdot 100}{x + y} \]
   2. Step-by-step derivation

      1. associate-*r/ 99.7%

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

   3. Simplified 99.7%

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

   4. Taylor expanded in x around 0 82.8%

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

   if -6.7999999999999996e92 < y < 1.1e-32

   1. Initial program 99.0%

      \[\frac{x \cdot 100}{x + y} \]
   2. Step-by-step derivation

      1. associate-*r/ 99.7%

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

   3. Simplified 99.7%

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

   4. Taylor expanded in x around inf 80.2%

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

4. Final simplification 81.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -6.8 \cdot 10^{+92} \lor \neg \left(y \leq 1.1 \cdot 10^{-32}\right):\\ \;\;\;\;x \cdot \frac{100}{y}\\ \mathbf{else}:\\ \;\;\;\;100\\ \end{array} \]

Alternative 4: 74.1% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -6.8 \cdot 10^{+92}:\\ \;\;\;\;\frac{x}{y \cdot 0.01}\\ \mathbf{elif}\;y \leq 2.45 \cdot 10^{-30}:\\ \;\;\;\;100\\ \mathbf{else}:\\ \;\;\;\;x \cdot \frac{100}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -6.8e+92)
   (/ x (* y 0.01))
   (if (<= y 2.45e-30) 100.0 (* x (/ 100.0 y)))))

C

double code(double x, double y) {
	double tmp;
	if (y <= -6.8e+92) {
		tmp = x / (y * 0.01);
	} else if (y <= 2.45e-30) {
		tmp = 100.0;
	} else {
		tmp = x * (100.0 / 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 <= (-6.8d+92)) then
        tmp = x / (y * 0.01d0)
    else if (y <= 2.45d-30) then
        tmp = 100.0d0
    else
        tmp = x * (100.0d0 / y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= -6.8e+92) {
		tmp = x / (y * 0.01);
	} else if (y <= 2.45e-30) {
		tmp = 100.0;
	} else {
		tmp = x * (100.0 / y);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -6.8e+92:
		tmp = x / (y * 0.01)
	elif y <= 2.45e-30:
		tmp = 100.0
	else:
		tmp = x * (100.0 / y)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -6.8e+92)
		tmp = Float64(x / Float64(y * 0.01));
	elseif (y <= 2.45e-30)
		tmp = 100.0;
	else
		tmp = Float64(x * Float64(100.0 / y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -6.8e+92)
		tmp = x / (y * 0.01);
	elseif (y <= 2.45e-30)
		tmp = 100.0;
	else
		tmp = x * (100.0 / y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -6.8e+92], N[(x / N[(y * 0.01), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 2.45e-30], 100.0, N[(x * N[(100.0 / y), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -6.7999999999999996e92

   1. Initial program 97.9%

      \[\frac{x \cdot 100}{x + y} \]
   2. Step-by-step derivation

      1. associate-/l* 99.8%

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

      2. remove-double-neg 99.8%

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

      3. sub0-neg 99.8%

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

      4. associate-+l- 99.8%

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

      5. neg-sub0 99.8%

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

      6. distribute-frac-neg 99.8%

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

      7. div-sub 99.8%

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

      8. sub-neg 99.8%

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

      9. distribute-neg-frac 99.8%

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

      10. distribute-neg-out 99.8%

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

      11. neg-mul-1 99.8%

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

      12. associate-/l* 99.7%

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

      13. associate-/r/ 99.8%

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

      14. metadata-eval 99.8%

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

      15. *-inverses 99.8%

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

      16. distribute-frac-neg 99.8%

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

      17. associate-/r* 97.9%

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

      18. distribute-rgt-neg-in 97.9%

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

      19. neg-mul-1 97.9%

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

      20. associate-/l* 97.8%

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

      21. associate-/r/ 97.9%

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

   3. Simplified 99.8%

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

   4. Taylor expanded in x around 0 87.6%

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

      1. *-commutative 87.6%

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

   6. Simplified 87.6%

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

   if -6.7999999999999996e92 < y < 2.44999999999999985e-30

   1. Initial program 99.0%

      \[\frac{x \cdot 100}{x + y} \]
   2. Step-by-step derivation

      1. associate-*r/ 99.7%

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

   3. Simplified 99.7%

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

   4. Taylor expanded in x around inf 80.2%

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

   if 2.44999999999999985e-30 < y

   1. Initial program 99.7%

      \[\frac{x \cdot 100}{x + y} \]
   2. Step-by-step derivation

      1. associate-*r/ 99.8%

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

   3. Simplified 99.8%

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

   4. Taylor expanded in x around 0 79.2%

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

4. Final simplification 81.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -6.8 \cdot 10^{+92}:\\ \;\;\;\;\frac{x}{y \cdot 0.01}\\ \mathbf{elif}\;y \leq 2.45 \cdot 10^{-30}:\\ \;\;\;\;100\\ \mathbf{else}:\\ \;\;\;\;x \cdot \frac{100}{y}\\ \end{array} \]

Alternative 5: 74.1% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -6.8 \cdot 10^{+92}:\\ \;\;\;\;\frac{x \cdot 100}{y}\\ \mathbf{elif}\;y \leq 2.9 \cdot 10^{-30}:\\ \;\;\;\;100\\ \mathbf{else}:\\ \;\;\;\;x \cdot \frac{100}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= y -6.8e+92)
   (/ (* x 100.0) y)
   (if (<= y 2.9e-30) 100.0 (* x (/ 100.0 y)))))

C

double code(double x, double y) {
	double tmp;
	if (y <= -6.8e+92) {
		tmp = (x * 100.0) / y;
	} else if (y <= 2.9e-30) {
		tmp = 100.0;
	} else {
		tmp = x * (100.0 / 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 <= (-6.8d+92)) then
        tmp = (x * 100.0d0) / y
    else if (y <= 2.9d-30) then
        tmp = 100.0d0
    else
        tmp = x * (100.0d0 / y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= -6.8e+92) {
		tmp = (x * 100.0) / y;
	} else if (y <= 2.9e-30) {
		tmp = 100.0;
	} else {
		tmp = x * (100.0 / y);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= -6.8e+92:
		tmp = (x * 100.0) / y
	elif y <= 2.9e-30:
		tmp = 100.0
	else:
		tmp = x * (100.0 / y)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= -6.8e+92)
		tmp = Float64(Float64(x * 100.0) / y);
	elseif (y <= 2.9e-30)
		tmp = 100.0;
	else
		tmp = Float64(x * Float64(100.0 / y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -6.8e+92)
		tmp = (x * 100.0) / y;
	elseif (y <= 2.9e-30)
		tmp = 100.0;
	else
		tmp = x * (100.0 / y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, -6.8e+92], N[(N[(x * 100.0), $MachinePrecision] / y), $MachinePrecision], If[LessEqual[y, 2.9e-30], 100.0, N[(x * N[(100.0 / y), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -6.7999999999999996e92

   1. Initial program 97.9%

      \[\frac{x \cdot 100}{x + y} \]
   2. Step-by-step derivation

      1. associate-*r/ 99.6%

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

   3. Simplified 99.6%

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

   4. Taylor expanded in x around 0 87.5%

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

      1. associate-*r/ 87.7%

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

   6. Applied egg-rr 87.7%

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

   if -6.7999999999999996e92 < y < 2.89999999999999989e-30

   1. Initial program 99.0%

      \[\frac{x \cdot 100}{x + y} \]
   2. Step-by-step derivation

      1. associate-*r/ 99.7%

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

   3. Simplified 99.7%

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

   4. Taylor expanded in x around inf 80.2%

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

   if 2.89999999999999989e-30 < y

   1. Initial program 99.7%

      \[\frac{x \cdot 100}{x + y} \]
   2. Step-by-step derivation

      1. associate-*r/ 99.8%

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

   3. Simplified 99.8%

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

   4. Taylor expanded in x around 0 79.2%

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

4. Final simplification 81.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -6.8 \cdot 10^{+92}:\\ \;\;\;\;\frac{x \cdot 100}{y}\\ \mathbf{elif}\;y \leq 2.9 \cdot 10^{-30}:\\ \;\;\;\;100\\ \mathbf{else}:\\ \;\;\;\;x \cdot \frac{100}{y}\\ \end{array} \]

Alternative 6: 99.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.0%

   \[\frac{x \cdot 100}{x + y} \]
2. Step-by-step derivation

   1. associate-*r/ 99.7%

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

3. Simplified 99.7%

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

4. Final simplification 99.7%

   \[\leadsto x \cdot \frac{100}{x + y} \]

Alternative 7: 49.8% accurate, 7.0× speedup

Math

\[\begin{array}{l} \\ 100 \end{array} \]

FPCore

(FPCore (x y) :precision binary64 100.0)

C

double code(double x, double y) {
	return 100.0;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = 100.0d0
end function

Java

public static double code(double x, double y) {
	return 100.0;
}

Python

def code(x, y):
	return 100.0

Julia

function code(x, y)
	return 100.0
end

MATLAB

function tmp = code(x, y)
	tmp = 100.0;
end

Wolfram

code[x_, y_] := 100.0

Derivation

1. Initial program 99.0%

   \[\frac{x \cdot 100}{x + y} \]
2. Step-by-step derivation

   1. associate-*r/ 99.7%

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

3. Simplified 99.7%

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

4. Taylor expanded in x around inf 51.5%

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

5. Final simplification 51.5%

   \[\leadsto 100 \]

Developer target: 99.7% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2023290 
(FPCore (x y)
  :name "Development.Shake.Progress:message from shake-0.15.5"
  :precision binary64

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

  (/ (* x 100.0) (+ x y)))