details

property	value
status	complete
benchmark	reverse-iio.pl
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n053.star.cs.uiowa.edu
space	talp_dds

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.77592301369 seconds
cpu usage	4.180312939
max memory	2.76529152E8

stage attributes

key	value
output-size	6904
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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Left Termination of the query pattern reverse(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: reverse([], X, X). reverse(.(X, Y), Z, U) :- reverse(Y, Z, .(X, U)). Query: reverse(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: reverse_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: reverse_in_gga([], X, X) -> reverse_out_gga([], X, X) reverse_in_gga(.(X, Y), Z, U) -> U1_gga(X, Y, Z, U, reverse_in_gga(Y, Z, .(X, U))) U1_gga(X, Y, Z, U, reverse_out_gga(Y, Z, .(X, U))) -> reverse_out_gga(.(X, Y), Z, U) The argument filtering Pi contains the following mapping: reverse_in_gga(x1, x2, x3) = reverse_in_gga(x1, x2) [] = [] reverse_out_gga(x1, x2, x3) = reverse_out_gga(x3) .(x1, x2) = .(x1, x2) U1_gga(x1, x2, x3, x4, x5) = U1_gga(x5) Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog ---------------------------------------- (2) Obligation: Pi-finite rewrite system: The TRS R consists of the following rules: reverse_in_gga([], X, X) -> reverse_out_gga([], X, X) reverse_in_gga(.(X, Y), Z, U) -> U1_gga(X, Y, Z, U, reverse_in_gga(Y, Z, .(X, U))) U1_gga(X, Y, Z, U, reverse_out_gga(Y, Z, .(X, U))) -> reverse_out_gga(.(X, Y), Z, U) The argument filtering Pi contains the following mapping: reverse_in_gga(x1, x2, x3) = reverse_in_gga(x1, x2) [] = [] reverse_out_gga(x1, x2, x3) = reverse_out_gga(x3) .(x1, x2) = .(x1, x2) U1_gga(x1, x2, x3, x4, x5) = U1_gga(x5) popout

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

job log

popout

actions

all output return to Logic Programming