Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic_Programming 2019-04-02 08.22 pair #434324883
details
property
value
status
complete
benchmark
flatlength-bff.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n149.star.cs.uiowa.edu
space
BCGGV05
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.73121 seconds
cpu usage
3.93261
user time
3.73309
system time
0.199519
max virtual memory
1.88115E7
max residence set size
278412.0
stage attributes
key
value
starexec-result
YES
output
3.69/1.69 YES 3.84/1.71 proof of /export/starexec/sandbox/benchmark/theBenchmark.pl 3.84/1.71 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 3.84/1.71 3.84/1.71 3.84/1.71 Left Termination of the query pattern 3.84/1.71 3.84/1.71 fl(g,a,a) 3.84/1.71 3.84/1.71 w.r.t. the given Prolog program could successfully be proven: 3.84/1.71 3.84/1.71 (0) Prolog 3.84/1.71 (1) PrologToDTProblemTransformerProof [SOUND, 0 ms] 3.84/1.71 (2) TRIPLES 3.84/1.71 (3) TriplesToPiDPProof [SOUND, 0 ms] 3.84/1.71 (4) PiDP 3.84/1.71 (5) DependencyGraphProof [EQUIVALENT, 0 ms] 3.84/1.71 (6) PiDP 3.84/1.71 (7) PiDPToQDPProof [SOUND, 0 ms] 3.84/1.71 (8) QDP 3.84/1.71 (9) QDPSizeChangeProof [EQUIVALENT, 0 ms] 3.84/1.71 (10) YES 3.84/1.71 3.84/1.71 3.84/1.71 ---------------------------------------- 3.84/1.71 3.84/1.71 (0) 3.84/1.71 Obligation: 3.84/1.71 Clauses: 3.84/1.71 3.84/1.71 fl([], [], 0). 3.84/1.71 fl(.(E, X), R, s(Z)) :- ','(append(E, Y, R), fl(X, Y, Z)). 3.84/1.71 append([], X, X). 3.84/1.71 append(.(X, Xs), Ys, .(X, Zs)) :- append(Xs, Ys, Zs). 3.84/1.71 3.84/1.71 3.84/1.71 Query: fl(g,a,a) 3.84/1.71 ---------------------------------------- 3.84/1.71 3.84/1.71 (1) PrologToDTProblemTransformerProof (SOUND) 3.84/1.71 Built DT problem from termination graph DT10. 3.84/1.71 3.84/1.71 { 3.84/1.71 "root": 17, 3.84/1.71 "program": { 3.84/1.71 "directives": [], 3.84/1.71 "clauses": [ 3.84/1.71 [ 3.84/1.71 "(fl ([]) ([]) (0))", 3.84/1.71 null 3.84/1.71 ], 3.84/1.71 [ 3.84/1.71 "(fl (. E X) R (s Z))", 3.84/1.71 "(',' (append E Y R) (fl X Y Z))" 3.84/1.71 ], 3.84/1.71 [ 3.84/1.71 "(append ([]) X X)", 3.84/1.71 null 3.84/1.71 ], 3.84/1.71 [ 3.84/1.71 "(append (. X Xs) Ys (. X Zs))", 3.84/1.71 "(append Xs Ys Zs)" 3.84/1.71 ] 3.84/1.71 ] 3.84/1.71 }, 3.84/1.71 "graph": { 3.84/1.71 "nodes": { 3.84/1.71 "17": { 3.84/1.71 "goal": [{ 3.84/1.71 "clause": -1, 3.84/1.71 "scope": -1, 3.84/1.71 "term": "(fl T1 T2 T3)" 3.84/1.71 }], 3.84/1.71 "kb": { 3.84/1.71 "nonunifying": [], 3.84/1.71 "intvars": {}, 3.84/1.71 "arithmetic": { 3.84/1.71 "type": "PlainIntegerRelationState", 3.84/1.71 "relations": [] 3.84/1.71 }, 3.84/1.71 "ground": ["T1"], 3.84/1.71 "free": [], 3.84/1.71 "exprvars": [] 3.84/1.71 } 3.84/1.71 }, 3.84/1.71 "18": { 3.84/1.71 "goal": [ 3.84/1.71 { 3.84/1.71 "clause": 0, 3.84/1.71 "scope": 1, 3.84/1.71 "term": "(fl T1 T2 T3)" 3.84/1.71 }, 3.84/1.71 { 3.84/1.71 "clause": 1, 3.84/1.71 "scope": 1, 3.84/1.71 "term": "(fl T1 T2 T3)" 3.84/1.71 } 3.84/1.71 ], 3.84/1.71 "kb": { 3.84/1.71 "nonunifying": [],
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