details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.46895718575 seconds
cpu usage	6.566693737
max memory	6.06777344E8

stage attributes

key	value
output-size	24455
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 hanoi(g,g,g,g,a,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToIRSwTTransformerProof [SOUND, 15 ms] (2) IRSwT (3) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms] (4) IRSwT (5) IntTRSCompressionProof [EQUIVALENT, 22 ms] (6) IRSwT (7) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (8) IRSwT (9) IRSwTTerminationDigraphProof [EQUIVALENT, 45 ms] (10) IRSwT (11) IntTRSCompressionProof [EQUIVALENT, 0 ms] (12) IRSwT (13) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (14) IRSwT (15) TempFilterProof [SOUND, 33 ms] (16) IntTRS (17) PolynomialOrderProcessor [EQUIVALENT, 12 ms] (18) YES ---------------------------------------- (0) Obligation: Clauses: hanoi(1, A, B, C, .(to(A, B), Zs), Zs). hanoi(N, A, B, C, Xs, Zs) :- ','(>(N, 1), ','(is(N1, -(N, 1)), ','(hanoi(N1, A, C, B, Xs, .(to(A, B), Ys)), hanoi(N1, C, B, A, Ys, Zs)))). Query: hanoi(g,g,g,g,a,a) ---------------------------------------- (1) PrologToIRSwTTransformerProof (SOUND) Transformed Prolog program to IRSwT according to method in Master Thesis of A. Weinert { "root": 1, "program": { "directives": [], "clauses": [ [ "(hanoi (1) A B C (. (to A B) Zs) Zs)", null ], [ "(hanoi N A B C Xs Zs)", "(',' (> N (1)) (',' (is N1 (- N (1))) (',' (hanoi N1 A C B Xs (. (to A B) Ys)) (hanoi N1 C B A Ys Zs))))" ] ] }, "graph": { "nodes": { "22": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "23": { "goal": [{ "clause": -1, "scope": -1, "term": "(',' (> T41 (1)) (',' (is X41 (- T41 (1))) (',' (hanoi X41 T42 T44 T43 T47 (. (to T42 T43) X42)) (hanoi X41 T44 T43 T42 X42 T48))))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [ "T41", popout

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

job log

popout

actions

all output return to Logic Progr 19030