Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381920157
details
property
value
status
complete
benchmark
ex2-c.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n027.star.cs.uiowa.edu
space
AProVE_numeric
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.77798295021 seconds
cpu usage
4.194325293
max memory
2.7389952E8
stage attributes
key
value
output-size
18714
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 rec2(g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToIRSwTTransformerProof [SOUND, 24 ms] (2) TRUE ---------------------------------------- (0) Obligation: Clauses: rec1(I, Ret) :- ','(=<(I, 0), ','(!, is(Ret, 0))). rec1(I, Ret) :- ','(!, ','(is(I1, +(I, 1)), ','(rec1(I1, Ret1), ','(rec2(Ret1, Ret2), is(Ret, Ret2))))). rec2(J, Ret) :- ','(=<(J, 0), ','(!, is(Ret, 0))). rec2(J, Ret) :- ','(!, ','(is(I1, -(I, 1)), ','(rec2(I1, Ret1), ','(rec1(Ret1, Ret2), is(Ret, Ret2))))). Query: rec2(g,a) ---------------------------------------- (1) PrologToIRSwTTransformerProof (SOUND) Transformed Prolog program to IRSwT according to method in Master Thesis of A. Weinert { "root": 2, "program": { "directives": [], "clauses": [ [ "(rec1 I Ret)", "(',' (=< I (0)) (',' (!) (is Ret (0))))" ], [ "(rec1 I Ret)", "(',' (!) (',' (is I1 (+ I (1))) (',' (rec1 I1 Ret1) (',' (rec2 Ret1 Ret2) (is Ret Ret2)))))" ], [ "(rec2 J Ret)", "(',' (=< J (0)) (',' (!) (is Ret (0))))" ], [ "(rec2 J Ret)", "(',' (!) (',' (is I1 (- I (1))) (',' (rec2 I1 Ret1) (',' (rec1 Ret1 Ret2) (is Ret Ret2)))))" ] ] }, "graph": { "nodes": { "11": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "391": { "goal": [ { "clause": -1, "scope": -1, "term": "(',' (!_1) (is T10 (0)))" }, { "clause": 3, "scope": 1, "term": "(rec2 T8 T2)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [{ "lhs": { "name": "T8",
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030