Logic Progr 19030 pair #381919893

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.98733282089 seconds
cpu usage	4.399990494
max memory	2.2616064E8

stage attributes

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

front(g,a)

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

(0) Prolog
(1) PrologToPiTRSProof [SOUND, 0 ms]
(2) PiTRS
(3) DependencyPairsProof [EQUIVALENT, 11 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:

front(void, []).
front(tree(X, void, void), .(X, [])).
front(tree(X1, L, R), Xs) :- ','(front(L, Ls), ','(front(R, Rs), app(Ls, Rs, Xs))).
app([], X, X).
app(.(X, Xs), Ys, .(X, Zs)) :- app(Xs, Ys, Zs).


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

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

front_in_2: (b,f)

app_in_3: (b,b,f)

Transforming Prolog into the following Term Rewriting System:

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

   front_in_ga(void, []) -> front_out_ga(void, [])
   front_in_ga(tree(X, void, void), .(X, [])) -> front_out_ga(tree(X, void, void), .(X, []))
   front_in_ga(tree(X1, L, R), Xs) -> U1_ga(X1, L, R, Xs, front_in_ga(L, Ls))
   U1_ga(X1, L, R, Xs, front_out_ga(L, Ls)) -> U2_ga(X1, L, R, Xs, Ls, front_in_ga(R, Rs))
   U2_ga(X1, L, R, Xs, Ls, front_out_ga(R, Rs)) -> U3_ga(X1, L, R, Xs, app_in_gga(Ls, Rs, Xs))
   app_in_gga([], X, X) -> app_out_gga([], X, X)
   app_in_gga(.(X, Xs), Ys, .(X, Zs)) -> U4_gga(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs))
   U4_gga(X, Xs, Ys, Zs, app_out_gga(Xs, Ys, Zs)) -> app_out_gga(.(X, Xs), Ys, .(X, Zs))
   U3_ga(X1, L, R, Xs, app_out_gga(Ls, Rs, Xs)) -> front_out_ga(tree(X1, L, R), Xs)

The argument filtering Pi contains the following mapping:
front_in_ga(x1, x2)  =  front_in_ga(x1)

void  =  void

front_out_ga(x1, x2)  =  front_out_ga(x2)

tree(x1, x2, x3)  =  tree(x1, x2, x3)

U1_ga(x1, x2, x3, x4, x5)  =  U1_ga(x3, x5)

U2_ga(x1, x2, x3, x4, x5, x6)  =  U2_ga(x5, x6)

U3_ga(x1, x2, x3, x4, x5)  =  U3_ga(x5)

app_in_gga(x1, x2, x3)  =  app_in_gga(x1, x2)

[]  =  []

app_out_gga(x1, x2, x3)  =  app_out_gga(x3)

.(x1, x2)  =  .(x1, x2)

U4_gga(x1, x2, x3, x4, x5)  =  U4_gga(x1, x5)

popout

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

job log

popout

actions all output return to Logic Progr 19030