Development.Shake.Progress:message from shake-0.15.5

Percentage Accurate: 99.4% → 99.7%

Time: 7.4s

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.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}{y + x} \cdot 100 \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.7%

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

3. Taylor expanded in y around inf

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

   1. +-commutative N/A

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

   2. distribute-rgt-in N/A

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

   3. *-lft-identity N/A

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

   4. lower-fma.f64 N/A

      \[\leadsto \frac{x \cdot 100}{\color{blue}{\mathsf{fma}\left(\frac{x}{y}, y, y\right)}} \]

   5. lower-/.f64 89.5

      \[\leadsto \frac{x \cdot 100}{\mathsf{fma}\left(\color{blue}{\frac{x}{y}}, y, y\right)} \]

5. Applied rewrites 89.5%

   \[\leadsto \frac{x \cdot 100}{\color{blue}{\mathsf{fma}\left(\frac{x}{y}, y, y\right)}} \]
6. Step-by-step derivation

   1. lift-/.f64 N/A

      \[\leadsto \color{blue}{\frac{x \cdot 100}{\mathsf{fma}\left(\frac{x}{y}, y, y\right)}} \]

   2. lift-*.f64 N/A

      \[\leadsto \frac{\color{blue}{x \cdot 100}}{\mathsf{fma}\left(\frac{x}{y}, y, y\right)} \]

   3. *-commutative N/A

      \[\leadsto \frac{\color{blue}{100 \cdot x}}{\mathsf{fma}\left(\frac{x}{y}, y, y\right)} \]

   4. associate-/l* N/A

      \[\leadsto \color{blue}{100 \cdot \frac{x}{\mathsf{fma}\left(\frac{x}{y}, y, y\right)}} \]

   5. *-commutative N/A

      \[\leadsto \color{blue}{\frac{x}{\mathsf{fma}\left(\frac{x}{y}, y, y\right)} \cdot 100} \]

   6. lower-*.f64 N/A

      \[\leadsto \color{blue}{\frac{x}{\mathsf{fma}\left(\frac{x}{y}, y, y\right)} \cdot 100} \]

   7. lower-/.f64 89.5

      \[\leadsto \color{blue}{\frac{x}{\mathsf{fma}\left(\frac{x}{y}, y, y\right)}} \cdot 100 \]

7. Applied rewrites 99.8%

   \[\leadsto \color{blue}{\frac{x}{\mathsf{fma}\left(1, x, y\right)} \cdot 100} \]
8. Step-by-step derivation

9. Applied rewrites 99.8%

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

Alternative 2: 98.2% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{x \cdot 100}{x + y} \leq 20:\\ \;\;\;\;\frac{100}{y} \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{y}{x}, -100, 100\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (/ (* x 100.0) (+ x y)) 20.0)
   (* (/ 100.0 y) x)
   (fma (/ y x) -100.0 100.0)))

C

double code(double x, double y) {
	double tmp;
	if (((x * 100.0) / (x + y)) <= 20.0) {
		tmp = (100.0 / y) * x;
	} else {
		tmp = fma((y / x), -100.0, 100.0);
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (Float64(Float64(x * 100.0) / Float64(x + y)) <= 20.0)
		tmp = Float64(Float64(100.0 / y) * x);
	else
		tmp = fma(Float64(y / x), -100.0, 100.0);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 x #s(literal 100 binary64)) (+.f64 x y)) < 20

   1. Initial program 99.6%

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

   3. Taylor expanded in x around 0

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

      1. *-lft-identity N/A

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

      2. associate-*l/ N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. associate-*r/ N/A

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

      6. metadata-eval N/A

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

      7. lower-/.f64 98.2

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

   5. Applied rewrites 98.2%

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

   if 20 < (/.f64 (*.f64 x #s(literal 100 binary64)) (+.f64 x y))

   1. Initial program 99.8%

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

   3. Taylor expanded in x around inf

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 98.2

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

   5. Applied rewrites 98.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{y}{x}, -100, 100\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 97.6% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{x \cdot 100}{x + y} \leq 20:\\ \;\;\;\;\frac{100}{y} \cdot x\\ \mathbf{else}:\\ \;\;\;\;100\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (/ (* x 100.0) (+ x y)) 20.0) (* (/ 100.0 y) x) 100.0))

C

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

Java

public static double code(double x, double y) {
	double tmp;
	if (((x * 100.0) / (x + y)) <= 20.0) {
		tmp = (100.0 / y) * x;
	} else {
		tmp = 100.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if ((x * 100.0) / (x + y)) <= 20.0:
		tmp = (100.0 / y) * x
	else:
		tmp = 100.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (Float64(Float64(x * 100.0) / Float64(x + y)) <= 20.0)
		tmp = Float64(Float64(100.0 / y) * x);
	else
		tmp = 100.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (((x * 100.0) / (x + y)) <= 20.0)
		tmp = (100.0 / y) * x;
	else
		tmp = 100.0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 x #s(literal 100 binary64)) (+.f64 x y)) < 20

   1. Initial program 99.6%

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

   3. Taylor expanded in x around 0

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

      1. *-lft-identity N/A

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

      2. associate-*l/ N/A

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

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. associate-*r/ N/A

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

      6. metadata-eval N/A

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

      7. lower-/.f64 98.2

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

   5. Applied rewrites 98.2%

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

   if 20 < (/.f64 (*.f64 x #s(literal 100 binary64)) (+.f64 x y))

   1. Initial program 99.8%

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

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{100} \]
   4. Step-by-step derivation

   5. Applied rewrites 96.8%

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

Alternative 4: 49.7% accurate, 20.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.7%

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

3. Taylor expanded in x around inf

   \[\leadsto \color{blue}{100} \]
4. Step-by-step derivation

5. Applied rewrites 49.6%

   \[\leadsto \color{blue}{100} \]
6. Add Preprocessing

Alternative 5: 2.7% accurate, 20.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.7%

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

4. Applied rewrites 50.6%

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

5. Taylor expanded in x around inf

   \[\leadsto \color{blue}{-100} \]
6. Step-by-step derivation

7. Applied rewrites 2.5%

   \[\leadsto \color{blue}{-100} \]
8. Add Preprocessing

Developer Target 1: 99.7% accurate, 0.6× 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 2024329 
(FPCore (x y)
  :name "Development.Shake.Progress:message from shake-0.15.5"
  :precision binary64

  :alt
  (! :herbie-platform default (* (/ x 1) (/ 100 (+ x y))))

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