details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.64614009857 seconds
cpu usage	7.003757212
max memory	4.10677248E8

stage attributes

key	value
output-size	40621
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.pl /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.pl # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Left Termination of the query pattern shanoi(g,g,g,g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToIRSwTTransformerProof [SOUND, 61 ms] (2) AND (3) IRSwT (4) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms] (5) TRUE (6) IRSwT (7) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms] (8) IRSwT (9) IntTRSCompressionProof [EQUIVALENT, 0 ms] (10) IRSwT (11) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (12) IRSwT (13) IRSwTTerminationDigraphProof [EQUIVALENT, 47 ms] (14) IRSwT (15) IntTRSCompressionProof [EQUIVALENT, 0 ms] (16) IRSwT (17) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (18) IRSwT (19) TempFilterProof [SOUND, 40 ms] (20) IntTRS (21) RankingReductionPairProof [EQUIVALENT, 13 ms] (22) YES ---------------------------------------- (0) Obligation: Clauses: shanoi(1, A, B, C, .(mv(A, C), [])). shanoi(N, A, B, C, M) :- ','(>(N, 1), ','(is(N1, -(N, 1)), ','(shanoi(N1, A, C, B, M1), ','(shanoi(N1, B, A, C, M2), ','(append(M1, .(mv(A, C), []), T), append(T, M2, M)))))). append([], L, L). append(.(H, L), L1, .(H, R)) :- append(L, L1, R). demo :- ','(=(Size, 15), ','(format('Towers of Hanoi for ~w elements', .(Size, [])), ','(time(X1, A), ','(nl, ','(nl, ','(shanoi(Size, a, b, c, Sol), ','(time(T, Sol), ','(format('The solution is: ~w', .(Sol, [])), ','(nl, ','(format('Solved in ~w msec.', .(T, [])), nl)))))))))). Query: shanoi(g,g,g,g,a) ---------------------------------------- (1) PrologToIRSwTTransformerProof (SOUND) Transformed Prolog program to IRSwT according to method in Master Thesis of A. Weinert { "root": 3, "program": { "directives": [], "clauses": [ [ "(shanoi (1) A B C (. (mv A C) ([])))", null ], [ "(shanoi N A B C M)", "(',' (> N (1)) (',' (is N1 (- N (1))) (',' (shanoi N1 A C B M1) (',' (shanoi N1 B A C M2) (',' (append M1 (. (mv A C) ([])) T) (append T M2 M))))))" ], [ "(append ([]) L L)", null ], [ "(append (. H L) L1 (. H R))", "(append L L1 R)" ], [ "(demo)", "(',' (= Size (15)) (',' (format ('Towers of Hanoi for ~w elements') (. Size ([]))) (',' (time X1 A) (',' (nl) (',' (nl) (',' (shanoi Size (a) (b) (c) Sol) (',' (time T Sol) (',' (format ('The solution is: ~w') (. Sol ([]))) (',' (nl) (',' (format ('Solved in ~w msec.') (. T ([]))) (nl)))))))))))" ] ] }, "graph": { "nodes": { "23": { "goal": [{ "clause": -1, "scope": -1, "term": "(',' (> T32 (1)) (',' (is X36 (- T32 (1))) (',' (shanoi X36 T33 T35 T34 X37) (',' (shanoi X36 T34 T33 T35 X38) (',' (append X37 (. (mv T33 T35) ([])) X39) (append X39 X38 T37))))))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { popout

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

job log

popout

actions

all output return to Logic Progr 19030