Logic Programming pair #487096306

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.87014 seconds
cpu usage	4.32869
user time	4.11177
system time	0.216926
max virtual memory	1.8810496E7
max residence set size	343456.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

p(g,a)

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

(0) Prolog
(1) PrologToDTProblemTransformerProof [SOUND, 32 ms]
(2) TRIPLES
(3) TriplesToPiDPProof [SOUND, 9 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:

p(X, X).
p(f(X), g(Y)) :- ','(p(f(X), f(Z)), p(Z, g(W))).


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

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

{
    "root": 1,
    "program": {
        "directives": [],
        "clauses": [
            [
                "(p X X)",
                null
            ],
            [
                "(p (f X) (g Y))",
                "(',' (p (f X) (f Z)) (p Z (g W)))"
            ]
        ]
    },
    "graph": {
        "nodes": {
            "66": {
                "goal": [],
                "kb": {
                    "nonunifying": [],
                    "intvars": {},
                    "arithmetic": {
                        "type": "PlainIntegerRelationState",
                        "relations": []
                    },
                    "ground": [],
                    "free": [],
                    "exprvars": []
                }
            },
            "67": {
                "goal": [
                    {
                        "clause": 0,
                        "scope": 2,
                        "term": "(',' (p (f T7) (f X7)) (p X7 (g X8)))"
                    },
                    {
                        "clause": 1,
                        "scope": 2,
                        "term": "(',' (p (f T7) (f X7)) (p X7 (g X8)))"
                    }
                ],
                "kb": {
                    "nonunifying": [],
                    "intvars": {},
                    "arithmetic": {
                        "type": "PlainIntegerRelationState",
                        "relations": []
                    },
                    "ground": ["T7"],
                    "free": [
                        "X7",
                        "X8"
                    ],
                    "exprvars": []
                }
            },
            "68": {

popout

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

job log

popout

actions all output return to Logic Programming