Logic Programming pair #487096604

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.41723 seconds
cpu usage	6.24348
user time	5.87788
system time	0.365607
max virtual memory	1.9143316E7
max residence set size	755620.0

stage attributes

key	value
starexec-result	MAYBE

output

MAYBE
proof of /export/starexec/sandbox2/benchmark/theBenchmark.pl
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


Left Termination of the query pattern

sublist(g,g)

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

(0) Prolog
(1) PrologToPiTRSProof [SOUND, 0 ms]
(2) PiTRS
    (3) DependencyPairsProof [EQUIVALENT, 7 ms]
    (4) PiDP
    (5) DependencyGraphProof [EQUIVALENT, 0 ms]
    (6) AND
        (7) PiDP
            (8) UsableRulesProof [EQUIVALENT, 0 ms]
            (9) PiDP
            (10) PiDPToQDPProof [SOUND, 16 ms]
            (11) QDP
            (12) QDPSizeChangeProof [EQUIVALENT, 0 ms]
            (13) YES
        (14) PiDP
            (15) UsableRulesProof [EQUIVALENT, 0 ms]
            (16) PiDP
            (17) PiDPToQDPProof [SOUND, 0 ms]
            (18) QDP
(19) PrologToPiTRSProof [SOUND, 0 ms]
(20) PiTRS
    (21) DependencyPairsProof [EQUIVALENT, 2 ms]
    (22) PiDP
    (23) DependencyGraphProof [EQUIVALENT, 0 ms]
    (24) AND
        (25) PiDP
            (26) UsableRulesProof [EQUIVALENT, 0 ms]
            (27) PiDP
            (28) PiDPToQDPProof [SOUND, 2 ms]
            (29) QDP
            (30) QDPSizeChangeProof [EQUIVALENT, 0 ms]
            (31) YES
        (32) PiDP
            (33) UsableRulesProof [EQUIVALENT, 0 ms]
            (34) PiDP
            (35) PiDPToQDPProof [SOUND, 0 ms]
            (36) QDP
(37) PrologToTRSTransformerProof [SOUND, 0 ms]
(38) QTRS
    (39) DependencyPairsProof [EQUIVALENT, 0 ms]
    (40) QDP
    (41) DependencyGraphProof [EQUIVALENT, 0 ms]
    (42) AND
        (43) QDP
            (44) UsableRulesProof [EQUIVALENT, 0 ms]
            (45) QDP
            (46) QDPSizeChangeProof [EQUIVALENT, 0 ms]
            (47) YES
        (48) QDP
            (49) UsableRulesProof [EQUIVALENT, 0 ms]
            (50) QDP
(51) PrologToIRSwTTransformerProof [SOUND, 36 ms]
(52) AND
    (53) IRSwT
        (54) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms]
        (55) TRUE
    (56) IRSwT
        (57) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms]
        (58) IRSwT
        (59) IntTRSCompressionProof [EQUIVALENT, 21 ms]
        (60) IRSwT
        (61) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
        (62) IRSwT
        (63) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms]
        (64) IRSwT
        (65) FilterProof [EQUIVALENT, 0 ms]
        (66) IntTRS
        (67) IntTRSPeriodicNontermProof [COMPLETE, 6 ms]
        (68) NO
(69) PrologToDTProblemTransformerProof [SOUND, 41 ms]
(70) TRIPLES
    (71) TriplesToPiDPProof [SOUND, 0 ms]
    (72) PiDP
    (73) DependencyGraphProof [EQUIVALENT, 0 ms]
    (74) AND
        (75) PiDP
            (76) UsableRulesProof [EQUIVALENT, 0 ms]
            (77) PiDP
            (78) PiDPToQDPProof [SOUND, 0 ms]
            (79) QDP
            (80) QDPSizeChangeProof [EQUIVALENT, 0 ms]
            (81) YES
        (82) PiDP
            (83) UsableRulesProof [EQUIVALENT, 0 ms]
            (84) PiDP
            (85) PiDPToQDPProof [SOUND, 0 ms]
            (86) QDP
        (87) PiDP
            (88) UsableRulesProof [EQUIVALENT, 0 ms]

popout

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

job log

popout

actions all output return to Logic Programming