details

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

run statistics

property	value
solver	NTI_20
configuration	default
runtime (wallclock)	0.211071014404 seconds
cpu usage	0.190046966
max memory	3.3959936E7

stage attributes

key	value
output-size	1085
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 ** p(o): ([p([1|_0]) :- l(_0), l([1|_0]) :- l(_0)], {l/1->(), p/1->()}) ** END proof argument ** ** BEGIN proof description ** * Iteration = 0: 0 unfolded rule generated, 0 loop generated * Iteration = 1: 5 new unfolded rule(s) generated, 0 new loop(s) generated * Iteration = 2: 5 new unfolded rule(s) generated, 1 new loop(s) generated * Iteration = 3: 3 new unfolded rule(s) generated, 1 new loop(s) generated The mode p(o) is non-terminating because of the generated looping pair: ([p([1|_0]) :- l(_0), l([1|_0]) :- l(_0)], {l/1->(), p/1->()}) * All specified modes do not terminate: p(o) ** END proof description ** Proof stopped at iteration 3 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