details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.61383891106 seconds
cpu usage	3.581044276
max memory	2.61267456E8

stage attributes

key	value
output-size	6370
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 member(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, 6 ms] (10) QDP (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Clauses: member(X, .(Y, Xs)) :- member(X, Xs). member(X, .(X, Xs)). Query: member(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: member_in_2: (f,b) Transforming Prolog into the following Term Rewriting System: Pi-finite rewrite system: The TRS R consists of the following rules: member_in_ag(X, .(Y, Xs)) -> U1_ag(X, Y, Xs, member_in_ag(X, Xs)) member_in_ag(X, .(X, Xs)) -> member_out_ag(X, .(X, Xs)) U1_ag(X, Y, Xs, member_out_ag(X, Xs)) -> member_out_ag(X, .(Y, Xs)) The argument filtering Pi contains the following mapping: member_in_ag(x1, x2) = member_in_ag(x2) .(x1, x2) = .(x1, x2) U1_ag(x1, x2, x3, x4) = U1_ag(x4) member_out_ag(x1, x2) = member_out_ag(x1) Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog ---------------------------------------- (2) Obligation: Pi-finite rewrite system: The TRS R consists of the following rules: member_in_ag(X, .(Y, Xs)) -> U1_ag(X, Y, Xs, member_in_ag(X, Xs)) member_in_ag(X, .(X, Xs)) -> member_out_ag(X, .(X, Xs)) U1_ag(X, Y, Xs, member_out_ag(X, Xs)) -> member_out_ag(X, .(Y, Xs)) The argument filtering Pi contains the following mapping: member_in_ag(x1, x2) = member_in_ag(x2) .(x1, x2) = .(x1, x2) U1_ag(x1, x2, x3, x4) = U1_ag(x4) member_out_ag(x1, x2) = member_out_ag(x1) ---------------------------------------- popout

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

job log

popout

actions

all output return to Logic Progr 19030