Logic Programming pair #487529615

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.70667004585 seconds
cpu usage	3.445234942
max memory	2.2454272E8

stage attributes

key	value
output-size	17461
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.pl /export/starexec/sandbox2/output/output_files


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


YES
proof of /export/starexec/sandbox2/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, 0 ms]
(2) TRIPLES
(3) TPisEmptyProof [EQUIVALENT, 0 ms]
(4) YES


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

(0)
Obligation:
Clauses:

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


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

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

{
    "root": 8,
    "program": {
        "directives": [],
        "clauses": [
            [
                "(p X (g X))",
                null
            ],
            [
                "(p X (f X))",
                "(p X (g Y))"
            ]
        ]
    },
    "graph": {
        "nodes": {
            "99": {
                "goal": [],
                "kb": {
                    "nonunifying": [],
                    "intvars": {},
                    "arithmetic": {
                        "type": "PlainIntegerRelationState",
                        "relations": []
                    },
                    "ground": [],
                    "free": [],
                    "exprvars": []
                }
            },
            "45": {
                "goal": [{
                    "clause": 0,
                    "scope": 2,
                    "term": "(p T6 (g X5))"
                }],
                "kb": {
                    "nonunifying": [],
                    "intvars": {},
                    "arithmetic": {
                        "type": "PlainIntegerRelationState",
                        "relations": []
                    },
                    "ground": ["T6"],
                    "free": ["X5"],
                    "exprvars": []
                }
            },
            "46": {
                "goal": [{
                    "clause": 1,
                    "scope": 2,
                    "term": "(p T6 (g X5))"
                }],
                "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