details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.94371294975 seconds
cpu usage	4.571809557
max memory	2.51404288E8

stage attributes

key	value
output-size	19640
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 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, 2 ms] (6) PiDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) PiDP (9) UsableRulesProof [EQUIVALENT, 0 ms] (10) PiDP (11) PiDPToQDPProof [SOUND, 0 ms] (12) QDP (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] (14) YES ---------------------------------------- (0) Obligation: Clauses: inner_product(Xs, Ys, IP) :- inner_product(Xs, Ys, 0, IP). inner_product(.(X, Xs), .(Y, Ys), Temp, IP) :- ','(is(Temp1, +(*(X, Y), Temp)), inner_product(Xs, Ys, Temp1, IP)). inner_product([], [], IP, IP). Query: inner_product(g,g,a) ---------------------------------------- (1) UndefinedPredicateHandlerProof (SOUND) Added facts for all undefined predicates [PROLOG]. ---------------------------------------- (2) Obligation: Clauses: inner_product(Xs, Ys, IP) :- inner_product(Xs, Ys, 0, IP). inner_product(.(X, Xs), .(Y, Ys), Temp, IP) :- ','(is(Temp1, +(*(X, Y), Temp)), inner_product(Xs, Ys, Temp1, IP)). inner_product([], [], IP, IP). 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) inner_product_in_4: (b,b,b,f) (b,b,f,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(Xs, Ys, IP) -> U1_gga(Xs, Ys, IP, inner_product_in_ggga(Xs, Ys, 0, IP)) inner_product_in_ggga(.(X, Xs), .(Y, Ys), Temp, IP) -> U2_ggga(X, Xs, Y, Ys, Temp, IP, is_in_ag(Temp1, +(*(X, Y), Temp))) is_in_ag(X0, X1) -> is_out_ag(X0, X1) U2_ggga(X, Xs, Y, Ys, Temp, IP, is_out_ag(Temp1, +(*(X, Y), Temp))) -> U3_ggga(X, Xs, Y, Ys, Temp, IP, inner_product_in_ggaa(Xs, Ys, Temp1, IP)) inner_product_in_ggaa(.(X, Xs), .(Y, Ys), Temp, IP) -> U2_ggaa(X, Xs, Y, Ys, Temp, IP, is_in_ag(Temp1, +(*(X, Y), Temp))) U2_ggaa(X, Xs, Y, Ys, Temp, IP, is_out_ag(Temp1, +(*(X, Y), Temp))) -> U3_ggaa(X, Xs, Y, Ys, Temp, IP, inner_product_in_ggaa(Xs, Ys, Temp1, IP)) inner_product_in_ggaa([], [], IP, IP) -> inner_product_out_ggaa([], [], IP, IP) U3_ggaa(X, Xs, Y, Ys, Temp, IP, inner_product_out_ggaa(Xs, Ys, Temp1, IP)) -> inner_product_out_ggaa(.(X, Xs), .(Y, Ys), Temp, IP) U3_ggga(X, Xs, Y, Ys, Temp, IP, inner_product_out_ggaa(Xs, Ys, Temp1, IP)) -> inner_product_out_ggga(.(X, Xs), .(Y, Ys), Temp, IP) inner_product_in_ggga([], [], IP, IP) -> inner_product_out_ggga([], [], IP, IP) U1_gga(Xs, Ys, IP, inner_product_out_ggga(Xs, Ys, 0, IP)) -> inner_product_out_gga(Xs, Ys, IP) The argument filtering Pi contains the following mapping: inner_product_in_gga(x1, x2, x3) = inner_product_in_gga(x1, x2) U1_gga(x1, x2, x3, x4) = U1_gga(x4) inner_product_in_ggga(x1, x2, x3, x4) = inner_product_in_ggga(x1, x2, x3) .(x1, x2) = .(x1, x2) U2_ggga(x1, x2, x3, x4, x5, x6, x7) = U2_ggga(x2, x4, x7) popout

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

job log

popout

actions

all output return to Logic Progr 19030