Logic Progr 19030 pair #381919791

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.96284294128 seconds
cpu usage	8.584933032
max memory	1.03274496E9

stage attributes

key	value
output-size	1730939
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.pl /export/starexec/sandbox/output/output_files


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


YES
proof of /export/starexec/sandbox/benchmark/theBenchmark.pl
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


Left Termination of the query pattern

group(g,g,a)

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

(0) Prolog
(1) PrologToDTProblemTransformerProof [SOUND, 128 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) UsableRulesProof [EQUIVALENT, 0 ms]
        (16) PiDP
        (17) PiDPToQDPProof [SOUND, 0 ms]
        (18) QDP
        (19) QDPQMonotonicMRRProof [EQUIVALENT, 28 ms]
        (20) QDP
        (21) DependencyGraphProof [EQUIVALENT, 0 ms]
        (22) TRUE


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

(0)
Obligation:
Clauses:

group([], [], []).
group(G, .(N1, Ns), .(G1, Gs)) :- ','(selectN(N1, G, G1), ','(subtract(G, G1, R), group(R, Ns, Gs))).
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: group(g,g,a)
----------------------------------------

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

{
    "root": 1,
    "program": {
        "directives": [],
        "clauses": [
            [
                "(group ([]) ([]) ([]))",
                null
            ],
            [
                "(group G (. N1 Ns) (. G1 Gs))",
                "(',' (selectN N1 G G1) (',' (subtract G G1 R) (group R Ns Gs)))"
            ],
            [
                "(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": {
            "3002": {
                "goal": [],
                "kb": {
                    "nonunifying": [],
                    "intvars": {},

popout

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

job log

popout

actions all output return to Logic Progr 19030