details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.35882 seconds
cpu usage	9.85839
user time	9.38771
system time	0.470683
max virtual memory	1.993646E7
max residence set size	832652.0

stage attributes

key	value
starexec-result	YES

output

9.27/3.30 YES 9.74/3.32 proof of /export/starexec/sandbox/benchmark/theBenchmark.pl 9.74/3.32 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.74/3.32 9.74/3.32 9.74/3.32 Left Termination of the query pattern 9.74/3.32 9.74/3.32 reach(g,g,g,g) 9.74/3.32 9.74/3.32 w.r.t. the given Prolog program could successfully be proven: 9.74/3.32 9.74/3.32 (0) Prolog 9.74/3.32 (1) PrologToDTProblemTransformerProof [SOUND, 43 ms] 9.74/3.32 (2) TRIPLES 9.74/3.32 (3) TriplesToPiDPProof [SOUND, 25 ms] 9.74/3.32 (4) PiDP 9.74/3.32 (5) DependencyGraphProof [EQUIVALENT, 0 ms] 9.74/3.32 (6) AND 9.74/3.32 (7) PiDP 9.74/3.32 (8) UsableRulesProof [EQUIVALENT, 0 ms] 9.74/3.32 (9) PiDP 9.74/3.32 (10) PiDPToQDPProof [SOUND, 0 ms] 9.74/3.32 (11) QDP 9.74/3.32 (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] 9.74/3.32 (13) YES 9.74/3.32 (14) PiDP 9.74/3.32 (15) UsableRulesProof [EQUIVALENT, 0 ms] 9.74/3.32 (16) PiDP 9.74/3.32 (17) PiDPToQDPProof [EQUIVALENT, 0 ms] 9.74/3.32 (18) QDP 9.74/3.32 (19) QDPSizeChangeProof [EQUIVALENT, 0 ms] 9.74/3.32 (20) YES 9.74/3.32 (21) PiDP 9.74/3.32 (22) UsableRulesProof [EQUIVALENT, 0 ms] 9.74/3.32 (23) PiDP 9.74/3.32 (24) PiDPToQDPProof [SOUND, 0 ms] 9.74/3.32 (25) QDP 9.74/3.32 (26) QDPSizeChangeProof [EQUIVALENT, 0 ms] 9.74/3.32 (27) YES 9.74/3.32 (28) PiDP 9.74/3.32 (29) UsableRulesProof [EQUIVALENT, 0 ms] 9.74/3.32 (30) PiDP 9.74/3.32 (31) PiDPToQDPProof [EQUIVALENT, 0 ms] 9.74/3.32 (32) QDP 9.74/3.32 (33) QDPSizeChangeProof [EQUIVALENT, 0 ms] 9.74/3.32 (34) YES 9.74/3.32 (35) PiDP 9.74/3.32 (36) PiDPToQDPProof [SOUND, 0 ms] 9.74/3.32 (37) QDP 9.74/3.32 (38) QDPQMonotonicMRRProof [EQUIVALENT, 56 ms] 9.74/3.32 (39) QDP 9.74/3.32 (40) DependencyGraphProof [EQUIVALENT, 0 ms] 9.74/3.32 (41) TRUE 9.74/3.32 9.74/3.32 9.74/3.32 ---------------------------------------- 9.74/3.32 9.74/3.32 (0) 9.74/3.32 Obligation: 9.74/3.32 Clauses: 9.74/3.32 9.74/3.32 reach(X, Y, Edges, Not_Visited) :- member(.(X, .(Y, [])), Edges). 9.74/3.32 reach(X, Z, Edges, Not_Visited) :- ','(member(.(X, .(Y, [])), Edges), ','(member(Y, Not_Visited), ','(delete(Y, Not_Visited, V1), reach(Y, Z, Edges, V1)))). 9.74/3.32 member(H, .(H, L)). 9.74/3.32 member(X, .(H, L)) :- member(X, L). 9.74/3.32 delete(X, .(X, Y), Y). 9.74/3.32 delete(X, .(H, T1), .(H, T2)) :- delete(X, T1, T2). 9.74/3.32 9.74/3.32 9.74/3.32 Query: reach(g,g,g,g) 9.74/3.32 ---------------------------------------- 9.74/3.32 9.74/3.32 (1) PrologToDTProblemTransformerProof (SOUND) 9.74/3.32 Built DT problem from termination graph DT10. 9.74/3.32 9.74/3.32 { 9.74/3.32 "root": 1, 9.74/3.32 "program": { 9.74/3.32 "directives": [], 9.74/3.32 "clauses": [ 9.74/3.32 [ 9.74/3.32 "(reach X Y Edges Not_Visited)", 9.74/3.32 "(member (. X (. Y ([]))) Edges)" 9.74/3.32 ], 9.74/3.32 [ 9.74/3.32 "(reach X Z Edges Not_Visited)", 9.74/3.32 "(',' (member (. X (. Y ([]))) Edges) (',' (member Y Not_Visited) (',' (delete Y Not_Visited V1) (reach Y Z Edges V1))))" 9.74/3.32 ], 9.74/3.32 [ 9.74/3.32 "(member H (. H L))", 9.74/3.32 null 9.74/3.32 ], 9.74/3.32 [ 9.74/3.32 "(member X (. H L))", 9.74/3.32 "(member X L)" 9.74/3.32 ], 9.74/3.32 [ 9.74/3.32 "(delete X (. X Y) Y)", 9.74/3.32 null 9.74/3.32 ], 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