details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.77803 seconds
cpu usage	7.19276
user time	6.81454
system time	0.378223
max virtual memory	1.960924E7
max residence set size	600004.0

stage attributes

key	value
starexec-result	YES

output

6.68/2.70 YES 6.97/2.73 proof of /export/starexec/sandbox/benchmark/theBenchmark.pl 6.97/2.73 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 6.97/2.73 6.97/2.73 6.97/2.73 Left Termination of the query pattern 6.97/2.73 6.97/2.73 rem(g,g,a) 6.97/2.73 6.97/2.73 w.r.t. the given Prolog program could successfully be proven: 6.97/2.73 6.97/2.73 (0) Prolog 6.97/2.73 (1) PrologToDTProblemTransformerProof [SOUND, 44 ms] 6.97/2.73 (2) TRIPLES 6.97/2.73 (3) TriplesToPiDPProof [SOUND, 0 ms] 6.97/2.73 (4) PiDP 6.97/2.73 (5) DependencyGraphProof [EQUIVALENT, 0 ms] 6.97/2.73 (6) AND 6.97/2.73 (7) PiDP 6.97/2.73 (8) UsableRulesProof [EQUIVALENT, 0 ms] 6.97/2.73 (9) PiDP 6.97/2.73 (10) PiDPToQDPProof [EQUIVALENT, 0 ms] 6.97/2.73 (11) QDP 6.97/2.73 (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] 6.97/2.73 (13) YES 6.97/2.73 (14) PiDP 6.97/2.73 (15) UsableRulesProof [EQUIVALENT, 0 ms] 6.97/2.73 (16) PiDP 6.97/2.73 (17) PiDPToQDPProof [SOUND, 0 ms] 6.97/2.73 (18) QDP 6.97/2.73 (19) QDPSizeChangeProof [EQUIVALENT, 0 ms] 6.97/2.73 (20) YES 6.97/2.73 (21) PiDP 6.97/2.73 (22) PiDPToQDPProof [SOUND, 0 ms] 6.97/2.73 (23) QDP 6.97/2.73 (24) QDPOrderProof [EQUIVALENT, 33 ms] 6.97/2.73 (25) QDP 6.97/2.73 (26) PisEmptyProof [EQUIVALENT, 0 ms] 6.97/2.73 (27) YES 6.97/2.73 6.97/2.73 6.97/2.73 ---------------------------------------- 6.97/2.73 6.97/2.73 (0) 6.97/2.73 Obligation: 6.97/2.73 Clauses: 6.97/2.73 6.97/2.73 rem(X, Y, R) :- ','(notZero(Y), ','(sub(X, Y, Z), rem(Z, Y, R))). 6.97/2.73 rem(X, Y, X) :- ','(notZero(Y), geq(X, Y)). 6.97/2.73 sub(s(X), s(Y), Z) :- sub(X, Y, Z). 6.97/2.73 sub(X, 0, X). 6.97/2.73 notZero(s(X)). 6.97/2.73 geq(s(X), s(Y)) :- geq(X, Y). 6.97/2.73 geq(X, 0). 6.97/2.73 6.97/2.73 6.97/2.73 Query: rem(g,g,a) 6.97/2.73 ---------------------------------------- 6.97/2.73 6.97/2.73 (1) PrologToDTProblemTransformerProof (SOUND) 6.97/2.73 Built DT problem from termination graph DT10. 6.97/2.73 6.97/2.73 { 6.97/2.73 "root": 16, 6.97/2.73 "program": { 6.97/2.73 "directives": [], 6.97/2.73 "clauses": [ 6.97/2.73 [ 6.97/2.73 "(rem X Y R)", 6.97/2.73 "(',' (notZero Y) (',' (sub X Y Z) (rem Z Y R)))" 6.97/2.73 ], 6.97/2.73 [ 6.97/2.73 "(rem X Y X)", 6.97/2.73 "(',' (notZero Y) (geq X Y))" 6.97/2.73 ], 6.97/2.73 [ 6.97/2.73 "(sub (s X) (s Y) Z)", 6.97/2.73 "(sub X Y Z)" 6.97/2.73 ], 6.97/2.73 [ 6.97/2.73 "(sub X (0) X)", 6.97/2.73 null 6.97/2.73 ], 6.97/2.73 [ 6.97/2.73 "(notZero (s X))", 6.97/2.73 null 6.97/2.73 ], 6.97/2.73 [ 6.97/2.73 "(geq (s X) (s Y))", 6.97/2.73 "(geq X Y)" 6.97/2.73 ], 6.97/2.73 [ 6.97/2.73 "(geq X (0))", 6.97/2.73 null 6.97/2.73 ] 6.97/2.73 ] 6.97/2.73 }, 6.97/2.73 "graph": { 6.97/2.73 "nodes": { 6.97/2.73 "type": "Nodes", 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