details

property	value
status	complete
benchmark	mergesort.pl
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n139.star.cs.uiowa.edu
space	BCGGV05

run statistics

property	value
solver	NTI_20
configuration	default
runtime (wallclock)	0.212198019028 seconds
cpu usage	0.212648586
max memory	3.571712E7

stage attributes

key	value
output-size	1144
starexec-result	NO

output

/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.pl /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Prover = LP(tech=TOPLAS06, unlimited) ** BEGIN proof argument ** ms(o,i): ([ms([_0|[_1|_2]],_3) :- split([_1|_2],_4,_5), split([_0|_1],[_0|_2],_3) :- split(_1,_3,_2)], {split/3->(), ms/2->(1->_0)}) ** END proof argument ** ** BEGIN proof description ** * Iteration = 0: 0 unfolded rule generated, 0 loop generated * Iteration = 1: 11 new unfolded rule(s) generated, 2 new loop(s) generated * Iteration = 2: 15 new unfolded rule(s) generated, 13 new loop(s) generated The mode ms(o,i) is non-terminating because of the generated looping pair: ([ms([_0|[_1|_2]],_3) :- split([_1|_2],_4,_5), split([_0|_1],[_0|_2],_3) :- split(_1,_3,_2)], {split/3->(), ms/2->(1->_0)}) * All specified modes do not terminate: ms(o,i) ** END proof description ** Proof stopped at iteration 2 Number of unfolded rules generated by this proof = 26 Number of unfolded rules generated by all the parallel proofs = 26 popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Logic Programming