Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381919831
details
property
value
status
complete
benchmark
fib.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
prolog_mixed
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.91953492165 seconds
cpu usage
4.734073971
max memory
3.70556928E8
stage attributes
key
value
output-size
199980
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 fib1(g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToIRSwTTransformerProof [SOUND, 26 ms] (2) TRUE ---------------------------------------- (0) Obligation: Clauses: fib1(N, F) :- forwardfib(2, N, 1, 1, F). forwardfib(M, N, F1, F2, F2) :- >=(M, N). forwardfib(M, N, F1, F2, F) :- ','(<(M, N), ','(is(NextM, +(M, 1)), ','(is(NextF2, +(F1, F2)), forwardfib(NextM, N, F2, NextF2, F)))). fib2(1, 1) :- !. fib2(2, 1) :- !. fib2(N, F) :- ','(>(N, 2), ','(is(N1, -(N, 1)), ','(fib2(N1, F1), ','(is(N2, -(N, 2)), ','(fib2(N2, F2), is(F, +(F1, F2))))))). Query: fib1(g,a) ---------------------------------------- (1) PrologToIRSwTTransformerProof (SOUND) Transformed Prolog program to IRSwT according to method in Master Thesis of A. Weinert { "root": 1, "program": { "directives": [], "clauses": [ [ "(fib1 N F)", "(forwardfib (2) N (1) (1) F)" ], [ "(forwardfib M N F1 F2 F2)", "(>= M N)" ], [ "(forwardfib M N F1 F2 F)", "(',' (< M N) (',' (is NextM (+ M (1))) (',' (is NextF2 (+ F1 F2)) (forwardfib NextM N F2 NextF2 F))))" ], [ "(fib2 (1) (1))", "(!)" ], [ "(fib2 (2) (1))", "(!)" ], [ "(fib2 N F)", "(',' (> N (2)) (',' (is N1 (- N (1))) (',' (fib2 N1 F1) (',' (is N2 (- N (2))) (',' (fib2 N2 F2) (is F (+ F1 F2)))))))" ] ] }, "graph": { "nodes": { "22": { "goal": [ { "clause": 1, "scope": 2, "term": "(forwardfib (2) T9 (1) (1) T11)" }, { "clause": 2, "scope": 2, "term": "(forwardfib (2) T9 (1) (1) T11)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T9"], "free": [], "exprvars": [] } },
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030