details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.34668 seconds
cpu usage	9.81522
user time	9.31107
system time	0.504147
max virtual memory	3.7916104E7
max residence set size	918428.0

stage attributes

key	value
starexec-result	YES

output

9.30/3.18 YES 9.64/3.28 proof of /export/starexec/sandbox2/benchmark/theBenchmark.pl 9.64/3.28 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.64/3.28 9.64/3.28 9.64/3.28 Left Termination of the query pattern 9.64/3.28 9.64/3.28 shapes(g,a) 9.64/3.28 9.64/3.28 w.r.t. the given Prolog program could successfully be proven: 9.64/3.28 9.64/3.28 (0) Prolog 9.64/3.28 (1) PrologToDTProblemTransformerProof [SOUND, 53 ms] 9.64/3.28 (2) TRIPLES 9.64/3.28 (3) TriplesToPiDPProof [SOUND, 0 ms] 9.64/3.28 (4) PiDP 9.64/3.28 (5) DependencyGraphProof [EQUIVALENT, 0 ms] 9.64/3.28 (6) AND 9.64/3.28 (7) PiDP 9.64/3.28 (8) UsableRulesProof [EQUIVALENT, 0 ms] 9.64/3.28 (9) PiDP 9.64/3.28 (10) PiDPToQDPProof [SOUND, 0 ms] 9.64/3.28 (11) QDP 9.64/3.28 (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] 9.64/3.28 (13) YES 9.64/3.28 (14) PiDP 9.64/3.28 (15) UsableRulesProof [EQUIVALENT, 0 ms] 9.64/3.28 (16) PiDP 9.64/3.28 (17) PiDPToQDPProof [SOUND, 0 ms] 9.64/3.28 (18) QDP 9.64/3.28 (19) QDPQMonotonicMRRProof [EQUIVALENT, 111 ms] 9.64/3.28 (20) QDP 9.64/3.28 (21) DependencyGraphProof [EQUIVALENT, 0 ms] 9.64/3.28 (22) TRUE 9.64/3.28 (23) PiDP 9.64/3.28 (24) UsableRulesProof [EQUIVALENT, 0 ms] 9.64/3.28 (25) PiDP 9.64/3.28 (26) PiDPToQDPProof [SOUND, 0 ms] 9.64/3.28 (27) QDP 9.64/3.28 (28) QDPSizeChangeProof [EQUIVALENT, 0 ms] 9.64/3.28 (29) YES 9.64/3.28 (30) PiDP 9.64/3.28 (31) UsableRulesProof [EQUIVALENT, 0 ms] 9.64/3.28 (32) PiDP 9.64/3.28 (33) PiDPToQDPProof [SOUND, 0 ms] 9.64/3.28 (34) QDP 9.64/3.28 (35) QDPSizeChangeProof [EQUIVALENT, 0 ms] 9.64/3.28 (36) YES 9.64/3.28 9.64/3.28 9.64/3.28 ---------------------------------------- 9.64/3.28 9.64/3.28 (0) 9.64/3.28 Obligation: 9.64/3.28 Clauses: 9.64/3.28 9.64/3.28 shapes(Matrix, N) :- ','(varmat(Matrix, MatrixWithVars), unif_matrx(MatrixWithVars)). 9.64/3.28 varmat([], []). 9.64/3.28 varmat(.(L, Ls), .(VL, VLs)) :- ','(varmat(L, VL), varmat(Ls, VLs)). 9.64/3.28 varmat(.(black, Xs), .(black, VXs)) :- varmat(Xs, VXs). 9.64/3.28 varmat(.(white, Xs), .(w(X1), VXs)) :- varmat(Xs, VXs). 9.64/3.28 unif_matrx(.(L1, .(L2, Ls))) :- ','(unif_lines(L1, L2), unif_matrx(.(L2, Ls))). 9.64/3.28 unif_matrx(.(X2, [])). 9.64/3.28 unif_lines(.(W, .(X, L1s)), .(Y, .(Z, L2s))) :- ','(unif_pairs(.(W, .(X, .(Y, .(Z, .(W, .(Y, .(X, .(Z, .(W, .(Z, .(X, .(Y, []))))))))))))), unif_lines(.(X, L1s), .(Z, L2s))). 9.64/3.28 unif_lines(.(X3, []), .(X4, [])). 9.64/3.28 unif_pairs([]). 9.64/3.28 unif_pairs(.(A, .(B, Pairs))) :- ','(unif(A, B), unif_pairs(Pairs)). 9.64/3.28 unif(w(A), w(A)). 9.64/3.28 unif(black, black). 9.64/3.28 unif(black, w(X5)). 9.64/3.28 unif(w(X6), black). 9.64/3.28 9.64/3.28 9.64/3.28 Query: shapes(g,a) 9.64/3.28 ---------------------------------------- 9.64/3.28 9.64/3.28 (1) PrologToDTProblemTransformerProof (SOUND) 9.64/3.28 Built DT problem from termination graph DT10. 9.64/3.28 9.64/3.28 { 9.64/3.28 "root": 1, 9.64/3.28 "program": { 9.64/3.28 "directives": [], 9.64/3.28 "clauses": [ 9.64/3.28 [ 9.64/3.28 "(shapes Matrix N)", 9.64/3.28 "(',' (varmat Matrix MatrixWithVars) (unif_matrx MatrixWithVars))" 9.64/3.28 ], 9.64/3.28 [ 9.64/3.28 "(varmat ([]) ([]))", 9.64/3.28 null 9.64/3.28 ], 9.64/3.28 [ 9.64/3.28 "(varmat (. L Ls) (. VL VLs))", 9.64/3.28 "(',' (varmat L VL) (varmat Ls VLs))" 9.64/3.28 ], 9.64/3.28 [ 9.64/3.28 "(varmat (. (black) Xs) (. (black) VXs))", 9.64/3.28 "(varmat Xs VXs)" 9.64/3.28 ], 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