Logic Programming pair #487529487

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.92910718918 seconds
cpu usage	7.879949011
max memory	1.001033728E9

stage attributes

key	value
output-size	100646
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

flat(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, 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) UsableRulesReductionPairsProof [EQUIVALENT, 4 ms]
    (12) QDP
    (13) NonTerminationLoopProof [COMPLETE, 0 ms]
    (14) NO
(15) PrologToPiTRSProof [SOUND, 0 ms]
(16) PiTRS
    (17) DependencyPairsProof [EQUIVALENT, 0 ms]
    (18) PiDP
    (19) DependencyGraphProof [EQUIVALENT, 1 ms]
    (20) PiDP
    (21) UsableRulesProof [EQUIVALENT, 0 ms]
    (22) PiDP
    (23) PiDPToQDPProof [SOUND, 0 ms]
    (24) QDP
    (25) UsableRulesReductionPairsProof [EQUIVALENT, 4 ms]
    (26) QDP
    (27) NonTerminationLoopProof [COMPLETE, 0 ms]
    (28) NO
(29) PrologToTRSTransformerProof [SOUND, 0 ms]
(30) QTRS
    (31) DependencyPairsProof [EQUIVALENT, 0 ms]
    (32) QDP
    (33) DependencyGraphProof [EQUIVALENT, 0 ms]
    (34) QDP
    (35) UsableRulesProof [EQUIVALENT, 0 ms]
    (36) QDP
    (37) UsableRulesReductionPairsProof [EQUIVALENT, 3 ms]
    (38) QDP
    (39) NonTerminationLoopProof [COMPLETE, 0 ms]
    (40) NO
(41) PrologToDTProblemTransformerProof [SOUND, 51 ms]
(42) TRIPLES
    (43) TriplesToPiDPProof [SOUND, 0 ms]
    (44) PiDP
    (45) DependencyGraphProof [EQUIVALENT, 0 ms]
    (46) PiDP
    (47) PiDPToQDPProof [SOUND, 0 ms]
    (48) QDP
    (49) UsableRulesReductionPairsProof [EQUIVALENT, 1 ms]
    (50) QDP
    (51) NonTerminationLoopProof [COMPLETE, 0 ms]
    (52) NO
(53) PrologToIRSwTTransformerProof [SOUND, 0 ms]
(54) IRSwT
    (55) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms]
    (56) IRSwT
    (57) IntTRSCompressionProof [EQUIVALENT, 32 ms]
    (58) IRSwT
    (59) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
    (60) IRSwT
    (61) IRSwTTerminationDigraphProof [EQUIVALENT, 10 ms]
    (62) IRSwT
    (63) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 14 ms]
    (64) IRSwT


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

(0)
Obligation:
Clauses:

flat([], []).
flat(.([], T), R) :- flat(T, R).
flat(.(.(H, T), TT), .(H, R)) :- flat(.(T, TT), R).


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

popout

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

job log

popout

actions all output return to Logic Programming