Logic Programming pair #487096606

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.14789 seconds
cpu usage	5.25163
user time	4.95616
system time	0.295469
max virtual memory	1.934038E7
max residence set size	459104.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

flat(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, 4 ms]
(4) PiDP
(5) DependencyGraphProof [EQUIVALENT, 0 ms]
(6) PiDP
(7) PiDPToQDPProof [SOUND, 0 ms]
(8) QDP
(9) UsableRulesReductionPairsProof [EQUIVALENT, 12 ms]
(10) QDP
(11) MRRProof [EQUIVALENT, 0 ms]
(12) QDP
(13) PisEmptyProof [EQUIVALENT, 0 ms]
(14) YES


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

(0)
Obligation:
Clauses:

right(tree(X, XS1, XS2), XS2).
flat(niltree, nil).
flat(tree(X, niltree, XS), cons(X, YS)) :- ','(right(tree(X, niltree, XS), ZS), flat(ZS, YS)).
flat(tree(X, tree(Y, YS1, YS2), XS), ZS) :- flat(tree(Y, YS1, tree(X, YS2, XS)), ZS).


Query: flat(g,a)
----------------------------------------

(1) PrologToDTProblemTransformerProof (SOUND)
Built DT problem from termination graph DT10.

{
    "root": 2,
    "program": {
        "directives": [],
        "clauses": [
            [
                "(right (tree X XS1 XS2) XS2)",
                null
            ],
            [
                "(flat (niltree) (nil))",
                null
            ],
            [
                "(flat (tree X (niltree) XS) (cons X YS))",
                "(',' (right (tree X (niltree) XS) ZS) (flat ZS YS))"
            ],
            [
                "(flat (tree X (tree Y YS1 YS2) XS) ZS)",
                "(flat (tree Y YS1 (tree X YS2 XS)) ZS)"
            ]
        ]
    },
    "graph": {
        "nodes": {
            "type": "Nodes",
            "197": {
                "goal": [
                    {
                        "clause": -1,
                        "scope": -1,
                        "term": "(',' (right (tree T6 (niltree) T7) X16) (flat X16 T9))"
                    },
                    {
                        "clause": 3,
                        "scope": 1,
                        "term": "(flat (tree T6 (niltree) T7) T2)"
                    }
                ],
                "kb": {
                    "nonunifying": [],
                    "intvars": {},
                    "arithmetic": {
                        "type": "PlainIntegerRelationState",
                        "relations": []
                    },
                    "ground": [
                        "T6",
                        "T7"
                    ],
                    "free": ["X16"],
                    "exprvars": []
                }
            },

popout

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

job log

popout

actions all output return to Logic Programming