Logic Programming pair #487529403

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.53491902351 seconds
cpu usage	6.893755073
max memory	6.60627456E8

stage attributes

key	value
output-size	210790
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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


Left Termination of the query pattern

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


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

(0)
Obligation:
Clauses:

reverse(X1s, X2s) :- reverse(X1s, [], X2s).
reverse([], Xs, Xs).
reverse(.(X, X1s), X2s, Ys) :- reverse(X1s, .(X, X2s), Ys).


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

reverse_in_2: (f,b)

popout

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

job log

popout

actions all output return to Logic Programming