Logic Programming pair #487096314

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.06191 seconds
cpu usage	5.03632
user time	4.79327
system time	0.24305
max virtual memory	1.92793E7
max residence set size	426264.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

perm1(g,g)

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

(0) Prolog
(1) PrologToDTProblemTransformerProof [SOUND, 23 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 [EQUIVALENT, 0 ms]
        (11) QDP
        (12) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (13) YES
    (14) PiDP
        (15) UsableRulesProof [EQUIVALENT, 0 ms]
        (16) PiDP
        (17) PiDPToQDPProof [EQUIVALENT, 0 ms]
        (18) QDP
        (19) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (20) YES
    (21) PiDP
        (22) UsableRulesProof [EQUIVALENT, 0 ms]
        (23) PiDP
        (24) PiDPToQDPProof [EQUIVALENT, 0 ms]
        (25) QDP
        (26) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (27) YES


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

(0)
Obligation:
Clauses:

perm1(L, M) :- ','(eq_len1(L, M), same_sets(L, M)).
eq_len1([], []).
eq_len1(.(X1, Xs), .(X2, Ys)) :- eq_len1(Xs, Ys).
member(X, .(X, X3)).
member(X, .(X4, T)) :- member(X, T).
same_sets([], X5).
same_sets(.(X, Xs), L) :- ','(member(X, L), same_sets(Xs, L)).


Query: perm1(g,g)
----------------------------------------

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

{
    "root": 7,
    "program": {
        "directives": [],
        "clauses": [
            [
                "(perm1 L M)",
                "(',' (eq_len1 L M) (same_sets L M))"
            ],
            [
                "(eq_len1 ([]) ([]))",
                null
            ],
            [
                "(eq_len1 (. X1 Xs) (. X2 Ys))",
                "(eq_len1 Xs Ys)"
            ],
            [
                "(member X (. X X3))",
                null
            ],
            [
                "(member X (. X4 T))",
                "(member X T)"
            ],
            [
                "(same_sets ([]) X5)",
                null
            ],
            [
                "(same_sets (. X Xs) L)",
                "(',' (member X L) (same_sets Xs L))"
            ]
        ]
    },
    "graph": {
        "nodes": {
            "type": "Nodes",

popout

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

job log

popout

actions all output return to Logic Programming