Logic_Programming 2019-04-02 08.22 pair #434324567

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.71586 seconds
cpu usage	3.74878
user time	3.57747
system time	0.171314
max virtual memory	1.854274E7
max residence set size	267008.0

stage attributes

key	value
starexec-result	YES

output

3.45/1.68	YES
3.69/1.70	proof of /export/starexec/sandbox/benchmark/theBenchmark.pl
3.69/1.70	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
3.69/1.70	
3.69/1.70	
3.69/1.70	Left Termination of the query pattern
3.69/1.70	
3.69/1.70	even(g)
3.69/1.70	
3.69/1.70	w.r.t. the given Prolog program could successfully be proven:
3.69/1.70	
3.69/1.70	(0) Prolog
3.69/1.70	(1) PrologToDTProblemTransformerProof [SOUND, 0 ms]
3.69/1.70	(2) TRIPLES
3.69/1.70	(3) TriplesToPiDPProof [SOUND, 0 ms]
3.69/1.70	(4) PiDP
3.69/1.70	(5) DependencyGraphProof [EQUIVALENT, 0 ms]
3.69/1.70	(6) PiDP
3.69/1.70	(7) PiDPToQDPProof [EQUIVALENT, 0 ms]
3.69/1.70	(8) QDP
3.69/1.70	(9) QDPSizeChangeProof [EQUIVALENT, 0 ms]
3.69/1.70	(10) YES
3.69/1.70	
3.69/1.70	
3.69/1.70	----------------------------------------
3.69/1.70	
3.69/1.70	(0)
3.69/1.70	Obligation:
3.69/1.70	Clauses:
3.69/1.70	
3.69/1.70	even(0).
3.69/1.70	even(s(s(0))).
3.69/1.70	even(s(s(s(X)))) :- odd(X).
3.69/1.70	odd(s(0)).
3.69/1.70	odd(s(X)) :- even(s(s(X))).
3.69/1.70	
3.69/1.70	
3.69/1.70	Query: even(g)
3.69/1.70	----------------------------------------
3.69/1.70	
3.69/1.70	(1) PrologToDTProblemTransformerProof (SOUND)
3.69/1.70	Built DT problem from termination graph DT10.
3.69/1.70	
3.69/1.70	{
3.69/1.70	    "root": 9,
3.69/1.70	    "program": {
3.69/1.70	        "directives": [],
3.69/1.70	        "clauses": [
3.69/1.70	            [
3.69/1.70	                "(even (0))",
3.69/1.70	                null
3.69/1.70	            ],
3.69/1.70	            [
3.69/1.70	                "(even (s (s (0))))",
3.69/1.70	                null
3.69/1.70	            ],
3.69/1.70	            [
3.69/1.70	                "(even (s (s (s X))))",
3.69/1.70	                "(odd X)"
3.69/1.70	            ],
3.69/1.70	            [
3.69/1.70	                "(odd (s (0)))",
3.69/1.70	                null
3.69/1.70	            ],
3.69/1.70	            [
3.69/1.70	                "(odd (s X))",
3.69/1.70	                "(even (s (s X)))"
3.69/1.70	            ]
3.69/1.70	        ]
3.69/1.70	    },
3.69/1.70	    "graph": {
3.69/1.70	        "nodes": {
3.69/1.70	            "88": {
3.69/1.70	                "goal": [{
3.69/1.70	                    "clause": 2,
3.69/1.70	                    "scope": 1,
3.69/1.70	                    "term": "(even (0))"
3.69/1.70	                }],
3.69/1.70	                "kb": {
3.69/1.70	                    "nonunifying": [],
3.69/1.70	                    "intvars": {},
3.69/1.70	                    "arithmetic": {
3.69/1.70	                        "type": "PlainIntegerRelationState",
3.69/1.70	                        "relations": []
3.69/1.70	                    },
3.69/1.70	                    "ground": [],
3.69/1.70	                    "free": [],
3.69/1.70	                    "exprvars": []
3.69/1.70	                }
3.69/1.70	            },
3.69/1.70	            "99": {
3.69/1.70	                "goal": [],
3.69/1.70	                "kb": {
3.69/1.70	                    "nonunifying": [],
3.69/1.70	                    "intvars": {},
3.69/1.70	                    "arithmetic": {
3.69/1.70	                        "type": "PlainIntegerRelationState",
3.69/1.70	                        "relations": []
3.69/1.70	                    },
3.69/1.70	                    "ground": [],

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