details

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

run statistics

property	value
solver	NTI_20
configuration	default
runtime (wallclock)	0.236032962799 seconds
cpu usage	0.209066667
max memory	3.6773888E7

stage attributes

key	value
output-size	1135
starexec-result	NO

output

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

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

job log

popout

actions

all output return to Logic Programming