Logic_Programming 2019-04-02 08.22 pair #434324347

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.9566 seconds
cpu usage	11.9943
user time	11.4554
system time	0.538853
max virtual memory	1.9676032E7
max residence set size	1150536.0

stage attributes

key	value
starexec-result	YES

output

11.40/3.85	YES
11.84/3.90	proof of /export/starexec/sandbox/benchmark/theBenchmark.pl
11.84/3.90	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
11.84/3.90	
11.84/3.90	
11.84/3.90	Left Termination of the query pattern
11.84/3.90	
11.84/3.90	mergesort(g,a)
11.84/3.90	
11.84/3.90	w.r.t. the given Prolog program could successfully be proven:
11.84/3.90	
11.84/3.90	(0) Prolog
11.84/3.90	(1) PrologToPiTRSProof [SOUND, 35 ms]
11.84/3.90	(2) PiTRS
11.84/3.90	(3) DependencyPairsProof [EQUIVALENT, 34 ms]
11.84/3.90	(4) PiDP
11.84/3.90	(5) DependencyGraphProof [EQUIVALENT, 0 ms]
11.84/3.90	(6) AND
11.84/3.90	    (7) PiDP
11.84/3.90	        (8) UsableRulesProof [EQUIVALENT, 0 ms]
11.84/3.90	        (9) PiDP
11.84/3.90	        (10) PiDPToQDPProof [EQUIVALENT, 0 ms]
11.84/3.90	        (11) QDP
11.84/3.90	        (12) QDPSizeChangeProof [EQUIVALENT, 0 ms]
11.84/3.90	        (13) YES
11.84/3.90	    (14) PiDP
11.84/3.90	        (15) UsableRulesProof [EQUIVALENT, 0 ms]
11.84/3.90	        (16) PiDP
11.84/3.90	        (17) PiDPToQDPProof [EQUIVALENT, 0 ms]
11.84/3.90	        (18) QDP
11.84/3.90	        (19) QDPSizeChangeProof [EQUIVALENT, 0 ms]
11.84/3.90	        (20) YES
11.84/3.90	    (21) PiDP
11.84/3.90	        (22) UsableRulesProof [EQUIVALENT, 0 ms]
11.84/3.90	        (23) PiDP
11.84/3.90	        (24) PiDPToQDPProof [SOUND, 0 ms]
11.84/3.90	        (25) QDP
11.84/3.90	        (26) MRRProof [EQUIVALENT, 46 ms]
11.84/3.90	        (27) QDP
11.84/3.90	        (28) DependencyGraphProof [EQUIVALENT, 0 ms]
11.84/3.90	        (29) QDP
11.84/3.90	        (30) UsableRulesProof [EQUIVALENT, 0 ms]
11.84/3.90	        (31) QDP
11.84/3.90	        (32) QReductionProof [EQUIVALENT, 0 ms]
11.84/3.90	        (33) QDP
11.84/3.90	        (34) QDPSizeChangeProof [EQUIVALENT, 0 ms]
11.84/3.90	        (35) YES
11.84/3.90	    (36) PiDP
11.84/3.90	        (37) UsableRulesProof [EQUIVALENT, 0 ms]
11.84/3.90	        (38) PiDP
11.84/3.90	        (39) PiDPToQDPProof [SOUND, 0 ms]
11.84/3.90	        (40) QDP
11.84/3.90	        (41) QDPSizeChangeProof [EQUIVALENT, 0 ms]
11.84/3.90	        (42) YES
11.84/3.90	    (43) PiDP
11.84/3.90	        (44) PiDPToQDPProof [SOUND, 3 ms]
11.84/3.90	        (45) QDP
11.84/3.90	        (46) QDPOrderProof [EQUIVALENT, 371 ms]
11.84/3.90	        (47) QDP
11.84/3.90	        (48) DependencyGraphProof [EQUIVALENT, 0 ms]
11.84/3.90	        (49) TRUE
11.84/3.90	
11.84/3.90	
11.84/3.90	----------------------------------------
11.84/3.90	
11.84/3.90	(0)
11.84/3.90	Obligation:
11.84/3.90	Clauses:
11.84/3.90	
11.84/3.90	mergesort([], []).
11.84/3.90	mergesort(.(X, []), .(X, [])).
11.84/3.90	mergesort(.(X, .(Y, L1)), L2) :- ','(split2(.(X, .(Y, L1)), L3, L4), ','(mergesort(L3, L5), ','(mergesort(L4, L6), merge(L5, L6, L2)))).
11.84/3.90	split(L1, L2, L3) :- split0(L1, L2, L3).
11.84/3.90	split(L1, L2, L3) :- split1(L1, L2, L3).
11.84/3.90	split(L1, L2, L3) :- split2(L1, L2, L3).
11.84/3.90	split0([], [], []).
11.84/3.90	split1(.(X, []), .(X, []), []).
11.84/3.90	split2(.(X, .(Y, L1)), .(X, L2), .(Y, L3)) :- split(L1, L2, L3).
11.84/3.90	merge([], L1, L1).
11.84/3.90	merge(L1, [], L1).
11.84/3.90	merge(.(X, L1), .(Y, L2), .(X, L3)) :- ','(le(X, Y), merge(L1, .(Y, L2), L3)).
11.84/3.90	merge(.(X, L1), .(Y, L2), .(Y, L3)) :- ','(gt(X, Y), merge(.(X, L1), L2, L3)).
11.84/3.90	gt(s(X), s(Y)) :- gt(X, Y).
11.84/3.90	gt(s(X), 0).
11.84/3.90	le(s(X), s(Y)) :- le(X, Y).
11.84/3.90	le(0, s(Y)).
11.84/3.90	le(0, 0).
11.84/3.90	
11.84/3.90	
11.84/3.90	Query: mergesort(g,a)
11.84/3.90	----------------------------------------
11.84/3.90	
11.84/3.90	(1) PrologToPiTRSProof (SOUND)
11.84/3.90	We use the technique of [TOCL09]. With regard to the inferred argument filtering the predicates were used in the following modes:
11.84/3.90	
11.84/3.90	mergesort_in_2: (b,f)
11.84/3.90	
11.84/3.90	split2_in_3: (b,f,f)
11.84/3.90	
11.84/3.90	split_in_3: (b,f,f)

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