The program gen.py generates an .owl file, a linear constraints (cd1) file. Reasoning task is common for all sizes, A implies B.

Input for the generator: n, the length of a proof chain.

Example run:
python3 gen.py 3 {-name example}
It will generate three files, "example.owl", "example.txt" and "example.scala". If -name is not specified, default names are "artificial3.txt" and "artificial3.owl".

An example of a reasoning task of size 1.

The ontology
	A -> A r0.(C0 & LC)
	LC: num0 = 5
	A r0.C0 -> E r0.LC0
	LC0: num1 = 5
	E r0.(C0 & LC0' & neg EQ) -> C0'
	EQ: num0 = num1 \/ num2 = num1 \/ num2 = num3 \/ num3 = num4 

	LC0': num0 + 2*num1 = 15 %lin combination of LC and LC0
	C0' -> B 
implies A->B
