details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.74243402481 seconds
cpu usage	3.899580201
max memory	2.74755584E8

stage attributes

key	value
output-size	10356
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 app3_a(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: app3_a(Xs, Ys, Zs, Us) :- ','(app(Xs, Ys, Vs), app(Vs, Zs, Us)). app3_b(Xs, Ys, Zs, Us) :- ','(app(Ys, Zs, Vs), app(Xs, Vs, Us)). app([], Ys, Ys). app(.(X, Xs), Ys, .(X, Zs)) :- app(Xs, Ys, Zs). Query: app3_a(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: app3_a_in_4: (b,b,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: app3_a_in_ggga(Xs, Ys, Zs, Us) -> U1_ggga(Xs, Ys, Zs, Us, app_in_gga(Xs, Ys, Vs)) app_in_gga([], Ys, Ys) -> app_out_gga([], Ys, Ys) app_in_gga(.(X, Xs), Ys, .(X, Zs)) -> U5_gga(X, Xs, Ys, Zs, app_in_gga(Xs, Ys, Zs)) U5_gga(X, Xs, Ys, Zs, app_out_gga(Xs, Ys, Zs)) -> app_out_gga(.(X, Xs), Ys, .(X, Zs)) U1_ggga(Xs, Ys, Zs, Us, app_out_gga(Xs, Ys, Vs)) -> U2_ggga(Xs, Ys, Zs, Us, app_in_gga(Vs, Zs, Us)) U2_ggga(Xs, Ys, Zs, Us, app_out_gga(Vs, Zs, Us)) -> app3_a_out_ggga(Xs, Ys, Zs, Us) The argument filtering Pi contains the following mapping: app3_a_in_ggga(x1, x2, x3, x4) = app3_a_in_ggga(x1, x2, x3) U1_ggga(x1, x2, x3, x4, x5) = U1_ggga(x3, 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) U5_gga(x1, x2, x3, x4, x5) = U5_gga(x1, x5) U2_ggga(x1, x2, x3, x4, x5) = U2_ggga(x5) app3_a_out_ggga(x1, x2, x3, x4) = app3_a_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: popout

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

job log

popout

actions

all output return to Logic Programming