details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.00546813011 seconds
cpu usage	4.861598388
max memory	4.26057728E8

stage attributes

key	value
output-size	13509
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.pl /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.pl # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Left Termination of the query pattern hidden_flatten(g,a,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) CutEliminatorProof [SOUND, 0 ms] (2) Prolog (3) PrologToPiTRSProof [SOUND, 0 ms] (4) PiTRS (5) DependencyPairsProof [EQUIVALENT, 2 ms] (6) PiDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) PiDP (9) PiDPToQDPProof [SOUND, 12 ms] (10) QDP (11) UsableRulesReductionPairsProof [EQUIVALENT, 17 ms] (12) QDP (13) DependencyGraphProof [EQUIVALENT, 0 ms] (14) TRUE ---------------------------------------- (0) Obligation: Clauses: hidden_flatten([], L, L). hidden_flatten(.(.(H, T), L), S, F) :- ','(!, ','(hidden_flatten(L, S, Lf), hidden_flatten(.(H, T), Lf, F))). hidden_flatten(.(H, T), S, .(H, L)) :- hidden_flatten(T, S, L). Query: hidden_flatten(g,a,a) ---------------------------------------- (1) CutEliminatorProof (SOUND) Eliminated all cuts by simply ignoring them[PROLOG]. ---------------------------------------- (2) Obligation: Clauses: hidden_flatten([], L, L). hidden_flatten(.(.(H, T), L), S, F) :- ','(hidden_flatten(L, S, Lf), hidden_flatten(.(H, T), Lf, F)). hidden_flatten(.(H, T), S, .(H, L)) :- hidden_flatten(T, S, L). Query: hidden_flatten(g,a,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: hidden_flatten_in_3: (b,f,f) Transforming Prolog into the following Term Rewriting System: Pi-finite rewrite system: The TRS R consists of the following rules: hidden_flatten_in_gaa([], L, L) -> hidden_flatten_out_gaa([], L, L) hidden_flatten_in_gaa(.(.(H, T), L), S, F) -> U1_gaa(H, T, L, S, F, hidden_flatten_in_gaa(L, S, Lf)) hidden_flatten_in_gaa(.(H, T), S, .(H, L)) -> U3_gaa(H, T, S, L, hidden_flatten_in_gaa(T, S, L)) U3_gaa(H, T, S, L, hidden_flatten_out_gaa(T, S, L)) -> hidden_flatten_out_gaa(.(H, T), S, .(H, L)) U1_gaa(H, T, L, S, F, hidden_flatten_out_gaa(L, S, Lf)) -> U2_gaa(H, T, L, S, F, hidden_flatten_in_gaa(.(H, T), Lf, F)) U2_gaa(H, T, L, S, F, hidden_flatten_out_gaa(.(H, T), Lf, F)) -> hidden_flatten_out_gaa(.(.(H, T), L), S, F) The argument filtering Pi contains the following mapping: hidden_flatten_in_gaa(x1, x2, x3) = hidden_flatten_in_gaa(x1) [] = [] hidden_flatten_out_gaa(x1, x2, x3) = hidden_flatten_out_gaa .(x1, x2) = .(x1, x2) U1_gaa(x1, x2, x3, x4, x5, x6) = U1_gaa(x1, x2, x6) U3_gaa(x1, x2, x3, x4, x5) = U3_gaa(x5) U2_gaa(x1, x2, x3, x4, x5, x6) = U2_gaa(x6) popout

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

job log

popout

actions

all output return to Logic Progr 19030