Logic Progr 19030 pair #381920003

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.2209751606 seconds
cpu usage	5.501144957
max memory	3.58453248E8

stage attributes

key	value
output-size	55283
starexec-result	MAYBE

output

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


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


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


Left Termination of the query pattern

append(a,a,a)

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

(0) Prolog
(1) PrologToPiTRSProof [SOUND, 0 ms]
(2) PiTRS
    (3) DependencyPairsProof [EQUIVALENT, 0 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) PrologToTRSTransformerProof [SOUND, 0 ms]
(22) QTRS
    (23) QTRSRRRProof [EQUIVALENT, 0 ms]
    (24) QTRS
    (25) QTRSRRRProof [EQUIVALENT, 4 ms]
    (26) QTRS
    (27) Overlay + Local Confluence [EQUIVALENT, 0 ms]
    (28) QTRS
    (29) DependencyPairsProof [EQUIVALENT, 0 ms]
    (30) QDP
    (31) UsableRulesProof [EQUIVALENT, 0 ms]
    (32) QDP
    (33) QReductionProof [EQUIVALENT, 0 ms]
    (34) QDP
(35) PrologToIRSwTTransformerProof [SOUND, 0 ms]
(36) IRSwT
    (37) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms]
    (38) IRSwT
    (39) IntTRSCompressionProof [EQUIVALENT, 21 ms]
    (40) IRSwT
    (41) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
    (42) IRSwT
    (43) IRSwTTerminationDigraphProof [EQUIVALENT, 6 ms]
    (44) IRSwT
    (45) FilterProof [EQUIVALENT, 0 ms]
    (46) IntTRS
    (47) IntTRSPeriodicNontermProof [COMPLETE, 7 ms]
    (48) NO
(49) PrologToDTProblemTransformerProof [SOUND, 0 ms]
(50) TRIPLES
    (51) TriplesToPiDPProof [SOUND, 0 ms]
    (52) PiDP
    (53) DependencyGraphProof [EQUIVALENT, 0 ms]
    (54) PiDP
    (55) PiDPToQDPProof [SOUND, 0 ms]
    (56) QDP


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

(0)
Obligation:
Clauses:

append([], L, L).
append(.(H, L1), L2, .(H, L3)) :- append(L1, L2, L3).
append1([], L, L).
append1(.(H, L1), L2, .(H, L3)) :- append1(L1, L2, L3).


Query: append(a,a,a)
----------------------------------------

(1) PrologToPiTRSProof (SOUND)
We use the technique of [TOCL09]. With regard to the inferred argument filtering the predicates were used in the following modes:

append_in_3: (f,f,f)

Transforming Prolog into the following Term Rewriting System:

Pi-finite rewrite system:
The TRS R consists of the following rules:

popout

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

job log

popout

actions all output return to Logic Progr 19030