details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.91909503937 seconds
cpu usage	4.156165937
max memory	3.50572544E8

stage attributes

key	value
output-size	8211
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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Left Termination of the query pattern reverse_concatenate(g,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) PiDP (7) UsableRulesProof [EQUIVALENT, 0 ms] (8) PiDP (9) PiDPToQDPProof [SOUND, 0 ms] (10) QDP (11) QDPSizeChangeProof [EQUIVALENT, 2 ms] (12) YES ---------------------------------------- (0) Obligation: Clauses: concatenate([], L, L). concatenate(.(X, L1), L2, .(X, L3)) :- concatenate(L1, L2, L3). member(X, .(X, L)). member(X, .(Y, L)) :- member(X, L). reverse(L, L1) :- reverse_concatenate(L, [], L1). reverse_concatenate([], L, L). reverse_concatenate(.(X, L1), L2, L3) :- reverse_concatenate(L1, .(X, L2), L3). Query: reverse_concatenate(g,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: reverse_concatenate_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: reverse_concatenate_in_gga([], L, L) -> reverse_concatenate_out_gga([], L, L) reverse_concatenate_in_gga(.(X, L1), L2, L3) -> U4_gga(X, L1, L2, L3, reverse_concatenate_in_gga(L1, .(X, L2), L3)) U4_gga(X, L1, L2, L3, reverse_concatenate_out_gga(L1, .(X, L2), L3)) -> reverse_concatenate_out_gga(.(X, L1), L2, L3) The argument filtering Pi contains the following mapping: reverse_concatenate_in_gga(x1, x2, x3) = reverse_concatenate_in_gga(x1, x2) [] = [] reverse_concatenate_out_gga(x1, x2, x3) = reverse_concatenate_out_gga(x3) .(x1, x2) = .(x1, x2) U4_gga(x1, x2, x3, x4, x5) = U4_gga(x5) Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog ---------------------------------------- (2) Obligation: Pi-finite rewrite system: The TRS R consists of the following rules: reverse_concatenate_in_gga([], L, L) -> reverse_concatenate_out_gga([], L, L) reverse_concatenate_in_gga(.(X, L1), L2, L3) -> U4_gga(X, L1, L2, L3, reverse_concatenate_in_gga(L1, .(X, L2), L3)) U4_gga(X, L1, L2, L3, reverse_concatenate_out_gga(L1, .(X, L2), L3)) -> reverse_concatenate_out_gga(.(X, L1), L2, L3) The argument filtering Pi contains the following mapping: reverse_concatenate_in_gga(x1, x2, x3) = reverse_concatenate_in_gga(x1, x2) [] = [] reverse_concatenate_out_gga(x1, x2, x3) = reverse_concatenate_out_gga(x3) popout

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

job log

popout

actions

all output return to Logic Programming