Logic Progr 19030 pair #381919703

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.38739013672 seconds
cpu usage	6.505328667
max memory	5.10377984E8

stage attributes

key	value
output-size	49029
starexec-result	MAYBE

output

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


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


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


Left Termination of the query pattern

encode_direct(g,a)

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

(0) Prolog
(1) UndefinedPredicateHandlerProof [SOUND, 0 ms]
(2) Prolog
(3) PrologToPiTRSProof [SOUND, 2 ms]
(4) PiTRS
(5) DependencyPairsProof [EQUIVALENT, 16 ms]
(6) PiDP
(7) DependencyGraphProof [EQUIVALENT, 0 ms]
(8) AND
    (9) PiDP
        (10) UsableRulesProof [EQUIVALENT, 0 ms]
        (11) PiDP
        (12) PiDPToQDPProof [SOUND, 19 ms]
        (13) QDP
        (14) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (15) YES
    (16) PiDP
        (17) UsableRulesProof [EQUIVALENT, 0 ms]
        (18) PiDP
        (19) PiDPToQDPProof [SOUND, 0 ms]
        (20) QDP
        (21) MRRProof [EQUIVALENT, 153 ms]
        (22) QDP
        (23) PisEmptyProof [EQUIVALENT, 0 ms]
        (24) YES


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

(0)
Obligation:
Clauses:

encode_direct([], []).
encode_direct(.(X, Xs), .(Z, Zs)) :- ','(count(X, Xs, Ys, 1, Z), encode_direct(Ys, Zs)).
count(X, [], [], 1, X).
count(X, [], [], N, .(N, .(X, []))) :- >(N, 1).
count(X, .(Y, Ys), .(Y, Ys), 1, X) :- \=(X, Y).
count(X, .(Y, Ys), .(Y, Ys), N, .(N, .(X, []))) :- ','(>(N, 1), \=(X, Y)).
count(X, .(X, Xs), Ys, K, T) :- ','(is(K1, +(K, 1)), count(X, Xs, Ys, K1, T)).


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

(1) UndefinedPredicateHandlerProof (SOUND)
Added facts for all undefined predicates [PROLOG].
----------------------------------------

(2)
Obligation:
Clauses:

encode_direct([], []).
encode_direct(.(X, Xs), .(Z, Zs)) :- ','(count(X, Xs, Ys, 1, Z), encode_direct(Ys, Zs)).
count(X, [], [], 1, X).
count(X, [], [], N, .(N, .(X, []))) :- >(N, 1).
count(X, .(Y, Ys), .(Y, Ys), 1, X) :- \=(X, Y).
count(X, .(Y, Ys), .(Y, Ys), N, .(N, .(X, []))) :- ','(>(N, 1), \=(X, Y)).
count(X, .(X, Xs), Ys, K, T) :- ','(is(K1, +(K, 1)), count(X, Xs, Ys, K1, T)).
>(X0, X1).
\=(X0, X1).
is(X0, X1).


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

(3) PrologToPiTRSProof (SOUND)
We use the technique of [TOCL09]. With regard to the inferred argument filtering the predicates were used in the following modes:

encode_direct_in_2: (b,f)

count_in_5: (b,b,f,b,f) (b,b,f,f,f)

Transforming Prolog into the following Term Rewriting System:

Pi-finite rewrite system:
The TRS R consists of the following rules:

popout

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

job log

popout

actions all output return to Logic Progr 19030