Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic_Programming 2019-04-02 08.22 pair #434324725
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_apt
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.49103 seconds
cpu usage
14.4762
user time
13.661
system time
0.815234
max virtual memory
2.0149616E7
max residence set size
1386792.0
stage attributes
key
value
starexec-result
YES
output
13.82/4.37 YES 14.36/4.43 proof of /export/starexec/sandbox/benchmark/theBenchmark.pl 14.36/4.43 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 14.36/4.43 14.36/4.43 14.36/4.43 Left Termination of the query pattern 14.36/4.43 14.36/4.43 mergesort(g,a) 14.36/4.43 14.36/4.43 w.r.t. the given Prolog program could successfully be proven: 14.36/4.43 14.36/4.43 (0) Prolog 14.36/4.43 (1) PrologToTRSTransformerProof [SOUND, 48 ms] 14.36/4.43 (2) QTRS 14.36/4.43 (3) DependencyPairsProof [EQUIVALENT, 0 ms] 14.36/4.43 (4) QDP 14.36/4.43 (5) DependencyGraphProof [EQUIVALENT, 0 ms] 14.36/4.43 (6) AND 14.36/4.43 (7) QDP 14.36/4.43 (8) UsableRulesProof [EQUIVALENT, 0 ms] 14.36/4.43 (9) QDP 14.36/4.43 (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] 14.36/4.43 (11) YES 14.36/4.43 (12) QDP 14.36/4.43 (13) UsableRulesProof [EQUIVALENT, 0 ms] 14.36/4.43 (14) QDP 14.36/4.43 (15) QDPSizeChangeProof [EQUIVALENT, 0 ms] 14.36/4.43 (16) YES 14.36/4.43 (17) QDP 14.36/4.43 (18) QDPOrderProof [EQUIVALENT, 0 ms] 14.36/4.43 (19) QDP 14.36/4.43 (20) DependencyGraphProof [EQUIVALENT, 0 ms] 14.36/4.43 (21) TRUE 14.36/4.43 (22) QDP 14.36/4.43 (23) UsableRulesProof [EQUIVALENT, 0 ms] 14.36/4.43 (24) QDP 14.36/4.43 (25) QDPSizeChangeProof [EQUIVALENT, 0 ms] 14.36/4.43 (26) YES 14.36/4.43 (27) QDP 14.36/4.43 (28) QDPOrderProof [EQUIVALENT, 64 ms] 14.36/4.43 (29) QDP 14.36/4.43 (30) DependencyGraphProof [EQUIVALENT, 0 ms] 14.36/4.43 (31) TRUE 14.36/4.43 14.36/4.43 14.36/4.43 ---------------------------------------- 14.36/4.43 14.36/4.43 (0) 14.36/4.43 Obligation: 14.36/4.43 Clauses: 14.36/4.43 14.36/4.43 mergesort([], []). 14.36/4.43 mergesort(.(X, []), .(X, [])). 14.36/4.43 mergesort(.(X, .(Y, Xs)), Ys) :- ','(split(.(X, .(Y, Xs)), X1s, X2s), ','(mergesort(X1s, Y1s), ','(mergesort(X2s, Y2s), merge(Y1s, Y2s, Ys)))). 14.36/4.43 split([], [], []). 14.36/4.43 split(.(X, Xs), .(X, Ys), Zs) :- split(Xs, Zs, Ys). 14.36/4.43 merge([], Xs, Xs). 14.36/4.43 merge(Xs, [], Xs). 14.36/4.43 merge(.(X, Xs), .(Y, Ys), .(X, Zs)) :- ','(le(X, Y), merge(Xs, .(Y, Ys), Zs)). 14.36/4.43 merge(.(X, Xs), .(Y, Ys), .(Y, Zs)) :- ','(gt(X, Y), merge(.(X, Xs), Ys, Zs)). 14.36/4.43 gt(s(X), s(Y)) :- gt(X, Y). 14.36/4.43 gt(s(X), 0). 14.36/4.43 le(s(X), s(Y)) :- le(X, Y). 14.36/4.43 le(0, s(Y)). 14.36/4.43 le(0, 0). 14.36/4.43 14.36/4.43 14.36/4.43 Query: mergesort(g,a) 14.36/4.43 ---------------------------------------- 14.36/4.43 14.36/4.43 (1) PrologToTRSTransformerProof (SOUND) 14.36/4.43 Transformed Prolog program to TRS. 14.36/4.43 14.36/4.43 { 14.36/4.43 "root": 3, 14.36/4.43 "program": { 14.36/4.43 "directives": [], 14.36/4.43 "clauses": [ 14.36/4.43 [ 14.36/4.43 "(mergesort ([]) ([]))", 14.36/4.43 null 14.36/4.43 ], 14.36/4.43 [ 14.36/4.43 "(mergesort (. X ([])) (. X ([])))", 14.36/4.43 null 14.36/4.43 ], 14.36/4.43 [ 14.36/4.43 "(mergesort (. X (. Y Xs)) Ys)", 14.36/4.43 "(',' (split (. X (. Y Xs)) X1s X2s) (',' (mergesort X1s Y1s) (',' (mergesort X2s Y2s) (merge Y1s Y2s Ys))))" 14.36/4.43 ], 14.36/4.43 [ 14.36/4.43 "(split ([]) ([]) ([]))", 14.36/4.43 null 14.36/4.43 ], 14.36/4.43 [ 14.36/4.43 "(split (. X Xs) (. X Ys) Zs)", 14.36/4.43 "(split Xs Zs Ys)" 14.36/4.43 ], 14.36/4.43 [ 14.36/4.43 "(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