Logic Programming pair #487529261

details

property	value
status	complete
benchmark	transpose2.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	SGST06

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.74160194397 seconds
cpu usage	6.926866047
max memory	8.10573824E8

stage attributes

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

transpose_aux(a,g,a)

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, 1 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) NonTerminationLoopProof [COMPLETE, 0 ms]
    (16) NO
(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) NonTerminationLoopProof [COMPLETE, 0 ms]
    (32) NO
(33) PrologToTRSTransformerProof [SOUND, 47 ms]
(34) QTRS
    (35) AAECC Innermost [EQUIVALENT, 0 ms]
    (36) QTRS
    (37) DependencyPairsProof [EQUIVALENT, 0 ms]
    (38) QDP
    (39) DependencyGraphProof [EQUIVALENT, 0 ms]
    (40) QDP
    (41) UsableRulesProof [EQUIVALENT, 0 ms]
    (42) QDP
    (43) QReductionProof [EQUIVALENT, 0 ms]
    (44) QDP
    (45) TransformationProof [EQUIVALENT, 0 ms]
    (46) QDP
    (47) TransformationProof [EQUIVALENT, 0 ms]
    (48) QDP
    (49) NonTerminationLoopProof [COMPLETE, 0 ms]
    (50) NO
(51) PrologToDTProblemTransformerProof [SOUND, 45 ms]
(52) TRIPLES
    (53) TriplesToPiDPProof [SOUND, 0 ms]
    (54) PiDP
    (55) DependencyGraphProof [EQUIVALENT, 0 ms]
    (56) PiDP
    (57) PiDPToQDPProof [SOUND, 0 ms]
    (58) QDP
    (59) TransformationProof [EQUIVALENT, 0 ms]
    (60) QDP
    (61) TransformationProof [EQUIVALENT, 0 ms]
    (62) QDP
    (63) NonTerminationLoopProof [COMPLETE, 0 ms]
    (64) NO
(65) PrologToIRSwTTransformerProof [SOUND, 40 ms]
(66) IRSwT
    (67) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms]
    (68) IRSwT
    (69) IntTRSCompressionProof [EQUIVALENT, 51 ms]
    (70) IRSwT
    (71) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
    (72) IRSwT
    (73) IRSwTTerminationDigraphProof [EQUIVALENT, 7 ms]
    (74) IRSwT
    (75) IRSwTToIntTRSProof [SOUND, 0 ms]
    (76) IRSwT


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

(0)
Obligation:

popout

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

job log

popout

actions all output return to Logic Programming