Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381919767
details
property
value
status
complete
benchmark
len2.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n036.star.cs.uiowa.edu
space
Stroeder_09
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.66978383064 seconds
cpu usage
3.788411288
max memory
2.47717888E8
stage attributes
key
value
output-size
37303
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.pl /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.pl # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Left Termination of the query pattern len(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, 0 ms] (4) PiDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) PiDP (7) PiDPToQDPProof [SOUND, 0 ms] (8) QDP (9) QDPSizeChangeProof [EQUIVALENT, 0 ms] (10) YES ---------------------------------------- (0) Obligation: Clauses: len([], 0). len(Xs, s(N)) :- ','(no(empty(Xs)), ','(tail(Xs, Ys), len(Ys, N))). tail([], []). tail(.(X, Xs), Xs). empty([]). no(X) :- ','(X, ','(!, failure(a))). no(X1). failure(b). Query: len(g,a) ---------------------------------------- (1) PrologToDTProblemTransformerProof (SOUND) Built DT problem from termination graph DT10. { "root": 1, "program": { "directives": [], "clauses": [ [ "(len ([]) (0))", null ], [ "(len Xs (s N))", "(',' (no (empty Xs)) (',' (tail Xs Ys) (len Ys N)))" ], [ "(tail ([]) ([]))", null ], [ "(tail (. X Xs) Xs)", null ], [ "(empty ([]))", null ], [ "(no X)", "(',' X (',' (!) (failure (a))))" ], [ "(no X1)", null ], [ "(failure (b))", null ] ] }, "graph": { "nodes": { "24": { "goal": [{ "clause": -1, "scope": -1, "term": "(',' (no (empty ([]))) (',' (tail ([]) X6) (len X6 T5)))" }], "kb": {
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030