details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.93424 seconds
cpu usage	11.8176
user time	11.1503
system time	0.667297
max virtual memory	2.0611804E7
max residence set size	1164760.0

stage attributes

key	value
starexec-result	YES

output

11.31/3.80 YES 11.64/3.85 proof of /export/starexec/sandbox/benchmark/theBenchmark.pl 11.64/3.85 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 11.64/3.85 11.64/3.85 11.64/3.85 Left Termination of the query pattern 11.64/3.85 11.64/3.85 mergesort(g,a) 11.64/3.85 11.64/3.85 w.r.t. the given Prolog program could successfully be proven: 11.64/3.85 11.64/3.85 (0) Prolog 11.64/3.85 (1) PrologToDTProblemTransformerProof [SOUND, 0 ms] 11.64/3.85 (2) TRIPLES 11.64/3.85 (3) TriplesToPiDPProof [SOUND, 0 ms] 11.64/3.85 (4) PiDP 11.64/3.85 (5) DependencyGraphProof [EQUIVALENT, 0 ms] 11.64/3.85 (6) AND 11.64/3.85 (7) PiDP 11.64/3.85 (8) UsableRulesProof [EQUIVALENT, 0 ms] 11.64/3.85 (9) PiDP 11.64/3.85 (10) PiDPToQDPProof [SOUND, 0 ms] 11.64/3.85 (11) QDP 11.64/3.85 (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] 11.64/3.85 (13) YES 11.64/3.85 (14) PiDP 11.64/3.85 (15) UsableRulesProof [EQUIVALENT, 0 ms] 11.64/3.85 (16) PiDP 11.64/3.85 (17) PiDPToQDPProof [SOUND, 0 ms] 11.64/3.85 (18) QDP 11.64/3.85 (19) QDPSizeChangeProof [EQUIVALENT, 0 ms] 11.64/3.85 (20) YES 11.64/3.85 (21) PiDP 11.64/3.85 (22) PiDPToQDPProof [SOUND, 0 ms] 11.64/3.85 (23) QDP 11.64/3.85 (24) TransformationProof [EQUIVALENT, 0 ms] 11.64/3.85 (25) QDP 11.64/3.85 (26) QDPQMonotonicMRRProof [EQUIVALENT, 50 ms] 11.64/3.85 (27) QDP 11.64/3.85 (28) DependencyGraphProof [EQUIVALENT, 0 ms] 11.64/3.85 (29) QDP 11.64/3.85 (30) UsableRulesProof [EQUIVALENT, 0 ms] 11.64/3.85 (31) QDP 11.64/3.85 (32) QReductionProof [EQUIVALENT, 0 ms] 11.64/3.85 (33) QDP 11.64/3.85 (34) QDPQMonotonicMRRProof [EQUIVALENT, 0 ms] 11.64/3.85 (35) QDP 11.64/3.85 (36) DependencyGraphProof [EQUIVALENT, 0 ms] 11.64/3.85 (37) TRUE 11.64/3.85 11.64/3.85 11.64/3.85 ---------------------------------------- 11.64/3.85 11.64/3.85 (0) 11.64/3.85 Obligation: 11.64/3.85 Clauses: 11.64/3.85 11.64/3.85 mergesort([], []). 11.64/3.85 mergesort(.(X, []), .(X, [])). 11.64/3.85 mergesort(.(X, .(Y, Xs)), Ys) :- ','(split(.(X, .(Y, Xs)), X1s, X2s), ','(mergesort(X1s, Y1s), ','(mergesort(X2s, Y2s), merge(Y1s, Y2s, Ys)))). 11.64/3.85 split([], [], []). 11.64/3.85 split(.(X, Xs), .(X, Ys), Zs) :- split(Xs, Zs, Ys). 11.64/3.85 merge([], Xs, Xs). 11.64/3.85 merge(Xs, [], Xs). 11.64/3.85 merge(.(X, Xs), .(Y, Ys), .(X, Zs)) :- ','(=(X, Y), merge(.(X, Xs), Ys, Zs)). 11.64/3.85 11.64/3.85 11.64/3.85 Query: mergesort(g,a) 11.64/3.85 ---------------------------------------- 11.64/3.85 11.64/3.85 (1) PrologToDTProblemTransformerProof (SOUND) 11.64/3.85 Built DT problem from termination graph DT10. 11.64/3.85 11.64/3.85 { 11.64/3.85 "root": 7, 11.64/3.85 "program": { 11.64/3.85 "directives": [], 11.64/3.85 "clauses": [ 11.64/3.85 [ 11.64/3.85 "(mergesort ([]) ([]))", 11.64/3.85 null 11.64/3.85 ], 11.64/3.85 [ 11.64/3.85 "(mergesort (. X ([])) (. X ([])))", 11.64/3.85 null 11.64/3.85 ], 11.64/3.85 [ 11.64/3.85 "(mergesort (. X (. Y Xs)) Ys)", 11.64/3.85 "(',' (split (. X (. Y Xs)) X1s X2s) (',' (mergesort X1s Y1s) (',' (mergesort X2s Y2s) (merge Y1s Y2s Ys))))" 11.64/3.85 ], 11.64/3.85 [ 11.64/3.85 "(split ([]) ([]) ([]))", 11.64/3.85 null 11.64/3.85 ], 11.64/3.85 [ 11.64/3.85 "(split (. X Xs) (. X Ys) Zs)", 11.64/3.85 "(split Xs Zs Ys)" 11.64/3.85 ], 11.64/3.85 [ 11.64/3.85 "(merge ([]) Xs Xs)", 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