Logic Progr 19030 pair #381919993

details

property	value
status	complete
benchmark	svcomp-c-07-c.pl
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n037.star.cs.uiowa.edu
space	AProVE_numeric

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	14.0327188969 seconds
cpu usage	33.375529347
max memory	3.181867008E9

stage attributes

key	value
output-size	383666
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.pl /export/starexec/sandbox/output/output_files


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


YES
proof of /export/starexec/sandbox/benchmark/theBenchmark.pl
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


Left Termination of the query pattern

test_fun(g,g,g,g)

w.r.t. the given Prolog program could successfully be proven:

(0) Prolog
(1) PrologToIRSwTTransformerProof [SOUND, 77 ms]
(2) IRSwT
(3) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms]
(4) IRSwT
(5) IntTRSCompressionProof [EQUIVALENT, 35 ms]
(6) IRSwT
(7) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
(8) IRSwT
(9) IRSwTTerminationDigraphProof [EQUIVALENT, 56 ms]
(10) IRSwT
(11) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(12) IRSwT
(13) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms]
(14) IRSwT
(15) IRSwTToIntTRSProof [SOUND, 6 ms]
(16) IRSwT
(17) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(18) IRSwT
(19) TerminationGraphProcessor [EQUIVALENT, 13 ms]
(20) IntTRS
(21) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(22) IntTRS
(23) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
(24) YES


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

(0)
Obligation:
Clauses:

test_fun(I, J, K, Tmp) :- loop(I, J, K, Tmp, 0).
loop(I, J, K, Tmp, C) :- ','(=<(I, 100), ','(=<(J, K), ','(is(Tmp1, I), ','(is(I1, J), ','(is(J1, +(Tmp, 1)), ','(is(K1, -(K, 1)), ','(is(C1, +(C, 1)), loop(I1, J1, K1, Tmp1, C1)))))))).
loop(I, J, K, Tmp, C) :- >(I, 100).
loop(I, J, K, Tmp, C) :- >(J, K).


Query: test_fun(g,g,g,g)
----------------------------------------

(1) PrologToIRSwTTransformerProof (SOUND)
Transformed Prolog program to IRSwT according to method in Master Thesis of A. Weinert

{
    "root": 1,
    "program": {
        "directives": [],
        "clauses": [
            [
                "(test_fun I J K Tmp)",
                "(loop I J K Tmp (0))"
            ],
            [
                "(loop I J K Tmp C)",
                "(',' (=< I (100)) (',' (=< J K) (',' (is Tmp1 I) (',' (is I1 J) (',' (is J1 (+ Tmp (1))) (',' (is K1 (- K (1))) (',' (is C1 (+ C (1))) (loop I1 J1 K1 Tmp1 C1))))))))"
            ],
            [
                "(loop I J K Tmp C)",
                "(> I (100))"
            ],
            [
                "(loop I J K Tmp C)",
                "(> J K)"
            ]
        ]
    },
    "graph": {
        "nodes": {
            "4210": {
                "goal": [{
                    "clause": -1,
                    "scope": -1,
                    "term": "(',' (is X69 T42) (',' (is X70 (+ T44 (1))) (',' (is X71 (- T43 (1))) (',' (is X72 (+ (0) (1))) (loop X69 X70 X71 T45 X72)))))"
                }],
                "kb": {
                    "nonunifying": [],
                    "intvars": {},
                    "arithmetic": {
                        "type": "PlainIntegerRelationState",
                        "relations": [
                            {

popout

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

job log

popout

actions all output return to Logic Progr 19030