Logic Programming pair #487096608

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.60641 seconds
cpu usage	6.85395
user time	6.54963
system time	0.304314
max virtual memory	3.7908792E7
max residence set size	567868.0

stage attributes

key	value
starexec-result	YES

output

YES
proof of /export/starexec/sandbox/benchmark/theBenchmark.pl
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 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, 48 ms]
(2) AND
    (3) IRSwT
        (4) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms]
        (5) TRUE
    (6) IRSwT
        (7) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms]
        (8) IRSwT
        (9) IntTRSCompressionProof [EQUIVALENT, 53 ms]
        (10) IRSwT
        (11) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
        (12) IRSwT
        (13) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms]
        (14) IRSwT
        (15) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms]
        (16) IRSwT
        (17) TempFilterProof [SOUND, 2 ms]
        (18) IRSwT
        (19) IRSwTToQDPProof [SOUND, 0 ms]
        (20) QDP
        (21) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (22) YES


----------------------------------------

(0)
Obligation:
Clauses:

shanoi(s(0), A, B, C, .(mv(A, C), [])).
shanoi(s(s(X)), A, B, C, M) :- ','(eq(N1, s(X)), ','(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).
eq(X, X).


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 (s (0)) A B C (. (mv A C) ([])))",
                null
            ],
            [
                "(shanoi (s (s X)) A B C M)",
                "(',' (eq N1 (s X)) (',' (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)"
            ],
            [
                "(eq X X)",
                null
            ]
        ]
    },
    "graph": {
        "nodes": {
            "25": {
                "goal": [{
                    "clause": -1,
                    "scope": -1,
                    "term": "(',' (eq X35 (s T31)) (',' (shanoi X35 T32 T34 T33 X36) (',' (shanoi X35 T33 T32 T34 X37) (',' (append X36 (. (mv T32 T34) ([])) X38) (append X38 X37 T36)))))"
                }],
                "kb": {
                    "nonunifying": [],
                    "intvars": {},
                    "arithmetic": {
                        "type": "PlainIntegerRelationState",
                        "relations": []
                    },
                    "ground": [
                        "T31",
                        "T32",

popout

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

job log

popout

actions all output return to Logic Programming