details

property	value
status	complete
benchmark	sameleaves.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	terminweb_old

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.37587094307 seconds
cpu usage	5.859288174
max memory	5.39611136E8

stage attributes

key	value
output-size	28228
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 sameleaves(g,g) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToPiTRSProof [SOUND, 0 ms] (2) PiTRS (3) DependencyPairsProof [EQUIVALENT, 3 ms] (4) PiDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) AND (7) PiDP (8) UsableRulesProof [EQUIVALENT, 0 ms] (9) PiDP (10) PiDPToQDPProof [SOUND, 0 ms] (11) QDP (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] (13) YES (14) PiDP (15) UsableRulesProof [EQUIVALENT, 0 ms] (16) PiDP (17) PiDPToQDPProof [SOUND, 0 ms] (18) QDP (19) QDPSizeChangeProof [EQUIVALENT, 0 ms] (20) YES (21) PiDP (22) UsableRulesProof [EQUIVALENT, 0 ms] (23) PiDP (24) PiDPToQDPProof [SOUND, 2 ms] (25) QDP (26) UsableRulesReductionPairsProof [EQUIVALENT, 39 ms] (27) QDP (28) DependencyGraphProof [EQUIVALENT, 0 ms] (29) TRUE ---------------------------------------- (0) Obligation: Clauses: sameleaves(leaf(L), leaf(L)). sameleaves(tree(T1, T2), tree(S1, S2)) :- ','(getleave(T1, T2, L, T), ','(getleave(S1, S2, L, S), sameleaves(T, S))). getleave(leaf(A), C, A, C). getleave(tree(A, B), C, L, O) :- getleave(A, tree(B, C), L, O). Query: sameleaves(g,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: sameleaves_in_2: (b,b) getleave_in_4: (b,b,f,f) (b,b,b,f) Transforming Prolog into the following Term Rewriting System: Pi-finite rewrite system: The TRS R consists of the following rules: sameleaves_in_gg(leaf(L), leaf(L)) -> sameleaves_out_gg(leaf(L), leaf(L)) sameleaves_in_gg(tree(T1, T2), tree(S1, S2)) -> U1_gg(T1, T2, S1, S2, getleave_in_ggaa(T1, T2, L, T)) getleave_in_ggaa(leaf(A), C, A, C) -> getleave_out_ggaa(leaf(A), C, A, C) getleave_in_ggaa(tree(A, B), C, L, O) -> U4_ggaa(A, B, C, L, O, getleave_in_ggaa(A, tree(B, C), L, O)) U4_ggaa(A, B, C, L, O, getleave_out_ggaa(A, tree(B, C), L, O)) -> getleave_out_ggaa(tree(A, B), C, L, O) U1_gg(T1, T2, S1, S2, getleave_out_ggaa(T1, T2, L, T)) -> U2_gg(T1, T2, S1, S2, T, getleave_in_ggga(S1, S2, L, S)) getleave_in_ggga(leaf(A), C, A, C) -> getleave_out_ggga(leaf(A), C, A, C) getleave_in_ggga(tree(A, B), C, L, O) -> U4_ggga(A, B, C, L, O, getleave_in_ggga(A, tree(B, C), L, O)) U4_ggga(A, B, C, L, O, getleave_out_ggga(A, tree(B, C), L, O)) -> getleave_out_ggga(tree(A, B), C, L, O) U2_gg(T1, T2, S1, S2, T, getleave_out_ggga(S1, S2, L, S)) -> U3_gg(T1, T2, S1, S2, sameleaves_in_gg(T, S)) U3_gg(T1, T2, S1, S2, sameleaves_out_gg(T, S)) -> sameleaves_out_gg(tree(T1, T2), tree(S1, S2)) The argument filtering Pi contains the following mapping: sameleaves_in_gg(x1, x2) = sameleaves_in_gg(x1, x2) leaf(x1) = leaf(x1) sameleaves_out_gg(x1, x2) = sameleaves_out_gg tree(x1, x2) = tree(x1, x2) U1_gg(x1, x2, x3, x4, x5) = U1_gg(x3, x4, x5) getleave_in_ggaa(x1, x2, x3, x4) = getleave_in_ggaa(x1, x2) popout

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

job log

popout

actions

all output return to Logic Programming