details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.87757396698 seconds
cpu usage	4.288366751
max memory	2.16797184E8

stage attributes

key	value
output-size	9305
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 con(g) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToPiTRSProof [SOUND, 0 ms] (2) PiTRS (3) DependencyPairsProof [EQUIVALENT, 4 ms] (4) PiDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) PiDP (7) PiDPToQDPProof [EQUIVALENT, 0 ms] (8) QDP (9) QDPSizeChangeProof [EQUIVALENT, 0 ms] (10) YES ---------------------------------------- (0) Obligation: Clauses: dis(or(B1, B2)) :- ','(con(B1), dis(B2)). dis(B) :- con(B). con(and(B1, B2)) :- ','(dis(B1), con(B2)). con(B) :- bool(B). bool(0). bool(1). Query: con(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: con_in_1: (b) dis_in_1: (b) Transforming Prolog into the following Term Rewriting System: Pi-finite rewrite system: The TRS R consists of the following rules: con_in_g(and(B1, B2)) -> U4_g(B1, B2, dis_in_g(B1)) dis_in_g(or(B1, B2)) -> U1_g(B1, B2, con_in_g(B1)) con_in_g(B) -> U6_g(B, bool_in_g(B)) bool_in_g(0) -> bool_out_g(0) bool_in_g(1) -> bool_out_g(1) U6_g(B, bool_out_g(B)) -> con_out_g(B) U1_g(B1, B2, con_out_g(B1)) -> U2_g(B1, B2, dis_in_g(B2)) dis_in_g(B) -> U3_g(B, con_in_g(B)) U3_g(B, con_out_g(B)) -> dis_out_g(B) U2_g(B1, B2, dis_out_g(B2)) -> dis_out_g(or(B1, B2)) U4_g(B1, B2, dis_out_g(B1)) -> U5_g(B1, B2, con_in_g(B2)) U5_g(B1, B2, con_out_g(B2)) -> con_out_g(and(B1, B2)) Pi is empty. Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog ---------------------------------------- (2) Obligation: Pi-finite rewrite system: The TRS R consists of the following rules: con_in_g(and(B1, B2)) -> U4_g(B1, B2, dis_in_g(B1)) dis_in_g(or(B1, B2)) -> U1_g(B1, B2, con_in_g(B1)) con_in_g(B) -> U6_g(B, bool_in_g(B)) bool_in_g(0) -> bool_out_g(0) bool_in_g(1) -> bool_out_g(1) U6_g(B, bool_out_g(B)) -> con_out_g(B) U1_g(B1, B2, con_out_g(B1)) -> U2_g(B1, B2, dis_in_g(B2)) dis_in_g(B) -> U3_g(B, con_in_g(B)) U3_g(B, con_out_g(B)) -> dis_out_g(B) U2_g(B1, B2, dis_out_g(B2)) -> dis_out_g(or(B1, B2)) U4_g(B1, B2, dis_out_g(B1)) -> U5_g(B1, B2, con_in_g(B2)) U5_g(B1, B2, con_out_g(B2)) -> con_out_g(and(B1, B2)) popout

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

job log

popout

actions

all output return to Logic Progr 19030