details

property	value
status	complete
benchmark	insert-fbf.pl
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n080.star.cs.uiowa.edu
space	BCGGV05

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.29338 seconds
cpu usage	5.68801
user time	5.41598
system time	0.272031
max virtual memory	1.9077528E7
max residence set size	493568.0

stage attributes

key	value
starexec-result	YES

output

5.47/2.23 YES 5.47/2.26 proof of /export/starexec/sandbox/benchmark/theBenchmark.pl 5.47/2.26 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 5.47/2.26 5.47/2.26 5.47/2.26 Left Termination of the query pattern 5.47/2.26 5.47/2.26 insert(a,g,a) 5.47/2.26 5.47/2.26 w.r.t. the given Prolog program could successfully be proven: 5.47/2.26 5.47/2.26 (0) Prolog 5.47/2.26 (1) PrologToPiTRSProof [SOUND, 0 ms] 5.47/2.26 (2) PiTRS 5.47/2.26 (3) DependencyPairsProof [EQUIVALENT, 0 ms] 5.47/2.26 (4) PiDP 5.47/2.26 (5) DependencyGraphProof [EQUIVALENT, 0 ms] 5.47/2.26 (6) AND 5.47/2.26 (7) PiDP 5.47/2.26 (8) UsableRulesProof [EQUIVALENT, 0 ms] 5.47/2.26 (9) PiDP 5.47/2.26 (10) PiDPToQDPProof [SOUND, 3 ms] 5.47/2.26 (11) QDP 5.47/2.26 (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] 5.47/2.26 (13) YES 5.47/2.26 (14) PiDP 5.47/2.26 (15) UsableRulesProof [EQUIVALENT, 0 ms] 5.47/2.26 (16) PiDP 5.47/2.26 (17) PiDPToQDPProof [EQUIVALENT, 0 ms] 5.47/2.26 (18) QDP 5.47/2.26 (19) QDPSizeChangeProof [EQUIVALENT, 0 ms] 5.47/2.26 (20) YES 5.47/2.26 (21) PiDP 5.47/2.26 (22) UsableRulesProof [EQUIVALENT, 0 ms] 5.47/2.26 (23) PiDP 5.47/2.26 (24) PiDPToQDPProof [SOUND, 0 ms] 5.47/2.26 (25) QDP 5.47/2.26 (26) QDPSizeChangeProof [EQUIVALENT, 0 ms] 5.47/2.26 (27) YES 5.47/2.26 (28) PiDP 5.47/2.26 (29) UsableRulesProof [EQUIVALENT, 0 ms] 5.47/2.26 (30) PiDP 5.47/2.26 (31) PiDPToQDPProof [SOUND, 0 ms] 5.47/2.26 (32) QDP 5.47/2.26 (33) QDPSizeChangeProof [EQUIVALENT, 0 ms] 5.47/2.26 (34) YES 5.47/2.26 (35) PiDP 5.47/2.26 (36) UsableRulesProof [EQUIVALENT, 0 ms] 5.47/2.26 (37) PiDP 5.47/2.26 (38) PiDPToQDPProof [SOUND, 0 ms] 5.47/2.26 (39) QDP 5.47/2.26 (40) QDPSizeChangeProof [EQUIVALENT, 0 ms] 5.47/2.26 (41) YES 5.47/2.26 5.47/2.26 5.47/2.26 ---------------------------------------- 5.47/2.26 5.47/2.26 (0) 5.47/2.26 Obligation: 5.47/2.26 Clauses: 5.47/2.26 5.47/2.26 insert(X, void, tree(X, void, void)). 5.47/2.26 insert(X, tree(X, Left, Right), tree(X, Left, Right)). 5.47/2.26 insert(X, tree(Y, Left, Right), tree(Y, Left1, Right)) :- ','(less(X, Y), insert(X, Left, Left1)). 5.47/2.26 insert(X, tree(Y, Left, Right), tree(Y, Left, Right1)) :- ','(less(Y, X), insert(X, Right, Right1)). 5.47/2.26 less(0, s(X1)). 5.47/2.26 less(s(X), s(Y)) :- less(X, Y). 5.47/2.26 5.47/2.26 5.47/2.26 Query: insert(a,g,a) 5.47/2.26 ---------------------------------------- 5.47/2.26 5.47/2.26 (1) PrologToPiTRSProof (SOUND) 5.47/2.26 We use the technique of [TOCL09]. With regard to the inferred argument filtering the predicates were used in the following modes: 5.47/2.26 5.47/2.26 insert_in_3: (f,b,f) (b,b,f) 5.47/2.26 5.47/2.26 less_in_2: (f,b) (b,b) (b,f) 5.47/2.26 5.47/2.26 Transforming Prolog into the following Term Rewriting System: 5.47/2.26 5.47/2.26 Pi-finite rewrite system: 5.47/2.26 The TRS R consists of the following rules: 5.47/2.26 5.47/2.26 insert_in_aga(X, void, tree(X, void, void)) -> insert_out_aga(X, void, tree(X, void, void)) 5.47/2.26 insert_in_aga(X, tree(X, Left, Right), tree(X, Left, Right)) -> insert_out_aga(X, tree(X, Left, Right), tree(X, Left, Right)) 5.47/2.26 insert_in_aga(X, tree(Y, Left, Right), tree(Y, Left1, Right)) -> U1_aga(X, Y, Left, Right, Left1, less_in_ag(X, Y)) 5.47/2.26 less_in_ag(0, s(X1)) -> less_out_ag(0, s(X1)) 5.47/2.26 less_in_ag(s(X), s(Y)) -> U5_ag(X, Y, less_in_ag(X, Y)) 5.47/2.26 U5_ag(X, Y, less_out_ag(X, Y)) -> less_out_ag(s(X), s(Y)) 5.47/2.26 U1_aga(X, Y, Left, Right, Left1, less_out_ag(X, Y)) -> U2_aga(X, Y, Left, Right, Left1, insert_in_gga(X, Left, Left1)) 5.47/2.26 insert_in_gga(X, void, tree(X, void, void)) -> insert_out_gga(X, void, tree(X, void, void)) 5.47/2.26 insert_in_gga(X, tree(X, Left, Right), tree(X, Left, Right)) -> insert_out_gga(X, tree(X, Left, Right), tree(X, Left, Right)) 5.47/2.26 insert_in_gga(X, tree(Y, Left, Right), tree(Y, Left1, Right)) -> U1_gga(X, Y, Left, Right, Left1, less_in_gg(X, Y)) 5.47/2.26 less_in_gg(0, s(X1)) -> less_out_gg(0, s(X1)) 5.47/2.26 less_in_gg(s(X), s(Y)) -> U5_gg(X, Y, less_in_gg(X, Y)) 5.47/2.26 U5_gg(X, Y, less_out_gg(X, Y)) -> less_out_gg(s(X), s(Y)) 5.47/2.26 U1_gga(X, Y, Left, Right, Left1, less_out_gg(X, Y)) -> U2_gga(X, Y, Left, Right, Left1, insert_in_gga(X, Left, Left1)) 5.47/2.26 insert_in_gga(X, tree(Y, Left, Right), tree(Y, Left, Right1)) -> U3_gga(X, Y, Left, Right, Right1, less_in_gg(Y, X)) 5.47/2.26 U3_gga(X, Y, Left, Right, Right1, less_out_gg(Y, X)) -> U4_gga(X, Y, Left, Right, Right1, insert_in_gga(X, Right, Right1)) popout

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

job log

popout

actions

all output return to Logic_Programming 2019-04-02 08.22