Logic_Programming 2019-04-02 08.22 pair #434324677

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.5539 seconds
cpu usage	6.67502
user time	6.36896
system time	0.306055
max virtual memory	1.9142492E7
max residence set size	546132.0

stage attributes

key	value
starexec-result	YES

output

6.42/2.49	YES
6.56/2.51	proof of /export/starexec/sandbox2/benchmark/theBenchmark.pl
6.56/2.51	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
6.56/2.51	
6.56/2.51	
6.56/2.51	Left Termination of the query pattern
6.56/2.51	
6.56/2.51	merge(g,g,a)
6.56/2.51	
6.56/2.51	w.r.t. the given Prolog program could successfully be proven:
6.56/2.51	
6.56/2.51	(0) Prolog
6.56/2.51	(1) PrologToDTProblemTransformerProof [SOUND, 46 ms]
6.56/2.51	(2) TRIPLES
6.56/2.51	(3) TriplesToPiDPProof [SOUND, 42 ms]
6.56/2.51	(4) PiDP
6.56/2.51	(5) DependencyGraphProof [EQUIVALENT, 0 ms]
6.56/2.51	(6) AND
6.56/2.51	    (7) PiDP
6.56/2.51	        (8) UsableRulesProof [EQUIVALENT, 0 ms]
6.56/2.51	        (9) PiDP
6.56/2.51	        (10) PiDPToQDPProof [EQUIVALENT, 0 ms]
6.56/2.51	        (11) QDP
6.56/2.51	        (12) QDPSizeChangeProof [EQUIVALENT, 0 ms]
6.56/2.51	        (13) YES
6.56/2.51	    (14) PiDP
6.56/2.51	        (15) UsableRulesProof [EQUIVALENT, 0 ms]
6.56/2.51	        (16) PiDP
6.56/2.51	        (17) PiDPToQDPProof [EQUIVALENT, 0 ms]
6.56/2.51	        (18) QDP
6.56/2.51	        (19) QDPSizeChangeProof [EQUIVALENT, 0 ms]
6.56/2.51	        (20) YES
6.56/2.51	    (21) PiDP
6.56/2.51	        (22) PiDPToQDPProof [SOUND, 0 ms]
6.56/2.51	        (23) QDP
6.56/2.51	        (24) MRRProof [EQUIVALENT, 35 ms]
6.56/2.51	        (25) QDP
6.56/2.51	        (26) DependencyGraphProof [EQUIVALENT, 0 ms]
6.56/2.51	        (27) QDP
6.56/2.51	        (28) UsableRulesProof [EQUIVALENT, 0 ms]
6.56/2.51	        (29) QDP
6.56/2.51	        (30) QReductionProof [EQUIVALENT, 0 ms]
6.56/2.51	        (31) QDP
6.56/2.51	        (32) QDPSizeChangeProof [EQUIVALENT, 0 ms]
6.56/2.51	        (33) YES
6.56/2.51	
6.56/2.51	
6.56/2.51	----------------------------------------
6.56/2.51	
6.56/2.51	(0)
6.56/2.51	Obligation:
6.56/2.51	Clauses:
6.56/2.51	
6.56/2.51	merge([], X, X).
6.56/2.51	merge(X, [], X).
6.56/2.51	merge(.(X, Xs), .(Y, Ys), .(X, Zs)) :- ','(leq(X, Y), merge(Xs, .(Y, Ys), Zs)).
6.56/2.51	merge(.(X, Xs), .(Y, Ys), .(Y, Zs)) :- ','(less(Y, X), merge(.(X, Xs), Ys, Zs)).
6.56/2.51	less(0, s(0)).
6.56/2.51	less(s(X), s(Y)) :- less(X, Y).
6.56/2.51	leq(0, 0).
6.56/2.51	leq(0, s(0)).
6.56/2.51	leq(s(X), s(Y)) :- leq(X, Y).
6.56/2.51	
6.56/2.51	
6.56/2.51	Query: merge(g,g,a)
6.56/2.51	----------------------------------------
6.56/2.51	
6.56/2.51	(1) PrologToDTProblemTransformerProof (SOUND)
6.56/2.51	Built DT problem from termination graph DT10.
6.56/2.51	
6.56/2.51	{
6.56/2.51	    "root": 5,
6.56/2.51	    "program": {
6.56/2.51	        "directives": [],
6.56/2.51	        "clauses": [
6.56/2.51	            [
6.56/2.51	                "(merge ([]) X X)",
6.56/2.51	                null
6.56/2.51	            ],
6.56/2.51	            [
6.56/2.51	                "(merge X ([]) X)",
6.56/2.51	                null
6.56/2.51	            ],
6.56/2.51	            [
6.56/2.51	                "(merge (. X Xs) (. Y Ys) (. X Zs))",
6.56/2.51	                "(',' (leq X Y) (merge Xs (. Y Ys) Zs))"
6.56/2.51	            ],
6.56/2.51	            [
6.56/2.51	                "(merge (. X Xs) (. Y Ys) (. Y Zs))",
6.56/2.51	                "(',' (less Y X) (merge (. X Xs) Ys Zs))"
6.56/2.51	            ],
6.56/2.51	            [
6.56/2.51	                "(less (0) (s (0)))",
6.56/2.51	                null
6.56/2.51	            ],
6.56/2.51	            [
6.56/2.51	                "(less (s X) (s Y))",
6.56/2.51	                "(less X Y)"
6.56/2.51	            ],
6.56/2.51	            [

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