details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.13508 seconds
cpu usage	5.37574
user time	5.09694
system time	0.278807
max virtual memory	1.8809444E7
max residence set size	443188.0

stage attributes

key	value
starexec-result	YES

output

5.23/2.08 YES 5.23/2.10 proof of /export/starexec/sandbox/benchmark/theBenchmark.pl 5.23/2.10 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 5.23/2.10 5.23/2.10 5.23/2.10 Left Termination of the query pattern 5.23/2.10 5.23/2.10 flat(g,a) 5.23/2.10 5.23/2.10 w.r.t. the given Prolog program could successfully be proven: 5.23/2.10 5.23/2.10 (0) Prolog 5.23/2.10 (1) PrologToTRSTransformerProof [SOUND, 0 ms] 5.23/2.10 (2) QTRS 5.23/2.10 (3) QTRSRRRProof [EQUIVALENT, 132 ms] 5.23/2.10 (4) QTRS 5.23/2.10 (5) RisEmptyProof [EQUIVALENT, 0 ms] 5.23/2.10 (6) YES 5.23/2.10 5.23/2.10 5.23/2.10 ---------------------------------------- 5.23/2.10 5.23/2.10 (0) 5.23/2.10 Obligation: 5.23/2.10 Clauses: 5.23/2.10 5.23/2.10 right(tree(X, XS1, XS2), XS2). 5.23/2.10 flat(niltree, nil). 5.23/2.10 flat(tree(X, niltree, XS), cons(X, YS)) :- ','(right(tree(X, niltree, XS), ZS), flat(ZS, YS)). 5.23/2.10 flat(tree(X, tree(Y, YS1, YS2), XS), ZS) :- flat(tree(Y, YS1, tree(X, YS2, XS)), ZS). 5.23/2.10 5.23/2.10 5.23/2.10 Query: flat(g,a) 5.23/2.10 ---------------------------------------- 5.23/2.10 5.23/2.10 (1) PrologToTRSTransformerProof (SOUND) 5.23/2.10 Transformed Prolog program to TRS. 5.23/2.10 5.23/2.10 { 5.23/2.10 "root": 61, 5.23/2.10 "program": { 5.23/2.10 "directives": [], 5.23/2.10 "clauses": [ 5.23/2.10 [ 5.23/2.10 "(right (tree X XS1 XS2) XS2)", 5.23/2.10 null 5.23/2.10 ], 5.23/2.10 [ 5.23/2.10 "(flat (niltree) (nil))", 5.23/2.10 null 5.23/2.10 ], 5.23/2.10 [ 5.23/2.10 "(flat (tree X (niltree) XS) (cons X YS))", 5.23/2.10 "(',' (right (tree X (niltree) XS) ZS) (flat ZS YS))" 5.23/2.10 ], 5.23/2.10 [ 5.23/2.10 "(flat (tree X (tree Y YS1 YS2) XS) ZS)", 5.23/2.10 "(flat (tree Y YS1 (tree X YS2 XS)) ZS)" 5.23/2.10 ] 5.23/2.10 ] 5.23/2.10 }, 5.23/2.10 "graph": { 5.23/2.10 "nodes": { 5.23/2.10 "type": "Nodes", 5.23/2.10 "195": { 5.23/2.10 "goal": [{ 5.23/2.10 "clause": -1, 5.23/2.10 "scope": -1, 5.23/2.10 "term": "(flat (tree T38 T39 (tree T37 T40 T41)) T43)" 5.23/2.10 }], 5.23/2.10 "kb": { 5.23/2.10 "nonunifying": [], 5.23/2.10 "intvars": {}, 5.23/2.10 "arithmetic": { 5.23/2.10 "type": "PlainIntegerRelationState", 5.23/2.10 "relations": [] 5.23/2.10 }, 5.23/2.10 "ground": [ 5.23/2.10 "T37", 5.23/2.10 "T38", 5.23/2.10 "T39", 5.23/2.10 "T40", 5.23/2.10 "T41" 5.23/2.10 ], 5.23/2.10 "free": [], 5.23/2.10 "exprvars": [] 5.23/2.10 } 5.23/2.10 }, 5.23/2.10 "196": { 5.23/2.10 "goal": [], 5.23/2.10 "kb": { 5.23/2.10 "nonunifying": [], 5.23/2.10 "intvars": {}, 5.23/2.10 "arithmetic": { 5.23/2.10 "type": "PlainIntegerRelationState", 5.23/2.10 "relations": [] 5.23/2.10 }, 5.23/2.10 "ground": [], 5.23/2.10 "free": [], 5.23/2.10 "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