details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.61015 seconds
cpu usage	3.45368
user time	3.28258
system time	0.171094
max virtual memory	1.8476972E7
max residence set size	246688.0

stage attributes

key	value
starexec-result	YES

output

3.03/1.56 YES 3.41/1.57 proof of /export/starexec/sandbox/benchmark/theBenchmark.pl 3.41/1.57 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 3.41/1.57 3.41/1.57 3.41/1.57 Left Termination of the query pattern 3.41/1.57 3.41/1.57 p(g,a) 3.41/1.57 3.41/1.57 w.r.t. the given Prolog program could successfully be proven: 3.41/1.57 3.41/1.57 (0) Prolog 3.41/1.57 (1) PrologToDTProblemTransformerProof [SOUND, 0 ms] 3.41/1.57 (2) TRIPLES 3.41/1.57 (3) TriplesToPiDPProof [SOUND, 0 ms] 3.41/1.57 (4) PiDP 3.41/1.57 (5) DependencyGraphProof [EQUIVALENT, 0 ms] 3.41/1.57 (6) TRUE 3.41/1.57 3.41/1.57 3.41/1.57 ---------------------------------------- 3.41/1.57 3.41/1.57 (0) 3.41/1.57 Obligation: 3.41/1.57 Clauses: 3.41/1.57 3.41/1.57 p(X, Z) :- ','(q(X, Y), p(Y, Z)). 3.41/1.57 p(X, X). 3.41/1.57 q(a, b). 3.41/1.57 3.41/1.57 3.41/1.57 Query: p(g,a) 3.41/1.57 ---------------------------------------- 3.41/1.57 3.41/1.57 (1) PrologToDTProblemTransformerProof (SOUND) 3.41/1.57 Built DT problem from termination graph DT10. 3.41/1.57 3.41/1.57 { 3.41/1.57 "root": 81, 3.41/1.57 "program": { 3.41/1.57 "directives": [], 3.41/1.57 "clauses": [ 3.41/1.57 [ 3.41/1.57 "(p X Z)", 3.41/1.57 "(',' (q X Y) (p Y Z))" 3.41/1.57 ], 3.41/1.57 [ 3.41/1.57 "(p X X)", 3.41/1.57 null 3.41/1.57 ], 3.41/1.57 [ 3.41/1.57 "(q (a) (b))", 3.41/1.57 null 3.41/1.57 ] 3.41/1.57 ] 3.41/1.57 }, 3.41/1.57 "graph": { 3.41/1.57 "nodes": { 3.41/1.57 "type": "Nodes", 3.41/1.57 "112": { 3.41/1.57 "goal": [{ 3.41/1.57 "clause": -1, 3.41/1.57 "scope": -1, 3.41/1.57 "term": "(true)" 3.41/1.57 }], 3.41/1.57 "kb": { 3.41/1.57 "nonunifying": [], 3.41/1.57 "intvars": {}, 3.41/1.57 "arithmetic": { 3.41/1.57 "type": "PlainIntegerRelationState", 3.41/1.57 "relations": [] 3.41/1.57 }, 3.41/1.57 "ground": [], 3.41/1.57 "free": [], 3.41/1.57 "exprvars": [] 3.41/1.57 } 3.41/1.57 }, 3.41/1.57 "113": { 3.41/1.57 "goal": [], 3.41/1.57 "kb": { 3.41/1.57 "nonunifying": [], 3.41/1.57 "intvars": {}, 3.41/1.57 "arithmetic": { 3.41/1.57 "type": "PlainIntegerRelationState", 3.41/1.57 "relations": [] 3.41/1.57 }, 3.41/1.57 "ground": [], 3.41/1.57 "free": [], 3.41/1.57 "exprvars": [] 3.41/1.57 } 3.41/1.57 }, 3.41/1.57 "114": { 3.41/1.57 "goal": [], 3.41/1.57 "kb": { 3.41/1.57 "nonunifying": [], 3.41/1.57 "intvars": {}, 3.41/1.57 "arithmetic": { 3.41/1.57 "type": "PlainIntegerRelationState", 3.41/1.57 "relations": [] 3.41/1.57 }, 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