details

property	value
status	complete
benchmark	program-8-6-a.pl
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n027.star.cs.uiowa.edu
space	Art-of-prolog

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.72810983658 seconds
cpu usage	3.916563857
max memory	2.77848064E8

stage attributes

key	value
output-size	37082
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.pl /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.pl # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Left Termination of the query pattern sumlist(g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToDTProblemTransformerProof [SOUND, 0 ms] (2) TRIPLES (3) TriplesToPiDPProof [SOUND, 11 ms] (4) PiDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) PiDP (7) PiDPToQDPProof [SOUND, 0 ms] (8) QDP (9) QDPSizeChangeProof [EQUIVALENT, 0 ms] (10) YES ---------------------------------------- (0) Obligation: Clauses: sumlist(.(I, Is), Sum) :- ','(sumlist(Is, IsSum), is(Sum, +(I, IsSum))). sumlist([], 0). Query: sumlist(g,a) ---------------------------------------- (1) PrologToDTProblemTransformerProof (SOUND) Built DT problem from termination graph DT10. { "root": 1, "program": { "directives": [], "clauses": [ [ "(sumlist (. I Is) Sum)", "(',' (sumlist Is IsSum) (is Sum (+ I IsSum)))" ], [ "(sumlist ([]) (0))", null ] ] }, "graph": { "nodes": { "24": { "goal": [{ "clause": -1, "scope": -1, "term": "(sumlist T19 X29)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T19"], "free": ["X29"], "exprvars": [] } }, "25": { "goal": [{ "clause": -1, "scope": -1, "term": "(',' (is X30 (+ T18 T22)) (is T9 (+ T6 X30)))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [ "T6", "T18", "T22" ], "free": ["X30"], popout

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

job log

popout

actions

all output return to Logic Progr 19030