details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.61403 seconds
cpu usage	3.41958
user time	3.2714
system time	0.148186
max virtual memory	1.8275236E7
max residence set size	220832.0

stage attributes

key	value
starexec-result	YES

output

YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.pl # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Left Termination of the query pattern at(a,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToIRSwTTransformerProof [SOUND, 0 ms] (2) TRUE ---------------------------------------- (0) Obligation: Clauses: at(X, fido) :- ','(at(X, mary), near(X)). at(ta, mary). at(jm, mary). near(jm). Query: at(a,a) ---------------------------------------- (1) PrologToIRSwTTransformerProof (SOUND) Transformed Prolog program to IRSwT according to method in Master Thesis of A. Weinert { "root": 2, "program": { "directives": [], "clauses": [ [ "(at X (fido))", "(',' (at X (mary)) (near X))" ], [ "(at (ta) (mary))", null ], [ "(at (jm) (mary))", null ], [ "(near (jm))", null ] ] }, "graph": { "nodes": { "23": { "goal": [ { "clause": 1, "scope": 1, "term": "(at T1 T2)" }, { "clause": 2, "scope": 1, "term": "(at T1 T2)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "67": { "goal": [{ "clause": 1, "scope": 1, "term": "(at T1 T2)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Logic Programming