Logic Programming pair #487096534

details

property	value
status	complete
benchmark	transpose-bf.pl
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n138.star.cs.uiowa.edu
space	BCGGV05

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.9684 seconds
cpu usage	4.48904
user time	4.26167
system time	0.227369
max virtual memory	1.8942596E7
max residence set size	376612.0

stage attributes

key	value
starexec-result	YES

output

YES
proof of /export/starexec/sandbox2/benchmark/theBenchmark.pl
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


Left Termination of the query pattern

transpose(g,a)

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

(0) Prolog
(1) PrologToDTProblemTransformerProof [SOUND, 40 ms]
(2) TRIPLES
(3) TriplesToPiDPProof [SOUND, 0 ms]
(4) PiDP
(5) DependencyGraphProof [EQUIVALENT, 0 ms]
(6) AND
    (7) PiDP
        (8) UsableRulesProof [EQUIVALENT, 0 ms]
        (9) PiDP
        (10) PiDPToQDPProof [SOUND, 0 ms]
        (11) QDP
        (12) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (13) YES
    (14) PiDP
        (15) PiDPToQDPProof [SOUND, 0 ms]
        (16) QDP
        (17) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (18) YES


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

(0)
Obligation:
Clauses:

transpose(A, B) :- transpose_aux(A, [], B).
transpose_aux(.(R, Rs), X1, .(C, Cs)) :- ','(row2col(R, .(C, Cs), Cols1, Accm), transpose_aux(Rs, Accm, Cols1)).
transpose_aux([], X, X).
row2col(.(X, Xs), .(.(X, Ys), Cols), .(Ys, Cols1), .([], As)) :- row2col(Xs, Cols, Cols1, As).
row2col([], [], [], []).


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

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

{
    "root": 2,
    "program": {
        "directives": [],
        "clauses": [
            [
                "(transpose A B)",
                "(transpose_aux A ([]) B)"
            ],
            [
                "(transpose_aux (. R Rs) X1 (. C Cs))",
                "(',' (row2col R (. C Cs) Cols1 Accm) (transpose_aux Rs Accm Cols1))"
            ],
            [
                "(transpose_aux ([]) X X)",
                null
            ],
            [
                "(row2col (. X Xs) (. (. X Ys) Cols) (. Ys Cols1) (. ([]) As))",
                "(row2col Xs Cols Cols1 As)"
            ],
            [
                "(row2col ([]) ([]) ([]) ([]))",
                null
            ]
        ]
    },
    "graph": {
        "nodes": {
            "27": {
                "goal": [{
                    "clause": -1,
                    "scope": -1,
                    "term": "(row2col T24 (. T28 T29) X35 X36)"
                }],
                "kb": {
                    "nonunifying": [],
                    "intvars": {},
                    "arithmetic": {
                        "type": "PlainIntegerRelationState",
                        "relations": []
                    },
                    "ground": ["T24"],
                    "free": [
                        "X35",
                        "X36"
                    ],
                    "exprvars": []
                }

popout

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

job log

popout

actions all output return to Logic Programming