details

property	value
status	complete
benchmark	insert-bbf.pl
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n052.star.cs.uiowa.edu
space	BCGGV05

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.71894717216 seconds
cpu usage	4.113959404
max memory	2.97672704E8

stage attributes

key	value
output-size	21566
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 insert(g,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) AND (7) PiDP (8) UsableRulesProof [EQUIVALENT, 0 ms] (9) PiDP (10) PiDPToQDPProof [EQUIVALENT, 1 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 ---------------------------------------- (0) Obligation: Clauses: insert(X, void, tree(X, void, void)). insert(X, tree(X, Left, Right), tree(X, Left, Right)). insert(X, tree(Y, Left, Right), tree(Y, Left1, Right)) :- ','(less(X, Y), insert(X, Left, Left1)). insert(X, tree(Y, Left, Right), tree(Y, Left, Right1)) :- ','(less(Y, X), insert(X, Right, Right1)). less(0, s(X1)). less(s(X), s(Y)) :- less(X, Y). Query: insert(g,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: insert_in_3: (b,b,f) less_in_2: (b,b) Transforming Prolog into the following Term Rewriting System: Pi-finite rewrite system: The TRS R consists of the following rules: insert_in_gga(X, void, tree(X, void, void)) -> insert_out_gga(X, void, tree(X, void, void)) insert_in_gga(X, tree(X, Left, Right), tree(X, Left, Right)) -> insert_out_gga(X, tree(X, Left, Right), tree(X, Left, Right)) insert_in_gga(X, tree(Y, Left, Right), tree(Y, Left1, Right)) -> U1_gga(X, Y, Left, Right, Left1, less_in_gg(X, Y)) less_in_gg(0, s(X1)) -> less_out_gg(0, s(X1)) less_in_gg(s(X), s(Y)) -> U5_gg(X, Y, less_in_gg(X, Y)) U5_gg(X, Y, less_out_gg(X, Y)) -> less_out_gg(s(X), s(Y)) U1_gga(X, Y, Left, Right, Left1, less_out_gg(X, Y)) -> U2_gga(X, Y, Left, Right, Left1, insert_in_gga(X, Left, Left1)) insert_in_gga(X, tree(Y, Left, Right), tree(Y, Left, Right1)) -> U3_gga(X, Y, Left, Right, Right1, less_in_gg(Y, X)) U3_gga(X, Y, Left, Right, Right1, less_out_gg(Y, X)) -> U4_gga(X, Y, Left, Right, Right1, insert_in_gga(X, Right, Right1)) U4_gga(X, Y, Left, Right, Right1, insert_out_gga(X, Right, Right1)) -> insert_out_gga(X, tree(Y, Left, Right), tree(Y, Left, Right1)) U2_gga(X, Y, Left, Right, Left1, insert_out_gga(X, Left, Left1)) -> insert_out_gga(X, tree(Y, Left, Right), tree(Y, Left1, Right)) The argument filtering Pi contains the following mapping: insert_in_gga(x1, x2, x3) = insert_in_gga(x1, x2) void = void insert_out_gga(x1, x2, x3) = insert_out_gga(x3) tree(x1, x2, x3) = tree(x1, x2, x3) U1_gga(x1, x2, x3, x4, x5, x6) = U1_gga(x1, x2, x3, x4, x6) less_in_gg(x1, x2) = less_in_gg(x1, x2) 0 = 0 s(x1) = s(x1) less_out_gg(x1, x2) = less_out_gg popout

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

job log

popout

actions

all output return to Logic Progr 19030