details

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

run statistics

property	value
solver	NTI_20
configuration	default
runtime (wallclock)	0.207544803619 seconds
cpu usage	0.222440509
max memory	4.0726528E7

stage attributes

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

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

job log

popout

actions

all output return to Logic Programming