Logic Programming pair #487096276

details

property	value
status	complete
benchmark	incomplete.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	SGST06

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.75838 seconds
cpu usage	3.82173
user time	3.62917
system time	0.192565
max virtual memory	1.8877864E7
max residence set size	286452.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)

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

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

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


Query: p(g)
----------------------------------------

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

{
    "root": 24,
    "program": {
        "directives": [],
        "clauses": [
            [
                "(p X)",
                "(',' (q (f Y)) (p Y))"
            ],
            [
                "(p (g X))",
                "(p X)"
            ],
            [
                "(q (g Y))",
                null
            ]
        ]
    },
    "graph": {
        "nodes": {
            "24": {
                "goal": [{
                    "clause": -1,
                    "scope": -1,
                    "term": "(p T1)"
                }],
                "kb": {
                    "nonunifying": [],
                    "intvars": {},
                    "arithmetic": {
                        "type": "PlainIntegerRelationState",
                        "relations": []
                    },
                    "ground": ["T1"],
                    "free": [],
                    "exprvars": []
                }
            },
            "25": {
                "goal": [
                    {
                        "clause": 0,
                        "scope": 1,
                        "term": "(p T1)"
                    },
                    {
                        "clause": 1,
                        "scope": 1,
                        "term": "(p T1)"
                    }
                ],
                "kb": {
                    "nonunifying": [],
                    "intvars": {},
                    "arithmetic": {
                        "type": "PlainIntegerRelationState",
                        "relations": []
                    },

popout

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

job log

popout

actions all output return to Logic Programming