There are many ambiguities here. The solver is expected to determine what things are "allowed" to be inputs for each process. To avoid confusion examples should not be sorted differently if you consider inputting nothing.

In each example there is at least some overlap between the set of possible inputs and the set of possible outputs for each process. If we did not apply this constraint, an easy example to be sorted right would be a process that turns blue shapes red.

A harder-to-read but more clearly defined version of this Problem could include within each example a mini Bongard Problem sorting left all allowed inputs for the process.

There are many ambiguities here. The solver is expected to determine what things are "allowed" to be inputs for each process. To avoid confusion examples should not be sorted differently if you consider inputting nothing.

In each example there is at least some overlap between the set of possible inputs and the set of possible outputs for each process. If we did not apply this constraint, an easy example to be sorted right would be a process that turns blue shapes red.

A much denser but more clearly defined version of this Problem could include within each example a mini Bongard Problem sorting left all allowed inputs for the process.

There are many ambiguities here. The solver is expected to determine what things are "allowed" to be inputs for each process. To avoid confusion examples should not be sorted differently if you consider inputting nothing.

In each example there is at least some overlap between the set of possible inputs and the set of possible outputs for each process. If we did not apply this constraint, an easy example to be sorted right would be a process that turns blue shapes red.

A much denser but more clearly defined version of this Problem could include within each example a mini Bongard Problem sorting left all allowed inputs for the process.

There are many ambiguities here. The solver is expected to determine what things are "allowed" to be inputs for each process. To avoid confusion examples should not be sorted differently if you consider inputting nothing.

In each example there is at least some overlap between the set of possible inputs and the set of possible outputs for each process. If we did not apply this constraint, an easy example to be sorted right would be a process that turns blue shapes red.

A much denser but more clearly defined version of this Problem could include within each example a mini Bongard Problem sorting left all allowed inputs for the process.

There are many ambiguities here. The solver is expected to determine what things are "allowed" to be inputs for each process. To avoid confusion examples should not be sorted differently if you consider inputting nothing.

In each example there is at least some overlap between the set of possible inputs and the set of possible outputs for each process. If we did not apply this constraint, an easy example to be sorted right would be a process that turns blue shapes red.

A much denser but more clearly defined version of this Problem could include an image of a Bongard Problem sorting all allowed inputs for a given process left in each panel.

There are many ambiguities here. The solver is expected to determine what things are "allowed" to be inputs for each process. To avoid confusion examples should not be sorted differently if you consider inputting nothing.

A much denser but more clearly defined version of this Problem could include an image of a Bongard Problem sorting all allowed inputs for a given process left in each panel.

In each example there is at least some overlap between the set of possible inputs and the set of possible outputs for each process. If we did not apply this constraint, an easy example to be sorted right would be a process that turns blue shapes red.

Process described leaves some inputs invariant vs. no output will resemble its input.

Processes described by panels leave some inputs invariant vs. no output will resemble its input.

There are many ambiguities here. The solver is expected to determine what things are "allowed" to be inputs for each process. To avoid confusion examples should not be sorted differently if you consider inputting nothing.

In each example there is at least some overlap between the set of possible inputs and the set of possible outputs for each process. If we did not apply this constraint, an easy example to be sorted right would be a process that turns blue shapes red.

https://en.wikipedia.org/wiki/Fixed_point_(mathematics)

Leo Crabbe

Image of a Bongard Problem whose examples' pixel-flip invariance depends on examples themselves vs. image of Bongard Problem whose examples would be pixel-flip invariant regardless of which examples are chosen.

Leo Crabbe