Logic Progr 19030 pair #381920146

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.70809698105 seconds
cpu usage	3.884879484
max memory	2.76905984E8

stage attributes

key	value
output-size	12765
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

list(g)

w.r.t. the given Prolog program could successfully be proven:

(0) Prolog
(1) PrologToDTProblemTransformerProof [SOUND, 0 ms]
(2) TRIPLES
(3) TriplesToPiDPProof [SOUND, 0 ms]
(4) PiDP
(5) DependencyGraphProof [EQUIVALENT, 0 ms]
(6) PiDP
(7) PiDPToQDPProof [EQUIVALENT, 0 ms]
(8) QDP
(9) QDPSizeChangeProof [EQUIVALENT, 0 ms]
(10) YES


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

(0)
Obligation:
Clauses:

list([]) :- !.
list(X) :- ','(tail(X, T), list(T)).
tail([], []).
tail(.(X, Xs), Xs).


Query: list(g)
----------------------------------------

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

{
    "root": 1,
    "program": {
        "directives": [],
        "clauses": [
            [
                "(list ([]))",
                "(!)"
            ],
            [
                "(list X)",
                "(',' (tail X T) (list T))"
            ],
            [
                "(tail ([]) ([]))",
                null
            ],
            [
                "(tail (. X Xs) Xs)",
                null
            ]
        ]
    },
    "graph": {
        "nodes": {
            "55": {
                "goal": [{
                    "clause": 3,
                    "scope": 2,
                    "term": "(',' (tail T3 X3) (list X3))"
                }],
                "kb": {
                    "nonunifying": [[
                        "(list T3)",
                        "(list ([]))"
                    ]],
                    "intvars": {},
                    "arithmetic": {
                        "type": "PlainIntegerRelationState",
                        "relations": []
                    },
                    "ground": ["T3"],
                    "free": ["X3"],
                    "exprvars": []
                }
            },
            "1": {
                "goal": [{
                    "clause": -1,
                    "scope": -1,
                    "term": "(list T1)"
                }],

popout

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

job log

popout

actions all output return to Logic Progr 19030