details

property	value
status	complete
benchmark	slowsort-oi.pl
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n150.star.cs.uiowa.edu
space	talp_talp

run statistics

property	value
solver	NTI-TC20-firstrun
configuration	Default 200
runtime (wallclock)	0.245382 seconds
cpu usage	0.293118
user time	0.235931
system time	0.057187
max virtual memory	113188.0
max residence set size	45652.0

stage attributes

key	value
starexec-result	NO

output

NO Prover = LP(tech=TOPLAS06, unlimited) ** BEGIN proof argument ** slowsort(o,i): ([slowsort([_0|[_1]],[_2|[_3]]) :- delete(_2,[_0|_1],_4), delete(_0,[_1|_2],_3) :- delete(_0,_2,_3)], {delete/3->(0->_0, 2->_1), slowsort/2->(1->[_2|[_3]])}) ** 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: 17 new unfolded rule(s) generated, 11 new loop(s) generated The mode slowsort(o,i) is non-terminating because of the generated looping pair: ([slowsort([_0|[_1]],[_2|[_3]]) :- delete(_2,[_0|_1],_4), delete(_0,[_1|_2],_3) :- delete(_0,_2,_3)], {delete/3->(0->_0, 2->_1), slowsort/2->(1->[_2|[_3]])}) * All specified modes do not terminate: slowsort(o,i) ** END proof description ** Proof stopped at iteration 2 Number of unfolded rules generated by this proof = 28 Number of unfolded rules generated by all the parallel proofs = 28 popout

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

job log

popout

actions

all output return to Logic Programming