Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381919851
details
property
value
status
complete
benchmark
p1_28_a.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n073.star.cs.uiowa.edu
space
Hett
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.9992389679 seconds
cpu usage
4.774305579
max memory
2.83676672E8
stage attributes
key
value
output-size
25175
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.pl /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.pl # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Left Termination of the query pattern lsort(g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToDTProblemTransformerProof [SOUND, 0 ms] (2) TRIPLES (3) TriplesToPiDPProof [SOUND, 17 ms] (4) PiDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) PiDP (7) PiDPToQDPProof [SOUND, 7 ms] (8) QDP (9) QDPSizeChangeProof [EQUIVALENT, 0 ms] (10) YES ---------------------------------------- (0) Obligation: Clauses: lsort(InList, OutList) :- lsort(InList, OutList, asc). lsort(InList, OutList, Dir) :- ','(add_key(InList, KList, Dir), ','(keysort(KList, SKList), rem_key(SKList, OutList))). add_key([], [], X1). add_key(.(X, Xs), .(-(L, p(X)), Ys), asc) :- ','(!, ','(length(X, L), add_key(Xs, Ys, asc))). add_key(.(X, Xs), .(-(L, p(X)), Ys), desc) :- ','(length(X, L1), ','(is(L, -(L1)), add_key(Xs, Ys, desc))). rem_key([], []). rem_key(.(-(X2, p(X)), Xs), .(X, Ys)) :- rem_key(Xs, Ys). length(X3, X4). Query: lsort(g,a) ---------------------------------------- (1) PrologToDTProblemTransformerProof (SOUND) Built DT problem from termination graph DT10. { "root": 3, "program": { "directives": [], "clauses": [ [ "(lsort InList OutList)", "(lsort InList OutList (asc))" ], [ "(lsort InList OutList Dir)", "(',' (add_key InList KList Dir) (',' (keysort KList SKList) (rem_key SKList OutList)))" ], [ "(add_key ([]) ([]) X1)", null ], [ "(add_key (. X Xs) (. (- L (p X)) Ys) (asc))", "(',' (!) (',' (length X L) (add_key Xs Ys (asc))))" ], [ "(add_key (. X Xs) (. (- L (p X)) Ys) (desc))", "(',' (length X L1) (',' (is L (- L1)) (add_key Xs Ys (desc))))" ], [ "(rem_key ([]) ([]))", null ], [ "(rem_key (. (- X2 (p X)) Xs) (. X Ys))", "(rem_key Xs Ys)" ], [ "(length X3 X4)", null ] ] }, "graph": { "nodes": { "11": { "goal": [{ "clause": -1, "scope": -1, "term": "(',' (add_key T13 X22 (asc)) (',' (keysort X22 X23) (rem_key X23 T15)))" }], "kb": {
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030