details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	6.21839 seconds
cpu usage	20.4936
user time	19.4473
system time	1.04631
max virtual memory	3.7905096E7
max residence set size	2190604.0

stage attributes

key	value
starexec-result	YES

output

20.04/6.02 YES 20.04/6.09 proof of /export/starexec/sandbox/benchmark/theBenchmark.pl 20.04/6.09 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 20.04/6.09 20.04/6.09 20.04/6.09 Left Termination of the query pattern 20.04/6.09 20.04/6.09 mergesort(g,a,a) 20.04/6.09 20.04/6.09 w.r.t. the given Prolog program could successfully be proven: 20.04/6.09 20.04/6.09 (0) Prolog 20.04/6.09 (1) PrologToTRSTransformerProof [SOUND, 81 ms] 20.04/6.09 (2) QTRS 20.04/6.09 (3) DependencyPairsProof [EQUIVALENT, 0 ms] 20.04/6.09 (4) QDP 20.04/6.09 (5) DependencyGraphProof [EQUIVALENT, 0 ms] 20.04/6.09 (6) AND 20.04/6.09 (7) QDP 20.04/6.09 (8) UsableRulesProof [EQUIVALENT, 0 ms] 20.04/6.09 (9) QDP 20.04/6.09 (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] 20.04/6.09 (11) YES 20.04/6.09 (12) QDP 20.04/6.09 (13) UsableRulesProof [EQUIVALENT, 0 ms] 20.04/6.09 (14) QDP 20.04/6.09 (15) QDPSizeChangeProof [EQUIVALENT, 0 ms] 20.04/6.09 (16) YES 20.04/6.09 (17) QDP 20.04/6.09 (18) QDPSizeChangeProof [EQUIVALENT, 0 ms] 20.04/6.09 (19) YES 20.04/6.09 (20) QDP 20.04/6.09 (21) UsableRulesProof [EQUIVALENT, 0 ms] 20.04/6.09 (22) QDP 20.04/6.09 (23) QDPSizeChangeProof [EQUIVALENT, 0 ms] 20.04/6.09 (24) YES 20.04/6.09 (25) QDP 20.04/6.09 (26) QDPOrderProof [EQUIVALENT, 204 ms] 20.04/6.09 (27) QDP 20.04/6.09 (28) DependencyGraphProof [EQUIVALENT, 0 ms] 20.04/6.09 (29) TRUE 20.04/6.09 20.04/6.09 20.04/6.09 ---------------------------------------- 20.04/6.09 20.04/6.09 (0) 20.04/6.09 Obligation: 20.04/6.09 Clauses: 20.04/6.09 20.04/6.09 mergesort([], [], Ls). 20.04/6.09 mergesort(.(X, []), .(X, []), Ls). 20.04/6.09 mergesort(.(X, .(Y, Xs)), Ys, .(H, Ls)) :- ','(split(.(X, .(Y, Xs)), X1s, X2s, .(H, Ls)), ','(mergesort(X1s, Y1s, Ls), ','(mergesort(X2s, Y2s, Ls), merge(Y1s, Y2s, Ys, .(H, Ls))))). 20.04/6.09 split([], [], [], Ls). 20.04/6.09 split(.(X, Xs), .(X, Ys), Zs, .(H, Ls)) :- split(Xs, Zs, Ys, Ls). 20.04/6.09 merge([], Xs, Xs, Ls). 20.04/6.09 merge(Xs, [], Xs, Ls). 20.04/6.09 merge(.(X, Xs), .(Y, Ys), .(X, Zs), .(H, Ls)) :- ','(le(X, Y), merge(Xs, .(Y, Ys), Zs, Ls)). 20.04/6.09 merge(.(X, Xs), .(Y, Ys), .(Y, Zs), .(H, Ls)) :- ','(gt(X, Y), merge(.(X, Xs), Ys, Zs, Ls)). 20.04/6.09 gt(s(X), s(Y)) :- gt(X, Y). 20.04/6.09 gt(s(0), 0). 20.04/6.09 le(s(X), s(Y)) :- le(X, Y). 20.04/6.09 le(0, s(0)). 20.04/6.09 le(0, 0). 20.04/6.09 20.04/6.09 20.04/6.09 Query: mergesort(g,a,a) 20.04/6.09 ---------------------------------------- 20.04/6.09 20.04/6.09 (1) PrologToTRSTransformerProof (SOUND) 20.04/6.09 Transformed Prolog program to TRS. 20.04/6.09 20.04/6.09 { 20.04/6.09 "root": 2, 20.04/6.09 "program": { 20.04/6.09 "directives": [], 20.04/6.09 "clauses": [ 20.04/6.09 [ 20.04/6.09 "(mergesort ([]) ([]) Ls)", 20.04/6.09 null 20.04/6.09 ], 20.04/6.09 [ 20.04/6.09 "(mergesort (. X ([])) (. X ([])) Ls)", 20.04/6.09 null 20.04/6.09 ], 20.04/6.09 [ 20.04/6.09 "(mergesort (. X (. Y Xs)) Ys (. H Ls))", 20.04/6.09 "(',' (split (. X (. Y Xs)) X1s X2s (. H Ls)) (',' (mergesort X1s Y1s Ls) (',' (mergesort X2s Y2s Ls) (merge Y1s Y2s Ys (. H Ls)))))" 20.04/6.09 ], 20.04/6.09 [ 20.04/6.09 "(split ([]) ([]) ([]) Ls)", 20.04/6.09 null 20.04/6.09 ], 20.04/6.09 [ 20.04/6.09 "(split (. X Xs) (. X Ys) Zs (. H Ls))", 20.04/6.09 "(split Xs Zs Ys Ls)" 20.04/6.09 ], 20.04/6.09 [ 20.04/6.09 "(merge ([]) Xs Xs Ls)", 20.04/6.09 null 20.04/6.09 ], popout

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

job log

popout

actions

all output return to Logic_Programming 2019-04-02 08.22