details

property	value
status	complete
benchmark	euler-02.pl
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n026.star.cs.uiowa.edu
space	Euler_queensu-cs260

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.21378397942 seconds
cpu usage	5.854370749
max memory	7.1979008E8

stage attributes

key	value
output-size	191210
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 euler2(g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToDTProblemTransformerProof [SOUND, 80 ms] (2) TRIPLES (3) TPisEmptyProof [EQUIVALENT, 0 ms] (4) YES ---------------------------------------- (0) Obligation: Clauses: euler2(Bound, Result) :- sumEvenFib(0, 1, Bound, Result). sumEvenFib(Fib1, Fib2, Bound, Result) :- ','(nextFib(Fib1, Fib2, NextFib), ','(>(NextFib, Bound), is(Result, 0))). sumEvenFib(Fib1, Fib2, Bound, Result) :- ','(nextFib(Fib1, Fib2, NextFib), ','(=<(NextFib, Bound), ','(=:=(mod(NextFib, 2), 0), ','(sumEvenFib(Fib2, NextFib, Bound, RecursiveResult), is(Result, +(RecursiveResult, NextFib)))))). sumEvenFib(Fib1, Fib2, Bound, Result) :- ','(nextFib(Fib1, Fib2, NextFib), ','(=<(NextFib, Bound), ','(=\=(mod(NextFib, 2), 0), sumEvenFib(Fib2, NextFib, Bound, Result)))). nextFib(Fib1, Fib2, NextFib) :- is(NextFib, +(Fib1, Fib2)). Query: euler2(g,a) ---------------------------------------- (1) PrologToDTProblemTransformerProof (SOUND) Built DT problem from termination graph DT10. { "root": 1, "program": { "directives": [], "clauses": [ [ "(euler2 Bound Result)", "(sumEvenFib (0) (1) Bound Result)" ], [ "(sumEvenFib Fib1 Fib2 Bound Result)", "(',' (nextFib Fib1 Fib2 NextFib) (',' (> NextFib Bound) (is Result (0))))" ], [ "(sumEvenFib Fib1 Fib2 Bound Result)", "(',' (nextFib Fib1 Fib2 NextFib) (',' (=< NextFib Bound) (',' (=:= (mod NextFib (2)) (0)) (',' (sumEvenFib Fib2 NextFib Bound RecursiveResult) (is Result (+ RecursiveResult NextFib))))))" ], [ "(sumEvenFib Fib1 Fib2 Bound Result)", "(',' (nextFib Fib1 Fib2 NextFib) (',' (=< NextFib Bound) (',' (=\\= (mod NextFib (2)) (0)) (sumEvenFib Fib2 NextFib Bound Result))))" ], [ "(nextFib Fib1 Fib2 NextFib)", "(is NextFib (+ Fib1 Fib2))" ] ] }, "graph": { "nodes": { "3244": { "goal": [{ "clause": -1, "scope": -1, "term": "(',' (is X103 (+ (0) (1))) (',' (=< X103 T42) (',' (=\\= (mod X103 (2)) (0)) (sumEvenFib (1) X103 T42 T44))))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T42"], "free": ["X103"], "exprvars": [] } }, "3164": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [ { "lhs": { popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Logic Progr 19030