Logic Programming pair #487529537

details

property	value
status	complete
benchmark	inorder-bf.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	BCGGV05

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.04759001732 seconds
cpu usage	4.812724726
max memory	3.95476992E8

stage attributes

key	value
output-size	16478
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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


Left Termination of the query pattern

in_order(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, 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) PiDPToQDPProof [SOUND, 0 ms]
        (16) QDP
        (17) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (18) YES


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

(0)
Obligation:
Clauses:

in_order(void, []).
in_order(tree(X, Left, Right), Xs) :- ','(in_order(Left, Ls), ','(in_order(Right, Rs), app(Ls, .(X, Rs), Xs))).
app([], X, X).
app(.(X, Xs), Ys, .(X, Zs)) :- app(Xs, Ys, Zs).


Query: in_order(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:

in_order_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:

   in_order_in_ga(void, []) -> in_order_out_ga(void, [])
   in_order_in_ga(tree(X, Left, Right), Xs) -> U1_ga(X, Left, Right, Xs, in_order_in_ga(Left, Ls))
   U1_ga(X, Left, Right, Xs, in_order_out_ga(Left, Ls)) -> U2_ga(X, Left, Right, Xs, Ls, in_order_in_ga(Right, Rs))
   U2_ga(X, Left, Right, Xs, Ls, in_order_out_ga(Right, Rs)) -> U3_ga(X, Left, Right, Xs, app_in_gga(Ls, .(X, 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(X, Left, Right, Xs, app_out_gga(Ls, .(X, Rs), Xs)) -> in_order_out_ga(tree(X, Left, Right), Xs)

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

void  =  void

in_order_out_ga(x1, x2)  =  in_order_out_ga(x2)

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

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

U2_ga(x1, x2, x3, x4, x5, x6)  =  U2_ga(x1, 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 Programming