details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.67955 seconds
cpu usage	10.8134
user time	10.2402
system time	0.573165
max virtual memory	5.7602224E7
max residence set size	983968.0

stage attributes

key	value
starexec-result	YES

output

10.55/3.59 YES 10.66/3.61 proof of /export/starexec/sandbox/benchmark/theBenchmark.pl 10.66/3.61 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 10.66/3.61 10.66/3.61 10.66/3.61 Left Termination of the query pattern 10.66/3.61 10.66/3.61 mergesort(g,a) 10.66/3.61 10.66/3.61 w.r.t. the given Prolog program could successfully be proven: 10.66/3.61 10.66/3.61 (0) Prolog 10.66/3.61 (1) PrologToPiTRSProof [SOUND, 0 ms] 10.66/3.61 (2) PiTRS 10.66/3.61 (3) DependencyPairsProof [EQUIVALENT, 5 ms] 10.66/3.61 (4) PiDP 10.66/3.61 (5) DependencyGraphProof [EQUIVALENT, 0 ms] 10.66/3.61 (6) AND 10.66/3.61 (7) PiDP 10.66/3.61 (8) UsableRulesProof [EQUIVALENT, 0 ms] 10.66/3.61 (9) PiDP 10.66/3.61 (10) PiDPToQDPProof [EQUIVALENT, 0 ms] 10.66/3.61 (11) QDP 10.66/3.61 (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] 10.66/3.61 (13) YES 10.66/3.61 (14) PiDP 10.66/3.61 (15) UsableRulesProof [EQUIVALENT, 0 ms] 10.66/3.61 (16) PiDP 10.66/3.61 (17) PiDPToQDPProof [EQUIVALENT, 0 ms] 10.66/3.61 (18) QDP 10.66/3.61 (19) QDPSizeChangeProof [EQUIVALENT, 0 ms] 10.66/3.61 (20) YES 10.66/3.61 (21) PiDP 10.66/3.61 (22) UsableRulesProof [EQUIVALENT, 0 ms] 10.66/3.61 (23) PiDP 10.66/3.61 (24) PiDPToQDPProof [SOUND, 0 ms] 10.66/3.61 (25) QDP 10.66/3.61 (26) QDPOrderProof [EQUIVALENT, 29 ms] 10.66/3.61 (27) QDP 10.66/3.61 (28) PisEmptyProof [EQUIVALENT, 0 ms] 10.66/3.61 (29) YES 10.66/3.61 (30) PiDP 10.66/3.61 (31) UsableRulesProof [EQUIVALENT, 0 ms] 10.66/3.61 (32) PiDP 10.66/3.61 (33) PiDPToQDPProof [SOUND, 0 ms] 10.66/3.61 (34) QDP 10.66/3.61 (35) QDPSizeChangeProof [EQUIVALENT, 0 ms] 10.66/3.61 (36) YES 10.66/3.61 (37) PiDP 10.66/3.61 (38) UsableRulesProof [EQUIVALENT, 0 ms] 10.66/3.61 (39) PiDP 10.66/3.61 (40) PiDPToQDPProof [SOUND, 0 ms] 10.66/3.61 (41) QDP 10.66/3.61 (42) QDPQMonotonicMRRProof [EQUIVALENT, 95 ms] 10.66/3.61 (43) QDP 10.66/3.61 (44) DependencyGraphProof [EQUIVALENT, 0 ms] 10.66/3.61 (45) TRUE 10.66/3.61 10.66/3.61 10.66/3.61 ---------------------------------------- 10.66/3.61 10.66/3.61 (0) 10.66/3.61 Obligation: 10.66/3.61 Clauses: 10.66/3.61 10.66/3.61 mergesort([], []). 10.66/3.61 mergesort(.(E, []), .(E, [])). 10.66/3.61 mergesort(.(E, .(F, U)), V) :- ','(split(U, L2, L1), ','(mergesort(.(E, L2), X), ','(mergesort(.(F, L1), Z), merge(X, Z, V)))). 10.66/3.61 merge(X, [], X). 10.66/3.61 merge([], X, X). 10.66/3.61 merge(.(A, X), .(B, Y), .(A, Z)) :- ','(le(A, B), merge(X, .(B, Y), Z)). 10.66/3.61 merge(.(A, X), .(B, Y), .(B, Z)) :- ','(gt(A, B), merge(.(A, X), Y, Z)). 10.66/3.61 split([], [], []). 10.66/3.61 split(.(E, U), .(E, V), W) :- split(U, W, V). 10.66/3.61 gt(s(X), s(Y)) :- gt(X, Y). 10.66/3.61 gt(s(X), 0). 10.66/3.61 le(s(X), s(Y)) :- le(X, Y). 10.66/3.61 le(0, s(Y)). 10.66/3.61 le(0, 0). 10.66/3.61 10.66/3.61 10.66/3.61 Query: mergesort(g,a) 10.66/3.61 ---------------------------------------- 10.66/3.61 10.66/3.61 (1) PrologToPiTRSProof (SOUND) 10.66/3.61 We use the technique of [TOCL09]. With regard to the inferred argument filtering the predicates were used in the following modes: 10.66/3.61 10.66/3.61 mergesort_in_2: (b,f) 10.66/3.61 10.66/3.61 split_in_3: (b,f,f) 10.66/3.61 10.66/3.61 merge_in_3: (b,b,f) 10.66/3.61 10.66/3.61 le_in_2: (b,b) 10.66/3.61 10.66/3.61 gt_in_2: (b,b) 10.66/3.61 10.66/3.61 Transforming Prolog into the following Term Rewriting System: 10.66/3.61 10.66/3.61 Pi-finite rewrite system: 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