details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.88772 seconds
cpu usage	3.91597
user time	3.72859
system time	0.187386
max virtual memory	1.8810276E7
max residence set size	271416.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 tc(g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToDTProblemTransformerProof [SOUND, 0 ms] (2) TRIPLES (3) TriplesToPiDPProof [SOUND, 0 ms] (4) PiDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) TRUE ---------------------------------------- (0) Obligation: Clauses: p(a, b). p(b, c). tc(X, X). tc(X, Y) :- ','(p(X, Z), tc(Z, Y)). Query: tc(g,a) ---------------------------------------- (1) PrologToDTProblemTransformerProof (SOUND) Built DT problem from termination graph DT10. { "root": 1, "program": { "directives": [], "clauses": [ [ "(p (a) (b))", null ], [ "(p (b) (c))", null ], [ "(tc X X)", null ], [ "(tc X Y)", "(',' (p X Z) (tc Z Y))" ] ] }, "graph": { "nodes": { "16": { "goal": [ { "clause": -1, "scope": -1, "term": "(true)" }, { "clause": 3, "scope": 1, "term": "(tc T4 T2)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T4"], "free": [], "exprvars": [] } }, "17": { "goal": [{ "clause": 3, "scope": 1, "term": "(tc T1 T2)" }], "kb": { "nonunifying": [[ "(tc T1 T2)", "(tc X2 X2)" ]], "intvars": {}, popout

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

job log

popout

actions

all output return to Logic Programming