Development.Shake.Progress:message from shake-0.15.5

Percentage Accurate: 99.5% → 99.7%

Time: 5.8s

Alternatives: 5

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.5% 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} \\ 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.3%

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

   1. associate-/l* 99.7%

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

   2. *-commutative 99.7%

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

4. Applied egg-rr 99.7%

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

5. Final simplification 99.7%

   \[\leadsto x \cdot \frac{100}{x + y} \]
6. Add Preprocessing

Alternative 2: 74.6% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2.9 \cdot 10^{+17} \lor \neg \left(y \leq 9 \cdot 10^{+63}\right):\\ \;\;\;\;100 \cdot \frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;100\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -2.9e+17) (not (<= y 9e+63))) (* 100.0 (/ x y)) 100.0))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -2.9e+17) || !(y <= 9e+63)) {
		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 <= (-2.9d+17)) .or. (.not. (y <= 9d+63))) 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 <= -2.9e+17) || !(y <= 9e+63)) {
		tmp = 100.0 * (x / y);
	} else {
		tmp = 100.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -2.9e+17) or not (y <= 9e+63):
		tmp = 100.0 * (x / y)
	else:
		tmp = 100.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -2.9e+17) || !(y <= 9e+63))
		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 <= -2.9e+17) || ~((y <= 9e+63)))
		tmp = 100.0 * (x / y);
	else
		tmp = 100.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -2.9e+17], N[Not[LessEqual[y, 9e+63]], $MachinePrecision]], N[(100.0 * N[(x / y), $MachinePrecision]), $MachinePrecision], 100.0]

Derivation

1. Split input into 2 regimes

2. if y < -2.9e17 or 9.00000000000000034e63 < y

   1. Initial program 98.8%

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

      1. *-commutative 98.8%

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

      2. associate-/l* 99.6%

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

   3. Simplified 99.6%

      \[\leadsto \color{blue}{100 \cdot \frac{x}{x + y}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 80.3%

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

   if -2.9e17 < y < 9.00000000000000034e63

   1. Initial program 99.8%

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

      1. *-commutative 99.8%

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

      2. associate-/l* 99.8%

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

   3. Simplified 99.8%

      \[\leadsto \color{blue}{100 \cdot \frac{x}{x + y}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 75.6%

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

4. Final simplification 77.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2.9 \cdot 10^{+17} \lor \neg \left(y \leq 9 \cdot 10^{+63}\right):\\ \;\;\;\;100 \cdot \frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;100\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 74.8% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.9 \cdot 10^{+20} \lor \neg \left(y \leq 1.6 \cdot 10^{+56}\right):\\ \;\;\;\;x \cdot \frac{100}{y}\\ \mathbf{else}:\\ \;\;\;\;100\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -1.9e+20) (not (<= y 1.6e+56))) (* x (/ 100.0 y)) 100.0))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -1.9e+20) || !(y <= 1.6e+56)) {
		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 <= (-1.9d+20)) .or. (.not. (y <= 1.6d+56))) 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 <= -1.9e+20) || !(y <= 1.6e+56)) {
		tmp = x * (100.0 / y);
	} else {
		tmp = 100.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -1.9e+20) or not (y <= 1.6e+56):
		tmp = x * (100.0 / y)
	else:
		tmp = 100.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -1.9e+20) || !(y <= 1.6e+56))
		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 <= -1.9e+20) || ~((y <= 1.6e+56)))
		tmp = x * (100.0 / y);
	else
		tmp = 100.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -1.9e+20], N[Not[LessEqual[y, 1.6e+56]], $MachinePrecision]], N[(x * N[(100.0 / y), $MachinePrecision]), $MachinePrecision], 100.0]

Derivation

1. Split input into 2 regimes

2. if y < -1.9e20 or 1.60000000000000002e56 < y

   1. Initial program 98.8%

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

      1. associate-/l* 99.8%

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

      2. *-commutative 99.8%

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

   4. Applied egg-rr 99.8%

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

   5. Taylor expanded in x around 0 80.0%

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

   if -1.9e20 < y < 1.60000000000000002e56

   1. Initial program 99.7%

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

      1. *-commutative 99.7%

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

      2. associate-/l* 99.8%

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

   3. Simplified 99.8%

      \[\leadsto \color{blue}{100 \cdot \frac{x}{x + y}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 75.9%

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

4. Final simplification 77.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.9 \cdot 10^{+20} \lor \neg \left(y \leq 1.6 \cdot 10^{+56}\right):\\ \;\;\;\;x \cdot \frac{100}{y}\\ \mathbf{else}:\\ \;\;\;\;100\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.3%

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

   1. *-commutative 99.3%

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

   2. associate-/l* 99.7%

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

3. Simplified 99.7%

   \[\leadsto \color{blue}{100 \cdot \frac{x}{x + y}} \]
4. Add Preprocessing

5. Final simplification 99.7%

   \[\leadsto 100 \cdot \frac{x}{x + y} \]
6. Add Preprocessing

Alternative 5: 50.1% 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.3%

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

   1. *-commutative 99.3%

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

   2. associate-/l* 99.7%

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

3. Simplified 99.7%

   \[\leadsto \color{blue}{100 \cdot \frac{x}{x + y}} \]
4. Add Preprocessing

5. Taylor expanded in x around inf 50.2%

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

6. Final simplification 50.2%

   \[\leadsto 100 \]
7. Add Preprocessing

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 2024096 
(FPCore (x y)
  :name "Development.Shake.Progress:message from shake-0.15.5"
  :precision binary64

  :alt
  (* (/ x 1.0) (/ 100.0 (+ x y)))

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