Logic Progr 19030 pair #381919940

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.03379607201 seconds
cpu usage	8.586786023
max memory	1.148870656E9

stage attributes

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

group3(g,a,a,a)

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

(0) Prolog
(1) PrologToDTProblemTransformerProof [SOUND, 80 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, 4 ms]
        (11) QDP
        (12) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (13) YES
    (14) PiDP
        (15) PiDPToQDPProof [SOUND, 0 ms]
        (16) QDP
        (17) QDPOrderProof [EQUIVALENT, 35 ms]
        (18) QDP
        (19) PisEmptyProof [EQUIVALENT, 0 ms]
        (20) YES


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

(0)
Obligation:
Clauses:

group3(G, G1, G2, G3) :- ','(selectN(2, G, G1), ','(subtract(G, G1, R1), ','(selectN(3, R1, G2), ','(subtract(R1, G2, R2), ','(selectN(4, R2, G3), subtract(R2, G3, [])))))).
selectN(0, X1, []) :- !.
selectN(N, L, .(X, S)) :- ','(>(N, 0), ','(el(X, L, R), ','(is(N1, -(N, 1)), selectN(N1, R, S)))).
el(X, .(X, L), L).
el(X, .(X2, L), R) :- el(X, L, R).


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

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

{
    "root": 1,
    "program": {
        "directives": [],
        "clauses": [
            [
                "(group3 G G1 G2 G3)",
                "(',' (selectN (2) G G1) (',' (subtract G G1 R1) (',' (selectN (3) R1 G2) (',' (subtract R1 G2 R2) (',' (selectN (4) R2 G3) (subtract R2 G3 ([])))))))"
            ],
            [
                "(selectN (0) X1 ([]))",
                "(!)"
            ],
            [
                "(selectN N L (. X S))",
                "(',' (> N (0)) (',' (el X L R) (',' (is N1 (- N (1))) (selectN N1 R S))))"
            ],
            [
                "(el X (. X L) L)",
                null
            ],
            [
                "(el X (. X2 L) R)",
                "(el X L R)"
            ]
        ]
    },
    "graph": {
        "nodes": {
            "44": {
                "goal": [{
                    "clause": -1,
                    "scope": -1,
                    "term": "(el T61 T60 X62)"
                }],
                "kb": {
                    "nonunifying": [],
                    "intvars": {},
                    "arithmetic": {
                        "type": "PlainIntegerRelationState",
                        "relations": [

popout

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

job log

popout

actions all output return to Logic Progr 19030