Language.Haskell.HsColour.ColourHighlight:unbase from hscolour-1.23

Percentage Accurate: 99.9% → 99.9%

Time: 2.9s

Alternatives: 8

Speedup: 1.0×

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

Specification

Math

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

FPCore

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

C

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

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) * y) + t
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

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) * y) + t
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

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) * y) + t
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

   \[\left(x \cdot y + z\right) \cdot y + t \]
2. Add Preprocessing
3. Add Preprocessing

Alternative 2: 89.5% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (+ (* x y) z) y)))
   (if (<= t_1 -1.0)
     (* (fma y x z) y)
     (if (<= t_1 5e+173) (fma z y t) (fma z y (* (* y x) y))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = ((x * y) + z) * y;
	double tmp;
	if (t_1 <= -1.0) {
		tmp = fma(y, x, z) * y;
	} else if (t_1 <= 5e+173) {
		tmp = fma(z, y, t);
	} else {
		tmp = fma(z, y, ((y * x) * y));
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(Float64(x * y) + z) * y)
	tmp = 0.0
	if (t_1 <= -1.0)
		tmp = Float64(fma(y, x, z) * y);
	elseif (t_1 <= 5e+173)
		tmp = fma(z, y, t);
	else
		tmp = fma(z, y, Float64(Float64(y * x) * y));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 (+.f64 (*.f64 x y) z) y) < -1

   1. Initial program 99.9%

      \[\left(x \cdot y + z\right) \cdot y + t \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

         \[\leadsto \left(y \cdot x + z\right) \cdot y \]

      5. lower-fma.f64 90.8

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

   5. Applied rewrites 90.8%

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

   if -1 < (*.f64 (+.f64 (*.f64 x y) z) y) < 5.00000000000000034e173

   1. Initial program 100.0%

      \[\left(x \cdot y + z\right) \cdot y + t \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

         \[\leadsto z \cdot y + t \]

      3. lower-fma.f64 92.8

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

   5. Applied rewrites 92.8%

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

   if 5.00000000000000034e173 < (*.f64 (+.f64 (*.f64 x y) z) y)

   1. Initial program 99.9%

      \[\left(x \cdot y + z\right) \cdot y + t \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

         \[\leadsto \left(y \cdot x + z\right) \cdot y \]

      5. lower-fma.f64 97.9

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

   5. Applied rewrites 97.9%

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

      1. lift-*.f64 N/A

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

      2. lift-fma.f64 N/A

         \[\leadsto \left(y \cdot x + z\right) \cdot y \]

      3. +-commutative N/A

         \[\leadsto \left(z + y \cdot x\right) \cdot y \]

      4. *-commutative N/A

         \[\leadsto \left(z + x \cdot y\right) \cdot y \]

      5. *-commutative N/A

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

      6. distribute-rgt-in N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-*.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 97.9

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

   7. Applied rewrites 97.9%

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

Alternative 3: 89.9% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(x \cdot y + z\right) \cdot y\\ \mathbf{if}\;t\_1 \leq -1 \lor \neg \left(t\_1 \leq 5 \cdot 10^{+173}\right):\\ \;\;\;\;\mathsf{fma}\left(y, x, z\right) \cdot y\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(z, y, t\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (+ (* x y) z) y)))
   (if (or (<= t_1 -1.0) (not (<= t_1 5e+173)))
     (* (fma y x z) y)
     (fma z y t))))

C

double code(double x, double y, double z, double t) {
	double t_1 = ((x * y) + z) * y;
	double tmp;
	if ((t_1 <= -1.0) || !(t_1 <= 5e+173)) {
		tmp = fma(y, x, z) * y;
	} else {
		tmp = fma(z, y, t);
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(Float64(x * y) + z) * y)
	tmp = 0.0
	if ((t_1 <= -1.0) || !(t_1 <= 5e+173))
		tmp = Float64(fma(y, x, z) * y);
	else
		tmp = fma(z, y, t);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(N[(x * y), $MachinePrecision] + z), $MachinePrecision] * y), $MachinePrecision]}, If[Or[LessEqual[t$95$1, -1.0], N[Not[LessEqual[t$95$1, 5e+173]], $MachinePrecision]], N[(N[(y * x + z), $MachinePrecision] * y), $MachinePrecision], N[(z * y + t), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (+.f64 (*.f64 x y) z) y) < -1 or 5.00000000000000034e173 < (*.f64 (+.f64 (*.f64 x y) z) y)

   1. Initial program 99.9%

      \[\left(x \cdot y + z\right) \cdot y + t \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

         \[\leadsto \left(y \cdot x + z\right) \cdot y \]

      5. lower-fma.f64 93.2

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

   5. Applied rewrites 93.2%

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

   if -1 < (*.f64 (+.f64 (*.f64 x y) z) y) < 5.00000000000000034e173

   1. Initial program 100.0%

      \[\left(x \cdot y + z\right) \cdot y + t \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

         \[\leadsto z \cdot y + t \]

      3. lower-fma.f64 92.8

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

   5. Applied rewrites 92.8%

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

4. Final simplification 93.0%

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

Alternative 4: 80.4% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(x \cdot y + z\right) \cdot y\\ \mathbf{if}\;t\_1 \leq -\infty \lor \neg \left(t\_1 \leq 2 \cdot 10^{+278}\right):\\ \;\;\;\;\left(y \cdot y\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(z, y, t\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (+ (* x y) z) y)))
   (if (or (<= t_1 (- INFINITY)) (not (<= t_1 2e+278)))
     (* (* y y) x)
     (fma z y t))))

