Logic Programming pair #487096130

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.73967 seconds
cpu usage	3.78028
user time	3.62051
system time	0.159777
max virtual memory	1.8478004E7
max residence set size	250352.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

fold(g,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, 0 ms]
(4) PiDP
(5) DependencyGraphProof [EQUIVALENT, 0 ms]
(6) TRUE


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

(0)
Obligation:
Clauses:

fold(X, .(Y, Ys), Z) :- ','(myop(X, Y, V), fold(V, Ys, Z)).
fold(X, [], X).
myop(a, b, c).


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

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

{
    "root": 2,
    "program": {
        "directives": [],
        "clauses": [
            [
                "(fold X (. Y Ys) Z)",
                "(',' (myop X Y V) (fold V Ys Z))"
            ],
            [
                "(fold X ([]) X)",
                null
            ],
            [
                "(myop (a) (b) (c))",
                null
            ]
        ]
    },
    "graph": {
        "nodes": {
            "88": {
                "goal": [],
                "kb": {
                    "nonunifying": [],
                    "intvars": {},
                    "arithmetic": {
                        "type": "PlainIntegerRelationState",
                        "relations": []
                    },
                    "ground": [],
                    "free": [],
                    "exprvars": []
                }
            },
            "45": {
                "goal": [{
                    "clause": 1,
                    "scope": 1,
                    "term": "(fold T1 T2 T3)"
                }],
                "kb": {
                    "nonunifying": [[
                        "(fold T1 T2 T3)",
                        "(fold X5 (. X6 X7) X8)"
                    ]],
                    "intvars": {},
                    "arithmetic": {
                        "type": "PlainIntegerRelationState",
                        "relations": []
                    },
                    "ground": [
                        "T1",
                        "T2"
                    ],
                    "free": [
                        "X5",
                        "X6",
                        "X7",
                        "X8"
                    ],
                    "exprvars": []
                }

popout

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

job log

popout

actions all output return to Logic Programming