details

property	value
status	complete
benchmark	exercise_min.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	Art-of-prolog

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.7476079464 seconds
cpu usage	4.028160991
max memory	3.02526464E8

stage attributes

key	value
output-size	16449
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 min(g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) CutEliminatorProof [SOUND, 0 ms] (2) Prolog (3) UndefinedPredicateHandlerProof [SOUND, 0 ms] (4) Prolog (5) PrologToPiTRSProof [SOUND, 13 ms] (6) PiTRS (7) DependencyPairsProof [EQUIVALENT, 0 ms] (8) PiDP (9) DependencyGraphProof [EQUIVALENT, 0 ms] (10) PiDP (11) UsableRulesProof [EQUIVALENT, 0 ms] (12) PiDP (13) PiDPToQDPProof [SOUND, 17 ms] (14) QDP (15) QDPSizeChangeProof [EQUIVALENT, 0 ms] (16) YES ---------------------------------------- (0) Obligation: Clauses: min(.(I, Is), M) :- min(Is, I, M). min([], Min, Min). min(.(I, Is), Temp, Min) :- ','(min_1(I, Temp, Temp1), min(Is, Temp1, Min)). min_1(I, J, I) :- ','(>=(J, I), !). min_1(I, J, J) :- <(J, I). Query: min(g,a) ---------------------------------------- (1) CutEliminatorProof (SOUND) Eliminated all cuts by simply ignoring them[PROLOG]. ---------------------------------------- (2) Obligation: Clauses: min(.(I, Is), M) :- min(Is, I, M). min([], Min, Min). min(.(I, Is), Temp, Min) :- ','(min_1(I, Temp, Temp1), min(Is, Temp1, Min)). min_1(I, J, I) :- >=(J, I). min_1(I, J, J) :- <(J, I). Query: min(g,a) ---------------------------------------- (3) UndefinedPredicateHandlerProof (SOUND) Added facts for all undefined predicates [PROLOG]. ---------------------------------------- (4) Obligation: Clauses: min(.(I, Is), M) :- min(Is, I, M). min([], Min, Min). min(.(I, Is), Temp, Min) :- ','(min_1(I, Temp, Temp1), min(Is, Temp1, Min)). min_1(I, J, I) :- >=(J, I). min_1(I, J, J) :- <(J, I). >=(X0, X1). <(X0, X1). Query: min(g,a) ---------------------------------------- (5) PrologToPiTRSProof (SOUND) We use the technique of [TOCL09]. With regard to the inferred argument filtering the predicates were used in the following modes: min_in_2: (b,f) min_in_3: (b,b,f) min_1_in_3: (b,b,f) Transforming Prolog into the following Term Rewriting System: popout

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

job log

popout

actions

all output return to Logic Progr 19030