details

property	value
status	complete
benchmark	program-8-6-b.pl
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n071.star.cs.uiowa.edu
space	Art-of-prolog

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.8370039463 seconds
cpu usage	4.247456074
max memory	2.17399296E8

stage attributes

key	value
output-size	16503
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 sumlist(g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) UndefinedPredicateHandlerProof [SOUND, 0 ms] (2) Prolog (3) PrologToPiTRSProof [SOUND, 0 ms] (4) PiTRS (5) DependencyPairsProof [EQUIVALENT, 11 ms] (6) PiDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) PiDP (9) UsableRulesProof [EQUIVALENT, 0 ms] (10) PiDP (11) PiDPToQDPProof [SOUND, 4 ms] (12) QDP (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] (14) YES ---------------------------------------- (0) Obligation: Clauses: sumlist(Is, Sum) :- sumlist(Is, 0, Sum). sumlist(.(I, Is), Temp, Sum) :- ','(is(Temp1, +(Temp, I)), sumlist(Is, Temp1, Sum)). sumlist([], Sum, Sum). Query: sumlist(g,a) ---------------------------------------- (1) UndefinedPredicateHandlerProof (SOUND) Added facts for all undefined predicates [PROLOG]. ---------------------------------------- (2) Obligation: Clauses: sumlist(Is, Sum) :- sumlist(Is, 0, Sum). sumlist(.(I, Is), Temp, Sum) :- ','(is(Temp1, +(Temp, I)), sumlist(Is, Temp1, Sum)). sumlist([], Sum, Sum). is(X0, X1). Query: sumlist(g,a) ---------------------------------------- (3) PrologToPiTRSProof (SOUND) We use the technique of [TOCL09]. With regard to the inferred argument filtering the predicates were used in the following modes: sumlist_in_2: (b,f) sumlist_in_3: (b,b,f) (b,f,f) Transforming Prolog into the following Term Rewriting System: Pi-finite rewrite system: The TRS R consists of the following rules: sumlist_in_ga(Is, Sum) -> U1_ga(Is, Sum, sumlist_in_gga(Is, 0, Sum)) sumlist_in_gga(.(I, Is), Temp, Sum) -> U2_gga(I, Is, Temp, Sum, is_in_ag(Temp1, +(Temp, I))) is_in_ag(X0, X1) -> is_out_ag(X0, X1) U2_gga(I, Is, Temp, Sum, is_out_ag(Temp1, +(Temp, I))) -> U3_gga(I, Is, Temp, Sum, sumlist_in_gaa(Is, Temp1, Sum)) sumlist_in_gaa(.(I, Is), Temp, Sum) -> U2_gaa(I, Is, Temp, Sum, is_in_ag(Temp1, +(Temp, I))) U2_gaa(I, Is, Temp, Sum, is_out_ag(Temp1, +(Temp, I))) -> U3_gaa(I, Is, Temp, Sum, sumlist_in_gaa(Is, Temp1, Sum)) sumlist_in_gaa([], Sum, Sum) -> sumlist_out_gaa([], Sum, Sum) U3_gaa(I, Is, Temp, Sum, sumlist_out_gaa(Is, Temp1, Sum)) -> sumlist_out_gaa(.(I, Is), Temp, Sum) U3_gga(I, Is, Temp, Sum, sumlist_out_gaa(Is, Temp1, Sum)) -> sumlist_out_gga(.(I, Is), Temp, Sum) sumlist_in_gga([], Sum, Sum) -> sumlist_out_gga([], Sum, Sum) U1_ga(Is, Sum, sumlist_out_gga(Is, 0, Sum)) -> sumlist_out_ga(Is, Sum) The argument filtering Pi contains the following mapping: sumlist_in_ga(x1, x2) = sumlist_in_ga(x1) U1_ga(x1, x2, x3) = U1_ga(x1, x3) sumlist_in_gga(x1, x2, x3) = sumlist_in_gga(x1, x2) .(x1, x2) = .(x1, x2) U2_gga(x1, x2, x3, x4, x5) = U2_gga(x1, x2, x3, x5) popout

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

job log

popout

actions

all output return to Logic Progr 19030