details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.65816998482 seconds
cpu usage	3.778840765
max memory	2.64429568E8

stage attributes

key	value
output-size	6983
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 append3(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, 0 ms] (10) QDP (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Clauses: append1([], X, X). append1(.(X, Y), U, .(X, Z)) :- append1(Y, U, Z). append2([], X, X). append2(.(X, Y), U, .(X, Z)) :- append2(Y, U, Z). append3([], X, X). append3(.(X, Y), U, .(X, Z)) :- append3(Y, U, Z). Query: append3(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: append3_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: append3_in_aag([], X, X) -> append3_out_aag([], X, X) append3_in_aag(.(X, Y), U, .(X, Z)) -> U3_aag(X, Y, U, Z, append3_in_aag(Y, U, Z)) U3_aag(X, Y, U, Z, append3_out_aag(Y, U, Z)) -> append3_out_aag(.(X, Y), U, .(X, Z)) The argument filtering Pi contains the following mapping: append3_in_aag(x1, x2, x3) = append3_in_aag(x3) append3_out_aag(x1, x2, x3) = append3_out_aag(x1, x2) .(x1, x2) = .(x1, x2) U3_aag(x1, x2, x3, x4, x5) = U3_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: append3_in_aag([], X, X) -> append3_out_aag([], X, X) append3_in_aag(.(X, Y), U, .(X, Z)) -> U3_aag(X, Y, U, Z, append3_in_aag(Y, U, Z)) U3_aag(X, Y, U, Z, append3_out_aag(Y, U, Z)) -> append3_out_aag(.(X, Y), U, .(X, Z)) The argument filtering Pi contains the following mapping: append3_in_aag(x1, x2, x3) = append3_in_aag(x3) append3_out_aag(x1, x2, x3) = append3_out_aag(x1, x2) .(x1, x2) = .(x1, x2) U3_aag(x1, x2, x3, x4, x5) = U3_aag(x1, x5) popout

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

job log

popout

actions

all output return to Logic Progr 19030