Logic Progr 19030 pair #381919930

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	n071.star.cs.uiowa.edu
space	terminweb_old

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.05267500877 seconds
cpu usage	8.826198592
max memory	8.08402944E8

stage attributes

key	value
output-size	230591
starexec-result	MAYBE

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.pl /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


MAYBE
proof of /export/starexec/sandbox2/benchmark/theBenchmark.pl
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


Left Termination of the query pattern

balance(a,g)

w.r.t. the given Prolog program could not be shown:

(0) Prolog
(1) PrologToPiTRSProof [SOUND, 0 ms]
(2) PiTRS
    (3) DependencyPairsProof [EQUIVALENT, 10 ms]
    (4) PiDP
    (5) DependencyGraphProof [EQUIVALENT, 0 ms]
    (6) PiDP
    (7) UsableRulesProof [EQUIVALENT, 0 ms]
    (8) PiDP
    (9) PiDPToQDPProof [SOUND, 0 ms]
    (10) QDP
(11) PrologToPiTRSProof [SOUND, 0 ms]
(12) PiTRS
    (13) DependencyPairsProof [EQUIVALENT, 0 ms]
    (14) PiDP
    (15) DependencyGraphProof [EQUIVALENT, 0 ms]
    (16) PiDP
    (17) UsableRulesProof [EQUIVALENT, 0 ms]
    (18) PiDP
    (19) PiDPToQDPProof [SOUND, 0 ms]
    (20) QDP
(21) PrologToDTProblemTransformerProof [SOUND, 121 ms]
(22) TRIPLES
    (23) TriplesToPiDPProof [SOUND, 0 ms]
    (24) PiDP
    (25) DependencyGraphProof [EQUIVALENT, 0 ms]
    (26) AND
        (27) PiDP
            (28) UsableRulesProof [EQUIVALENT, 0 ms]
            (29) PiDP
            (30) PiDPToQDPProof [SOUND, 0 ms]
            (31) QDP
        (32) PiDP
            (33) UsableRulesProof [EQUIVALENT, 0 ms]
            (34) PiDP
(35) PrologToTRSTransformerProof [SOUND, 136 ms]
(36) QTRS
    (37) QTRSRRRProof [EQUIVALENT, 340 ms]
    (38) QTRS
    (39) QTRSRRRProof [EQUIVALENT, 0 ms]
    (40) QTRS
    (41) QTRSRRRProof [EQUIVALENT, 0 ms]
    (42) QTRS
(43) PrologToIRSwTTransformerProof [SOUND, 196 ms]
(44) AND
    (45) IRSwT
        (46) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms]
        (47) IRSwT
        (48) IntTRSCompressionProof [EQUIVALENT, 20 ms]
        (49) IRSwT
        (50) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
        (51) IRSwT
        (52) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms]
        (53) IRSwT
        (54) FilterProof [EQUIVALENT, 0 ms]
        (55) IntTRS
        (56) IntTRSPeriodicNontermProof [COMPLETE, 5 ms]
        (57) NO
    (58) IRSwT
        (59) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms]
        (60) TRUE


----------------------------------------

(0)
Obligation:
Clauses:

balance(T, TB) :- balance(T, -(I, []), -(.(','(TB, -(I, [])), X), X), -(Rest, []), -(Rest, [])).
balance(nil, -(X, X), -(A, B), -(A, B), -(.(','(nil, -(C, C)), T), T)).
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))).


Query: balance(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:

balance_in_2: (f,b)

balance_in_5: (f,f,f,f,f)

popout

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

job log

popout

actions all output return to Logic Progr 19030