details

property	value
status	complete
benchmark	delmin-bff.pl
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n137.star.cs.uiowa.edu
space	BCGGV05

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.81224 seconds
cpu usage	4.19032
user time	4.00176
system time	0.188563
max virtual memory	1.8677144E7
max residence set size	282360.0

stage attributes

key	value
starexec-result	YES

output

YES proof of /export/starexec/sandbox/benchmark/theBenchmark.pl # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Left Termination of the query pattern delmin(g,a,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) PiDP (7) PiDPToQDPProof [SOUND, 0 ms] (8) QDP (9) QDPSizeChangeProof [EQUIVALENT, 0 ms] (10) YES ---------------------------------------- (0) Obligation: Clauses: delete(X, tree(X, void, Right), Right). delete(X, tree(X, Left, void), Left). delete(X, tree(X, Left, Right), tree(Y, Left, Right1)) :- delmin(Right, Y, Right1). delete(X, tree(Y, Left, Right), tree(Y, Left1, Right)) :- ','(less(X, Y), delete(X, Left, Left1)). delete(X, tree(Y, Left, Right), tree(Y, Left, Right1)) :- ','(less(Y, X), delete(X, Right, Right1)). delmin(tree(Y, void, Right), Y, Right). delmin(tree(X, Left, X1), Y, tree(X, Left1, X2)) :- delmin(Left, Y, Left1). less(0, s(X3)). less(s(X), s(Y)) :- less(X, Y). Query: delmin(g,a,a) ---------------------------------------- (1) PrologToDTProblemTransformerProof (SOUND) Built DT problem from termination graph DT10. { "root": 39, "program": { "directives": [], "clauses": [ [ "(delete X (tree X (void) Right) Right)", null ], [ "(delete X (tree X Left (void)) Left)", null ], [ "(delete X (tree X Left Right) (tree Y Left Right1))", "(delmin Right Y Right1)" ], [ "(delete X (tree Y Left Right) (tree Y Left1 Right))", "(',' (less X Y) (delete X Left Left1))" ], [ "(delete X (tree Y Left Right) (tree Y Left Right1))", "(',' (less Y X) (delete X Right Right1))" ], [ "(delmin (tree Y (void) Right) Y Right)", null ], [ "(delmin (tree X Left X1) Y (tree X Left1 X2))", "(delmin Left Y Left1)" ], [ "(less (0) (s X3))", null ], [ "(less (s X) (s Y))", "(less X Y)" ] ] }, "graph": { "nodes": { "39": { "goal": [{ "clause": -1, "scope": -1, "term": "(delmin T1 T2 T3)" }], "kb": { "nonunifying": [], popout

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

job log

popout

actions

all output return to Logic Programming