Logic_Programming 2019-04-02 08.22 pair #434324425

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	n100.star.cs.uiowa.edu
space	talp_mixed

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.06229 seconds
cpu usage	16.2958
user time	15.4343
system time	0.861537
max virtual memory	4.0065708E7
max residence set size	1560676.0

stage attributes

key	value
starexec-result	YES

output

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