Logic Programming pair #487096266

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.27204 seconds
cpu usage	9.62408
user time	9.12226
system time	0.501816
max virtual memory	2.0341608E7
max residence set size	981596.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

p(g)

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

(0) Prolog
(1) PrologToIRSwTTransformerProof [SOUND, 0 ms]
(2) IRSwT
(3) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms]
(4) IRSwT
(5) IntTRSCompressionProof [EQUIVALENT, 58 ms]
(6) IRSwT
(7) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
(8) IRSwT
(9) IRSwTTerminationDigraphProof [EQUIVALENT, 18 ms]
(10) IRSwT
(11) IntTRSCompressionProof [EQUIVALENT, 2 ms]
(12) IRSwT
(13) TempFilterProof [SOUND, 10 ms]
(14) IRSwT
(15) IRSwTToQDPProof [SOUND, 0 ms]
(16) QDP
(17) UsableRulesReductionPairsProof [EQUIVALENT, 0 ms]
(18) QDP
(19) PisEmptyProof [EQUIVALENT, 0 ms]
(20) YES


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

(0)
Obligation:
Clauses:

p(cons(X, nil)).
p(cons(s(s(X)), cons(Y, Xs))) :- ','(p(cons(X, cons(Y, Xs))), p(cons(s(s(s(s(Y)))), Xs))).
p(cons(0, Xs)) :- p(Xs).


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

(1) PrologToIRSwTTransformerProof (SOUND)
Transformed Prolog program to IRSwT according to method in Master Thesis of A. Weinert

{
    "root": 2,
    "program": {
        "directives": [],
        "clauses": [
            [
                "(p (cons X (nil)))",
                null
            ],
            [
                "(p (cons (s (s X)) (cons Y Xs)))",
                "(',' (p (cons X (cons Y Xs))) (p (cons (s (s (s (s Y)))) Xs)))"
            ],
            [
                "(p (cons (0) Xs))",
                "(p Xs)"
            ]
        ]
    },
    "graph": {
        "nodes": {
            "11": {
                "goal": [{
                    "clause": -1,
                    "scope": -1,
                    "term": "(true)"
                }],
                "kb": {
                    "nonunifying": [],
                    "intvars": {},
                    "arithmetic": {
                        "type": "PlainIntegerRelationState",
                        "relations": []
                    },
                    "ground": [],
                    "free": [],
                    "exprvars": []
                }
            },
            "22": {
                "goal": [{
                    "clause": -1,
                    "scope": -1,
                    "term": "(',' (p (cons T19 (cons T20 T21))) (p (cons (s (s (s (s T20)))) T21)))"
                }],
                "kb": {
                    "nonunifying": [],
                    "intvars": {},
                    "arithmetic": {

popout

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

job log

popout

actions all output return to Logic Programming