Logic Programming pair #487096562

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.69671 seconds
cpu usage	3.79949
user time	3.6233
system time	0.176188
max virtual memory	1.8945224E7
max residence set size	275356.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

sum(a,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, 5 ms]
(4) PiDP
(5) DependencyGraphProof [EQUIVALENT, 0 ms]
(6) PiDP
(7) PiDPToQDPProof [SOUND, 0 ms]
(8) QDP
(9) QDPSizeChangeProof [EQUIVALENT, 0 ms]
(10) YES


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

(0)
Obligation:
Clauses:

sum(X, 0, X).
sum(X, s(Y), s(Z)) :- sum(X, Y, Z).


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

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

{
    "root": 6,
    "program": {
        "directives": [],
        "clauses": [
            [
                "(sum X (0) X)",
                null
            ],
            [
                "(sum X (s Y) (s Z))",
                "(sum X Y Z)"
            ]
        ]
    },
    "graph": {
        "nodes": {
            "88": {
                "goal": [
                    {
                        "clause": 0,
                        "scope": 2,
                        "term": "(sum T13 T11 T14)"
                    },
                    {
                        "clause": 1,
                        "scope": 2,
                        "term": "(sum T13 T11 T14)"
                    }
                ],
                "kb": {
                    "nonunifying": [],
                    "intvars": {},
                    "arithmetic": {
                        "type": "PlainIntegerRelationState",
                        "relations": []
                    },
                    "ground": ["T11"],
                    "free": [],
                    "exprvars": []
                }
            },
            "12": {
                "goal": [
                    {
                        "clause": 0,
                        "scope": 1,
                        "term": "(sum T1 T2 T3)"
                    },
                    {
                        "clause": 1,
                        "scope": 1,
                        "term": "(sum T1 T2 T3)"
                    }
                ],
                "kb": {
                    "nonunifying": [],
                    "intvars": {},
                    "arithmetic": {
                        "type": "PlainIntegerRelationState",

popout

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

job log

popout

actions all output return to Logic Programming