details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.2734 seconds
cpu usage	8.74206
user time	8.30508
system time	0.436982
max virtual memory	2.01422E7
max residence set size	783424.0

stage attributes

key	value
starexec-result	MAYBE

output

8.22/3.98 MAYBE 8.22/3.99 proof of /export/starexec/sandbox/benchmark/theBenchmark.pl 8.22/3.99 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 8.22/3.99 8.22/3.99 8.22/3.99 Left Termination of the query pattern 8.22/3.99 8.22/3.99 balance(a,g) 8.22/3.99 8.22/3.99 w.r.t. the given Prolog program could not be shown: 8.22/3.99 8.22/3.99 (0) Prolog 8.22/3.99 (1) PrologToPiTRSProof [SOUND, 0 ms] 8.22/3.99 (2) PiTRS 8.22/3.99 (3) DependencyPairsProof [EQUIVALENT, 8 ms] 8.22/3.99 (4) PiDP 8.22/3.99 (5) DependencyGraphProof [EQUIVALENT, 0 ms] 8.22/3.99 (6) PiDP 8.22/3.99 (7) UsableRulesProof [EQUIVALENT, 0 ms] 8.22/3.99 (8) PiDP 8.22/3.99 (9) PiDPToQDPProof [SOUND, 17 ms] 8.22/3.99 (10) QDP 8.22/3.99 (11) PrologToPiTRSProof [SOUND, 0 ms] 8.22/3.99 (12) PiTRS 8.22/3.99 (13) DependencyPairsProof [EQUIVALENT, 2 ms] 8.22/3.99 (14) PiDP 8.22/3.99 (15) DependencyGraphProof [EQUIVALENT, 0 ms] 8.22/3.99 (16) PiDP 8.22/3.99 (17) UsableRulesProof [EQUIVALENT, 0 ms] 8.22/3.99 (18) PiDP 8.22/3.99 (19) PiDPToQDPProof [SOUND, 0 ms] 8.22/3.99 (20) QDP 8.22/3.99 (21) PrologToDTProblemTransformerProof [SOUND, 133 ms] 8.22/3.99 (22) TRIPLES 8.22/3.99 (23) TriplesToPiDPProof [SOUND, 22 ms] 8.22/3.99 (24) PiDP 8.22/3.99 (25) DependencyGraphProof [EQUIVALENT, 0 ms] 8.22/3.99 (26) AND 8.22/3.99 (27) PiDP 8.22/3.99 (28) UsableRulesProof [EQUIVALENT, 0 ms] 8.22/3.99 (29) PiDP 8.22/3.99 (30) PiDPToQDPProof [SOUND, 0 ms] 8.22/3.99 (31) QDP 8.22/3.99 (32) PiDP 8.22/3.99 (33) UsableRulesProof [EQUIVALENT, 0 ms] 8.22/3.99 (34) PiDP 8.22/3.99 (35) PrologToTRSTransformerProof [SOUND, 98 ms] 8.22/3.99 (36) QTRS 8.22/3.99 (37) QTRSRRRProof [EQUIVALENT, 326 ms] 8.22/3.99 (38) QTRS 8.22/3.99 (39) QTRSRRRProof [EQUIVALENT, 0 ms] 8.22/3.99 (40) QTRS 8.22/3.99 (41) PrologToIRSwTTransformerProof [SOUND, 95 ms] 8.22/3.99 (42) AND 8.22/3.99 (43) IRSwT 8.22/3.99 (44) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms] 8.22/3.99 (45) IRSwT 8.22/3.99 (46) IntTRSCompressionProof [EQUIVALENT, 18 ms] 8.22/3.99 (47) IRSwT 8.22/3.99 (48) IRSFormatTransformerProof [EQUIVALENT, 0 ms] 8.22/3.99 (49) IRSwT 8.22/3.99 (50) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms] 8.22/3.99 (51) IRSwT 8.22/3.99 (52) FilterProof [EQUIVALENT, 0 ms] 8.22/3.99 (53) IntTRS 8.22/3.99 (54) IntTRSPeriodicNontermProof [COMPLETE, 5 ms] 8.22/3.99 (55) NO 8.22/3.99 (56) IRSwT 8.22/3.99 (57) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms] 8.22/3.99 (58) TRUE 8.22/3.99 8.22/3.99 8.22/3.99 ---------------------------------------- 8.22/3.99 8.22/3.99 (0) 8.22/3.99 Obligation: 8.22/3.99 Clauses: 8.22/3.99 8.22/3.99 balance(T, TB) :- balance(T, -(I, []), -(.(','(TB, -(I, [])), X), X), -(Rest, []), -(Rest, [])). 8.22/3.99 balance(nil, -(X, X), -(A, B), -(A, B), -(.(','(nil, -(C, C)), T), T)). 8.22/3.99 balance(tree(L, V, R), -(IH, IT), -(.(','(tree(LB, VB, RB), -(A, D)), H), .(','(LB, -(A, .(VB, X))), .(','(RB, -(X, D)), T))), -(HR, TR), -(NH, NT)) :- ','(balance(L, -(IH, .(V, IT1)), -(H, T), -(HR1, TR1), -(NH, NT1)), balance(R, -(IT1, IT), -(HR1, TR1), -(HR, TR), -(NT1, NT))). 8.22/3.99 8.22/3.99 8.22/3.99 Query: balance(a,g) 8.22/3.99 ---------------------------------------- 8.22/3.99 8.22/3.99 (1) PrologToPiTRSProof (SOUND) 8.22/3.99 We use the technique of [TOCL09]. With regard to the inferred argument filtering the predicates were used in the following modes: 8.22/3.99 8.22/3.99 balance_in_2: (f,b) 8.22/3.99 8.22/3.99 balance_in_5: (f,f,f,f,f) 8.22/3.99 8.22/3.99 Transforming Prolog into the following Term Rewriting System: 8.22/3.99 8.22/3.99 Pi-finite rewrite system: 8.22/3.99 The TRS R consists of the following rules: 8.22/3.99 8.22/3.99 balance_in_ag(T, TB) -> U1_ag(T, TB, balance_in_aaaaa(T, -(I, []), -(.(','(TB, -(I, [])), X), X), -(Rest, []), -(Rest, []))) 8.22/3.99 balance_in_aaaaa(nil, -(X, X), -(A, B), -(A, B), -(.(','(nil, -(C, C)), T), T)) -> balance_out_aaaaa(nil, -(X, X), -(A, B), -(A, B), -(.(','(nil, -(C, C)), T), T)) 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