Logic Programming pair #487529177

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	n141.star.cs.uiowa.edu
space	talp_plumer

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.24411916733 seconds
cpu usage	5.723684374
max memory	6.10312192E8

stage attributes

key	value
output-size	55312
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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 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) PrologToTRSTransformerProof [SOUND, 0 ms]
(2) QTRS
    (3) QTRSRRRProof [EQUIVALENT, 0 ms]
    (4) QTRS
    (5) QTRSRRRProof [EQUIVALENT, 0 ms]
    (6) QTRS
    (7) Overlay + Local Confluence [EQUIVALENT, 0 ms]
    (8) QTRS
    (9) DependencyPairsProof [EQUIVALENT, 0 ms]
    (10) QDP
    (11) UsableRulesProof [EQUIVALENT, 0 ms]
    (12) QDP
    (13) QReductionProof [EQUIVALENT, 0 ms]
    (14) QDP
(15) PrologToPiTRSProof [SOUND, 0 ms]
(16) PiTRS
    (17) DependencyPairsProof [EQUIVALENT, 0 ms]
    (18) PiDP
    (19) DependencyGraphProof [EQUIVALENT, 0 ms]
    (20) PiDP
    (21) UsableRulesProof [EQUIVALENT, 0 ms]
    (22) PiDP
    (23) PiDPToQDPProof [SOUND, 0 ms]
    (24) QDP
(25) PrologToPiTRSProof [SOUND, 0 ms]
(26) PiTRS
    (27) DependencyPairsProof [EQUIVALENT, 0 ms]
    (28) PiDP
    (29) DependencyGraphProof [EQUIVALENT, 0 ms]
    (30) PiDP
    (31) UsableRulesProof [EQUIVALENT, 0 ms]
    (32) PiDP
    (33) PiDPToQDPProof [SOUND, 0 ms]
    (34) QDP
(35) PrologToDTProblemTransformerProof [SOUND, 0 ms]
(36) TRIPLES
    (37) TriplesToPiDPProof [SOUND, 0 ms]
    (38) PiDP
    (39) DependencyGraphProof [EQUIVALENT, 0 ms]
    (40) PiDP
    (41) PiDPToQDPProof [SOUND, 0 ms]
    (42) QDP
(43) PrologToIRSwTTransformerProof [SOUND, 0 ms]
(44) IRSwT
    (45) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms]
    (46) IRSwT
    (47) IntTRSCompressionProof [EQUIVALENT, 20 ms]
    (48) IRSwT
    (49) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
    (50) IRSwT
    (51) IRSwTTerminationDigraphProof [EQUIVALENT, 7 ms]
    (52) IRSwT
    (53) FilterProof [EQUIVALENT, 0 ms]
    (54) IntTRS
    (55) IntTRSPeriodicNontermProof [COMPLETE, 0 ms]
    (56) NO


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

(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) PrologToTRSTransformerProof (SOUND)
Transformed Prolog program to TRS.

{
    "root": 3,
    "program": {
        "directives": [],
        "clauses": [
            [

popout

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

job log

popout

actions all output return to Logic Programming