details

property	value
status	complete
benchmark	transpose-bf.pl
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n083.star.cs.uiowa.edu
space	BCGGV05

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.40629 seconds
cpu usage	4.32839
user time	4.12887
system time	0.199521
max virtual memory	3.7240608E7
max residence set size	291496.0

stage attributes

key	value
starexec-result	YES

output

4.05/1.87 YES 4.31/2.36 proof of /export/starexec/sandbox/benchmark/theBenchmark.pl 4.31/2.36 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 4.31/2.36 4.31/2.36 4.31/2.36 Left Termination of the query pattern 4.31/2.36 4.31/2.36 transpose(g,a) 4.31/2.36 4.31/2.36 w.r.t. the given Prolog program could successfully be proven: 4.31/2.36 4.31/2.36 (0) Prolog 4.31/2.36 (1) PrologToDTProblemTransformerProof [SOUND, 41 ms] 4.31/2.36 (2) TRIPLES 4.31/2.36 (3) TriplesToPiDPProof [SOUND, 0 ms] 4.31/2.36 (4) PiDP 4.31/2.36 (5) DependencyGraphProof [EQUIVALENT, 0 ms] 4.31/2.36 (6) AND 4.31/2.36 (7) PiDP 4.31/2.36 (8) UsableRulesProof [EQUIVALENT, 0 ms] 4.31/2.36 (9) PiDP 4.31/2.36 (10) PiDPToQDPProof [SOUND, 1 ms] 4.31/2.36 (11) QDP 4.31/2.36 (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] 4.31/2.36 (13) YES 4.31/2.36 (14) PiDP 4.31/2.36 (15) PiDPToQDPProof [SOUND, 0 ms] 4.31/2.36 (16) QDP 4.31/2.36 (17) QDPSizeChangeProof [EQUIVALENT, 0 ms] 4.31/2.36 (18) YES 4.31/2.36 4.31/2.36 4.31/2.36 ---------------------------------------- 4.31/2.36 4.31/2.36 (0) 4.31/2.36 Obligation: 4.31/2.36 Clauses: 4.31/2.36 4.31/2.36 transpose(A, B) :- transpose_aux(A, [], B). 4.31/2.36 transpose_aux(.(R, Rs), X1, .(C, Cs)) :- ','(row2col(R, .(C, Cs), Cols1, Accm), transpose_aux(Rs, Accm, Cols1)). 4.31/2.36 transpose_aux([], X, X). 4.31/2.36 row2col(.(X, Xs), .(.(X, Ys), Cols), .(Ys, Cols1), .([], As)) :- row2col(Xs, Cols, Cols1, As). 4.31/2.36 row2col([], [], [], []). 4.31/2.36 4.31/2.36 4.31/2.36 Query: transpose(g,a) 4.31/2.36 ---------------------------------------- 4.31/2.36 4.31/2.36 (1) PrologToDTProblemTransformerProof (SOUND) 4.31/2.36 Built DT problem from termination graph DT10. 4.31/2.36 4.31/2.36 { 4.31/2.36 "root": 2, 4.31/2.36 "program": { 4.31/2.36 "directives": [], 4.31/2.36 "clauses": [ 4.31/2.36 [ 4.31/2.36 "(transpose A B)", 4.31/2.36 "(transpose_aux A ([]) B)" 4.31/2.36 ], 4.31/2.36 [ 4.31/2.36 "(transpose_aux (. R Rs) X1 (. C Cs))", 4.31/2.36 "(',' (row2col R (. C Cs) Cols1 Accm) (transpose_aux Rs Accm Cols1))" 4.31/2.36 ], 4.31/2.36 [ 4.31/2.36 "(transpose_aux ([]) X X)", 4.31/2.36 null 4.31/2.36 ], 4.31/2.36 [ 4.31/2.36 "(row2col (. X Xs) (. (. X Ys) Cols) (. Ys Cols1) (. ([]) As))", 4.31/2.36 "(row2col Xs Cols Cols1 As)" 4.31/2.36 ], 4.31/2.36 [ 4.31/2.36 "(row2col ([]) ([]) ([]) ([]))", 4.31/2.36 null 4.31/2.36 ] 4.31/2.36 ] 4.31/2.36 }, 4.31/2.36 "graph": { 4.31/2.36 "nodes": { 4.31/2.36 "type": "Nodes", 4.31/2.36 "150": { 4.31/2.36 "goal": [{ 4.31/2.36 "clause": 3, 4.31/2.36 "scope": 3, 4.31/2.36 "term": "(row2col T24 (. T28 T29) X35 X36)" 4.31/2.36 }], 4.31/2.36 "kb": { 4.31/2.36 "nonunifying": [], 4.31/2.36 "intvars": {}, 4.31/2.36 "arithmetic": { 4.31/2.36 "type": "PlainIntegerRelationState", 4.31/2.36 "relations": [] 4.31/2.36 }, 4.31/2.36 "ground": ["T24"], 4.31/2.36 "free": [ 4.31/2.36 "X35", 4.31/2.36 "X36" 4.31/2.36 ], 4.31/2.36 "exprvars": [] 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