details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.78055405617 seconds
cpu usage	3.93720907
max memory	2.62529024E8

stage attributes

key	value
output-size	6310
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 sum(a,a,g) 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, 7 ms] (10) QDP (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Clauses: sum(X, s(Y), s(Z)) :- sum(X, Y, Z). sum(X, 0, X). Query: sum(a,a,g) ---------------------------------------- (1) PrologToPiTRSProof (SOUND) We use the technique of [TOCL09]. With regard to the inferred argument filtering the predicates were used in the following modes: sum_in_3: (f,f,b) Transforming Prolog into the following Term Rewriting System: Pi-finite rewrite system: The TRS R consists of the following rules: sum_in_aag(X, s(Y), s(Z)) -> U1_aag(X, Y, Z, sum_in_aag(X, Y, Z)) sum_in_aag(X, 0, X) -> sum_out_aag(X, 0, X) U1_aag(X, Y, Z, sum_out_aag(X, Y, Z)) -> sum_out_aag(X, s(Y), s(Z)) The argument filtering Pi contains the following mapping: sum_in_aag(x1, x2, x3) = sum_in_aag(x3) s(x1) = s(x1) U1_aag(x1, x2, x3, x4) = U1_aag(x3, x4) sum_out_aag(x1, x2, x3) = sum_out_aag(x1, x2, x3) Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog ---------------------------------------- (2) Obligation: Pi-finite rewrite system: The TRS R consists of the following rules: sum_in_aag(X, s(Y), s(Z)) -> U1_aag(X, Y, Z, sum_in_aag(X, Y, Z)) sum_in_aag(X, 0, X) -> sum_out_aag(X, 0, X) U1_aag(X, Y, Z, sum_out_aag(X, Y, Z)) -> sum_out_aag(X, s(Y), s(Z)) The argument filtering Pi contains the following mapping: sum_in_aag(x1, x2, x3) = sum_in_aag(x3) s(x1) = s(x1) U1_aag(x1, x2, x3, x4) = U1_aag(x3, x4) sum_out_aag(x1, x2, x3) = sum_out_aag(x1, x2, x3) ---------------------------------------- popout

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

job log

popout

actions

all output return to Logic Programming