details

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

run statistics

property	value
solver	NTI_20
configuration	default
runtime (wallclock)	0.22337603569 seconds
cpu usage	0.184835077
max memory	3.5856384E7

stage attributes

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

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

job log

popout

actions

all output return to Logic Programming