details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.94088101387 seconds
cpu usage	4.508826016
max memory	3.10636544E8

stage attributes

key	value
output-size	8457
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 rev(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, 3 ms] (4) PiDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) PiDP (7) UsableRulesProof [EQUIVALENT, 0 ms] (8) PiDP (9) PiDPToQDPProof [SOUND, 16 ms] (10) QDP (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Clauses: rev(LS, RES) :- r1(LS, [], RES). r1([], RES, RES). r1(.(X, Xs), Accm, RES) :- r1(Xs, .(X, Accm), RES). Query: rev(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: rev_in_2: (b,f) r1_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: rev_in_ga(LS, RES) -> U1_ga(LS, RES, r1_in_gga(LS, [], RES)) r1_in_gga([], RES, RES) -> r1_out_gga([], RES, RES) r1_in_gga(.(X, Xs), Accm, RES) -> U2_gga(X, Xs, Accm, RES, r1_in_gga(Xs, .(X, Accm), RES)) U2_gga(X, Xs, Accm, RES, r1_out_gga(Xs, .(X, Accm), RES)) -> r1_out_gga(.(X, Xs), Accm, RES) U1_ga(LS, RES, r1_out_gga(LS, [], RES)) -> rev_out_ga(LS, RES) The argument filtering Pi contains the following mapping: rev_in_ga(x1, x2) = rev_in_ga(x1) U1_ga(x1, x2, x3) = U1_ga(x3) r1_in_gga(x1, x2, x3) = r1_in_gga(x1, x2) [] = [] r1_out_gga(x1, x2, x3) = r1_out_gga(x3) .(x1, x2) = .(x1, x2) U2_gga(x1, x2, x3, x4, x5) = U2_gga(x5) rev_out_ga(x1, x2) = rev_out_ga(x2) Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog ---------------------------------------- (2) Obligation: Pi-finite rewrite system: The TRS R consists of the following rules: rev_in_ga(LS, RES) -> U1_ga(LS, RES, r1_in_gga(LS, [], RES)) r1_in_gga([], RES, RES) -> r1_out_gga([], RES, RES) r1_in_gga(.(X, Xs), Accm, RES) -> U2_gga(X, Xs, Accm, RES, r1_in_gga(Xs, .(X, Accm), RES)) U2_gga(X, Xs, Accm, RES, r1_out_gga(Xs, .(X, Accm), RES)) -> r1_out_gga(.(X, Xs), Accm, RES) popout

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

job log

popout

actions

all output return to Logic Programming