details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.02676 seconds
cpu usage	4.80082
user time	4.57015
system time	0.230664
max virtual memory	1.8812552E7
max residence set size	371032.0

stage attributes

key	value
starexec-result	YES

output

YES proof of /export/starexec/sandbox/benchmark/theBenchmark.pl # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Left Termination of the query pattern countstack(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) UsableRulesReductionPairsProof [EQUIVALENT, 0 ms] (12) QDP (13) PisEmptyProof [EQUIVALENT, 0 ms] (14) YES ---------------------------------------- (0) Obligation: Clauses: countstack(empty, 0). countstack(push(nil, T), X) :- countstack(T, X). countstack(push(cons(U, V), T), s(X)) :- countstack(push(U, push(V, T)), X). Query: countstack(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: countstack_in_2: (b,f) Transforming Prolog into the following Term Rewriting System: Pi-finite rewrite system: The TRS R consists of the following rules: countstack_in_ga(empty, 0) -> countstack_out_ga(empty, 0) countstack_in_ga(push(nil, T), X) -> U1_ga(T, X, countstack_in_ga(T, X)) countstack_in_ga(push(cons(U, V), T), s(X)) -> U2_ga(U, V, T, X, countstack_in_ga(push(U, push(V, T)), X)) U2_ga(U, V, T, X, countstack_out_ga(push(U, push(V, T)), X)) -> countstack_out_ga(push(cons(U, V), T), s(X)) U1_ga(T, X, countstack_out_ga(T, X)) -> countstack_out_ga(push(nil, T), X) The argument filtering Pi contains the following mapping: countstack_in_ga(x1, x2) = countstack_in_ga(x1) empty = empty countstack_out_ga(x1, x2) = countstack_out_ga(x1, x2) push(x1, x2) = push(x1, x2) nil = nil U1_ga(x1, x2, x3) = U1_ga(x1, x3) cons(x1, x2) = cons(x1, x2) U2_ga(x1, x2, x3, x4, x5) = U2_ga(x1, x2, x3, x5) s(x1) = s(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: countstack_in_ga(empty, 0) -> countstack_out_ga(empty, 0) countstack_in_ga(push(nil, T), X) -> U1_ga(T, X, countstack_in_ga(T, X)) countstack_in_ga(push(cons(U, V), T), s(X)) -> U2_ga(U, V, T, X, countstack_in_ga(push(U, push(V, T)), X)) U2_ga(U, V, T, X, countstack_out_ga(push(U, push(V, T)), X)) -> countstack_out_ga(push(cons(U, V), T), s(X)) U1_ga(T, X, countstack_out_ga(T, X)) -> countstack_out_ga(push(nil, T), X) The argument filtering Pi contains the following mapping: countstack_in_ga(x1, x2) = countstack_in_ga(x1) popout

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

job log

popout

actions

all output return to Logic Programming