C

double code(double x, double y, double z, double t) {
	double t_1 = ((x * y) + z) * y;
	double tmp;
	if ((t_1 <= -((double) INFINITY)) || !(t_1 <= 2e+278)) {
		tmp = (y * y) * x;
	} else {
		tmp = fma(z, y, t);
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(Float64(x * y) + z) * y)
	tmp = 0.0
	if ((t_1 <= Float64(-Inf)) || !(t_1 <= 2e+278))
		tmp = Float64(Float64(y * y) * x);
	else
		tmp = fma(z, y, t);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (+.f64 (*.f64 x y) z) y) < -inf.0 or 1.99999999999999993e278 < (*.f64 (+.f64 (*.f64 x y) z) y)

   1. Initial program 100.0%

      \[\left(x \cdot y + z\right) \cdot y + t \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

         \[\leadsto {y}^{2} \cdot \color{blue}{x} \]

      2. lower-*.f64 N/A

         \[\leadsto {y}^{2} \cdot \color{blue}{x} \]

      3. unpow2 N/A

         \[\leadsto \left(y \cdot y\right) \cdot x \]

      4. lower-*.f64 84.8

         \[\leadsto \left(y \cdot y\right) \cdot x \]

   5. Applied rewrites 84.8%

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

   if -inf.0 < (*.f64 (+.f64 (*.f64 x y) z) y) < 1.99999999999999993e278

   1. Initial program 99.9%

      \[\left(x \cdot y + z\right) \cdot y + t \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

         \[\leadsto z \cdot y + t \]

      3. lower-fma.f64 80.3

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

   5. Applied rewrites 80.3%

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

4. Final simplification 81.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(x \cdot y + z\right) \cdot y \leq -\infty \lor \neg \left(\left(x \cdot y + z\right) \cdot y \leq 2 \cdot 10^{+278}\right):\\ \;\;\;\;\left(y \cdot y\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(z, y, t\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 52.6% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(x \cdot y + z\right) \cdot y\\ \mathbf{if}\;t\_1 \leq -1 \lor \neg \left(t\_1 \leq 1.5 \cdot 10^{+143}\right):\\ \;\;\;\;z \cdot y\\ \mathbf{else}:\\ \;\;\;\;t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (+ (* x y) z) y)))
   (if (or (<= t_1 -1.0) (not (<= t_1 1.5e+143))) (* z y) t)))

C

