/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(g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToDTProblemTransformerProof [SOUND, 0 ms] (2) TRIPLES (3) TriplesToPiDPProof [SOUND, 0 ms] (4) PiDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) TRUE ---------------------------------------- (0) Obligation: Clauses: p(X, Z) :- ','(q(X, Y), p(Y, Z)). p(X, X). q(a, b). Query: p(g,a) ---------------------------------------- (1) PrologToDTProblemTransformerProof (SOUND) Built DT problem from termination graph DT10. { "root": 7, "program": { "directives": [], "clauses": [ [ "(p X Z)", "(',' (q X Y) (p Y Z))" ], [ "(p X X)", null ], [ "(q (a) (b))", null ] ] }, "graph": { "nodes": { "type": "Nodes", "110": { "goal": [{ "clause": 1, "scope": 1, "term": "(p T5 T2)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T5"], "free": [], "exprvars": [] } }, "102": { "goal": [{ "clause": 2, "scope": 2, "term": "(',' (q T5 X5) (p X5 T7))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T5"], "free": ["X5"], "exprvars": [] } }, "113": { "goal": [{ "clause": -1, "scope": -1, "term": "(true)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "103": { "goal": [ { "clause": -1, "scope": 2, "term": null }, { "clause": 1, "scope": 1, "term": "(p T5 T2)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T5"], "free": [], "exprvars": [] } }, "104": { "goal": [{ "clause": -1, "scope": -1, "term": "(p (b) T7)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "105": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "7": { "goal": [{ "clause": -1, "scope": -1, "term": "(p T1 T2)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T1"], "free": [], "exprvars": [] } }, "8": { "goal": [ { "clause": 0, "scope": 1, "term": "(p T1 T2)" }, { "clause": 1, "scope": 1, "term": "(p T1 T2)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T1"], "free": [], "exprvars": [] } }, "118": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "119": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "94": { "goal": [ { "clause": -1, "scope": -1, "term": "(',' (q T5 X5) (p X5 T7))" }, { "clause": 1, "scope": 1, "term": "(p T5 T2)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T5"], "free": ["X5"], "exprvars": [] } }, "95": { "goal": [ { "clause": 2, "scope": 2, "term": "(',' (q T5 X5) (p X5 T7))" }, { "clause": -1, "scope": 2, "term": null }, { "clause": 1, "scope": 1, "term": "(p T5 T2)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T5"], "free": ["X5"], "exprvars": [] } } }, "edges": [ { "from": 7, "to": 8, "label": "CASE" }, { "from": 8, "to": 94, "label": "ONLY EVAL with clause\np(X3, X4) :- ','(q(X3, X5), p(X5, X4)).\nand substitutionT1 -> T5,\nX3 -> T5,\nT2 -> T7,\nX4 -> T7,\nT6 -> T7" }, { "from": 94, "to": 95, "label": "CASE" }, { "from": 95, "to": 102, "label": "PARALLEL" }, { "from": 95, "to": 103, "label": "PARALLEL" }, { "from": 102, "to": 104, "label": "EVAL with clause\nq(a, b).\nand substitutionT5 -> a,\nX5 -> b" }, { "from": 102, "to": 105, "label": "EVAL-BACKTRACK" }, { "from": 103, "to": 110, "label": "FAILURE" }, { "from": 104, "to": 7, "label": "INSTANCE with matching:\nT1 -> b\nT2 -> T7" }, { "from": 110, "to": 113, "label": "EVAL with clause\np(X11, X11).\nand substitutionT5 -> T11,\nX11 -> T11,\nT2 -> T11" }, { "from": 110, "to": 118, "label": "EVAL-BACKTRACK" }, { "from": 113, "to": 119, "label": "SUCCESS" } ], "type": "Graph" } } ---------------------------------------- (2) Obligation: Triples: pA(a, X1) :- pA(b, X1). Clauses: pcA(a, X1) :- pcA(b, X1). pcA(X1, X1). Afs: pA(x1, x2) = pA(x1) ---------------------------------------- (3) TriplesToPiDPProof (SOUND) We use the technique of [DT09]. With regard to the inferred argument filtering the predicates were used in the following modes: pA_in_2: (b,f) Transforming TRIPLES into the following Term Rewriting System: Pi DP problem: The TRS P consists of the following rules: PA_IN_GA(a, X1) -> U1_GA(X1, pA_in_ga(b, X1)) PA_IN_GA(a, X1) -> PA_IN_GA(b, X1) R is empty. The argument filtering Pi contains the following mapping: pA_in_ga(x1, x2) = pA_in_ga(x1) a = a b = b PA_IN_GA(x1, x2) = PA_IN_GA(x1) U1_GA(x1, x2) = U1_GA(x2) We have to consider all (P,R,Pi)-chains Infinitary Constructor Rewriting Termination of PiDP implies Termination of TRIPLES ---------------------------------------- (4) Obligation: Pi DP problem: The TRS P consists of the following rules: PA_IN_GA(a, X1) -> U1_GA(X1, pA_in_ga(b, X1)) PA_IN_GA(a, X1) -> PA_IN_GA(b, X1) R is empty. The argument filtering Pi contains the following mapping: pA_in_ga(x1, x2) = pA_in_ga(x1) a = a b = b PA_IN_GA(x1, x2) = PA_IN_GA(x1) U1_GA(x1, x2) = U1_GA(x2) We have to consider all (P,R,Pi)-chains ---------------------------------------- (5) DependencyGraphProof (EQUIVALENT) The approximation of the Dependency Graph [LOPSTR] contains 0 SCCs with 2 less nodes. ---------------------------------------- (6) TRUE