Logic_Programming 2019-04-02 08.22 pair #434324369

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.69136 seconds
cpu usage	3.34058
user time	3.18909
system time	0.151491
max virtual memory	1.8275212E7
max residence set size	237212.0

stage attributes

key	value
starexec-result	YES

output

3.22/1.63	YES
3.22/1.65	proof of /export/starexec/sandbox/benchmark/theBenchmark.pl
3.22/1.65	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
3.22/1.65	
3.22/1.65	
3.22/1.65	Left Termination of the query pattern
3.22/1.65	
3.22/1.65	p(a)
3.22/1.65	
3.22/1.65	w.r.t. the given Prolog program could successfully be proven:
3.22/1.65	
3.22/1.65	(0) Prolog
3.22/1.65	(1) PrologToIRSwTTransformerProof [SOUND, 0 ms]
3.22/1.65	(2) TRUE
3.22/1.65	
3.22/1.65	
3.22/1.65	----------------------------------------
3.22/1.65	
3.22/1.65	(0)
3.22/1.65	Obligation:
3.22/1.65	Clauses:
3.22/1.65	
3.22/1.65	p(.(A, [])) :- l(.(A, [])).
3.22/1.65	r(1).
3.22/1.65	l([]).
3.22/1.65	l(.(H, T)) :- ','(r(H), l(T)).
3.22/1.65	
3.22/1.65	
3.22/1.65	Query: p(a)
3.22/1.65	----------------------------------------
3.22/1.65	
3.22/1.65	(1) PrologToIRSwTTransformerProof (SOUND)
3.22/1.65	Transformed Prolog program to IRSwT according to method in Master Thesis of A. Weinert
3.22/1.65	
3.22/1.65	{
3.22/1.65	    "root": 1,
3.22/1.65	    "program": {
3.22/1.65	        "directives": [],
3.22/1.65	        "clauses": [
3.22/1.65	            [
3.22/1.65	                "(p (. A ([])))",
3.22/1.65	                "(l (. A ([])))"
3.22/1.65	            ],
3.22/1.65	            [
3.22/1.65	                "(r (1))",
3.22/1.65	                null
3.22/1.65	            ],
3.22/1.65	            [
3.22/1.65	                "(l ([]))",
3.22/1.65	                null
3.22/1.65	            ],
3.22/1.65	            [
3.22/1.65	                "(l (. H T))",
3.22/1.65	                "(',' (r H) (l T))"
3.22/1.65	            ]
3.22/1.65	        ]
3.22/1.65	    },
3.22/1.65	    "graph": {
3.22/1.65	        "nodes": {
3.22/1.65	            "type": "Nodes",
3.22/1.65	            "120": {
3.22/1.65	                "goal": [{
3.22/1.65	                    "clause": -1,
3.22/1.65	                    "scope": -1,
3.22/1.65	                    "term": "(',' (r T10) (l ([])))"
3.22/1.65	                }],
3.22/1.65	                "kb": {
3.22/1.65	                    "nonunifying": [],
3.22/1.65	                    "intvars": {},
3.22/1.65	                    "arithmetic": {
3.22/1.65	                        "type": "PlainIntegerRelationState",
3.22/1.65	                        "relations": []
3.22/1.65	                    },
3.22/1.65	                    "ground": [],
3.22/1.65	                    "free": [],
3.22/1.65	                    "exprvars": []
3.22/1.65	                }
3.22/1.65	            },
3.22/1.65	            "142": {
3.22/1.65	                "goal": [{
3.22/1.65	                    "clause": -1,
3.22/1.65	                    "scope": -1,
3.22/1.65	                    "term": "(true)"
3.22/1.65	                }],
3.22/1.65	                "kb": {
3.22/1.65	                    "nonunifying": [],
3.22/1.65	                    "intvars": {},
3.22/1.65	                    "arithmetic": {
3.22/1.65	                        "type": "PlainIntegerRelationState",
3.22/1.65	                        "relations": []
3.22/1.65	                    },
3.22/1.65	                    "ground": [],
3.22/1.65	                    "free": [],
3.22/1.65	                    "exprvars": []
3.22/1.65	                }
3.22/1.65	            },
3.22/1.65	            "121": {
3.22/1.65	                "goal": [{
3.22/1.65	                    "clause": 1,
3.22/1.65	                    "scope": 3,

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