Logic Progr 19030 pair #381919834

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.90836405754 seconds
cpu usage	4.68292774
max memory	4.38480896E8

stage attributes

key	value
output-size	48548
starexec-result	YES

output

/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

tak(g,g,g,a)

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

(0) Prolog
(1) PrologToDTProblemTransformerProof [SOUND, 62 ms]
(2) TRIPLES
(3) TPisEmptyProof [EQUIVALENT, 0 ms]
(4) YES


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

(0)
Obligation:
Clauses:

tak(X, Y, Z, A) :- ','(=<(X, Y), ','(!, =(Z, A))).
tak(X, Y, Z, A) :- ','(is(X1, -(X, 1)), ','(is(Y1, -(Y, 1)), ','(is(Z1, -(Z, 1)), ','(tak(Z1, X, Y, A3), ','(tak(Y1, Z, X, A2), ','(tak(X1, Y, Z, A1), tak(A1, A2, A3, A))))))).
test :- ','(tak(14, 12, 6, X), ','(write(X), nl)).


Query: tak(g,g,g,a)
----------------------------------------

(1) PrologToDTProblemTransformerProof (SOUND)
Built DT problem from termination graph DT10.

{
    "root": 1,
    "program": {
        "directives": [],
        "clauses": [
            [
                "(tak X Y Z A)",
                "(',' (=< X Y) (',' (!) (= Z A)))"
            ],
            [
                "(tak X Y Z A)",
                "(',' (is X1 (- X (1))) (',' (is Y1 (- Y (1))) (',' (is Z1 (- Z (1))) (',' (tak Z1 X Y A3) (',' (tak Y1 Z X A2) (',' (tak X1 Y Z A1) (tak A1 A2 A3 A)))))))"
            ],
            [
                "(test)",
                "(',' (tak (14) (12) (6) X) (',' (write X) (nl)))"
            ]
        ]
    },
    "graph": {
        "nodes": {
            "3123": {
                "goal": [{
                    "clause": -1,
                    "scope": -1,
                    "term": "(= T11 T13)"
                }],
                "kb": {
                    "nonunifying": [],
                    "intvars": {},
                    "arithmetic": {
                        "type": "PlainIntegerRelationState",
                        "relations": [{
                            "lhs": {
                                "name": "T9",
                                "type": "PlainIntegerVariable"
                            },
                            "type": "PlainIntegerRelation",
                            "rhs": {
                                "name": "T10",
                                "type": "PlainIntegerVariable"
                            },
                            "operation": "<="
                        }]
                    },
                    "ground": ["T11"],
                    "free": [],
                    "exprvars": [
                        "T10",
                        "T9"
                    ]
                }
            },
            "3122": {
                "goal": [{
                    "clause": 1,
                    "scope": 1,
                    "term": "(tak T9 T10 T11 T4)"
                }],

popout

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

job log

popout

actions all output return to Logic Progr 19030