Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, H

Percentage Accurate: 95.5% → 97.9%

Time: 3.9s

Alternatives: 13

Speedup: 1.4×

• 27.6% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 95.5% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 97.9% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq 1.8 \cdot 10^{-44}:\\ \;\;\;\;\mathsf{fma}\left(\frac{t}{z} \cdot 0.3333333333333333, \frac{1}{y}, \mathsf{fma}\left(-0.3333333333333333, \frac{y}{z}, x\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\left(x - \frac{\frac{y}{z}}{3}\right) + \frac{t}{\left(z \cdot 3\right) \cdot y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= t 1.8e-44)
   (fma
    (* (/ t z) 0.3333333333333333)
    (/ 1.0 y)
    (fma -0.3333333333333333 (/ y z) x))
   (+ (- x (/ (/ y z) 3.0)) (/ t (* (* z 3.0) y)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (t <= 1.8e-44) {
		tmp = fma(((t / z) * 0.3333333333333333), (1.0 / y), fma(-0.3333333333333333, (y / z), x));
	} else {
		tmp = (x - ((y / z) / 3.0)) + (t / ((z * 3.0) * y));
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (t <= 1.8e-44)
		tmp = fma(Float64(Float64(t / z) * 0.3333333333333333), Float64(1.0 / y), fma(-0.3333333333333333, Float64(y / z), x));
	else
		tmp = Float64(Float64(x - Float64(Float64(y / z) / 3.0)) + Float64(t / Float64(Float64(z * 3.0) * y)));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[t, 1.8e-44], N[(N[(N[(t / z), $MachinePrecision] * 0.3333333333333333), $MachinePrecision] * N[(1.0 / y), $MachinePrecision] + N[(-0.3333333333333333 * N[(y / z), $MachinePrecision] + x), $MachinePrecision]), $MachinePrecision], N[(N[(x - N[(N[(y / z), $MachinePrecision] / 3.0), $MachinePrecision]), $MachinePrecision] + N[(t / N[(N[(z * 3.0), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < 1.7999999999999999e-44

   1. Initial program 95.5%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. +-commutative N/A

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

      6. lift-/.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. associate-/r* N/A

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

      10. mult-flip N/A

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

      11. mult-flip N/A

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

      12. metadata-eval N/A

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

      13. times-frac N/A

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

      14. metadata-eval N/A

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

      15. associate-*l* N/A

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

      16. mult-flip N/A

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

      17. *-commutative N/A

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

      18. lower-fma.f64 N/A

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

   3. Applied rewrites 95.7%

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

   if 1.7999999999999999e-44 < t

   1. Initial program 95.5%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-/r* N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 95.5

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

   3. Applied rewrites 95.5%

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

Alternative 2: 95.7% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 3.6 \cdot 10^{-252}:\\ \;\;\;\;x - \frac{\left(\frac{t}{y} - y\right) \cdot -0.3333333333333333}{z}\\ \mathbf{else}:\\ \;\;\;\;\left(x - \frac{y}{z \cdot 3}\right) + \frac{t}{\left(z \cdot 3\right) \cdot y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y 3.6e-252)
   (- x (/ (* (- (/ t y) y) -0.3333333333333333) z))
   (+ (- x (/ y (* z 3.0))) (/ t (* (* z 3.0) y)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= 3.6e-252) {
		tmp = x - ((((t / y) - y) * -0.3333333333333333) / z);
	} else {
		tmp = (x - (y / (z * 3.0))) + (t / ((z * 3.0) * y));
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (y <= 3.6d-252) then
        tmp = x - ((((t / y) - y) * (-0.3333333333333333d0)) / z)
    else
        tmp = (x - (y / (z * 3.0d0))) + (t / ((z * 3.0d0) * y))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= 3.6e-252) {
		tmp = x - ((((t / y) - y) * -0.3333333333333333) / z);
	} else {
		tmp = (x - (y / (z * 3.0))) + (t / ((z * 3.0) * y));
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if y <= 3.6e-252:
		tmp = x - ((((t / y) - y) * -0.3333333333333333) / z)
	else:
		tmp = (x - (y / (z * 3.0))) + (t / ((z * 3.0) * y))
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= 3.6e-252)
		tmp = Float64(x - Float64(Float64(Float64(Float64(t / y) - y) * -0.3333333333333333) / z));
	else
		tmp = Float64(Float64(x - Float64(y / Float64(z * 3.0))) + Float64(t / Float64(Float64(z * 3.0) * y)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (y <= 3.6e-252)
		tmp = x - ((((t / y) - y) * -0.3333333333333333) / z);
	else
		tmp = (x - (y / (z * 3.0))) + (t / ((z * 3.0) * y));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[y, 3.6e-252], N[(x - N[(N[(N[(N[(t / y), $MachinePrecision] - y), $MachinePrecision] * -0.3333333333333333), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision], N[(N[(x - N[(y / N[(z * 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(t / N[(N[(z * 3.0), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 3.60000000000000023e-252

   1. Initial program 95.5%

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

   3. Applied rewrites 95.7%

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

   if 3.60000000000000023e-252 < y

   1. Initial program 95.5%

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

Alternative 3: 95.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 3.4 \cdot 10^{-187}:\\ \;\;\;\;x - \frac{\left(\frac{t}{y} - y\right) \cdot -0.3333333333333333}{z}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{t}{y \cdot z} - \frac{y}{z}, 0.3333333333333333, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y 3.4e-187)
   (- x (/ (* (- (/ t y) y) -0.3333333333333333) z))
   (fma (- (/ t (* y z)) (/ y z)) 0.3333333333333333 x)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= 3.4e-187) {
		tmp = x - ((((t / y) - y) * -0.3333333333333333) / z);
	} else {
		tmp = fma(((t / (y * z)) - (y / z)), 0.3333333333333333, x);
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= 3.4e-187)
		tmp = Float64(x - Float64(Float64(Float64(Float64(t / y) - y) * -0.3333333333333333) / z));
	else
		tmp = fma(Float64(Float64(t / Float64(y * z)) - Float64(y / z)), 0.3333333333333333, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[y, 3.4e-187], N[(x - N[(N[(N[(N[(t / y), $MachinePrecision] - y), $MachinePrecision] * -0.3333333333333333), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision], N[(N[(N[(t / N[(y * z), $MachinePrecision]), $MachinePrecision] - N[(y / z), $MachinePrecision]), $MachinePrecision] * 0.3333333333333333 + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 3.4000000000000001e-187

   1. Initial program 95.5%

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

   3. Applied rewrites 95.7%

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

   if 3.4000000000000001e-187 < y

   1. Initial program 95.5%

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

   3. Applied rewrites 95.6%

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

      1. lift-/.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. div-sub N/A

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

      5. associate-/r* N/A

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

      6. lower--.f64 N/A

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

      7. *-commutative N/A

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

      8. lift-/.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. lift-/.f64 95.4

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

   5. Applied rewrites 95.4%

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

Alternative 4: 95.5% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 95.5%

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

3. Applied rewrites 95.6%

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

Alternative 5: 89.3% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -4000000:\\ \;\;\;\;x - \frac{0.3333333333333333 \cdot y}{z}\\ \mathbf{elif}\;y \leq 3.4 \cdot 10^{-187}:\\ \;\;\;\;\mathsf{fma}\left(\frac{\frac{t}{y}}{z}, 0.3333333333333333, x\right)\\ \mathbf{elif}\;y \leq 4.7 \cdot 10^{-39}:\\ \;\;\;\;\mathsf{fma}\left(\frac{t}{z \cdot y}, 0.3333333333333333, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{y}{z}, -0.3333333333333333, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y -4000000.0)
   (- x (/ (* 0.3333333333333333 y) z))
   (if (<= y 3.4e-187)
     (fma (/ (/ t y) z) 0.3333333333333333 x)
     (if (<= y 4.7e-39)
       (fma (/ t (* z y)) 0.3333333333333333 x)
       (fma (/ y z) -0.3333333333333333 x)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= -4000000.0) {
		tmp = x - ((0.3333333333333333 * y) / z);
	} else if (y <= 3.4e-187) {
		tmp = fma(((t / y) / z), 0.3333333333333333, x);
	} else if (y <= 4.7e-39) {
		tmp = fma((t / (z * y)), 0.3333333333333333, x);
	} else {
		tmp = fma((y / z), -0.3333333333333333, x);
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= -4000000.0)
		tmp = Float64(x - Float64(Float64(0.3333333333333333 * y) / z));
	elseif (y <= 3.4e-187)
		tmp = fma(Float64(Float64(t / y) / z), 0.3333333333333333, x);
	elseif (y <= 4.7e-39)
		tmp = fma(Float64(t / Float64(z * y)), 0.3333333333333333, x);
	else
		tmp = fma(Float64(y / z), -0.3333333333333333, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[y, -4000000.0], N[(x - N[(N[(0.3333333333333333 * y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 3.4e-187], N[(N[(N[(t / y), $MachinePrecision] / z), $MachinePrecision] * 0.3333333333333333 + x), $MachinePrecision], If[LessEqual[y, 4.7e-39], N[(N[(t / N[(z * y), $MachinePrecision]), $MachinePrecision] * 0.3333333333333333 + x), $MachinePrecision], N[(N[(y / z), $MachinePrecision] * -0.3333333333333333 + x), $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if y < -4e6

   1. Initial program 95.5%

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

   3. Applied rewrites 95.7%

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

   4. Taylor expanded in y around inf

      \[\leadsto x - \frac{\color{blue}{\frac{1}{3} \cdot y}}{z} \]
   5. Step-by-step derivation

      1. lower-*.f64 64.5

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

   6. Applied rewrites 64.5%

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

   if -4e6 < y < 3.4000000000000001e-187

   1. Initial program 95.5%

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

   3. Applied rewrites 95.6%

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

   4. Taylor expanded in y around 0

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

      1. lift-/.f64 62.3

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

   6. Applied rewrites 62.3%

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

   if 3.4000000000000001e-187 < y < 4.7000000000000002e-39

   1. Initial program 95.5%

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

   3. Applied rewrites 95.6%

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

   4. Taylor expanded in y around 0

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

      1. lift-/.f64 62.3

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

   6. Applied rewrites 62.3%

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

   7. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 62.9

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

   9. Applied rewrites 62.9%

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

   if 4.7000000000000002e-39 < y

   1. Initial program 95.5%

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

   2. Taylor expanded in y around 0

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

      1. *-commutative N/A

         \[\leadsto \frac{t}{y \cdot z} \cdot \color{blue}{\frac{1}{3}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{t}{y \cdot z} \cdot \color{blue}{\frac{1}{3}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{t}{y \cdot z} \cdot \frac{1}{3} \]

      4. *-commutative N/A

         \[\leadsto \frac{t}{z \cdot y} \cdot \frac{1}{3} \]

      5. lower-*.f64 34.6

         \[\leadsto \frac{t}{z \cdot y} \cdot 0.3333333333333333 \]

   4. Applied rewrites 34.6%

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

   5. Taylor expanded in t around 0

      \[\leadsto \color{blue}{x - \frac{1}{3} \cdot \frac{y}{z}} \]
   6. Step-by-step derivation

      1. fp-cancel-sub-sign-inv N/A

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

         \[\leadsto \frac{y}{z} \cdot \frac{-1}{3} + x \]

      5. lower-fma.f64 N/A

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

      6. lift-/.f64 64.5

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

   7. Applied rewrites 64.5%

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

Alternative 6: 88.9% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -4000000:\\ \;\;\;\;x - \frac{0.3333333333333333 \cdot y}{z}\\ \mathbf{elif}\;y \leq 4.7 \cdot 10^{-39}:\\ \;\;\;\;\mathsf{fma}\left(\frac{t}{z \cdot y}, 0.3333333333333333, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{y}{z}, -0.3333333333333333, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y -4000000.0)
   (- x (/ (* 0.3333333333333333 y) z))
   (if (<= y 4.7e-39)
     (fma (/ t (* z y)) 0.3333333333333333 x)
     (fma (/ y z) -0.3333333333333333 x))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= -4000000.0) {
		tmp = x - ((0.3333333333333333 * y) / z);
	} else if (y <= 4.7e-39) {
		tmp = fma((t / (z * y)), 0.3333333333333333, x);
	} else {
		tmp = fma((y / z), -0.3333333333333333, x);
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= -4000000.0)
		tmp = Float64(x - Float64(Float64(0.3333333333333333 * y) / z));
	elseif (y <= 4.7e-39)
		tmp = fma(Float64(t / Float64(z * y)), 0.3333333333333333, x);
	else
		tmp = fma(Float64(y / z), -0.3333333333333333, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[y, -4000000.0], N[(x - N[(N[(0.3333333333333333 * y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 4.7e-39], N[(N[(t / N[(z * y), $MachinePrecision]), $MachinePrecision] * 0.3333333333333333 + x), $MachinePrecision], N[(N[(y / z), $MachinePrecision] * -0.3333333333333333 + x), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -4e6

   1. Initial program 95.5%

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

   3. Applied rewrites 95.7%

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

   4. Taylor expanded in y around inf

      \[\leadsto x - \frac{\color{blue}{\frac{1}{3} \cdot y}}{z} \]
   5. Step-by-step derivation

      1. lower-*.f64 64.5

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

   6. Applied rewrites 64.5%

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

   if -4e6 < y < 4.7000000000000002e-39

   1. Initial program 95.5%

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

   3. Applied rewrites 95.6%

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

   4. Taylor expanded in y around 0

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

      1. lift-/.f64 62.3

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

   6. Applied rewrites 62.3%

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

   7. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 62.9

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

   9. Applied rewrites 62.9%

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

   if 4.7000000000000002e-39 < y

   1. Initial program 95.5%

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

   2. Taylor expanded in y around 0

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

      1. *-commutative N/A

         \[\leadsto \frac{t}{y \cdot z} \cdot \color{blue}{\frac{1}{3}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{t}{y \cdot z} \cdot \color{blue}{\frac{1}{3}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{t}{y \cdot z} \cdot \frac{1}{3} \]

      4. *-commutative N/A

         \[\leadsto \frac{t}{z \cdot y} \cdot \frac{1}{3} \]

      5. lower-*.f64 34.6

         \[\leadsto \frac{t}{z \cdot y} \cdot 0.3333333333333333 \]

   4. Applied rewrites 34.6%

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

   5. Taylor expanded in t around 0

      \[\leadsto \color{blue}{x - \frac{1}{3} \cdot \frac{y}{z}} \]
   6. Step-by-step derivation

      1. fp-cancel-sub-sign-inv N/A

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

         \[\leadsto \frac{y}{z} \cdot \frac{-1}{3} + x \]

      5. lower-fma.f64 N/A

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

      6. lift-/.f64 64.5

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

   7. Applied rewrites 64.5%

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

Alternative 7: 77.8% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -650:\\ \;\;\;\;x - \frac{0.3333333333333333 \cdot y}{z}\\ \mathbf{elif}\;y \leq 1.8 \cdot 10^{-45}:\\ \;\;\;\;\frac{\frac{t}{z}}{y} \cdot 0.3333333333333333\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{y}{z}, -0.3333333333333333, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y -650.0)
   (- x (/ (* 0.3333333333333333 y) z))
   (if (<= y 1.8e-45)
     (* (/ (/ t z) y) 0.3333333333333333)
     (fma (/ y z) -0.3333333333333333 x))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= -650.0) {
		tmp = x - ((0.3333333333333333 * y) / z);
	} else if (y <= 1.8e-45) {
		tmp = ((t / z) / y) * 0.3333333333333333;
	} else {
		tmp = fma((y / z), -0.3333333333333333, x);
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= -650.0)
		tmp = Float64(x - Float64(Float64(0.3333333333333333 * y) / z));
	elseif (y <= 1.8e-45)
		tmp = Float64(Float64(Float64(t / z) / y) * 0.3333333333333333);
	else
		tmp = fma(Float64(y / z), -0.3333333333333333, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[y, -650.0], N[(x - N[(N[(0.3333333333333333 * y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.8e-45], N[(N[(N[(t / z), $MachinePrecision] / y), $MachinePrecision] * 0.3333333333333333), $MachinePrecision], N[(N[(y / z), $MachinePrecision] * -0.3333333333333333 + x), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -650

   1. Initial program 95.5%

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

   3. Applied rewrites 95.7%

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

   4. Taylor expanded in y around inf

      \[\leadsto x - \frac{\color{blue}{\frac{1}{3} \cdot y}}{z} \]
   5. Step-by-step derivation

      1. lower-*.f64 64.5

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

   6. Applied rewrites 64.5%

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

   if -650 < y < 1.8e-45

   1. Initial program 95.5%

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

   2. Taylor expanded in y around 0

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

      1. *-commutative N/A

         \[\leadsto \frac{t}{y \cdot z} \cdot \color{blue}{\frac{1}{3}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{t}{y \cdot z} \cdot \color{blue}{\frac{1}{3}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{t}{y \cdot z} \cdot \frac{1}{3} \]

      4. *-commutative N/A

         \[\leadsto \frac{t}{z \cdot y} \cdot \frac{1}{3} \]

      5. lower-*.f64 34.6

         \[\leadsto \frac{t}{z \cdot y} \cdot 0.3333333333333333 \]

   4. Applied rewrites 34.6%

      \[\leadsto \color{blue}{\frac{t}{z \cdot y} \cdot 0.3333333333333333} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \frac{t}{z \cdot y} \cdot \frac{1}{3} \]

      2. lift-/.f64 N/A

         \[\leadsto \frac{t}{z \cdot y} \cdot \frac{1}{3} \]

      3. associate-/r* N/A

         \[\leadsto \frac{\frac{t}{z}}{y} \cdot \frac{1}{3} \]

      4. lower-/.f64 N/A

         \[\leadsto \frac{\frac{t}{z}}{y} \cdot \frac{1}{3} \]

      5. lift-/.f64 37.9

         \[\leadsto \frac{\frac{t}{z}}{y} \cdot 0.3333333333333333 \]

   6. Applied rewrites 37.9%

      \[\leadsto \frac{\frac{t}{z}}{y} \cdot 0.3333333333333333 \]

   if 1.8e-45 < y

   1. Initial program 95.5%

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

   2. Taylor expanded in y around 0

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

      1. *-commutative N/A

         \[\leadsto \frac{t}{y \cdot z} \cdot \color{blue}{\frac{1}{3}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{t}{y \cdot z} \cdot \color{blue}{\frac{1}{3}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{t}{y \cdot z} \cdot \frac{1}{3} \]

      4. *-commutative N/A

         \[\leadsto \frac{t}{z \cdot y} \cdot \frac{1}{3} \]

      5. lower-*.f64 34.6

         \[\leadsto \frac{t}{z \cdot y} \cdot 0.3333333333333333 \]

   4. Applied rewrites 34.6%

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

   5. Taylor expanded in t around 0

      \[\leadsto \color{blue}{x - \frac{1}{3} \cdot \frac{y}{z}} \]
   6. Step-by-step derivation

      1. fp-cancel-sub-sign-inv N/A

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

         \[\leadsto \frac{y}{z} \cdot \frac{-1}{3} + x \]

      5. lower-fma.f64 N/A

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

      6. lift-/.f64 64.5

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

   7. Applied rewrites 64.5%

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

Alternative 8: 76.4% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -4.2 \cdot 10^{-97}:\\ \;\;\;\;x - \frac{0.3333333333333333 \cdot y}{z}\\ \mathbf{elif}\;y \leq 1.15 \cdot 10^{-45}:\\ \;\;\;\;\frac{t}{z \cdot y} \cdot 0.3333333333333333\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{y}{z}, -0.3333333333333333, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y -4.2e-97)
   (- x (/ (* 0.3333333333333333 y) z))
   (if (<= y 1.15e-45)
     (* (/ t (* z y)) 0.3333333333333333)
     (fma (/ y z) -0.3333333333333333 x))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= -4.2e-97) {
		tmp = x - ((0.3333333333333333 * y) / z);
	} else if (y <= 1.15e-45) {
		tmp = (t / (z * y)) * 0.3333333333333333;
	} else {
		tmp = fma((y / z), -0.3333333333333333, x);
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= -4.2e-97)
		tmp = Float64(x - Float64(Float64(0.3333333333333333 * y) / z));
	elseif (y <= 1.15e-45)
		tmp = Float64(Float64(t / Float64(z * y)) * 0.3333333333333333);
	else
		tmp = fma(Float64(y / z), -0.3333333333333333, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[y, -4.2e-97], N[(x - N[(N[(0.3333333333333333 * y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.15e-45], N[(N[(t / N[(z * y), $MachinePrecision]), $MachinePrecision] * 0.3333333333333333), $MachinePrecision], N[(N[(y / z), $MachinePrecision] * -0.3333333333333333 + x), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -4.2000000000000002e-97

   1. Initial program 95.5%

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

   3. Applied rewrites 95.7%

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

   4. Taylor expanded in y around inf

      \[\leadsto x - \frac{\color{blue}{\frac{1}{3} \cdot y}}{z} \]
   5. Step-by-step derivation

      1. lower-*.f64 64.5

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

   6. Applied rewrites 64.5%

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

   if -4.2000000000000002e-97 < y < 1.14999999999999996e-45

   1. Initial program 95.5%

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

   2. Taylor expanded in y around 0

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

      1. *-commutative N/A

         \[\leadsto \frac{t}{y \cdot z} \cdot \color{blue}{\frac{1}{3}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{t}{y \cdot z} \cdot \color{blue}{\frac{1}{3}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{t}{y \cdot z} \cdot \frac{1}{3} \]

      4. *-commutative N/A

         \[\leadsto \frac{t}{z \cdot y} \cdot \frac{1}{3} \]

      5. lower-*.f64 34.6

         \[\leadsto \frac{t}{z \cdot y} \cdot 0.3333333333333333 \]

   4. Applied rewrites 34.6%

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

   if 1.14999999999999996e-45 < y

   1. Initial program 95.5%

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

   2. Taylor expanded in y around 0

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

      1. *-commutative N/A

         \[\leadsto \frac{t}{y \cdot z} \cdot \color{blue}{\frac{1}{3}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{t}{y \cdot z} \cdot \color{blue}{\frac{1}{3}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{t}{y \cdot z} \cdot \frac{1}{3} \]

      4. *-commutative N/A

         \[\leadsto \frac{t}{z \cdot y} \cdot \frac{1}{3} \]

      5. lower-*.f64 34.6

         \[\leadsto \frac{t}{z \cdot y} \cdot 0.3333333333333333 \]

   4. Applied rewrites 34.6%

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

   5. Taylor expanded in t around 0

      \[\leadsto \color{blue}{x - \frac{1}{3} \cdot \frac{y}{z}} \]
   6. Step-by-step derivation

      1. fp-cancel-sub-sign-inv N/A

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

         \[\leadsto \frac{y}{z} \cdot \frac{-1}{3} + x \]

      5. lower-fma.f64 N/A

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

      6. lift-/.f64 64.5

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

   7. Applied rewrites 64.5%

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

Alternative 9: 76.2% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -4.2 \cdot 10^{-97}:\\ \;\;\;\;x - \frac{0.3333333333333333 \cdot y}{z}\\ \mathbf{elif}\;y \leq 1.15 \cdot 10^{-45}:\\ \;\;\;\;\frac{0.3333333333333333}{y \cdot z} \cdot t\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{y}{z}, -0.3333333333333333, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y -4.2e-97)
   (- x (/ (* 0.3333333333333333 y) z))
   (if (<= y 1.15e-45)
     (* (/ 0.3333333333333333 (* y z)) t)
     (fma (/ y z) -0.3333333333333333 x))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= -4.2e-97) {
		tmp = x - ((0.3333333333333333 * y) / z);
	} else if (y <= 1.15e-45) {
		tmp = (0.3333333333333333 / (y * z)) * t;
	} else {
		tmp = fma((y / z), -0.3333333333333333, x);
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= -4.2e-97)
		tmp = Float64(x - Float64(Float64(0.3333333333333333 * y) / z));
	elseif (y <= 1.15e-45)
		tmp = Float64(Float64(0.3333333333333333 / Float64(y * z)) * t);
	else
		tmp = fma(Float64(y / z), -0.3333333333333333, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[y, -4.2e-97], N[(x - N[(N[(0.3333333333333333 * y), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.15e-45], N[(N[(0.3333333333333333 / N[(y * z), $MachinePrecision]), $MachinePrecision] * t), $MachinePrecision], N[(N[(y / z), $MachinePrecision] * -0.3333333333333333 + x), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -4.2000000000000002e-97

   1. Initial program 95.5%

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

   3. Applied rewrites 95.7%

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

   4. Taylor expanded in y around inf

      \[\leadsto x - \frac{\color{blue}{\frac{1}{3} \cdot y}}{z} \]
   5. Step-by-step derivation

      1. lower-*.f64 64.5

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

   6. Applied rewrites 64.5%

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

   if -4.2000000000000002e-97 < y < 1.14999999999999996e-45

   1. Initial program 95.5%

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

   2. Taylor expanded in y around 0

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

      1. *-commutative N/A

         \[\leadsto \frac{t}{y \cdot z} \cdot \color{blue}{\frac{1}{3}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{t}{y \cdot z} \cdot \color{blue}{\frac{1}{3}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{t}{y \cdot z} \cdot \frac{1}{3} \]

      4. *-commutative N/A

         \[\leadsto \frac{t}{z \cdot y} \cdot \frac{1}{3} \]

      5. lower-*.f64 34.6

         \[\leadsto \frac{t}{z \cdot y} \cdot 0.3333333333333333 \]

   4. Applied rewrites 34.6%

      \[\leadsto \color{blue}{\frac{t}{z \cdot y} \cdot 0.3333333333333333} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \frac{t}{z \cdot y} \cdot \color{blue}{\frac{1}{3}} \]

      2. *-commutative N/A

         \[\leadsto \frac{1}{3} \cdot \color{blue}{\frac{t}{z \cdot y}} \]

      3. lift-*.f64 N/A

         \[\leadsto \frac{1}{3} \cdot \frac{t}{z \cdot \color{blue}{y}} \]

      4. lift-/.f64 N/A

         \[\leadsto \frac{1}{3} \cdot \frac{t}{\color{blue}{z \cdot y}} \]

      5. *-commutative N/A

         \[\leadsto \frac{1}{3} \cdot \frac{t}{y \cdot \color{blue}{z}} \]

      6. associate-*r/ N/A

         \[\leadsto \frac{\frac{1}{3} \cdot t}{\color{blue}{y \cdot z}} \]

      7. *-commutative N/A

         \[\leadsto \frac{\frac{1}{3} \cdot t}{z \cdot \color{blue}{y}} \]

      8. associate-*l/ N/A

         \[\leadsto \frac{\frac{1}{3}}{z \cdot y} \cdot \color{blue}{t} \]

      9. mult-flip N/A

         \[\leadsto \left(\frac{1}{3} \cdot \frac{1}{z \cdot y}\right) \cdot t \]

      10. *-commutative N/A

          \[\leadsto \left(\frac{1}{3} \cdot \frac{1}{y \cdot z}\right) \cdot t \]

      11. lower-*.f64 N/A

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

      12. *-commutative N/A

          \[\leadsto \left(\frac{1}{3} \cdot \frac{1}{z \cdot y}\right) \cdot t \]

      13. mult-flip N/A

          \[\leadsto \frac{\frac{1}{3}}{z \cdot y} \cdot t \]

      14. lift-/.f64 N/A

          \[\leadsto \frac{\frac{1}{3}}{z \cdot y} \cdot t \]

      15. *-commutative N/A

          \[\leadsto \frac{\frac{1}{3}}{y \cdot z} \cdot t \]

      16. lower-*.f64 34.4

          \[\leadsto \frac{0.3333333333333333}{y \cdot z} \cdot t \]

   6. Applied rewrites 34.4%

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

   if 1.14999999999999996e-45 < y

   1. Initial program 95.5%

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

   2. Taylor expanded in y around 0

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

      1. *-commutative N/A

         \[\leadsto \frac{t}{y \cdot z} \cdot \color{blue}{\frac{1}{3}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{t}{y \cdot z} \cdot \color{blue}{\frac{1}{3}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{t}{y \cdot z} \cdot \frac{1}{3} \]

      4. *-commutative N/A

         \[\leadsto \frac{t}{z \cdot y} \cdot \frac{1}{3} \]

      5. lower-*.f64 34.6

         \[\leadsto \frac{t}{z \cdot y} \cdot 0.3333333333333333 \]

   4. Applied rewrites 34.6%

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

   5. Taylor expanded in t around 0

      \[\leadsto \color{blue}{x - \frac{1}{3} \cdot \frac{y}{z}} \]
   6. Step-by-step derivation

      1. fp-cancel-sub-sign-inv N/A

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

         \[\leadsto \frac{y}{z} \cdot \frac{-1}{3} + x \]

      5. lower-fma.f64 N/A

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

      6. lift-/.f64 64.5

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

   7. Applied rewrites 64.5%

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

Alternative 10: 64.5% accurate, 2.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 95.5%

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

2. Taylor expanded in y around 0

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

   1. *-commutative N/A

      \[\leadsto \frac{t}{y \cdot z} \cdot \color{blue}{\frac{1}{3}} \]

   2. lower-*.f64 N/A

      \[\leadsto \frac{t}{y \cdot z} \cdot \color{blue}{\frac{1}{3}} \]

   3. lower-/.f64 N/A

      \[\leadsto \frac{t}{y \cdot z} \cdot \frac{1}{3} \]

   4. *-commutative N/A

      \[\leadsto \frac{t}{z \cdot y} \cdot \frac{1}{3} \]

   5. lower-*.f64 34.6

      \[\leadsto \frac{t}{z \cdot y} \cdot 0.3333333333333333 \]

4. Applied rewrites 34.6%

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

5. Taylor expanded in t around 0

   \[\leadsto \color{blue}{x - \frac{1}{3} \cdot \frac{y}{z}} \]
6. Step-by-step derivation

   1. fp-cancel-sub-sign-inv N/A

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

   2. metadata-eval N/A

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

   3. +-commutative N/A

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

   4. *-commutative N/A

      \[\leadsto \frac{y}{z} \cdot \frac{-1}{3} + x \]

   5. lower-fma.f64 N/A

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

   6. lift-/.f64 64.5

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

7. Applied rewrites 64.5%

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

Alternative 11: 47.5% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.6 \cdot 10^{+48}:\\ \;\;\;\;1 \cdot x\\ \mathbf{elif}\;x \leq 1.46 \cdot 10^{+116}:\\ \;\;\;\;\frac{-0.3333333333333333}{z} \cdot y\\ \mathbf{else}:\\ \;\;\;\;1 \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= x -2.6e+48)
   (* 1.0 x)
   (if (<= x 1.46e+116) (* (/ -0.3333333333333333 z) y) (* 1.0 x))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (x <= -2.6e+48) {
		tmp = 1.0 * x;
	} else if (x <= 1.46e+116) {
		tmp = (-0.3333333333333333 / z) * y;
	} else {
		tmp = 1.0 * x;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (x <= (-2.6d+48)) then
        tmp = 1.0d0 * x
    else if (x <= 1.46d+116) then
        tmp = ((-0.3333333333333333d0) / z) * y
    else
        tmp = 1.0d0 * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (x <= -2.6e+48) {
		tmp = 1.0 * x;
	} else if (x <= 1.46e+116) {
		tmp = (-0.3333333333333333 / z) * y;
	} else {
		tmp = 1.0 * x;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if x <= -2.6e+48:
		tmp = 1.0 * x
	elif x <= 1.46e+116:
		tmp = (-0.3333333333333333 / z) * y
	else:
		tmp = 1.0 * x
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (x <= -2.6e+48)
		tmp = Float64(1.0 * x);
	elseif (x <= 1.46e+116)
		tmp = Float64(Float64(-0.3333333333333333 / z) * y);
	else
		tmp = Float64(1.0 * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (x <= -2.6e+48)
		tmp = 1.0 * x;
	elseif (x <= 1.46e+116)
		tmp = (-0.3333333333333333 / z) * y;
	else
		tmp = 1.0 * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[x, -2.6e+48], N[(1.0 * x), $MachinePrecision], If[LessEqual[x, 1.46e+116], N[(N[(-0.3333333333333333 / z), $MachinePrecision] * y), $MachinePrecision], N[(1.0 * x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x < -2.59999999999999995e48 or 1.45999999999999994e116 < x

   1. Initial program 95.5%

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

   2. Taylor expanded in y around 0

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

      1. *-commutative N/A

         \[\leadsto \frac{t}{y \cdot z} \cdot \color{blue}{\frac{1}{3}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{t}{y \cdot z} \cdot \color{blue}{\frac{1}{3}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{t}{y \cdot z} \cdot \frac{1}{3} \]

      4. *-commutative N/A

         \[\leadsto \frac{t}{z \cdot y} \cdot \frac{1}{3} \]

      5. lower-*.f64 34.6

         \[\leadsto \frac{t}{z \cdot y} \cdot 0.3333333333333333 \]

   4. Applied rewrites 34.6%

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

   5. Taylor expanded in t around 0

      \[\leadsto \color{blue}{x - \frac{1}{3} \cdot \frac{y}{z}} \]
   6. Step-by-step derivation

      1. fp-cancel-sub-sign-inv N/A

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

         \[\leadsto \frac{y}{z} \cdot \frac{-1}{3} + x \]

      5. lower-fma.f64 N/A

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

      6. lift-/.f64 64.5

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

   7. Applied rewrites 64.5%

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

   8. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 61.0

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

   10. Applied rewrites 61.0%

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

   11. Taylor expanded in x around inf

       \[\leadsto 1 \cdot x \]
   12. Step-by-step derivation

   13. Applied rewrites 31.0%

       \[\leadsto 1 \cdot x \]

   if -2.59999999999999995e48 < x < 1.45999999999999994e116

   1. Initial program 95.5%

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

   2. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

         \[\leadsto \left(\frac{x}{y} - \frac{1}{3} \cdot \frac{1}{z}\right) \cdot y \]

      4. lower-/.f64 N/A

         \[\leadsto \left(\frac{x}{y} - \frac{1}{3} \cdot \frac{1}{z}\right) \cdot y \]

      5. mult-flip-rev N/A

         \[\leadsto \left(\frac{x}{y} - \frac{\frac{1}{3}}{z}\right) \cdot y \]

      6. lower-/.f64 60.7

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

   4. Applied rewrites 60.7%

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

   5. Taylor expanded in x around 0

      \[\leadsto \frac{\frac{-1}{3}}{z} \cdot y \]
   6. Step-by-step derivation

      1. lower-/.f64 35.6

         \[\leadsto \frac{-0.3333333333333333}{z} \cdot y \]

   7. Applied rewrites 35.6%

      \[\leadsto \frac{-0.3333333333333333}{z} \cdot y \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 12: 47.5% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.6 \cdot 10^{+48}:\\ \;\;\;\;1 \cdot x\\ \mathbf{elif}\;x \leq 1.46 \cdot 10^{+116}:\\ \;\;\;\;\frac{y}{z} \cdot -0.3333333333333333\\ \mathbf{else}:\\ \;\;\;\;1 \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= x -2.6e+48)
   (* 1.0 x)
   (if (<= x 1.46e+116) (* (/ y z) -0.3333333333333333) (* 1.0 x))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (x <= -2.6e+48) {
		tmp = 1.0 * x;
	} else if (x <= 1.46e+116) {
		tmp = (y / z) * -0.3333333333333333;
	} else {
		tmp = 1.0 * x;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (x <= (-2.6d+48)) then
        tmp = 1.0d0 * x
    else if (x <= 1.46d+116) then
        tmp = (y / z) * (-0.3333333333333333d0)
    else
        tmp = 1.0d0 * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (x <= -2.6e+48) {
		tmp = 1.0 * x;
	} else if (x <= 1.46e+116) {
		tmp = (y / z) * -0.3333333333333333;
	} else {
		tmp = 1.0 * x;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if x <= -2.6e+48:
		tmp = 1.0 * x
	elif x <= 1.46e+116:
		tmp = (y / z) * -0.3333333333333333
	else:
		tmp = 1.0 * x
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (x <= -2.6e+48)
		tmp = Float64(1.0 * x);
	elseif (x <= 1.46e+116)
		tmp = Float64(Float64(y / z) * -0.3333333333333333);
	else
		tmp = Float64(1.0 * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (x <= -2.6e+48)
		tmp = 1.0 * x;
	elseif (x <= 1.46e+116)
		tmp = (y / z) * -0.3333333333333333;
	else
		tmp = 1.0 * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[x, -2.6e+48], N[(1.0 * x), $MachinePrecision], If[LessEqual[x, 1.46e+116], N[(N[(y / z), $MachinePrecision] * -0.3333333333333333), $MachinePrecision], N[(1.0 * x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x < -2.59999999999999995e48 or 1.45999999999999994e116 < x

   1. Initial program 95.5%

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

   2. Taylor expanded in y around 0

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

      1. *-commutative N/A

         \[\leadsto \frac{t}{y \cdot z} \cdot \color{blue}{\frac{1}{3}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{t}{y \cdot z} \cdot \color{blue}{\frac{1}{3}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{t}{y \cdot z} \cdot \frac{1}{3} \]

      4. *-commutative N/A

         \[\leadsto \frac{t}{z \cdot y} \cdot \frac{1}{3} \]

      5. lower-*.f64 34.6

         \[\leadsto \frac{t}{z \cdot y} \cdot 0.3333333333333333 \]

   4. Applied rewrites 34.6%

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

   5. Taylor expanded in t around 0

      \[\leadsto \color{blue}{x - \frac{1}{3} \cdot \frac{y}{z}} \]
   6. Step-by-step derivation

      1. fp-cancel-sub-sign-inv N/A

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

         \[\leadsto \frac{y}{z} \cdot \frac{-1}{3} + x \]

      5. lower-fma.f64 N/A

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

      6. lift-/.f64 64.5

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

   7. Applied rewrites 64.5%

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

   8. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 61.0

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

   10. Applied rewrites 61.0%

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

   11. Taylor expanded in x around inf

       \[\leadsto 1 \cdot x \]
   12. Step-by-step derivation

   13. Applied rewrites 31.0%

       \[\leadsto 1 \cdot x \]

   if -2.59999999999999995e48 < x < 1.45999999999999994e116

   1. Initial program 95.5%

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

   2. Taylor expanded in y around 0

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

      1. *-commutative N/A

         \[\leadsto \frac{t}{y \cdot z} \cdot \color{blue}{\frac{1}{3}} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{t}{y \cdot z} \cdot \color{blue}{\frac{1}{3}} \]

      3. lower-/.f64 N/A

         \[\leadsto \frac{t}{y \cdot z} \cdot \frac{1}{3} \]

      4. *-commutative N/A

         \[\leadsto \frac{t}{z \cdot y} \cdot \frac{1}{3} \]

      5. lower-*.f64 34.6

         \[\leadsto \frac{t}{z \cdot y} \cdot 0.3333333333333333 \]

   4. Applied rewrites 34.6%

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

   5. Taylor expanded in t around 0

      \[\leadsto \color{blue}{x - \frac{1}{3} \cdot \frac{y}{z}} \]
   6. Step-by-step derivation

      1. fp-cancel-sub-sign-inv N/A

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

         \[\leadsto \frac{y}{z} \cdot \frac{-1}{3} + x \]

      5. lower-fma.f64 N/A

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

      6. lift-/.f64 64.5

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

   7. Applied rewrites 64.5%

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

   8. Taylor expanded in x around 0

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

      1. *-commutative N/A

         \[\leadsto \frac{y}{z} \cdot \frac{-1}{3} \]

      2. lower-*.f64 N/A

         \[\leadsto \frac{y}{z} \cdot \frac{-1}{3} \]

      3. lift-/.f64 35.6

         \[\leadsto \frac{y}{z} \cdot -0.3333333333333333 \]

   10. Applied rewrites 35.6%

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

Alternative 13: 31.0% accurate, 5.5× speedup

Math

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

FPCore

(FPCore (x y z t) :precision binary64 (* 1.0 x))

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = 1.0d0 * x
end function

Java

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

Python

def code(x, y, z, t):
	return 1.0 * x

Julia

function code(x, y, z, t)
	return Float64(1.0 * x)
end

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := N[(1.0 * x), $MachinePrecision]

Derivation

1. Initial program 95.5%

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

2. Taylor expanded in y around 0

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

   1. *-commutative N/A

      \[\leadsto \frac{t}{y \cdot z} \cdot \color{blue}{\frac{1}{3}} \]

   2. lower-*.f64 N/A

      \[\leadsto \frac{t}{y \cdot z} \cdot \color{blue}{\frac{1}{3}} \]

   3. lower-/.f64 N/A

      \[\leadsto \frac{t}{y \cdot z} \cdot \frac{1}{3} \]

   4. *-commutative N/A

      \[\leadsto \frac{t}{z \cdot y} \cdot \frac{1}{3} \]

   5. lower-*.f64 34.6

      \[\leadsto \frac{t}{z \cdot y} \cdot 0.3333333333333333 \]

4. Applied rewrites 34.6%

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

5. Taylor expanded in t around 0

   \[\leadsto \color{blue}{x - \frac{1}{3} \cdot \frac{y}{z}} \]
6. Step-by-step derivation

   1. fp-cancel-sub-sign-inv N/A

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

   2. metadata-eval N/A

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

   3. +-commutative N/A

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

   4. *-commutative N/A

      \[\leadsto \frac{y}{z} \cdot \frac{-1}{3} + x \]

   5. lower-fma.f64 N/A

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

   6. lift-/.f64 64.5

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

7. Applied rewrites 64.5%

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

8. Taylor expanded in x around inf

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. +-commutative N/A

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

   4. *-commutative N/A

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

   5. lower-fma.f64 N/A

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

   6. lower-/.f64 N/A

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

   7. *-commutative N/A

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

   8. lower-*.f64 61.0

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

10. Applied rewrites 61.0%

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

11. Taylor expanded in x around inf

    \[\leadsto 1 \cdot x \]
12. Step-by-step derivation

13. Applied rewrites 31.0%

    \[\leadsto 1 \cdot x \]
14. Add Preprocessing

Reproduce

herbie shell --seed 2025136 
(FPCore (x y z t)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, H"
  :precision binary64
  (+ (- x (/ y (* z 3.0))) (/ t (* (* z 3.0) y))))