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

Percentage Accurate: 85.6% → 98.2%

Time: 10.7s

Alternatives: 10

Speedup: 1.1×

Specification

Math

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

FPCore

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

C

double code(double x, double y, double z, double t, double a) {
	return x + ((y * (z - t)) / (a - 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 - t)) / (a - t))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 85.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t, double a) {
	return x + ((y * (z - t)) / (a - 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 - t)) / (a - t))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 98.2% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 85.5%

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

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-/.f64 N/A

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

   4. frac-2neg N/A

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

   5. div-inv N/A

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

   6. lift-*.f64 N/A

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

   7. distribute-lft-neg-in N/A

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

   8. associate-*l* N/A

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

   9. lower-fma.f64 N/A

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

   10. lower-neg.f64 N/A

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

   11. lower-*.f64 N/A

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

   12. lower-/.f64 N/A

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

   13. neg-sub0 N/A

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

   14. lift--.f64 N/A

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

   15. sub-neg N/A

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

   16. +-commutative N/A

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

   17. associate--r+ N/A

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

   18. neg-sub0 N/A

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

   19. remove-double-neg N/A

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

   20. lower--.f64 98.3

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

4. Applied rewrites 98.3%

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

Alternative 2: 83.6% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma y (- 1.0 (/ z t)) x)))
   (if (<= t -4.1e+20) t_1 (if (<= t 7.2e-56) (fma (- z t) (/ y a) x) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma(y, (1.0 - (z / t)), x);
	double tmp;
	if (t <= -4.1e+20) {
		tmp = t_1;
	} else if (t <= 7.2e-56) {
		tmp = fma((z - t), (y / a), x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(y, Float64(1.0 - Float64(z / t)), x)
	tmp = 0.0
	if (t <= -4.1e+20)
		tmp = t_1;
	elseif (t <= 7.2e-56)
		tmp = fma(Float64(z - t), Float64(y / a), x);
	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[(z / t), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]}, If[LessEqual[t, -4.1e+20], t$95$1, If[LessEqual[t, 7.2e-56], N[(N[(z - t), $MachinePrecision] * N[(y / a), $MachinePrecision] + x), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if t < -4.1e20 or 7.19999999999999956e-56 < t

   1. Initial program 77.1%

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

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. associate-/l* N/A

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

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

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

      5. lower-fma.f64 N/A

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

      6. neg-sub0 N/A

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

      7. div-sub N/A

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

      8. *-inverses N/A

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

      9. associate-+l- N/A

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

      10. neg-sub0 N/A

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

      11. mul-1-neg N/A

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

      12. +-commutative N/A

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

      13. mul-1-neg N/A

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

      14. unsub-neg N/A

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

      15. lower--.f64 N/A

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

      16. lower-/.f64 91.4

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

   5. Applied rewrites 91.4%

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

   if -4.1e20 < t < 7.19999999999999956e-56

   1. Initial program 97.2%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. clear-num N/A

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

      5. associate-/r/ N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 97.2

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

   4. Applied rewrites 97.2%

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

   5. Taylor expanded in a around inf

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 84.7

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

   7. Applied rewrites 84.7%

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

Alternative 3: 83.5% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma y (- 1.0 (/ z t)) x)))
   (if (<= t -4.2e+20) t_1 (if (<= t 7.2e-56) (fma y (/ (- z t) a) x) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma(y, (1.0 - (z / t)), x);
	double tmp;
	if (t <= -4.2e+20) {
		tmp = t_1;
	} else if (t <= 7.2e-56) {
		tmp = fma(y, ((z - t) / a), x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(y, Float64(1.0 - Float64(z / t)), x)
	tmp = 0.0
	if (t <= -4.2e+20)
		tmp = t_1;
	elseif (t <= 7.2e-56)
		tmp = fma(y, Float64(Float64(z - t) / a), x);
	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[(z / t), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]}, If[LessEqual[t, -4.2e+20], t$95$1, If[LessEqual[t, 7.2e-56], N[(y * N[(N[(z - t), $MachinePrecision] / a), $MachinePrecision] + x), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if t < -4.2e20 or 7.19999999999999956e-56 < t

   1. Initial program 77.1%

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

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. associate-/l* N/A

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

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

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

      5. lower-fma.f64 N/A

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

      6. neg-sub0 N/A

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

      7. div-sub N/A

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

      8. *-inverses N/A

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

      9. associate-+l- N/A

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

      10. neg-sub0 N/A

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

      11. mul-1-neg N/A

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

      12. +-commutative N/A

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

      13. mul-1-neg N/A

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

      14. unsub-neg N/A

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

      15. lower--.f64 N/A

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

      16. lower-/.f64 91.4

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

   5. Applied rewrites 91.4%

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

   if -4.2e20 < t < 7.19999999999999956e-56

   1. Initial program 97.2%

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

   3. Taylor expanded in a around inf

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 84.7

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

   5. Applied rewrites 84.7%

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

Alternative 4: 81.0% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(y, 1 - \frac{z}{t}, x\right)\\ \mathbf{if}\;t \leq -4.1 \cdot 10^{+20}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t \leq 7.2 \cdot 10^{-56}:\\ \;\;\;\;x + \frac{y \cdot z}{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 (/ z t)) x)))
   (if (<= t -4.1e+20) t_1 (if (<= t 7.2e-56) (+ x (/ (* y z) a)) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma(y, (1.0 - (z / t)), x);
	double tmp;
	if (t <= -4.1e+20) {
		tmp = t_1;
	} else if (t <= 7.2e-56) {
		tmp = x + ((y * z) / a);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(y, Float64(1.0 - Float64(z / t)), x)
	tmp = 0.0
	if (t <= -4.1e+20)
		tmp = t_1;
	elseif (t <= 7.2e-56)
		tmp = Float64(x + Float64(Float64(y * z) / 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[(z / t), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]}, If[LessEqual[t, -4.1e+20], t$95$1, If[LessEqual[t, 7.2e-56], N[(x + N[(N[(y * z), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if t < -4.1e20 or 7.19999999999999956e-56 < t

   1. Initial program 77.1%

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

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. associate-/l* N/A

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

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

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

      5. lower-fma.f64 N/A

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

      6. neg-sub0 N/A

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

      7. div-sub N/A

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

      8. *-inverses N/A

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

      9. associate-+l- N/A

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

      10. neg-sub0 N/A

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

      11. mul-1-neg N/A

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

      12. +-commutative N/A

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

      13. mul-1-neg N/A

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

      14. unsub-neg N/A

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

      15. lower--.f64 N/A

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

      16. lower-/.f64 91.4

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

   5. Applied rewrites 91.4%

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

   if -4.1e20 < t < 7.19999999999999956e-56

   1. Initial program 97.2%

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

   3. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 81.1

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

   5. Applied rewrites 81.1%

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

Alternative 5: 76.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -0.00047:\\ \;\;\;\;y + x\\ \mathbf{elif}\;t \leq 2 \cdot 10^{+14}:\\ \;\;\;\;x + \frac{y \cdot z}{a}\\ \mathbf{else}:\\ \;\;\;\;y + x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= t -0.00047) (+ y x) (if (<= t 2e+14) (+ x (/ (* y z) a)) (+ y x))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (t <= -0.00047) {
		tmp = y + x;
	} else if (t <= 2e+14) {
		tmp = x + ((y * z) / a);
	} else {
		tmp = y + 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 (t <= (-0.00047d0)) then
        tmp = y + x
    else if (t <= 2d+14) then
        tmp = x + ((y * z) / a)
    else
        tmp = y + 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 (t <= -0.00047) {
		tmp = y + x;
	} else if (t <= 2e+14) {
		tmp = x + ((y * z) / a);
	} else {
		tmp = y + x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if t <= -0.00047:
		tmp = y + x
	elif t <= 2e+14:
		tmp = x + ((y * z) / a)
	else:
		tmp = y + x
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (t <= -0.00047)
		tmp = Float64(y + x);
	elseif (t <= 2e+14)
		tmp = Float64(x + Float64(Float64(y * z) / a));
	else
		tmp = Float64(y + x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (t <= -0.00047)
		tmp = y + x;
	elseif (t <= 2e+14)
		tmp = x + ((y * z) / a);
	else
		tmp = y + x;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -4.69999999999999986e-4 or 2e14 < t

   1. Initial program 75.3%

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

   3. Taylor expanded in t around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 84.4

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

   5. Applied rewrites 84.4%

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

   if -4.69999999999999986e-4 < t < 2e14

   1. Initial program 97.4%

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

   3. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 78.0

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

   5. Applied rewrites 78.0%

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

Alternative 6: 77.6% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= t -0.0295) (+ y x) (if (<= t 2e+14) (fma y (/ z a) x) (+ y x))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (t <= -0.0295) {
		tmp = y + x;
	} else if (t <= 2e+14) {
		tmp = fma(y, (z / a), x);
	} else {
		tmp = y + x;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (t <= -0.0295)
		tmp = Float64(y + x);
	elseif (t <= 2e+14)
		tmp = fma(y, Float64(z / a), x);
	else
		tmp = Float64(y + x);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -0.029499999999999998 or 2e14 < t

   1. Initial program 75.3%

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

   3. Taylor expanded in t around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 84.4

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

   5. Applied rewrites 84.4%

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

   if -0.029499999999999998 < t < 2e14

   1. Initial program 97.4%

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

   3. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 77.1

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

   5. Applied rewrites 77.1%

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

Alternative 7: 96.1% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 85.5%

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

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-/.f64 N/A

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

   4. lift-*.f64 N/A

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

   5. *-commutative N/A

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

   6. associate-/l* N/A

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

   7. *-commutative N/A

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

   8. lower-fma.f64 N/A

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

   9. lower-/.f64 96.5

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

4. Applied rewrites 96.5%

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

Alternative 8: 60.4% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -5.7 \cdot 10^{+202}:\\ \;\;\;\;z \cdot \frac{y}{a}\\ \mathbf{else}:\\ \;\;\;\;y + x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= z -5.7e+202) (* z (/ y a)) (+ y x)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -5.7e+202) {
		tmp = z * (y / a);
	} else {
		tmp = y + 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 (z <= (-5.7d+202)) then
        tmp = z * (y / a)
    else
        tmp = y + 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 (z <= -5.7e+202) {
		tmp = z * (y / a);
	} else {
		tmp = y + x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if z <= -5.7e+202:
		tmp = z * (y / a)
	else:
		tmp = y + x
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (z <= -5.7e+202)
		tmp = Float64(z * Float64(y / a));
	else
		tmp = Float64(y + x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (z <= -5.7e+202)
		tmp = z * (y / a);
	else
		tmp = y + x;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -5.6999999999999997e202

   1. Initial program 84.2%

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

   3. Taylor expanded in x around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower--.f64 73.8

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

   5. Applied rewrites 73.8%

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

   6. Taylor expanded in t around 0

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

   8. Applied rewrites 46.0%

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

   10. Applied rewrites 51.0%

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

   if -5.6999999999999997e202 < z

   1. Initial program 85.6%

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

   3. Taylor expanded in t around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 69.9

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

   5. Applied rewrites 69.9%

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

Alternative 9: 60.4% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -5.7 \cdot 10^{+202}:\\ \;\;\;\;y \cdot \frac{z}{a}\\ \mathbf{else}:\\ \;\;\;\;y + x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= z -5.7e+202) (* y (/ z a)) (+ y x)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -5.7e+202) {
		tmp = y * (z / a);
	} else {
		tmp = y + 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 (z <= (-5.7d+202)) then
        tmp = y * (z / a)
    else
        tmp = y + 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 (z <= -5.7e+202) {
		tmp = y * (z / a);
	} else {
		tmp = y + x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if z <= -5.7e+202:
		tmp = y * (z / a)
	else:
		tmp = y + x
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (z <= -5.7e+202)
		tmp = Float64(y * Float64(z / a));
	else
		tmp = Float64(y + x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (z <= -5.7e+202)
		tmp = y * (z / a);
	else
		tmp = y + x;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -5.6999999999999997e202

   1. Initial program 84.2%

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

   3. Taylor expanded in x around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower--.f64 73.8

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

   5. Applied rewrites 73.8%

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

   6. Taylor expanded in t around 0

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

   8. Applied rewrites 46.0%

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

   10. Applied rewrites 46.1%

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

   if -5.6999999999999997e202 < z

   1. Initial program 85.6%

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

   3. Taylor expanded in t around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 69.9

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

   5. Applied rewrites 69.9%

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

Alternative 10: 60.2% accurate, 6.5× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t, double a) {
	return y + 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 = y + x
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 85.5%

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

3. Taylor expanded in t around inf

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

   1. +-commutative N/A

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

   2. lower-+.f64 66.1

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

5. Applied rewrites 66.1%

   \[\leadsto \color{blue}{y + x} \]
6. Add Preprocessing

Developer Target 1: 98.4% accurate, 0.8× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t, double a) {
	return x + (y / ((a - t) / (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 / ((a - t) / (z - t)))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

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

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

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