details

property	value
status	complete
benchmark	NJ4.pl
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n138.star.cs.uiowa.edu
space	terminweb_new

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.80211687088 seconds
cpu usage	3.861666865
max memory	2.78523904E8

stage attributes

key	value
output-size	8558
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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Left Termination of the query pattern p(g,g,g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToPiTRSProof [SOUND, 0 ms] (2) PiTRS (3) DependencyPairsProof [EQUIVALENT, 0 ms] (4) PiDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) PiDP (7) UsableRulesProof [EQUIVALENT, 0 ms] (8) PiDP (9) PiDPToQDPProof [SOUND, 0 ms] (10) QDP (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Clauses: p(M, N, s(R), RES) :- p(M, R, N, RES). p(M, s(N), R, RES) :- p(R, N, M, RES). p(M, X1, X2, M). Query: p(g,g,g,a) ---------------------------------------- (1) PrologToPiTRSProof (SOUND) We use the technique of [TOCL09]. With regard to the inferred argument filtering the predicates were used in the following modes: p_in_4: (b,b,b,f) Transforming Prolog into the following Term Rewriting System: Pi-finite rewrite system: The TRS R consists of the following rules: p_in_ggga(M, N, s(R), RES) -> U1_ggga(M, N, R, RES, p_in_ggga(M, R, N, RES)) p_in_ggga(M, s(N), R, RES) -> U2_ggga(M, N, R, RES, p_in_ggga(R, N, M, RES)) p_in_ggga(M, X1, X2, M) -> p_out_ggga(M, X1, X2, M) U2_ggga(M, N, R, RES, p_out_ggga(R, N, M, RES)) -> p_out_ggga(M, s(N), R, RES) U1_ggga(M, N, R, RES, p_out_ggga(M, R, N, RES)) -> p_out_ggga(M, N, s(R), RES) The argument filtering Pi contains the following mapping: p_in_ggga(x1, x2, x3, x4) = p_in_ggga(x1, x2, x3) s(x1) = s(x1) U1_ggga(x1, x2, x3, x4, x5) = U1_ggga(x1, x2, x3, x5) U2_ggga(x1, x2, x3, x4, x5) = U2_ggga(x1, x2, x3, x5) p_out_ggga(x1, x2, x3, x4) = p_out_ggga(x1, x2, x3, x4) Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog ---------------------------------------- (2) Obligation: Pi-finite rewrite system: The TRS R consists of the following rules: p_in_ggga(M, N, s(R), RES) -> U1_ggga(M, N, R, RES, p_in_ggga(M, R, N, RES)) p_in_ggga(M, s(N), R, RES) -> U2_ggga(M, N, R, RES, p_in_ggga(R, N, M, RES)) p_in_ggga(M, X1, X2, M) -> p_out_ggga(M, X1, X2, M) U2_ggga(M, N, R, RES, p_out_ggga(R, N, M, RES)) -> p_out_ggga(M, s(N), R, RES) U1_ggga(M, N, R, RES, p_out_ggga(M, R, N, RES)) -> p_out_ggga(M, N, s(R), RES) The argument filtering Pi contains the following mapping: p_in_ggga(x1, x2, x3, x4) = p_in_ggga(x1, x2, x3) s(x1) = s(x1) U1_ggga(x1, x2, x3, x4, x5) = U1_ggga(x1, x2, x3, x5) popout

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

job log

popout

actions

all output return to Logic Programming