details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.78013 seconds
cpu usage	3.77274
user time	3.59032
system time	0.18241
max virtual memory	1.8676664E7
max residence set size	260616.0

stage attributes

key	value
starexec-result	YES

output

3.30/1.71 YES 3.63/1.74 proof of /export/starexec/sandbox/benchmark/theBenchmark.pl 3.63/1.74 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 3.63/1.74 3.63/1.74 3.63/1.74 Left Termination of the query pattern 3.63/1.74 3.63/1.74 fold(g,g,a) 3.63/1.74 3.63/1.74 w.r.t. the given Prolog program could successfully be proven: 3.63/1.74 3.63/1.74 (0) Prolog 3.63/1.74 (1) PrologToDTProblemTransformerProof [SOUND, 0 ms] 3.63/1.74 (2) TRIPLES 3.63/1.74 (3) TriplesToPiDPProof [SOUND, 0 ms] 3.63/1.74 (4) PiDP 3.63/1.74 (5) DependencyGraphProof [EQUIVALENT, 0 ms] 3.63/1.74 (6) TRUE 3.63/1.74 3.63/1.74 3.63/1.74 ---------------------------------------- 3.63/1.74 3.63/1.74 (0) 3.63/1.74 Obligation: 3.63/1.74 Clauses: 3.63/1.74 3.63/1.74 fold(X, .(Y, Ys), Z) :- ','(myop(X, Y, V), fold(V, Ys, Z)). 3.63/1.74 fold(X, [], X). 3.63/1.74 myop(a, b, c). 3.63/1.74 3.63/1.74 3.63/1.74 Query: fold(g,g,a) 3.63/1.74 ---------------------------------------- 3.63/1.74 3.63/1.74 (1) PrologToDTProblemTransformerProof (SOUND) 3.63/1.74 Built DT problem from termination graph DT10. 3.63/1.74 3.63/1.74 { 3.63/1.74 "root": 70, 3.63/1.74 "program": { 3.63/1.74 "directives": [], 3.63/1.74 "clauses": [ 3.63/1.74 [ 3.63/1.74 "(fold X (. Y Ys) Z)", 3.63/1.74 "(',' (myop X Y V) (fold V Ys Z))" 3.63/1.74 ], 3.63/1.74 [ 3.63/1.74 "(fold X ([]) X)", 3.63/1.74 null 3.63/1.74 ], 3.63/1.74 [ 3.63/1.74 "(myop (a) (b) (c))", 3.63/1.74 null 3.63/1.74 ] 3.63/1.74 ] 3.63/1.74 }, 3.63/1.74 "graph": { 3.63/1.74 "nodes": { 3.63/1.74 "170": { 3.63/1.74 "goal": [], 3.63/1.74 "kb": { 3.63/1.74 "nonunifying": [], 3.63/1.74 "intvars": {}, 3.63/1.74 "arithmetic": { 3.63/1.74 "type": "PlainIntegerRelationState", 3.63/1.74 "relations": [] 3.63/1.74 }, 3.63/1.74 "ground": [], 3.63/1.74 "free": [], 3.63/1.74 "exprvars": [] 3.63/1.74 } 3.63/1.74 }, 3.63/1.74 "171": { 3.63/1.74 "goal": [], 3.63/1.74 "kb": { 3.63/1.74 "nonunifying": [], 3.63/1.74 "intvars": {}, 3.63/1.74 "arithmetic": { 3.63/1.74 "type": "PlainIntegerRelationState", 3.63/1.74 "relations": [] 3.63/1.74 }, 3.63/1.74 "ground": [], 3.63/1.74 "free": [], 3.63/1.74 "exprvars": [] 3.63/1.74 } 3.63/1.74 }, 3.63/1.74 "type": "Nodes", 3.63/1.74 "143": { 3.63/1.74 "goal": [ 3.63/1.74 { 3.63/1.74 "clause": -1, 3.63/1.74 "scope": -1, 3.63/1.74 "term": "(',' (myop T8 T9 X9) (fold X9 T10 T12))" 3.63/1.74 }, 3.63/1.74 { 3.63/1.74 "clause": 1, 3.63/1.74 "scope": 1, 3.63/1.74 "term": "(fold T8 (. T9 T10) T3)" 3.63/1.74 } 3.63/1.74 ], 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