details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.17953801155 seconds
cpu usage	5.690672853
max memory	4.98745344E8

stage attributes

key	value
output-size	40903
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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Left Termination of the query pattern hbal_tree(g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToDTProblemTransformerProof [SOUND, 49 ms] (2) TRIPLES (3) TriplesToPiDPProof [SOUND, 0 ms] (4) PiDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) PiDP (7) PiDPToQDPProof [SOUND, 0 ms] (8) QDP (9) MRRProof [EQUIVALENT, 61 ms] (10) QDP (11) PisEmptyProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Clauses: hbal_tree(zero, nil). hbal_tree(s(zero), t(x, nil, nil)). hbal_tree(s(s(X)), t(x, L, R)) :- ','(distr(s(X), X, DL, DR), ','(hbal_tree(DL, L), hbal_tree(DR, R))). distr(D1, X1, D1, D1). distr(D1, D2, D1, D2). distr(D1, D2, D2, D1). Query: hbal_tree(g,a) ---------------------------------------- (1) PrologToDTProblemTransformerProof (SOUND) Built DT problem from termination graph DT10. { "root": 1, "program": { "directives": [], "clauses": [ [ "(hbal_tree (zero) (nil))", null ], [ "(hbal_tree (s (zero)) (t (x) (nil) (nil)))", null ], [ "(hbal_tree (s (s X)) (t (x) L R))", "(',' (distr (s X) X DL DR) (',' (hbal_tree DL L) (hbal_tree DR R)))" ], [ "(distr D1 X1 D1 D1)", null ], [ "(distr D1 D2 D1 D2)", null ], [ "(distr D1 D2 D2 D1)", null ] ] }, "graph": { "nodes": { "66": { "goal": [ { "clause": 3, "scope": 2, "term": "(',' (distr (s T6) T6 X14 X15) (',' (hbal_tree X14 T9) (hbal_tree X15 T10)))" }, { "clause": 4, "scope": 2, "term": "(',' (distr (s T6) T6 X14 X15) (',' (hbal_tree X14 T9) (hbal_tree X15 T10)))" }, { "clause": 5, "scope": 2, popout

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

job log

popout

actions

all output return to Logic Programming