details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.66247 seconds
cpu usage	14.6664
user time	13.8848
system time	0.781604
max virtual memory	1.190926E8
max residence set size	1448716.0

stage attributes

key	value
starexec-result	YES

output

14.26/4.55 YES 14.43/4.60 proof of /export/starexec/sandbox/benchmark/theBenchmark.pl 14.43/4.60 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 14.43/4.60 14.43/4.60 14.43/4.60 Left Termination of the query pattern 14.43/4.60 14.43/4.60 mergesort(g,a) 14.43/4.60 14.43/4.60 w.r.t. the given Prolog program could successfully be proven: 14.43/4.60 14.43/4.60 (0) Prolog 14.43/4.60 (1) PrologToDTProblemTransformerProof [SOUND, 28 ms] 14.43/4.60 (2) TRIPLES 14.43/4.60 (3) TriplesToPiDPProof [SOUND, 0 ms] 14.43/4.60 (4) PiDP 14.43/4.60 (5) DependencyGraphProof [EQUIVALENT, 0 ms] 14.43/4.60 (6) AND 14.43/4.60 (7) PiDP 14.43/4.60 (8) UsableRulesProof [EQUIVALENT, 0 ms] 14.43/4.60 (9) PiDP 14.43/4.60 (10) PiDPToQDPProof [EQUIVALENT, 0 ms] 14.43/4.60 (11) QDP 14.43/4.60 (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] 14.43/4.60 (13) YES 14.43/4.60 (14) PiDP 14.43/4.60 (15) UsableRulesProof [EQUIVALENT, 0 ms] 14.43/4.60 (16) PiDP 14.43/4.60 (17) PiDPToQDPProof [EQUIVALENT, 0 ms] 14.43/4.60 (18) QDP 14.43/4.60 (19) QDPSizeChangeProof [EQUIVALENT, 0 ms] 14.43/4.60 (20) YES 14.43/4.60 (21) PiDP 14.43/4.60 (22) UsableRulesProof [EQUIVALENT, 0 ms] 14.43/4.60 (23) PiDP 14.43/4.60 (24) PiDPToQDPProof [SOUND, 0 ms] 14.43/4.60 (25) QDP 14.43/4.60 (26) MRRProof [EQUIVALENT, 29 ms] 14.43/4.60 (27) QDP 14.43/4.60 (28) MRRProof [EQUIVALENT, 22 ms] 14.43/4.60 (29) QDP 14.43/4.60 (30) DependencyGraphProof [EQUIVALENT, 0 ms] 14.43/4.60 (31) QDP 14.43/4.60 (32) UsableRulesProof [EQUIVALENT, 0 ms] 14.43/4.60 (33) QDP 14.43/4.60 (34) QReductionProof [EQUIVALENT, 0 ms] 14.43/4.60 (35) QDP 14.43/4.60 (36) QDPSizeChangeProof [EQUIVALENT, 0 ms] 14.43/4.60 (37) YES 14.43/4.60 (38) PiDP 14.43/4.60 (39) UsableRulesProof [EQUIVALENT, 0 ms] 14.43/4.60 (40) PiDP 14.43/4.60 (41) PiDPToQDPProof [SOUND, 0 ms] 14.43/4.60 (42) QDP 14.43/4.60 (43) QDPSizeChangeProof [EQUIVALENT, 0 ms] 14.43/4.60 (44) YES 14.43/4.60 (45) PiDP 14.43/4.60 (46) PiDPToQDPProof [SOUND, 0 ms] 14.43/4.60 (47) QDP 14.43/4.60 (48) TransformationProof [EQUIVALENT, 0 ms] 14.43/4.60 (49) QDP 14.43/4.60 (50) QDPOrderProof [EQUIVALENT, 57 ms] 14.43/4.60 (51) QDP 14.43/4.60 (52) DependencyGraphProof [EQUIVALENT, 0 ms] 14.43/4.60 (53) TRUE 14.43/4.60 14.43/4.60 14.43/4.60 ---------------------------------------- 14.43/4.60 14.43/4.60 (0) 14.43/4.60 Obligation: 14.43/4.60 Clauses: 14.43/4.60 14.43/4.60 mergesort([], []). 14.43/4.60 mergesort(.(E, []), .(E, [])). 14.43/4.60 mergesort(.(E, .(F, U)), V) :- ','(split(.(E, .(F, U)), W, Y), ','(mergesort(W, X), ','(mergesort(Y, Z), merge(X, Z, V)))). 14.43/4.60 merge(X, [], X). 14.43/4.60 merge([], X, X). 14.43/4.60 merge(.(A, X), .(B, Y), .(A, Z)) :- ','(le(A, B), merge(X, .(B, Y), Z)). 14.43/4.60 merge(.(A, X), .(B, Y), .(B, Z)) :- ','(gt(A, B), merge(.(A, X), Y, Z)). 14.43/4.60 split([], [], []). 14.43/4.60 split(.(E, U), .(E, V), W) :- split(U, W, V). 14.43/4.60 gt(s(X), s(Y)) :- gt(X, Y). 14.43/4.60 gt(s(X), 0). 14.43/4.60 le(s(X), s(Y)) :- le(X, Y). 14.43/4.60 le(0, s(Y)). 14.43/4.60 le(0, 0). 14.43/4.60 14.43/4.60 14.43/4.60 Query: mergesort(g,a) 14.43/4.60 ---------------------------------------- 14.43/4.60 14.43/4.60 (1) PrologToDTProblemTransformerProof (SOUND) 14.43/4.60 Built DT problem from termination graph DT10. 14.43/4.60 14.43/4.60 { 14.43/4.60 "root": 12, 14.43/4.60 "program": { 14.43/4.60 "directives": [], 14.43/4.60 "clauses": [ 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