Logic Progr 19030 pair #381919788

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.71466517448 seconds
cpu usage	3.970263735
max memory	2.77045248E8

stage attributes

key	value
output-size	39874
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

q(g,g)

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) AND
    (7) PiDP
        (8) PiDPToQDPProof [SOUND, 0 ms]
        (9) QDP
        (10) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (11) YES
    (12) PiDP
        (13) PiDPToQDPProof [SOUND, 0 ms]
        (14) QDP
        (15) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (16) YES


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

(0)
Obligation:
Clauses:

q(X, Y) :- m(X, Y, Z).
m(X, 0, X).
m(0, Y, 0) :- !.
m(X, Y, Z) :- ','(p(X, A), ','(p(Y, B), m(A, B, Z))).
p(0, 0).
p(s(X), X).


Query: q(g,g)
----------------------------------------

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

{
    "root": 1,
    "program": {
        "directives": [],
        "clauses": [
            [
                "(q X Y)",
                "(m X Y Z)"
            ],
            [
                "(m X (0) X)",
                null
            ],
            [
                "(m (0) Y (0))",
                "(!)"
            ],
            [
                "(m X Y Z)",
                "(',' (p X A) (',' (p Y B) (m A B Z)))"
            ],
            [
                "(p (0) (0))",
                null
            ],
            [
                "(p (s X) X)",
                null
            ]
        ]
    },
    "graph": {
        "nodes": {
            "29": {
                "goal": [{
                    "clause": -1,
                    "scope": -1,
                    "term": "(m T5 T6 X5)"
                }],
                "kb": {
                    "nonunifying": [],
                    "intvars": {},
                    "arithmetic": {
                        "type": "PlainIntegerRelationState",

popout

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

job log

popout

actions all output return to Logic Progr 19030