Logic Progr 19030 pair #381919867

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.72127199173 seconds
cpu usage	18.610108112
max memory	9.29071104E8

stage attributes

key	value
output-size	30314
starexec-result	YES

output

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


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


YES
proof of /export/starexec/sandbox/benchmark/theBenchmark.pl
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


Left Termination of the query pattern

p(g,g)

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

(0) Prolog
(1) PrologToTRSTransformerProof [SOUND, 0 ms]
(2) QTRS
(3) Overlay + Local Confluence [EQUIVALENT, 0 ms]
(4) QTRS
(5) DependencyPairsProof [EQUIVALENT, 0 ms]
(6) QDP
(7) DependencyGraphProof [EQUIVALENT, 0 ms]
(8) AND
    (9) QDP
        (10) UsableRulesProof [EQUIVALENT, 0 ms]
        (11) QDP
        (12) QReductionProof [EQUIVALENT, 0 ms]
        (13) QDP
        (14) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (15) YES
    (16) QDP
        (17) UsableRulesProof [EQUIVALENT, 0 ms]
        (18) QDP
        (19) QReductionProof [EQUIVALENT, 0 ms]
        (20) QDP
        (21) NonInfProof [EQUIVALENT, 52 ms]
        (22) AND
            (23) QDP
                (24) DependencyGraphProof [EQUIVALENT, 0 ms]
                (25) TRUE
            (26) QDP
                (27) DependencyGraphProof [EQUIVALENT, 0 ms]
                (28) TRUE


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

(0)
Obligation:
Clauses:

p(X, Y) :- ','(less(X, Y), ','(!, p(s(X), Y))).
less(0, s(X1)).
less(s(X), s(Y)) :- less(X, Y).


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

(1) PrologToTRSTransformerProof (SOUND)
Transformed Prolog program to TRS.

{
    "root": 2,
    "program": {
        "directives": [],
        "clauses": [
            [
                "(p X Y)",
                "(',' (less X Y) (',' (!) (p (s X) Y)))"
            ],
            [
                "(less (0) (s X1))",
                null
            ],
            [
                "(less (s X) (s Y))",
                "(less X Y)"
            ]
        ]
    },
    "graph": {
        "nodes": {
            "88": {
                "goal": [],
                "kb": {
                    "nonunifying": [],
                    "intvars": {},
                    "arithmetic": {
                        "type": "PlainIntegerRelationState",
                        "relations": []
                    },
                    "ground": [],
                    "free": [],
                    "exprvars": []
                }
            },

popout

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

job log

popout

actions all output return to Logic Progr 19030