Logic Progr 19030 pair #381919883

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.44675803185 seconds
cpu usage	5.994157809
max memory	7.404544E8

stage attributes

key	value
output-size	47168
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


Left Termination of the query pattern

t()

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

(0) Prolog
(1) CutEliminatorProof [SOUND, 0 ms]
(2) Prolog
    (3) UnifyTransformerProof [EQUIVALENT, 0 ms]
    (4) Prolog
    (5) PrologToPiTRSProof [SOUND, 0 ms]
    (6) PiTRS
        (7) DependencyPairsProof [EQUIVALENT, 0 ms]
        (8) PiDP
        (9) DependencyGraphProof [EQUIVALENT, 0 ms]
        (10) AND
            (11) PiDP
                (12) UsableRulesProof [EQUIVALENT, 0 ms]
                (13) PiDP
                (14) PiDPToQDPProof [SOUND, 0 ms]
                (15) QDP
            (16) PiDP
                (17) UsableRulesProof [EQUIVALENT, 0 ms]
                (18) PiDP
    (19) PrologToPiTRSProof [SOUND, 0 ms]
    (20) PiTRS
        (21) DependencyPairsProof [EQUIVALENT, 0 ms]
        (22) PiDP
        (23) DependencyGraphProof [EQUIVALENT, 0 ms]
        (24) AND
            (25) PiDP
                (26) UsableRulesProof [EQUIVALENT, 0 ms]
                (27) PiDP
                (28) PiDPToQDPProof [SOUND, 0 ms]
                (29) QDP
            (30) PiDP
                (31) UsableRulesProof [EQUIVALENT, 0 ms]
                (32) PiDP
(33) PrologToDTProblemTransformerProof [SOUND, 0 ms]
(34) TRIPLES
    (35) TriplesToPiDPProof [SOUND, 0 ms]
    (36) PiDP
    (37) DependencyGraphProof [EQUIVALENT, 0 ms]
    (38) PiDP
    (39) PiDPToQDPProof [EQUIVALENT, 0 ms]
    (40) QDP
(41) PrologToTRSTransformerProof [SOUND, 0 ms]
(42) QTRS
    (43) QTRSRRRProof [EQUIVALENT, 0 ms]
    (44) QTRS
    (45) Overlay + Local Confluence [EQUIVALENT, 0 ms]
    (46) QTRS
    (47) DependencyPairsProof [EQUIVALENT, 0 ms]
    (48) QDP
    (49) UsableRulesProof [EQUIVALENT, 0 ms]
    (50) QDP
    (51) QReductionProof [EQUIVALENT, 0 ms]
    (52) QDP
(53) PrologToIRSwTTransformerProof [SOUND, 0 ms]
(54) IRSwT
    (55) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms]
    (56) IRSwT
    (57) IntTRSCompressionProof [EQUIVALENT, 0 ms]
    (58) IRSwT
    (59) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
    (60) IRSwT
    (61) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms]
    (62) IRSwT
    (63) FilterProof [EQUIVALENT, 0 ms]
    (64) IntTRS
    (65) IntTRSNonPeriodicNontermProof [COMPLETE, 7 ms]
    (66) NO


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

(0)
Obligation:
Clauses:

t :- ','(=(X, f(0, f(1, f(0, X)))), ','(!, g(X))).
t :- t.
g(f(X, f(X, X1))) :- !.
g(f(X2, X)) :- g(X).


Query: t()
----------------------------------------

popout

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

job log

popout

actions all output return to Logic Progr 19030