Graphics.Rendering.Plot.Render.Plot.Axis:renderAxisTicks from plot-0.2.3.4, A

Percentage Accurate: 85.7% → 98.3%

Time: 7.3s

Alternatives: 7

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ x + \frac{y \cdot \left(z - t\right)}{z - a} \end{array} \]

FPCore

(FPCore (x y z t a) :precision binary64 (+ x (/ (* y (- z t)) (- z a))))

C

double code(double x, double y, double z, double t, double a) {
	return x + ((y * (z - t)) / (z - a));
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    code = x + ((y * (z - t)) / (z - a))
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	return x + ((y * (z - t)) / (z - a));
}

Python

def code(x, y, z, t, a):
	return x + ((y * (z - t)) / (z - a))

Julia

function code(x, y, z, t, a)
	return Float64(x + Float64(Float64(y * Float64(z - t)) / Float64(z - a)))
end

MATLAB

function tmp = code(x, y, z, t, a)
	tmp = x + ((y * (z - t)) / (z - a));
end

Wolfram

code[x_, y_, z_, t_, a_] := N[(x + N[(N[(y * N[(z - t), $MachinePrecision]), $MachinePrecision] / N[(z - a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 85.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x + \frac{y \cdot \left(z - t\right)}{z - a} \end{array} \]

FPCore

(FPCore (x y z t a) :precision binary64 (+ x (/ (* y (- z t)) (- z a))))

C

double code(double x, double y, double z, double t, double a) {
	return x + ((y * (z - t)) / (z - a));
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    code = x + ((y * (z - t)) / (z - a))
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	return x + ((y * (z - t)) / (z - a));
}

Python

def code(x, y, z, t, a):
	return x + ((y * (z - t)) / (z - a))

Julia

function code(x, y, z, t, a)
	return Float64(x + Float64(Float64(y * Float64(z - t)) / Float64(z - a)))
end

MATLAB

function tmp = code(x, y, z, t, a)
	tmp = x + ((y * (z - t)) / (z - a));
end

Wolfram

code[x_, y_, z_, t_, a_] := N[(x + N[(N[(y * N[(z - t), $MachinePrecision]), $MachinePrecision] / N[(z - a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 98.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x + \frac{y}{\frac{z - a}{z - t}} \end{array} \]

FPCore

(FPCore (x y z t a) :precision binary64 (+ x (/ y (/ (- z a) (- z t)))))

C

double code(double x, double y, double z, double t, double a) {
	return x + (y / ((z - a) / (z - t)));
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    code = x + (y / ((z - a) / (z - t)))
end function

Java

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

Python

def code(x, y, z, t, a):
	return x + (y / ((z - a) / (z - t)))

Julia

function code(x, y, z, t, a)
	return Float64(x + Float64(y / Float64(Float64(z - a) / Float64(z - t))))
end

MATLAB

function tmp = code(x, y, z, t, a)
	tmp = x + (y / ((z - a) / (z - t)));
end

Wolfram

code[x_, y_, z_, t_, a_] := N[(x + N[(y / N[(N[(z - a), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 87.0%

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

   1. associate-/l* 98.8%

      \[\leadsto x + \color{blue}{\frac{y}{\frac{z - a}{z - t}}} \]

3. Simplified 98.8%

   \[\leadsto \color{blue}{x + \frac{y}{\frac{z - a}{z - t}}} \]

4. Final simplification 98.8%

   \[\leadsto x + \frac{y}{\frac{z - a}{z - t}} \]

Alternative 2: 78.0% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -4.7 \cdot 10^{+25} \lor \neg \left(a \leq 6 \cdot 10^{-119}\right):\\ \;\;\;\;x + y \cdot \frac{t}{a}\\ \mathbf{else}:\\ \;\;\;\;x + \left(z - t\right) \cdot \frac{y}{z}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= a -4.7e+25) (not (<= a 6e-119)))
   (+ x (* y (/ t a)))
   (+ x (* (- z t) (/ y z)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a <= -4.7e+25) || !(a <= 6e-119)) {
		tmp = x + (y * (t / a));
	} else {
		tmp = x + ((z - t) * (y / z));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if ((a <= (-4.7d+25)) .or. (.not. (a <= 6d-119))) then
        tmp = x + (y * (t / a))
    else
        tmp = x + ((z - t) * (y / z))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a <= -4.7e+25) || !(a <= 6e-119)) {
		tmp = x + (y * (t / a));
	} else {
		tmp = x + ((z - t) * (y / z));
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (a <= -4.7e+25) or not (a <= 6e-119):
		tmp = x + (y * (t / a))
	else:
		tmp = x + ((z - t) * (y / z))
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((a <= -4.7e+25) || !(a <= 6e-119))
		tmp = Float64(x + Float64(y * Float64(t / a)));
	else
		tmp = Float64(x + Float64(Float64(z - t) * Float64(y / z)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((a <= -4.7e+25) || ~((a <= 6e-119)))
		tmp = x + (y * (t / a));
	else
		tmp = x + ((z - t) * (y / z));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[a, -4.7e+25], N[Not[LessEqual[a, 6e-119]], $MachinePrecision]], N[(x + N[(y * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x + N[(N[(z - t), $MachinePrecision] * N[(y / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < -4.6999999999999998e25 or 6.0000000000000004e-119 < a

   1. Initial program 86.7%

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

      1. +-commutative 86.7%

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

      2. associate-*r/ 99.9%

         \[\leadsto \color{blue}{y \cdot \frac{z - t}{z - a}} + x \]

      3. fma-def 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, \frac{z - t}{z - a}, x\right)} \]
   4. Step-by-step derivation

      1. fma-udef 99.9%

         \[\leadsto \color{blue}{y \cdot \frac{z - t}{z - a} + x} \]

   5. Applied egg-rr 99.9%

      \[\leadsto \color{blue}{y \cdot \frac{z - t}{z - a} + x} \]

   6. Taylor expanded in z around 0 80.3%

      \[\leadsto \color{blue}{\frac{y \cdot t}{a}} + x \]
   7. Step-by-step derivation

      1. associate-*r/ 86.9%

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

   8. Simplified 86.9%

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

   if -4.6999999999999998e25 < a < 6.0000000000000004e-119

   1. Initial program 87.5%

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

      1. associate-*l/ 96.5%

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

   3. Simplified 96.5%

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

   4. Taylor expanded in z around inf 84.5%

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

4. Final simplification 85.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -4.7 \cdot 10^{+25} \lor \neg \left(a \leq 6 \cdot 10^{-119}\right):\\ \;\;\;\;x + y \cdot \frac{t}{a}\\ \mathbf{else}:\\ \;\;\;\;x + \left(z - t\right) \cdot \frac{y}{z}\\ \end{array} \]

Alternative 3: 79.1% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -1.38 \cdot 10^{+34}:\\ \;\;\;\;x + \frac{t - z}{\frac{a}{y}}\\ \mathbf{elif}\;a \leq 6 \cdot 10^{-119}:\\ \;\;\;\;x + \left(z - t\right) \cdot \frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot \frac{t}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= a -1.38e+34)
   (+ x (/ (- t z) (/ a y)))
   (if (<= a 6e-119) (+ x (* (- z t) (/ y z))) (+ x (* y (/ t a))))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (a <= -1.38e+34) {
		tmp = x + ((t - z) / (a / y));
	} else if (a <= 6e-119) {
		tmp = x + ((z - t) * (y / z));
	} else {
		tmp = x + (y * (t / a));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if (a <= (-1.38d+34)) then
        tmp = x + ((t - z) / (a / y))
    else if (a <= 6d-119) then
        tmp = x + ((z - t) * (y / z))
    else
        tmp = x + (y * (t / a))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (a <= -1.38e+34) {
		tmp = x + ((t - z) / (a / y));
	} else if (a <= 6e-119) {
		tmp = x + ((z - t) * (y / z));
	} else {
		tmp = x + (y * (t / a));
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if a <= -1.38e+34:
		tmp = x + ((t - z) / (a / y))
	elif a <= 6e-119:
		tmp = x + ((z - t) * (y / z))
	else:
		tmp = x + (y * (t / a))
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (a <= -1.38e+34)
		tmp = Float64(x + Float64(Float64(t - z) / Float64(a / y)));
	elseif (a <= 6e-119)
		tmp = Float64(x + Float64(Float64(z - t) * Float64(y / z)));
	else
		tmp = Float64(x + Float64(y * Float64(t / a)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (a <= -1.38e+34)
		tmp = x + ((t - z) / (a / y));
	elseif (a <= 6e-119)
		tmp = x + ((z - t) * (y / z));
	else
		tmp = x + (y * (t / a));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[a, -1.38e+34], N[(x + N[(N[(t - z), $MachinePrecision] / N[(a / y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 6e-119], N[(x + N[(N[(z - t), $MachinePrecision] * N[(y / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x + N[(y * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if a < -1.3799999999999999e34

   1. Initial program 84.2%

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

      1. +-commutative 84.2%

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

      2. associate-*r/ 99.9%

         \[\leadsto \color{blue}{y \cdot \frac{z - t}{z - a}} + x \]

      3. fma-def 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in a around inf 78.6%

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

      1. +-commutative 78.6%

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

      2. *-commutative 78.6%

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

      3. mul-1-neg 78.6%

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

      4. unsub-neg 78.6%

         \[\leadsto \color{blue}{x - \frac{y \cdot \left(z - t\right)}{a}} \]

      5. *-commutative 78.6%

         \[\leadsto x - \frac{\color{blue}{\left(z - t\right) \cdot y}}{a} \]

      6. associate-/l* 87.0%

         \[\leadsto x - \color{blue}{\frac{z - t}{\frac{a}{y}}} \]

   6. Simplified 87.0%

      \[\leadsto \color{blue}{x - \frac{z - t}{\frac{a}{y}}} \]

   if -1.3799999999999999e34 < a < 6.0000000000000004e-119

   1. Initial program 87.8%

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

      1. associate-*l/ 96.6%

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

   3. Simplified 96.6%

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

   4. Taylor expanded in z around inf 84.1%

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

   if 6.0000000000000004e-119 < a

   1. Initial program 88.7%

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

      1. +-commutative 88.7%

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

      2. associate-*r/ 100.0%

         \[\leadsto \color{blue}{y \cdot \frac{z - t}{z - a}} + x \]

      3. fma-def 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, \frac{z - t}{z - a}, x\right)} \]
   4. Step-by-step derivation

      1. fma-udef 100.0%

         \[\leadsto \color{blue}{y \cdot \frac{z - t}{z - a} + x} \]

   5. Applied egg-rr 100.0%

      \[\leadsto \color{blue}{y \cdot \frac{z - t}{z - a} + x} \]

   6. Taylor expanded in z around 0 83.0%

      \[\leadsto \color{blue}{\frac{y \cdot t}{a}} + x \]
   7. Step-by-step derivation

      1. associate-*r/ 88.6%

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

   8. Simplified 88.6%

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

4. Final simplification 86.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -1.38 \cdot 10^{+34}:\\ \;\;\;\;x + \frac{t - z}{\frac{a}{y}}\\ \mathbf{elif}\;a \leq 6 \cdot 10^{-119}:\\ \;\;\;\;x + \left(z - t\right) \cdot \frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot \frac{t}{a}\\ \end{array} \]

Alternative 4: 76.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -4.6 \cdot 10^{+87}:\\ \;\;\;\;x + y\\ \mathbf{elif}\;z \leq 1.65 \cdot 10^{+68}:\\ \;\;\;\;x + y \cdot \frac{t}{a}\\ \mathbf{else}:\\ \;\;\;\;x + y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= z -4.6e+87) (+ x y) (if (<= z 1.65e+68) (+ x (* y (/ t a))) (+ x y))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -4.6e+87) {
		tmp = x + y;
	} else if (z <= 1.65e+68) {
		tmp = x + (y * (t / a));
	} else {
		tmp = x + y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if (z <= (-4.6d+87)) then
        tmp = x + y
    else if (z <= 1.65d+68) then
        tmp = x + (y * (t / a))
    else
        tmp = x + y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -4.6e+87) {
		tmp = x + y;
	} else if (z <= 1.65e+68) {
		tmp = x + (y * (t / a));
	} else {
		tmp = x + y;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if z <= -4.6e+87:
		tmp = x + y
	elif z <= 1.65e+68:
		tmp = x + (y * (t / a))
	else:
		tmp = x + y
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (z <= -4.6e+87)
		tmp = Float64(x + y);
	elseif (z <= 1.65e+68)
		tmp = Float64(x + Float64(y * Float64(t / a)));
	else
		tmp = Float64(x + y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (z <= -4.6e+87)
		tmp = x + y;
	elseif (z <= 1.65e+68)
		tmp = x + (y * (t / a));
	else
		tmp = x + y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[z, -4.6e+87], N[(x + y), $MachinePrecision], If[LessEqual[z, 1.65e+68], N[(x + N[(y * N[(t / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x + y), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if z < -4.6000000000000003e87 or 1.65e68 < z

   1. Initial program 73.4%

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

      1. +-commutative 73.4%

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

      2. associate-*r/ 99.9%

         \[\leadsto \color{blue}{y \cdot \frac{z - t}{z - a}} + x \]

      3. fma-def 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in z around inf 83.5%

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

   if -4.6000000000000003e87 < z < 1.65e68

   1. Initial program 94.3%

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

      1. +-commutative 94.3%

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

      2. associate-*r/ 98.2%

         \[\leadsto \color{blue}{y \cdot \frac{z - t}{z - a}} + x \]

      3. fma-def 98.2%

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

   3. Simplified 98.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, \frac{z - t}{z - a}, x\right)} \]
   4. Step-by-step derivation

      1. fma-udef 98.2%

         \[\leadsto \color{blue}{y \cdot \frac{z - t}{z - a} + x} \]

   5. Applied egg-rr 98.2%

      \[\leadsto \color{blue}{y \cdot \frac{z - t}{z - a} + x} \]

   6. Taylor expanded in z around 0 75.5%

      \[\leadsto \color{blue}{\frac{y \cdot t}{a}} + x \]
   7. Step-by-step derivation

      1. associate-*r/ 79.0%

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

   8. Simplified 79.0%

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

4. Final simplification 80.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -4.6 \cdot 10^{+87}:\\ \;\;\;\;x + y\\ \mathbf{elif}\;z \leq 1.65 \cdot 10^{+68}:\\ \;\;\;\;x + y \cdot \frac{t}{a}\\ \mathbf{else}:\\ \;\;\;\;x + y\\ \end{array} \]

Alternative 5: 96.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x + \left(z - t\right) \cdot \frac{y}{z - a} \end{array} \]

FPCore

(FPCore (x y z t a) :precision binary64 (+ x (* (- z t) (/ y (- z a)))))

C

double code(double x, double y, double z, double t, double a) {
	return x + ((z - t) * (y / (z - a)));
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    code = x + ((z - t) * (y / (z - a)))
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	return x + ((z - t) * (y / (z - a)));
}

Python

def code(x, y, z, t, a):
	return x + ((z - t) * (y / (z - a)))

Julia

function code(x, y, z, t, a)
	return Float64(x + Float64(Float64(z - t) * Float64(y / Float64(z - a))))
end

MATLAB

function tmp = code(x, y, z, t, a)
	tmp = x + ((z - t) * (y / (z - a)));
end

Wolfram

code[x_, y_, z_, t_, a_] := N[(x + N[(N[(z - t), $MachinePrecision] * N[(y / N[(z - a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 87.0%

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

   1. associate-*l/ 97.0%

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

3. Simplified 97.0%

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

4. Final simplification 97.0%

   \[\leadsto x + \left(z - t\right) \cdot \frac{y}{z - a} \]

Alternative 6: 62.6% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -6 \cdot 10^{+103}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq 4.2 \cdot 10^{+130}:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= a -6e+103) x (if (<= a 4.2e+130) (+ x y) x)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (a <= -6e+103) {
		tmp = x;
	} else if (a <= 4.2e+130) {
		tmp = x + y;
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if (a <= (-6d+103)) then
        tmp = x
    else if (a <= 4.2d+130) then
        tmp = x + y
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (a <= -6e+103) {
		tmp = x;
	} else if (a <= 4.2e+130) {
		tmp = x + y;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if a <= -6e+103:
		tmp = x
	elif a <= 4.2e+130:
		tmp = x + y
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (a <= -6e+103)
		tmp = x;
	elseif (a <= 4.2e+130)
		tmp = Float64(x + y);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (a <= -6e+103)
		tmp = x;
	elseif (a <= 4.2e+130)
		tmp = x + y;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[a, -6e+103], x, If[LessEqual[a, 4.2e+130], N[(x + y), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if a < -6e103 or 4.19999999999999981e130 < a

   1. Initial program 87.0%

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

      1. +-commutative 87.0%

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

      2. associate-*r/ 99.9%

         \[\leadsto \color{blue}{y \cdot \frac{z - t}{z - a}} + x \]

      3. fma-def 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in y around 0 74.5%

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

   if -6e103 < a < 4.19999999999999981e130

   1. Initial program 87.1%

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

      1. +-commutative 87.1%

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

      2. associate-*r/ 98.2%

         \[\leadsto \color{blue}{y \cdot \frac{z - t}{z - a}} + x \]

      3. fma-def 98.2%

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

   3. Simplified 98.2%

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

   4. Taylor expanded in z around inf 67.0%

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

4. Final simplification 69.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -6 \cdot 10^{+103}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq 4.2 \cdot 10^{+130}:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]

Alternative 7: 50.1% accurate, 11.0× speedup

Math

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

FPCore

(FPCore (x y z t a) :precision binary64 x)

C

double code(double x, double y, double z, double t, double a) {
	return x;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    code = x
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	return x;
}

Python

def code(x, y, z, t, a):
	return x

Julia

function code(x, y, z, t, a)
	return x
end

MATLAB

function tmp = code(x, y, z, t, a)
	tmp = x;
end

Wolfram

code[x_, y_, z_, t_, a_] := x

Derivation

1. Initial program 87.0%

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

   1. +-commutative 87.0%

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

   2. associate-*r/ 98.8%

      \[\leadsto \color{blue}{y \cdot \frac{z - t}{z - a}} + x \]

   3. fma-def 98.8%

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

3. Simplified 98.8%

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

4. Taylor expanded in y around 0 58.7%

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

5. Final simplification 58.7%

   \[\leadsto x \]

Developer target: 98.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x + \frac{y}{\frac{z - a}{z - t}} \end{array} \]

FPCore

(FPCore (x y z t a) :precision binary64 (+ x (/ y (/ (- z a) (- z t)))))

C

double code(double x, double y, double z, double t, double a) {
	return x + (y / ((z - a) / (z - t)));
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    code = x + (y / ((z - a) / (z - t)))
end function

Java

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

Python

def code(x, y, z, t, a):
	return x + (y / ((z - a) / (z - t)))

Julia

function code(x, y, z, t, a)
	return Float64(x + Float64(y / Float64(Float64(z - a) / Float64(z - t))))
end

MATLAB

function tmp = code(x, y, z, t, a)
	tmp = x + (y / ((z - a) / (z - t)));
end

Wolfram

code[x_, y_, z_, t_, a_] := N[(x + N[(y / N[(N[(z - a), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Reproduce

herbie shell --seed 2023199 
(FPCore (x y z t a)
  :name "Graphics.Rendering.Plot.Render.Plot.Axis:renderAxisTicks from plot-0.2.3.4, A"
  :precision binary64

  :herbie-target
  (+ x (/ y (/ (- z a) (- z t))))

  (+ x (/ (* y (- z t)) (- z a))))