Logic Programming pair #487096420

details

property	value
status	complete
benchmark	flatlength-bfb.pl
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n151.star.cs.uiowa.edu
space	BCGGV05

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.82153 seconds
cpu usage	4.02836
user time	3.85434
system time	0.174022
max virtual memory	1.8878088E7
max residence set size	285920.0

stage attributes

key	value
starexec-result	YES

output

YES
proof of /export/starexec/sandbox2/benchmark/theBenchmark.pl
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


Left Termination of the query pattern

fl(g,a,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 [SOUND, 0 ms]
(8) QDP
(9) QDPSizeChangeProof [EQUIVALENT, 1 ms]
(10) YES


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

(0)
Obligation:
Clauses:

fl([], [], 0).
fl(.(E, X), R, s(Z)) :- ','(append(E, Y, R), fl(X, Y, Z)).
append([], X, X).
append(.(X, Xs), Ys, .(X, Zs)) :- append(Xs, Ys, Zs).


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

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

{
    "root": 20,
    "program": {
        "directives": [],
        "clauses": [
            [
                "(fl ([]) ([]) (0))",
                null
            ],
            [
                "(fl (. E X) R (s Z))",
                "(',' (append E Y R) (fl X Y Z))"
            ],
            [
                "(append ([]) X X)",
                null
            ],
            [
                "(append (. X Xs) Ys (. X Zs))",
                "(append Xs Ys Zs)"
            ]
        ]
    },
    "graph": {
        "nodes": {
            "45": {
                "goal": [
                    {
                        "clause": 2,
                        "scope": 2,
                        "term": "(',' (append T8 X13 T12) (fl T9 X13 T11))"
                    },
                    {
                        "clause": 3,
                        "scope": 2,
                        "term": "(',' (append T8 X13 T12) (fl T9 X13 T11))"
                    }
                ],
                "kb": {
                    "nonunifying": [],
                    "intvars": {},
                    "arithmetic": {
                        "type": "PlainIntegerRelationState",
                        "relations": []
                    },
                    "ground": [
                        "T8",
                        "T9",
                        "T11"
                    ],
                    "free": ["X13"],
                    "exprvars": []
                }
            },
            "46": {
                "goal": [{
                    "clause": 2,
                    "scope": 2,

popout

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

job log

popout

actions all output return to Logic Programming