details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.77666902542 seconds
cpu usage	4.121102101
max memory	2.98340352E8

stage attributes

key	value
output-size	19205
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 split(g,g,a,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) UndefinedPredicateHandlerProof [SOUND, 0 ms] (2) Prolog (3) PrologToPiTRSProof [SOUND, 19 ms] (4) PiTRS (5) DependencyPairsProof [EQUIVALENT, 0 ms] (6) PiDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) PiDP (9) UsableRulesProof [EQUIVALENT, 0 ms] (10) PiDP (11) PiDPToQDPProof [SOUND, 0 ms] (12) QDP (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] (14) YES ---------------------------------------- (0) Obligation: Clauses: split(L, 0, [], L). split(.(X, Xs), N, .(X, Ys), Zs) :- ','(>(N, 0), ','(is(N1, -(N, 1)), split(Xs, N1, Ys, Zs))). Query: split(g,g,a,a) ---------------------------------------- (1) UndefinedPredicateHandlerProof (SOUND) Added facts for all undefined predicates [PROLOG]. ---------------------------------------- (2) Obligation: Clauses: split(L, 0, [], L). split(.(X, Xs), N, .(X, Ys), Zs) :- ','(>(N, 0), ','(is(N1, -(N, 1)), split(Xs, N1, Ys, Zs))). >(X0, X1). is(X0, X1). Query: split(g,g,a,a) ---------------------------------------- (3) PrologToPiTRSProof (SOUND) We use the technique of [TOCL09]. With regard to the inferred argument filtering the predicates were used in the following modes: split_in_4: (b,b,f,f) (b,f,f,f) Transforming Prolog into the following Term Rewriting System: Pi-finite rewrite system: The TRS R consists of the following rules: split_in_ggaa(L, 0, [], L) -> split_out_ggaa(L, 0, [], L) split_in_ggaa(.(X, Xs), N, .(X, Ys), Zs) -> U1_ggaa(X, Xs, N, Ys, Zs, >_in_gg(N, 0)) >_in_gg(X0, X1) -> >_out_gg(X0, X1) U1_ggaa(X, Xs, N, Ys, Zs, >_out_gg(N, 0)) -> U2_ggaa(X, Xs, N, Ys, Zs, is_in_ag(N1, -(N, 1))) is_in_ag(X0, X1) -> is_out_ag(X0, X1) U2_ggaa(X, Xs, N, Ys, Zs, is_out_ag(N1, -(N, 1))) -> U3_ggaa(X, Xs, N, Ys, Zs, N1, split_in_gaaa(Xs, N1, Ys, Zs)) split_in_gaaa(L, 0, [], L) -> split_out_gaaa(L, 0, [], L) split_in_gaaa(.(X, Xs), N, .(X, Ys), Zs) -> U1_gaaa(X, Xs, N, Ys, Zs, >_in_ag(N, 0)) >_in_ag(X0, X1) -> >_out_ag(X0, X1) U1_gaaa(X, Xs, N, Ys, Zs, >_out_ag(N, 0)) -> U2_gaaa(X, Xs, N, Ys, Zs, is_in_ag(N1, -(N, 1))) U2_gaaa(X, Xs, N, Ys, Zs, is_out_ag(N1, -(N, 1))) -> U3_gaaa(X, Xs, N, Ys, Zs, N1, split_in_gaaa(Xs, N1, Ys, Zs)) U3_gaaa(X, Xs, N, Ys, Zs, N1, split_out_gaaa(Xs, N1, Ys, Zs)) -> split_out_gaaa(.(X, Xs), N, .(X, Ys), Zs) U3_ggaa(X, Xs, N, Ys, Zs, N1, split_out_gaaa(Xs, N1, Ys, Zs)) -> split_out_ggaa(.(X, Xs), N, .(X, Ys), Zs) The argument filtering Pi contains the following mapping: split_in_ggaa(x1, x2, x3, x4) = split_in_ggaa(x1, x2) 0 = 0 split_out_ggaa(x1, x2, x3, x4) = split_out_ggaa(x1, x2, x3, x4) .(x1, x2) = .(x1, x2) U1_ggaa(x1, x2, x3, x4, x5, x6) = U1_ggaa(x1, x2, x3, x6) >_in_gg(x1, x2) = >_in_gg(x1, x2) popout

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

job log

popout

actions

all output return to Logic Progr 19030