Logic Progr 19030 pair #381920041

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.25539493561 seconds
cpu usage	9.142150556
max memory	5.33291008E8

stage attributes

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

rev(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) QDPOrderProof [EQUIVALENT, 227 ms]
        (18) QDP
        (19) DependencyGraphProof [EQUIVALENT, 0 ms]
        (20) TRUE


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

(0)
Obligation:
Clauses:

rev([], []).
rev(.(X, XS), .(Y, YS)) :- ','(rev1(X, XS, Y), rev2(X, XS, YS)).
rev1(X, [], X).
rev1(X, .(Y, YS), Z) :- rev1(Y, YS, Z).
rev2(X, [], []).
rev2(X, .(Y, YS), ZS) :- ','(rev2(Y, YS, US), ','(rev(US, VS), rev(.(X, VS), ZS))).


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

rev_in_2: (b,f)

rev1_in_3: (b,b,f)

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

   rev_in_ga([], []) -> rev_out_ga([], [])
   rev_in_ga(.(X, XS), .(Y, YS)) -> U1_ga(X, XS, Y, YS, rev1_in_gga(X, XS, Y))
   rev1_in_gga(X, [], X) -> rev1_out_gga(X, [], X)
   rev1_in_gga(X, .(Y, YS), Z) -> U3_gga(X, Y, YS, Z, rev1_in_gga(Y, YS, Z))
   U3_gga(X, Y, YS, Z, rev1_out_gga(Y, YS, Z)) -> rev1_out_gga(X, .(Y, YS), Z)
   U1_ga(X, XS, Y, YS, rev1_out_gga(X, XS, Y)) -> U2_ga(X, XS, Y, YS, rev2_in_gga(X, XS, YS))
   rev2_in_gga(X, [], []) -> rev2_out_gga(X, [], [])
   rev2_in_gga(X, .(Y, YS), ZS) -> U4_gga(X, Y, YS, ZS, rev2_in_gga(Y, YS, US))
   U4_gga(X, Y, YS, ZS, rev2_out_gga(Y, YS, US)) -> U5_gga(X, Y, YS, ZS, rev_in_ga(US, VS))
   U5_gga(X, Y, YS, ZS, rev_out_ga(US, VS)) -> U6_gga(X, Y, YS, ZS, rev_in_ga(.(X, VS), ZS))
   U6_gga(X, Y, YS, ZS, rev_out_ga(.(X, VS), ZS)) -> rev2_out_gga(X, .(Y, YS), ZS)
   U2_ga(X, XS, Y, YS, rev2_out_gga(X, XS, YS)) -> rev_out_ga(.(X, XS), .(Y, YS))

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

[]  =  []

rev_out_ga(x1, x2)  =  rev_out_ga(x1, x2)

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

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

rev1_in_gga(x1, x2, x3)  =  rev1_in_gga(x1, x2)

rev1_out_gga(x1, x2, x3)  =  rev1_out_gga(x1, x2, x3)

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

popout

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

job log

popout

actions all output return to Logic Progr 19030