details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.8269469738 seconds
cpu usage	4.137967006
max memory	2.096128E8

stage attributes

key	value
output-size	9625
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 p(g) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) CutEliminatorProof [SOUND, 0 ms] (2) Prolog (3) PrologToPiTRSProof [SOUND, 0 ms] (4) PiTRS (5) DependencyPairsProof [EQUIVALENT, 7 ms] (6) PiDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) PiDP (9) UsableRulesProof [EQUIVALENT, 0 ms] (10) PiDP (11) PiDPToQDPProof [EQUIVALENT, 0 ms] (12) QDP (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] (14) YES ---------------------------------------- (0) Obligation: Clauses: p(0). p(s(X)) :- ','(q(X), ','(!, r)). p(X) :- r. q(0). q(s(X)) :- ','(p(X), ','(!, r)). q(X) :- r. r. Query: p(g) ---------------------------------------- (1) CutEliminatorProof (SOUND) Eliminated all cuts by simply ignoring them[PROLOG]. ---------------------------------------- (2) Obligation: Clauses: p(0). p(s(X)) :- ','(q(X), r). p(X) :- r. q(0). q(s(X)) :- ','(p(X), r). q(X) :- r. r. Query: p(g) ---------------------------------------- (3) 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_1: (b) q_in_1: (b) Transforming Prolog into the following Term Rewriting System: Pi-finite rewrite system: The TRS R consists of the following rules: p_in_g(0) -> p_out_g(0) p_in_g(s(X)) -> U1_g(X, q_in_g(X)) q_in_g(0) -> q_out_g(0) q_in_g(s(X)) -> U4_g(X, p_in_g(X)) p_in_g(X) -> U3_g(X, r_in_) r_in_ -> r_out_ U3_g(X, r_out_) -> p_out_g(X) U4_g(X, p_out_g(X)) -> U5_g(X, r_in_) U5_g(X, r_out_) -> q_out_g(s(X)) q_in_g(X) -> U6_g(X, r_in_) U6_g(X, r_out_) -> q_out_g(X) U1_g(X, q_out_g(X)) -> U2_g(X, r_in_) U2_g(X, r_out_) -> p_out_g(s(X)) The argument filtering Pi contains the following mapping: p_in_g(x1) = p_in_g(x1) popout

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

job log

popout

actions

all output return to Logic Progr 19030