details

property	value
status	complete
benchmark	append-ooi.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_new

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.14742398262 seconds
cpu usage	3.793951405
max memory	2.7203584E8

stage attributes

key	value
output-size	6663
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 app(a,a,g) 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, 4 ms] (10) QDP (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Clauses: app([], X, X). app(.(X, Xs), Ys, .(X, Zs)) :- app(Xs, Ys, Zs). Query: app(a,a,g) ---------------------------------------- (1) PrologToPiTRSProof (SOUND) We use the technique of [TOCL09]. With regard to the inferred argument filtering the predicates were used in the following modes: app_in_3: (f,f,b) Transforming Prolog into the following Term Rewriting System: Pi-finite rewrite system: The TRS R consists of the following rules: app_in_aag([], X, X) -> app_out_aag([], X, X) app_in_aag(.(X, Xs), Ys, .(X, Zs)) -> U1_aag(X, Xs, Ys, Zs, app_in_aag(Xs, Ys, Zs)) U1_aag(X, Xs, Ys, Zs, app_out_aag(Xs, Ys, Zs)) -> app_out_aag(.(X, Xs), Ys, .(X, Zs)) The argument filtering Pi contains the following mapping: app_in_aag(x1, x2, x3) = app_in_aag(x3) app_out_aag(x1, x2, x3) = app_out_aag(x1, x2) .(x1, x2) = .(x1, x2) U1_aag(x1, x2, x3, x4, x5) = U1_aag(x1, 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: app_in_aag([], X, X) -> app_out_aag([], X, X) app_in_aag(.(X, Xs), Ys, .(X, Zs)) -> U1_aag(X, Xs, Ys, Zs, app_in_aag(Xs, Ys, Zs)) U1_aag(X, Xs, Ys, Zs, app_out_aag(Xs, Ys, Zs)) -> app_out_aag(.(X, Xs), Ys, .(X, Zs)) The argument filtering Pi contains the following mapping: app_in_aag(x1, x2, x3) = app_in_aag(x3) app_out_aag(x1, x2, x3) = app_out_aag(x1, x2) .(x1, x2) = .(x1, x2) U1_aag(x1, x2, x3, x4, x5) = U1_aag(x1, x5) ---------------------------------------- popout

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

job log

popout

actions

all output return to Logic Programming