details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.90859293938 seconds
cpu usage	4.082647835
max memory	2.79699456E8

stage attributes

key	value
output-size	10377
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 append3(g,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, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Clauses: append([], L, L). append(.(H, L1), L2, .(H, L3)) :- append(L1, L2, L3). append3(A, B, C, D) :- ','(append(A, B, E), append(E, C, D)). Query: append3(g,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: append3_in_4: (b,b,b,f) append_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: append3_in_ggga(A, B, C, D) -> U2_ggga(A, B, C, D, append_in_gga(A, B, E)) append_in_gga([], L, L) -> append_out_gga([], L, L) append_in_gga(.(H, L1), L2, .(H, L3)) -> U1_gga(H, L1, L2, L3, append_in_gga(L1, L2, L3)) U1_gga(H, L1, L2, L3, append_out_gga(L1, L2, L3)) -> append_out_gga(.(H, L1), L2, .(H, L3)) U2_ggga(A, B, C, D, append_out_gga(A, B, E)) -> U3_ggga(A, B, C, D, append_in_gga(E, C, D)) U3_ggga(A, B, C, D, append_out_gga(E, C, D)) -> append3_out_ggga(A, B, C, D) The argument filtering Pi contains the following mapping: append3_in_ggga(x1, x2, x3, x4) = append3_in_ggga(x1, x2, x3) U2_ggga(x1, x2, x3, x4, x5) = U2_ggga(x3, x5) append_in_gga(x1, x2, x3) = append_in_gga(x1, x2) [] = [] append_out_gga(x1, x2, x3) = append_out_gga(x3) .(x1, x2) = .(x1, x2) U1_gga(x1, x2, x3, x4, x5) = U1_gga(x1, x5) U3_ggga(x1, x2, x3, x4, x5) = U3_ggga(x5) append3_out_ggga(x1, x2, x3, x4) = append3_out_ggga(x4) Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog ---------------------------------------- (2) Obligation: Pi-finite rewrite system: The TRS R consists of the following rules: append3_in_ggga(A, B, C, D) -> U2_ggga(A, B, C, D, append_in_gga(A, B, E)) popout

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

job log

popout

actions

all output return to Logic Programming