/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: 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 :- r. r :- ','(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)", "(r)" ], [ "(r)", "(',' (q) (!))" ], [ "(r)", "(q)" ], [ "(q)", null ], [ "(q)", "(r)" ] ] }, "graph": { "nodes": { "34": { "goal": [{ "clause": 0, "scope": 1, "term": "(p)" }], "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": [] } }, "35": { "goal": [{ "clause": -1, "scope": -1, "term": "(r)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "58": { "goal": [ { "clause": 1, "scope": 2, "term": "(r)" }, { "clause": 2, "scope": 2, "term": "(r)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "59": { "goal": [ { "clause": -1, "scope": -1, "term": "(',' (q) (!_2))" }, { "clause": 2, "scope": 2, "term": "(r)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "60": { "goal": [ { "clause": 3, "scope": 3, "term": "(',' (q) (!_2))" }, { "clause": 4, "scope": 3, "term": "(',' (q) (!_2))" }, { "clause": -1, "scope": 3, "term": null }, { "clause": 2, "scope": 2, "term": "(r)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "61": { "goal": [ { "clause": -1, "scope": -1, "term": "(!_2)" }, { "clause": 4, "scope": 3, "term": "(',' (q) (!_2))" }, { "clause": -1, "scope": 3, "term": null }, { "clause": 2, "scope": 2, "term": "(r)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "type": "Nodes", "62": { "goal": [{ "clause": -1, "scope": -1, "term": "(true)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "63": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } } }, "edges": [ { "from": 2, "to": 34, "label": "CASE" }, { "from": 34, "to": 35, "label": "ONLY EVAL with clause\np :- r.\nand substitution" }, { "from": 35, "to": 58, "label": "CASE" }, { "from": 58, "to": 59, "label": "ONLY EVAL with clause\nr :- ','(q, !_2).\nand substitution" }, { "from": 59, "to": 60, "label": "CASE" }, { "from": 60, "to": 61, "label": "ONLY EVAL with clause\nq.\nand substitution" }, { "from": 61, "to": 62, "label": "CUT" }, { "from": 62, "to": 63, "label": "SUCCESS" } ], "type": "Graph" } } ---------------------------------------- (2) TRUE