details

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

run statistics

property	value
solver	NTI_20
configuration	default
runtime (wallclock)	0.223919868469 seconds
cpu usage	0.195855837
max memory	3.3611776E7

stage attributes

key	value
output-size	1183
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 ** sublist(i,i): ([sublist(_0,_1) :- append1(_2,_0,_3), append1([_0|_1],_2,[_0|_3]) :- append1(_1,_2,_3)], {sublist/2->(0->_0, 1->_1), append1/3->(1->_2)}) ** END proof argument ** ** BEGIN proof description ** * Iteration = 0: 0 unfolded rule generated, 0 loop generated * Iteration = 1: 5 new unfolded rule(s) generated, 2 new loop(s) generated * Iteration = 2: 8 new unfolded rule(s) generated, 7 new loop(s) generated The mode sublist(i,i) is non-terminating because of the generated looping pair: ([sublist(_0,_1) :- append1(_2,_0,_3), append1([_0|_1],_2,[_0|_3]) :- append1(_1,_2,_3)], {sublist/2->(0->_0, 1->_1), append1/3->(1->_2)}) * All specified modes do not terminate: sublist(i,i) ** END proof description ** Proof stopped at iteration 2 Number of unfolded rules generated by this proof = 13 Number of unfolded rules generated by all the parallel proofs = 13 popout

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

job log

popout

actions

all output return to Logic Programming