Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381919901
details
property
value
status
complete
benchmark
rec-counter1-c.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n078.star.cs.uiowa.edu
space
AProVE_numeric
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.03855895996 seconds
cpu usage
4.853043238
max memory
2.95727104E8
stage attributes
key
value
output-size
29426
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 rec(g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToDTProblemTransformerProof [SOUND, 48 ms] (2) TRIPLES (3) TPisEmptyProof [EQUIVALENT, 0 ms] (4) YES ---------------------------------------- (0) Obligation: Clauses: rec(A, Ret) :- ','(=:=(A, 0), ','(!, is(Ret, 0))). rec(A, Ret) :- ','(is(A1, -(A, 1)), ','(rec(A1, Ret1), ','(countDown(Ret1, Ret2), is(Ret, +(1, Ret2))))). countDown(X, Ret) :- ','(>(X, 0), ','(!, ','(is(X1, -(X, 1)), ','(countDown(X1, Ret1), is(Ret, -(Ret1, 1)))))). countDown(X, X) :- ','(=<(X, 0), !). Query: rec(g,a) ---------------------------------------- (1) PrologToDTProblemTransformerProof (SOUND) Built DT problem from termination graph DT10. { "root": 1, "program": { "directives": [], "clauses": [ [ "(rec A Ret)", "(',' (=:= A (0)) (',' (!) (is Ret (0))))" ], [ "(rec A Ret)", "(',' (is A1 (- A (1))) (',' (rec A1 Ret1) (',' (countDown Ret1 Ret2) (is Ret (+ (1) Ret2)))))" ], [ "(countDown X Ret)", "(',' (> X (0)) (',' (!) (',' (is X1 (- X (1))) (',' (countDown X1 Ret1) (is Ret (- Ret1 (1)))))))" ], [ "(countDown X X)", "(',' (=< X (0)) (!))" ] ] }, "graph": { "nodes": { "2364": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [ { "lhs": { "name": "T5", "type": "PlainIntegerVariable" }, "type": "PlainIntegerRelation", "rhs": { "type": "PlainIntegerConstant", "value": "0" }, "operation": "=" }, { "lhs": { "name": "T8", "type": "PlainIntegerVariable" }, "type": "PlainIntegerRelation", "rhs": { "type": "PlainIntegerConstant", "value": "0" }, "operation": "=" } ]
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030