details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.79212594032 seconds
cpu usage	4.214207169
max memory	3.27532544E8

stage attributes

key	value
output-size	10348
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 inner_product(g,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, 0 ms] (6) PiDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) PiDP (9) UsableRulesProof [EQUIVALENT, 0 ms] (10) PiDP (11) PiDPToQDPProof [SOUND, 9 ms] (12) QDP (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] (14) YES ---------------------------------------- (0) Obligation: Clauses: inner_product(.(X, Xs), .(Y, Ys), IP) :- ','(inner_product(Xs, Ys, IP1), is(IP, +(*(X, Y), IP1))). inner_product([], [], 0). Query: inner_product(g,g,a) ---------------------------------------- (1) UndefinedPredicateHandlerProof (SOUND) Added facts for all undefined predicates [PROLOG]. ---------------------------------------- (2) Obligation: Clauses: inner_product(.(X, Xs), .(Y, Ys), IP) :- ','(inner_product(Xs, Ys, IP1), is(IP, +(*(X, Y), IP1))). inner_product([], [], 0). is(X0, X1). Query: inner_product(g,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: inner_product_in_3: (b,b,f) Transforming Prolog into the following Term Rewriting System: Pi-finite rewrite system: The TRS R consists of the following rules: inner_product_in_gga(.(X, Xs), .(Y, Ys), IP) -> U1_gga(X, Xs, Y, Ys, IP, inner_product_in_gga(Xs, Ys, IP1)) inner_product_in_gga([], [], 0) -> inner_product_out_gga([], [], 0) U1_gga(X, Xs, Y, Ys, IP, inner_product_out_gga(Xs, Ys, IP1)) -> U2_gga(X, Xs, Y, Ys, IP, is_in_ag(IP, +(*(X, Y), IP1))) is_in_ag(X0, X1) -> is_out_ag(X0, X1) U2_gga(X, Xs, Y, Ys, IP, is_out_ag(IP, +(*(X, Y), IP1))) -> inner_product_out_gga(.(X, Xs), .(Y, Ys), IP) The argument filtering Pi contains the following mapping: inner_product_in_gga(x1, x2, x3) = inner_product_in_gga(x1, x2) .(x1, x2) = .(x1, x2) U1_gga(x1, x2, x3, x4, x5, x6) = U1_gga(x1, x3, x6) [] = [] inner_product_out_gga(x1, x2, x3) = inner_product_out_gga U2_gga(x1, x2, x3, x4, x5, x6) = U2_gga(x6) is_in_ag(x1, x2) = is_in_ag(x2) is_out_ag(x1, x2) = is_out_ag +(x1, x2) = +(x1) *(x1, x2) = *(x1, x2) popout

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

job log

popout

actions

all output return to Logic Progr 19030