UnCompetition

UnCompetition is an esolang created by User:Yayimhere, with the focus of trying to have an undecidable question, instead of actually being a programming language, however there is no proof that it has any so far.

Description

UnCompetition consists of a tree, where each node is a program IN UnCompetition. these programs, are all "solutions" to another program. programs are formatted like "solve for x" style questions. when a program P1 is ran, it will start the tree, where every nodes holds a program that meets all the conditions specified in P1. then all these programs are ran, and so on, until no more solutions can be found. Programs are solved for in order of which is least complex, and which is most.

There is a limit on how many node's each generation or level of the tree can have. On the second generation(or first programs solved for), there is a max of 1000. That limit then grows by 200 every generation.

these are all the commands(each is on its own line). P1 is the current program, P2 are all the generated programs:

Command	Meaning
!	P1 and P2 will be different
?	P2 will branch
[x]	P2 will have x number of lines(from 1-9)
:x	If there's x many node's in the current level of the tree, then include the below indented code, else, do not(from 1-100)
#	P2 will not create any more node's
{x}	the command x is excluded from P2
(x)	oppesite of {x}

All numbers must be integers.
P solutions are not allowed to have repeating commands, and order doesn't matter. this includes having both a [x] and a [y], no matter the number(this only counts for [x]). They must also not have any errors.
If there is a [x] and a [y] in P1, the larger will always be chosen.
` can be used to represent a generic number for operations like :x and [x] when referenced in the {} and () operations (ex. {:`} )