details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.73991 seconds
cpu usage	3.79563
user time	3.64027
system time	0.155368
max virtual memory	1.8810384E7
max residence set size	270796.0

stage attributes

key	value
starexec-result	YES

output

3.69/1.69 YES 3.69/1.71 proof of /export/starexec/sandbox2/benchmark/theBenchmark.pl 3.69/1.71 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 3.69/1.71 3.69/1.71 3.69/1.71 Left Termination of the query pattern 3.69/1.71 3.69/1.71 p(g) 3.69/1.71 3.69/1.71 w.r.t. the given Prolog program could successfully be proven: 3.69/1.71 3.69/1.71 (0) Prolog 3.69/1.71 (1) PrologToDTProblemTransformerProof [SOUND, 0 ms] 3.69/1.71 (2) TRIPLES 3.69/1.71 (3) TriplesToPiDPProof [SOUND, 0 ms] 3.69/1.71 (4) PiDP 3.69/1.71 (5) DependencyGraphProof [EQUIVALENT, 0 ms] 3.69/1.71 (6) PiDP 3.69/1.71 (7) PiDPToQDPProof [EQUIVALENT, 0 ms] 3.69/1.71 (8) QDP 3.69/1.71 (9) QDPSizeChangeProof [EQUIVALENT, 0 ms] 3.69/1.71 (10) YES 3.69/1.71 3.69/1.71 3.69/1.71 ---------------------------------------- 3.69/1.71 3.69/1.71 (0) 3.69/1.71 Obligation: 3.69/1.71 Clauses: 3.69/1.71 3.69/1.71 p(X) :- ','(q(f(Y)), p(Y)). 3.69/1.71 p(g(X)) :- p(X). 3.69/1.71 q(g(Y)). 3.69/1.71 3.69/1.71 3.69/1.71 Query: p(g) 3.69/1.71 ---------------------------------------- 3.69/1.71 3.69/1.71 (1) PrologToDTProblemTransformerProof (SOUND) 3.69/1.71 Built DT problem from termination graph DT10. 3.69/1.71 3.69/1.71 { 3.69/1.71 "root": 12, 3.69/1.71 "program": { 3.69/1.71 "directives": [], 3.69/1.71 "clauses": [ 3.69/1.71 [ 3.69/1.71 "(p X)", 3.69/1.71 "(',' (q (f Y)) (p Y))" 3.69/1.71 ], 3.69/1.71 [ 3.69/1.71 "(p (g X))", 3.69/1.71 "(p X)" 3.69/1.71 ], 3.69/1.71 [ 3.69/1.71 "(q (g Y))", 3.69/1.71 null 3.69/1.71 ] 3.69/1.71 ] 3.69/1.71 }, 3.69/1.71 "graph": { 3.69/1.71 "nodes": { 3.69/1.71 "121": { 3.69/1.71 "goal": [ 3.69/1.71 { 3.69/1.71 "clause": 2, 3.69/1.71 "scope": 2, 3.69/1.71 "term": "(',' (q (f X3)) (p X3))" 3.69/1.71 }, 3.69/1.71 { 3.69/1.71 "clause": -1, 3.69/1.71 "scope": 2, 3.69/1.71 "term": null 3.69/1.71 }, 3.69/1.71 { 3.69/1.71 "clause": 1, 3.69/1.71 "scope": 1, 3.69/1.71 "term": "(p T3)" 3.69/1.71 } 3.69/1.71 ], 3.69/1.71 "kb": { 3.69/1.71 "nonunifying": [], 3.69/1.71 "intvars": {}, 3.69/1.71 "arithmetic": { 3.69/1.71 "type": "PlainIntegerRelationState", 3.69/1.71 "relations": [] 3.69/1.71 }, 3.69/1.71 "ground": ["T3"], 3.69/1.71 "free": ["X3"], 3.69/1.71 "exprvars": [] 3.69/1.71 } 3.69/1.71 }, 3.69/1.71 "132": { 3.69/1.71 "goal": [], 3.69/1.71 "kb": { 3.69/1.71 "nonunifying": [], 3.69/1.71 "intvars": {}, 3.69/1.71 "arithmetic": { 3.69/1.71 "type": "PlainIntegerRelationState", 3.69/1.71 "relations": [] 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