Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381919995
details
property
value
status
complete
benchmark
rev.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n039.star.cs.uiowa.edu
space
Stroeder_09
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.22012686729 seconds
cpu usage
5.47937007
max memory
4.05385216E8
stage attributes
key
value
output-size
159221
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 rev(g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToDTProblemTransformerProof [SOUND, 101 ms] (2) TRIPLES (3) TriplesToPiDPProof [SOUND, 3 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: rev(L, R) :- rev(L, [], R). rev([], Y, Z) :- ','(!, eq(Y, Z)). rev(L, S, R) :- ','(head(L, X), ','(tail(L, T), rev(T, .(X, S), R))). head([], X1). head(.(X, X2), X). tail([], []). tail(.(X3, Xs), Xs). eq(X, X). Query: rev(g,a) ---------------------------------------- (1) PrologToDTProblemTransformerProof (SOUND) Built DT problem from termination graph DT10. { "root": 16, "program": { "directives": [], "clauses": [ [ "(rev L R)", "(rev L ([]) R)" ], [ "(rev ([]) Y Z)", "(',' (!) (eq Y Z))" ], [ "(rev L S R)", "(',' (head L X) (',' (tail L T) (rev T (. X S) R)))" ], [ "(head ([]) X1)", null ], [ "(head (. X X2) X)", null ], [ "(tail ([]) ([]))", null ], [ "(tail (. X3 Xs) Xs)", null ], [ "(eq X X)", null ] ] }, "graph": { "nodes": { "type": "Nodes", "110": { "goal": [{ "clause": -1, "scope": -1, "term": "(true)" }],
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030