Increasing proof sequences incrementally

The test script for cut-introduction now tests the
proof sequences (n) by iteratively increasing n,
stopping only when a timeout is reached.

git-svn-id: https://gapt.googlecode.com/svn/trunk@2368 85d21ef8-add0-11de-ae77-5bfb9c5a3f34