double code(double x, double y, double z, double t) {
	double t_1 = ((x * y) + z) * y;
	double tmp;
	if ((t_1 <= -1.0) || !(t_1 <= 1.5e+143)) {
		tmp = z * y;
	} else {
		tmp = t;
	}
	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) :: t_1
    real(8) :: tmp
    t_1 = ((x * y) + z) * y
    if ((t_1 <= (-1.0d0)) .or. (.not. (t_1 <= 1.5d+143))) then
        tmp = z * y
    else
        tmp = t
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = ((x * y) + z) * y;
	double tmp;
	if ((t_1 <= -1.0) || !(t_1 <= 1.5e+143)) {
		tmp = z * y;
	} else {
		tmp = t;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = ((x * y) + z) * y
	tmp = 0
	if (t_1 <= -1.0) or not (t_1 <= 1.5e+143):
		tmp = z * y
	else:
		tmp = t
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(Float64(x * y) + z) * y)
	tmp = 0.0
	if ((t_1 <= -1.0) || !(t_1 <= 1.5e+143))
		tmp = Float64(z * y);
	else
		tmp = t;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = ((x * y) + z) * y;
	tmp = 0.0;
	if ((t_1 <= -1.0) || ~((t_1 <= 1.5e+143)))
		tmp = z * y;
	else
		tmp = t;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(N[(x * y), $MachinePrecision] + z), $MachinePrecision] * y), $MachinePrecision]}, If[Or[LessEqual[t$95$1, -1.0], N[Not[LessEqual[t$95$1, 1.5e+143]], $MachinePrecision]], N[(z * y), $MachinePrecision], t]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (+.f64 (*.f64 x y) z) y) < -1 or 1.5e143 < (*.f64 (+.f64 (*.f64 x y) z) y)

   1. Initial program 99.9%

      \[\left(x \cdot y + z\right) \cdot y + t \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 36.5

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

   5. Applied rewrites 36.5%

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

   if -1 < (*.f64 (+.f64 (*.f64 x y) z) y) < 1.5e143

   1. Initial program 100.0%

      \[\left(x \cdot y + z\right) \cdot y + t \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

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

   5. Applied rewrites 79.1%

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

4. Final simplification 55.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(x \cdot y + z\right) \cdot y \leq -1 \lor \neg \left(\left(x \cdot y + z\right) \cdot y \leq 1.5 \cdot 10^{+143}\right):\\ \;\;\;\;z \cdot y\\ \mathbf{else}:\\ \;\;\;\;t\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 78.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2.7 \cdot 10^{+54} \lor \neg \left(y \leq 7.5 \cdot 10^{+18}\right):\\ \;\;\;\;\left(y \cdot x\right) \cdot y\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(z, y, t\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= y -2.7e+54) (not (<= y 7.5e+18))) (* (* y x) y) (fma z y t)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((y <= -2.7e+54) || !(y <= 7.5e+18)) {
		tmp = (y * x) * y;
	} else {
		tmp = fma(z, y, t);
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((y <= -2.7e+54) || !(y <= 7.5e+18))
		tmp = Float64(Float64(y * x) * y);
	else
		tmp = fma(z, y, t);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[y, -2.7e+54], N[Not[LessEqual[y, 7.5e+18]], $MachinePrecision]], N[(N[(y * x), $MachinePrecision] * y), $MachinePrecision], N[(z * y + t), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -2.70000000000000011e54 or 7.5e18 < y

   1. Initial program 100.0%

      \[\left(x \cdot y + z\right) \cdot y + t \]
   2. Add Preprocessing

   3. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

         \[\leadsto \left(y \cdot x + z\right) \cdot y \]

      5. lower-fma.f64 93.8

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

   5. Applied rewrites 93.8%

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

   6. Taylor expanded in x around inf

      \[\leadsto \left(x \cdot y\right) \cdot y \]
   7. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(y \cdot x\right) \cdot y \]

      2. lower-*.f64 74.1

         \[\leadsto \left(y \cdot x\right) \cdot y \]

   8. Applied rewrites 74.1%

      \[\leadsto \left(y \cdot x\right) \cdot y \]

   if -2.70000000000000011e54 < y < 7.5e18

   1. Initial program 99.9%

      \[\left(x \cdot y + z\right) \cdot y + t \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

         \[\leadsto z \cdot y + t \]

      3. lower-fma.f64 86.2

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

   5. Applied rewrites 86.2%

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

4. Final simplification 81.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2.7 \cdot 10^{+54} \lor \neg \left(y \leq 7.5 \cdot 10^{+18}\right):\\ \;\;\;\;\left(y \cdot x\right) \cdot y\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(z, y, t\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 65.5% accurate, 2.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.9%

   \[\left(x \cdot y + z\right) \cdot y + t \]
2. Add Preprocessing

3. Taylor expanded in x around 0

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

   1. +-commutative N/A

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

   2. *-commutative N/A

      \[\leadsto z \cdot y + t \]

   3. lower-fma.f64 65.4

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

5. Applied rewrites 65.4%

   \[\leadsto \color{blue}{\mathsf{fma}\left(z, y, t\right)} \]
6. Add Preprocessing

Alternative 8: 38.3% accurate, 17.0× speedup

Math

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

FPCore

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

C

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := t

Derivation

1. Initial program 99.9%

   \[\left(x \cdot y + z\right) \cdot y + t \]
2. Add Preprocessing

3. Taylor expanded in y around 0

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

5. Applied rewrites 40.3%

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

Reproduce

herbie shell --seed 2025064 
(FPCore (x y z t)
  :name "Language.Haskell.HsColour.ColourHighlight:unbase from hscolour-1.23"
  :precision binary64
  (+ (* (+ (* x y) z) y) t))