/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() w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToIRSwTTransformerProof [SOUND, 0 ms] (2) TRUE ---------------------------------------- (0) Obligation: Clauses: p :- ','(q, ','(r, !)). q. q :- q. r. Query: p() ---------------------------------------- (1) PrologToIRSwTTransformerProof (SOUND) Transformed Prolog program to IRSwT according to method in Master Thesis of A. Weinert { "root": 2, "program": { "directives": [], "clauses": [ [ "(p)", "(',' (q) (',' (r) (!)))" ], [ "(q)", null ], [ "(q)", "(q)" ], [ "(r)", null ] ] }, "graph": { "nodes": { "44": { "goal": [ { "clause": -1, "scope": -1, "term": "(!_1)" }, { "clause": -1, "scope": 3, "term": null }, { "clause": 2, "scope": 2, "term": "(',' (q) (',' (r) (!_1)))" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "2": { "goal": [{ "clause": -1, "scope": -1, "term": "(p)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "47": { "goal": [{ "clause": -1, "scope": -1, "term": "(true)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "37": { "goal": [{ "clause": -1, "scope": -1, "term": "(',' (q) (',' (r) (!_1)))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "38": { "goal": [ { "clause": 1, "scope": 2, "term": "(',' (q) (',' (r) (!_1)))" }, { "clause": 2, "scope": 2, "term": "(',' (q) (',' (r) (!_1)))" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "9": { "goal": [{ "clause": 0, "scope": 1, "term": "(p)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "50": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "type": "Nodes", "40": { "goal": [ { "clause": -1, "scope": -1, "term": "(',' (r) (!_1))" }, { "clause": 2, "scope": 2, "term": "(',' (q) (',' (r) (!_1)))" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "42": { "goal": [ { "clause": 3, "scope": 3, "term": "(',' (r) (!_1))" }, { "clause": -1, "scope": 3, "term": null }, { "clause": 2, "scope": 2, "term": "(',' (q) (',' (r) (!_1)))" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } } }, "edges": [ { "from": 2, "to": 9, "label": "CASE" }, { "from": 9, "to": 37, "label": "ONLY EVAL with clause\np :- ','(q, ','(r, !_1)).\nand substitution" }, { "from": 37, "to": 38, "label": "CASE" }, { "from": 38, "to": 40, "label": "ONLY EVAL with clause\nq.\nand substitution" }, { "from": 40, "to": 42, "label": "CASE" }, { "from": 42, "to": 44, "label": "ONLY EVAL with clause\nr.\nand substitution" }, { "from": 44, "to": 47, "label": "CUT" }, { "from": 47, "to": 50, "label": "SUCCESS" } ], "type": "Graph" } } ---------------------------------------- (2) TRUE