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

Percentage Accurate: 98.0% → 98.0%

Time: 10.1s

Alternatives: 12

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ x + y \cdot \frac{z - t}{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(y * Float64(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[(y * N[(N[(z - t), $MachinePrecision] / N[(z - a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 98.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x + y \cdot \frac{z - t}{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(y * Float64(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[(y * N[(N[(z - t), $MachinePrecision] / N[(z - a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 98.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x + y \cdot \frac{z - t}{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(y * Float64(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[(y * N[(N[(z - t), $MachinePrecision] / N[(z - a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 98.1%

   \[x + y \cdot \frac{z - t}{z - a} \]
2. Add Preprocessing
3. Add Preprocessing

Alternative 2: 66.2% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x + y \cdot \frac{z - t}{z - a}\\ \mathbf{if}\;t\_1 \leq -\infty:\\ \;\;\;\;t \cdot \frac{y}{a}\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+304}:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;\frac{y \cdot t}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (+ x (* y (/ (- z t) (- z a))))))
   (if (<= t_1 (- INFINITY))
     (* t (/ y a))
     (if (<= t_1 5e+304) (+ x y) (/ (* y t) a)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = x + (y * ((z - t) / (z - a)));
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = t * (y / a);
	} else if (t_1 <= 5e+304) {
		tmp = x + y;
	} else {
		tmp = (y * t) / a;
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = x + (y * ((z - t) / (z - a)));
	double tmp;
	if (t_1 <= -Double.POSITIVE_INFINITY) {
		tmp = t * (y / a);
	} else if (t_1 <= 5e+304) {
		tmp = x + y;
	} else {
		tmp = (y * t) / a;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = x + (y * ((z - t) / (z - a)))
	tmp = 0
	if t_1 <= -math.inf:
		tmp = t * (y / a)
	elif t_1 <= 5e+304:
		tmp = x + y
	else:
		tmp = (y * t) / a
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(x + Float64(y * Float64(Float64(z - t) / Float64(z - a))))
	tmp = 0.0
	if (t_1 <= Float64(-Inf))
		tmp = Float64(t * Float64(y / a));
	elseif (t_1 <= 5e+304)
		tmp = Float64(x + y);
	else
		tmp = Float64(Float64(y * t) / a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = x + (y * ((z - t) / (z - a)));
	tmp = 0.0;
	if (t_1 <= -Inf)
		tmp = t * (y / a);
	elseif (t_1 <= 5e+304)
		tmp = x + y;
	else
		tmp = (y * t) / a;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(x + N[(y * N[(N[(z - t), $MachinePrecision] / N[(z - a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(t * N[(y / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+304], N[(x + y), $MachinePrecision], N[(N[(y * t), $MachinePrecision] / a), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (+.f64 x (*.f64 y (/.f64 (-.f64 z t) (-.f64 z a)))) < -inf.0

   1. Initial program 89.4%

      \[x + y \cdot \frac{z - t}{z - a} \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 72.6

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

   5. Applied rewrites 72.6%

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

   6. Taylor expanded in x around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 72.6

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

   8. Applied rewrites 72.6%

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

      1. *-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 72.6

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

   10. Applied rewrites 72.6%

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

   if -inf.0 < (+.f64 x (*.f64 y (/.f64 (-.f64 z t) (-.f64 z a)))) < 4.9999999999999997e304

   1. Initial program 99.5%

      \[x + y \cdot \frac{z - t}{z - a} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 72.6

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

   5. Applied rewrites 72.6%

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

   if 4.9999999999999997e304 < (+.f64 x (*.f64 y (/.f64 (-.f64 z t) (-.f64 z a))))

   1. Initial program 82.8%

      \[x + y \cdot \frac{z - t}{z - a} \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 75.0

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

   5. Applied rewrites 75.0%

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

   6. Taylor expanded in x around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 75.0

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

   8. Applied rewrites 75.0%

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

4. Final simplification 72.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x + y \cdot \frac{z - t}{z - a} \leq -\infty:\\ \;\;\;\;t \cdot \frac{y}{a}\\ \mathbf{elif}\;x + y \cdot \frac{z - t}{z - a} \leq 5 \cdot 10^{+304}:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;\frac{y \cdot t}{a}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 66.2% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := t \cdot \frac{y}{a}\\ t_2 := x + y \cdot \frac{z - t}{z - a}\\ \mathbf{if}\;t\_2 \leq -\infty:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 \leq 5 \cdot 10^{+304}:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (* t (/ y a))) (t_2 (+ x (* y (/ (- z t) (- z a))))))
   (if (<= t_2 (- INFINITY)) t_1 (if (<= t_2 5e+304) (+ x y) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = t * (y / a);
	double t_2 = x + (y * ((z - t) / (z - a)));
	double tmp;
	if (t_2 <= -((double) INFINITY)) {
		tmp = t_1;
	} else if (t_2 <= 5e+304) {
		tmp = x + y;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = t * (y / a);
	double t_2 = x + (y * ((z - t) / (z - a)));
	double tmp;
	if (t_2 <= -Double.POSITIVE_INFINITY) {
		tmp = t_1;
	} else if (t_2 <= 5e+304) {
		tmp = x + y;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = t * (y / a)
	t_2 = x + (y * ((z - t) / (z - a)))
	tmp = 0
	if t_2 <= -math.inf:
		tmp = t_1
	elif t_2 <= 5e+304:
		tmp = x + y
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(t * Float64(y / a))
	t_2 = Float64(x + Float64(y * Float64(Float64(z - t) / Float64(z - a))))
	tmp = 0.0
	if (t_2 <= Float64(-Inf))
		tmp = t_1;
	elseif (t_2 <= 5e+304)
		tmp = Float64(x + y);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = t * (y / a);
	t_2 = x + (y * ((z - t) / (z - a)));
	tmp = 0.0;
	if (t_2 <= -Inf)
		tmp = t_1;
	elseif (t_2 <= 5e+304)
		tmp = x + y;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(t * N[(y / a), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(x + N[(y * N[(N[(z - t), $MachinePrecision] / N[(z - a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$2, (-Infinity)], t$95$1, If[LessEqual[t$95$2, 5e+304], N[(x + y), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 x (*.f64 y (/.f64 (-.f64 z t) (-.f64 z a)))) < -inf.0 or 4.9999999999999997e304 < (+.f64 x (*.f64 y (/.f64 (-.f64 z t) (-.f64 z a))))

   1. Initial program 86.9%

      \[x + y \cdot \frac{z - t}{z - a} \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 73.5

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

   5. Applied rewrites 73.5%

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

   6. Taylor expanded in x around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 73.5

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

   8. Applied rewrites 73.5%

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

      1. *-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 70.8

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

   10. Applied rewrites 70.8%

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

   if -inf.0 < (+.f64 x (*.f64 y (/.f64 (-.f64 z t) (-.f64 z a)))) < 4.9999999999999997e304

   1. Initial program 99.5%

      \[x + y \cdot \frac{z - t}{z - a} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 72.6

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

   5. Applied rewrites 72.6%

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

4. Final simplification 72.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x + y \cdot \frac{z - t}{z - a} \leq -\infty:\\ \;\;\;\;t \cdot \frac{y}{a}\\ \mathbf{elif}\;x + y \cdot \frac{z - t}{z - a} \leq 5 \cdot 10^{+304}:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;t \cdot \frac{y}{a}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 81.0% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z - t}{z - a}\\ \mathbf{if}\;t\_1 \leq 10^{-8}:\\ \;\;\;\;\mathsf{fma}\left(t, \frac{y}{a}, x\right)\\ \mathbf{elif}\;t\_1 \leq 10^{+134}:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{t}{a - z}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- z a))))
   (if (<= t_1 1e-8)
     (fma t (/ y a) x)
     (if (<= t_1 1e+134) (+ x y) (* y (/ t (- a z)))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (z - a);
	double tmp;
	if (t_1 <= 1e-8) {
		tmp = fma(t, (y / a), x);
	} else if (t_1 <= 1e+134) {
		tmp = x + y;
	} else {
		tmp = y * (t / (a - z));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(z - a))
	tmp = 0.0
	if (t_1 <= 1e-8)
		tmp = fma(t, Float64(y / a), x);
	elseif (t_1 <= 1e+134)
		tmp = Float64(x + y);
	else
		tmp = Float64(y * Float64(t / Float64(a - z)));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(z - t), $MachinePrecision] / N[(z - a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, 1e-8], N[(t * N[(y / a), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[t$95$1, 1e+134], N[(x + y), $MachinePrecision], N[(y * N[(t / N[(a - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 z t) (-.f64 z a)) < 1e-8

   1. Initial program 97.5%

      \[x + y \cdot \frac{z - t}{z - a} \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 78.3

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

   5. Applied rewrites 78.3%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. +-commutative N/A

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

      4. lift-/.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. associate-/l* N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 78.4

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

   7. Applied rewrites 78.4%

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

   if 1e-8 < (/.f64 (-.f64 z t) (-.f64 z a)) < 9.99999999999999921e133

   1. Initial program 100.0%

      \[x + y \cdot \frac{z - t}{z - a} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 92.5

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

   5. Applied rewrites 92.5%

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

   if 9.99999999999999921e133 < (/.f64 (-.f64 z t) (-.f64 z a))

   1. Initial program 89.4%

      \[x + y \cdot \frac{z - t}{z - a} \]
   2. Add Preprocessing

   3. Taylor expanded in t around inf

      \[\leadsto \color{blue}{-1 \cdot \frac{t \cdot y}{z - a}} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

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

      2. distribute-neg-frac2 N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. sub-neg N/A

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

      7. +-commutative N/A

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

      8. distribute-neg-in N/A

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

      9. remove-double-neg N/A

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

      10. neg-mul-1 N/A

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

      11. lower-+.f64 N/A

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

      12. neg-mul-1 N/A

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

      13. lower-neg.f64 74.4

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

   5. Applied rewrites 74.4%

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

      1. lift-neg.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 73.8

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

      7. lift-+.f64 N/A

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

      8. lift-neg.f64 N/A

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

      9. unsub-neg N/A

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

      10. lower--.f64 73.8

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

   7. Applied rewrites 73.8%

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

4. Final simplification 84.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{z - t}{z - a} \leq 10^{-8}:\\ \;\;\;\;\mathsf{fma}\left(t, \frac{y}{a}, x\right)\\ \mathbf{elif}\;\frac{z - t}{z - a} \leq 10^{+134}:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{t}{a - z}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 81.0% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z - t}{z - a}\\ \mathbf{if}\;t\_1 \leq 10^{-8}:\\ \;\;\;\;\mathsf{fma}\left(t, \frac{y}{a}, x\right)\\ \mathbf{elif}\;t\_1 \leq 10^{+46}:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y, \frac{t}{a}, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- z a))))
   (if (<= t_1 1e-8)
     (fma t (/ y a) x)
     (if (<= t_1 1e+46) (+ x y) (fma y (/ t a) x)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (z - a);
	double tmp;
	if (t_1 <= 1e-8) {
		tmp = fma(t, (y / a), x);
	} else if (t_1 <= 1e+46) {
		tmp = x + y;
	} else {
		tmp = fma(y, (t / a), x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(z - a))
	tmp = 0.0
	if (t_1 <= 1e-8)
		tmp = fma(t, Float64(y / a), x);
	elseif (t_1 <= 1e+46)
		tmp = Float64(x + y);
	else
		tmp = fma(y, Float64(t / a), x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(z - t), $MachinePrecision] / N[(z - a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, 1e-8], N[(t * N[(y / a), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[t$95$1, 1e+46], N[(x + y), $MachinePrecision], N[(y * N[(t / a), $MachinePrecision] + x), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 z t) (-.f64 z a)) < 1e-8

   1. Initial program 97.5%

      \[x + y \cdot \frac{z - t}{z - a} \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 78.3

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

   5. Applied rewrites 78.3%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. +-commutative N/A

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

      4. lift-/.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. associate-/l* N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 78.4

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

   7. Applied rewrites 78.4%

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

   if 1e-8 < (/.f64 (-.f64 z t) (-.f64 z a)) < 9.9999999999999999e45

   1. Initial program 100.0%

      \[x + y \cdot \frac{z - t}{z - a} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 97.5

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

   5. Applied rewrites 97.5%

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

   if 9.9999999999999999e45 < (/.f64 (-.f64 z t) (-.f64 z a))

   1. Initial program 94.5%

      \[x + y \cdot \frac{z - t}{z - a} \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 64.4

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

   5. Applied rewrites 64.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, \frac{t}{a}, x\right)} \]
3. Recombined 3 regimes into one program.

4. Final simplification 83.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{z - t}{z - a} \leq 10^{-8}:\\ \;\;\;\;\mathsf{fma}\left(t, \frac{y}{a}, x\right)\\ \mathbf{elif}\;\frac{z - t}{z - a} \leq 10^{+46}:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y, \frac{t}{a}, x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 80.1% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z - t}{z - a}\\ t_2 := \mathsf{fma}\left(t, \frac{y}{a}, x\right)\\ \mathbf{if}\;t\_1 \leq 10^{-8}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+135}:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- z a))) (t_2 (fma t (/ y a) x)))
   (if (<= t_1 1e-8) t_2 (if (<= t_1 5e+135) (+ x y) t_2))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (z - a);
	double t_2 = fma(t, (y / a), x);
	double tmp;
	if (t_1 <= 1e-8) {
		tmp = t_2;
	} else if (t_1 <= 5e+135) {
		tmp = x + y;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(z - a))
	t_2 = fma(t, Float64(y / a), x)
	tmp = 0.0
	if (t_1 <= 1e-8)
		tmp = t_2;
	elseif (t_1 <= 5e+135)
		tmp = Float64(x + y);
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(z - t), $MachinePrecision] / N[(z - a), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t * N[(y / a), $MachinePrecision] + x), $MachinePrecision]}, If[LessEqual[t$95$1, 1e-8], t$95$2, If[LessEqual[t$95$1, 5e+135], N[(x + y), $MachinePrecision], t$95$2]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 z t) (-.f64 z a)) < 1e-8 or 5.00000000000000029e135 < (/.f64 (-.f64 z t) (-.f64 z a))

   1. Initial program 96.5%

      \[x + y \cdot \frac{z - t}{z - a} \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 76.3

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

   5. Applied rewrites 76.3%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. +-commutative N/A

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

      4. lift-/.f64 N/A

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

      5. lift-*.f64 N/A

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

      6. *-commutative N/A

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

      7. associate-/l* N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 76.3

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

   7. Applied rewrites 76.3%

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

   if 1e-8 < (/.f64 (-.f64 z t) (-.f64 z a)) < 5.00000000000000029e135

   1. Initial program 100.0%

      \[x + y \cdot \frac{z - t}{z - a} \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 91.8

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

   5. Applied rewrites 91.8%

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

4. Final simplification 83.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{z - t}{z - a} \leq 10^{-8}:\\ \;\;\;\;\mathsf{fma}\left(t, \frac{y}{a}, x\right)\\ \mathbf{elif}\;\frac{z - t}{z - a} \leq 5 \cdot 10^{+135}:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(t, \frac{y}{a}, x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 83.6% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -9.2 \cdot 10^{-38}:\\ \;\;\;\;\mathsf{fma}\left(y, \frac{z}{z - a}, x\right)\\ \mathbf{elif}\;z \leq 6 \cdot 10^{-32}:\\ \;\;\;\;\mathsf{fma}\left(y, \frac{t - z}{a}, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y, 1 - \frac{t}{z}, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= z -9.2e-38)
   (fma y (/ z (- z a)) x)
   (if (<= z 6e-32) (fma y (/ (- t z) a) x) (fma y (- 1.0 (/ t z)) x))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -9.2e-38) {
		tmp = fma(y, (z / (z - a)), x);
	} else if (z <= 6e-32) {
		tmp = fma(y, ((t - z) / a), x);
	} else {
		tmp = fma(y, (1.0 - (t / z)), x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (z <= -9.2e-38)
		tmp = fma(y, Float64(z / Float64(z - a)), x);
	elseif (z <= 6e-32)
		tmp = fma(y, Float64(Float64(t - z) / a), x);
	else
		tmp = fma(y, Float64(1.0 - Float64(t / z)), x);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if z < -9.20000000000000007e-38

   1. Initial program 100.0%

      \[x + y \cdot \frac{z - t}{z - a} \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 87.8

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

   5. Applied rewrites 87.8%

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

   if -9.20000000000000007e-38 < z < 6.0000000000000001e-32

   1. Initial program 96.1%

      \[x + y \cdot \frac{z - t}{z - a} \]
   2. Add Preprocessing

   3. Taylor expanded in a around inf

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. associate-/l* N/A

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

      4. distribute-rgt-neg-in N/A

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

      5. mul-1-neg N/A

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

      6. lower-fma.f64 N/A

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

      7. associate-*r/ N/A

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

      8. lower-/.f64 N/A

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

      9. mul-1-neg N/A

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

      10. sub-neg N/A

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

      11. +-commutative N/A

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

      12. distribute-neg-in N/A

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

      13. unsub-neg N/A

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

      14. remove-double-neg N/A

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

      15. lower--.f64 87.2

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

   5. Applied rewrites 87.2%

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

   if 6.0000000000000001e-32 < z

   1. Initial program 100.0%

      \[x + y \cdot \frac{z - t}{z - a} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. div-sub N/A

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

      4. sub-neg N/A

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

      5. *-inverses N/A

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

      6. mul-1-neg N/A

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

      7. lower-fma.f64 N/A

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

      8. mul-1-neg N/A

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

      9. unsub-neg N/A

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

      10. lower--.f64 N/A

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

      11. lower-/.f64 94.3

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

   5. Applied rewrites 94.3%

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

Alternative 8: 80.6% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -3.4 \cdot 10^{-195}:\\ \;\;\;\;\mathsf{fma}\left(y, \frac{z}{z - a}, x\right)\\ \mathbf{elif}\;z \leq 2.5 \cdot 10^{-79}:\\ \;\;\;\;x + \frac{y \cdot t}{a}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y, 1 - \frac{t}{z}, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= z -3.4e-195)
   (fma y (/ z (- z a)) x)
   (if (<= z 2.5e-79) (+ x (/ (* y t) a)) (fma y (- 1.0 (/ t z)) x))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -3.4e-195) {
		tmp = fma(y, (z / (z - a)), x);
	} else if (z <= 2.5e-79) {
		tmp = x + ((y * t) / a);
	} else {
		tmp = fma(y, (1.0 - (t / z)), x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (z <= -3.4e-195)
		tmp = fma(y, Float64(z / Float64(z - a)), x);
	elseif (z <= 2.5e-79)
		tmp = Float64(x + Float64(Float64(y * t) / a));
	else
		tmp = fma(y, Float64(1.0 - Float64(t / z)), x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[z, -3.4e-195], N[(y * N[(z / N[(z - a), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[z, 2.5e-79], N[(x + N[(N[(y * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], N[(y * N[(1.0 - N[(t / z), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -3.40000000000000001e-195

   1. Initial program 98.9%

      \[x + y \cdot \frac{z - t}{z - a} \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 83.7

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

   5. Applied rewrites 83.7%

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

   if -3.40000000000000001e-195 < z < 2.5e-79

   1. Initial program 95.4%

      \[x + y \cdot \frac{z - t}{z - a} \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 90.1

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

   5. Applied rewrites 90.1%

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

   if 2.5e-79 < z

   1. Initial program 100.0%

      \[x + y \cdot \frac{z - t}{z - a} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. div-sub N/A

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

      4. sub-neg N/A

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

      5. *-inverses N/A

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

      6. mul-1-neg N/A

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

      7. lower-fma.f64 N/A

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

      8. mul-1-neg N/A

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

      9. unsub-neg N/A

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

      10. lower--.f64 N/A

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

      11. lower-/.f64 88.4

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

   5. Applied rewrites 88.4%

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

Alternative 9: 81.7% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(y, 1 - \frac{t}{z}, x\right)\\ \mathbf{if}\;z \leq -1.05 \cdot 10^{-35}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 2.5 \cdot 10^{-79}:\\ \;\;\;\;x + \frac{y \cdot t}{a}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma y (- 1.0 (/ t z)) x)))
   (if (<= z -1.05e-35) t_1 (if (<= z 2.5e-79) (+ x (/ (* y t) a)) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma(y, (1.0 - (t / z)), x);
	double tmp;
	if (z <= -1.05e-35) {
		tmp = t_1;
	} else if (z <= 2.5e-79) {
		tmp = x + ((y * t) / a);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(y, Float64(1.0 - Float64(t / z)), x)
	tmp = 0.0
	if (z <= -1.05e-35)
		tmp = t_1;
	elseif (z <= 2.5e-79)
		tmp = Float64(x + Float64(Float64(y * t) / a));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(y * N[(1.0 - N[(t / z), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]}, If[LessEqual[z, -1.05e-35], t$95$1, If[LessEqual[z, 2.5e-79], N[(x + N[(N[(y * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -1.05e-35 or 2.5e-79 < z

   1. Initial program 100.0%

      \[x + y \cdot \frac{z - t}{z - a} \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. div-sub N/A

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

      4. sub-neg N/A

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

      5. *-inverses N/A

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

      6. mul-1-neg N/A

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

      7. lower-fma.f64 N/A

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

      8. mul-1-neg N/A

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

      9. unsub-neg N/A

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

      10. lower--.f64 N/A

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

      11. lower-/.f64 86.9

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

   5. Applied rewrites 86.9%

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

   if -1.05e-35 < z < 2.5e-79

   1. Initial program 95.8%

      \[x + y \cdot \frac{z - t}{z - a} \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 84.5

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

   5. Applied rewrites 84.5%

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

Alternative 10: 95.9% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 98.1%

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

   1. lift--.f64 N/A

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

   2. lift--.f64 N/A

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

   3. frac-2neg N/A

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

   4. frac-2neg N/A

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

   5. lift-/.f64 N/A

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

   6. lift-*.f64 N/A

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

   7. +-commutative N/A

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

   8. lift-*.f64 N/A

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

   9. *-commutative N/A

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

   10. lift-/.f64 N/A

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

   11. div-inv N/A

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

   12. associate-*l* N/A

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

   13. *-commutative N/A

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

   14. lower-fma.f64 N/A

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

   15. associate-*l/ N/A

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

   16. *-lft-identity N/A

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

   17. lower-/.f64 95.7

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

4. Applied rewrites 95.7%

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

Alternative 11: 60.7% accurate, 6.5× speedup

Math

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

FPCore

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

C

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

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
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_] := N[(x + y), $MachinePrecision]

Derivation

1. Initial program 98.1%

   \[x + y \cdot \frac{z - t}{z - a} \]
2. Add Preprocessing

3. Taylor expanded in z around inf

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

   1. +-commutative N/A

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

   2. lower-+.f64 65.1

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

5. Applied rewrites 65.1%

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

6. Final simplification 65.1%

   \[\leadsto x + y \]
7. Add Preprocessing

Alternative 12: 18.8% accurate, 26.0× speedup

Math

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

FPCore

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

C

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

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 = y
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 98.1%

   \[x + y \cdot \frac{z - t}{z - a} \]
2. Add Preprocessing

3. Taylor expanded in t around 0

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

   1. +-commutative N/A

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

   2. associate-/l* N/A

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

   3. lower-fma.f64 N/A

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

   4. lower-/.f64 N/A

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

   5. lower--.f64 74.5

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

5. Applied rewrites 74.5%

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

6. Taylor expanded in y around inf

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

   1. associate-/l* N/A

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

   2. lower-*.f64 N/A

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

   3. lower-/.f64 N/A

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

   4. lower--.f64 26.6

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

8. Applied rewrites 26.6%

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

9. Taylor expanded in z around inf

   \[\leadsto y \cdot \color{blue}{1} \]
10. Step-by-step derivation

11. Applied rewrites 22.2%

    \[\leadsto y \cdot \color{blue}{1} \]
12. Step-by-step derivation

    1. *-rgt-identity 22.2

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

13. Applied rewrites 22.2%

    \[\leadsto \color{blue}{y} \]
14. Add Preprocessing

Developer Target 1: 98.2% accurate, 0.8× 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 2024219 
(FPCore (x y z t a)
  :name "Graphics.Rendering.Plot.Render.Plot.Axis:renderAxisLine from plot-0.2.3.4, A"
  :precision binary64

  :alt
  (! :herbie-platform default (+ x (/ y (/ (- z a) (- z t)))))

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