SRS Standard pair #487516931

details

property	value
status	complete
benchmark	212612.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n015.star.cs.uiowa.edu
space	ICFP_2010

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	37.6873631477 seconds
cpu usage	146.926186101
max memory	6.723579904E9

stage attributes

key	value
output-size	437900
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


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


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


Termination w.r.t. Q of the given QTRS could be proven:

(0) QTRS
(1) FlatCCProof [EQUIVALENT, 0 ms]
(2) QTRS
(3) RootLabelingProof [EQUIVALENT, 8 ms]
(4) QTRS
(5) QTRSRRRProof [EQUIVALENT, 10.3 s]
(6) QTRS
(7) QTRSRRRProof [EQUIVALENT, 36 ms]
(8) QTRS
(9) QTRSRRRProof [EQUIVALENT, 38 ms]
(10) QTRS
(11) DependencyPairsProof [EQUIVALENT, 86 ms]
(12) QDP
(13) DependencyGraphProof [EQUIVALENT, 0 ms]
(14) AND
    (15) QDP
        (16) UsableRulesProof [EQUIVALENT, 4 ms]
        (17) QDP
        (18) DependencyGraphProof [EQUIVALENT, 0 ms]
        (19) QDP
        (20) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (21) YES
    (22) QDP
        (23) UsableRulesProof [EQUIVALENT, 3 ms]
        (24) QDP
        (25) DependencyGraphProof [EQUIVALENT, 0 ms]
        (26) QDP
        (27) QDPOrderProof [EQUIVALENT, 36 ms]
        (28) QDP
        (29) QDPOrderProof [EQUIVALENT, 20 ms]
        (30) QDP
        (31) DependencyGraphProof [EQUIVALENT, 0 ms]
        (32) TRUE
    (33) QDP
        (34) UsableRulesProof [EQUIVALENT, 0 ms]
        (35) QDP
        (36) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (37) YES


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

(0)
Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:

   0(0(1(x1))) -> 2(0(3(3(0(1(x1))))))
   0(1(0(x1))) -> 0(1(3(4(0(3(x1))))))
   0(1(0(x1))) -> 2(0(3(0(1(4(x1))))))
   0(1(1(x1))) -> 0(3(1(3(1(x1)))))
   0(1(1(x1))) -> 1(3(0(1(4(x1)))))
   0(1(1(x1))) -> 0(1(3(1(3(1(x1))))))
   0(1(1(x1))) -> 1(3(2(1(3(0(x1))))))
   0(1(1(x1))) -> 1(3(3(1(4(0(x1))))))
   0(1(1(x1))) -> 3(0(3(1(5(1(x1))))))
   0(1(1(x1))) -> 5(0(3(1(5(1(x1))))))
   0(5(0(x1))) -> 3(0(3(5(0(x1)))))
   0(5(0(x1))) -> 3(5(0(0(3(x1)))))
   0(5(0(x1))) -> 5(0(3(0(2(x1)))))
   0(5(0(x1))) -> 5(0(3(3(0(x1)))))
   0(5(0(x1))) -> 4(5(0(3(3(0(x1))))))
   0(5(0(x1))) -> 4(5(0(3(5(0(x1))))))
   0(5(0(x1))) -> 5(3(0(1(3(0(x1))))))
   2(0(0(x1))) -> 0(3(0(3(2(x1)))))
   2(0(0(x1))) -> 0(3(3(0(2(3(x1))))))
   2(0(0(x1))) -> 0(3(5(2(0(3(x1))))))
   5(1(0(x1))) -> 3(5(0(1(4(3(x1))))))
   5(1(0(x1))) -> 3(5(1(4(0(3(x1))))))
   5(1(1(x1))) -> 3(1(5(1(x1))))
   5(1(1(x1))) -> 1(3(1(3(5(x1)))))
   5(1(1(x1))) -> 1(3(3(3(5(1(x1))))))
   5(1(1(x1))) -> 1(3(5(5(1(4(x1))))))
   0(2(0(1(x1)))) -> 0(2(3(3(0(1(x1))))))
   0(5(1(0(x1)))) -> 0(0(1(3(5(x1)))))
   0(5(4(0(x1)))) -> 0(4(5(0(3(x1)))))
   2(0(2(0(x1)))) -> 3(0(3(0(2(2(x1))))))
   2(0(4(1(x1)))) -> 2(3(0(1(4(4(x1))))))
   2(0(5(0(x1)))) -> 0(0(3(5(2(x1)))))
   2(2(4(1(x1)))) -> 3(2(4(3(2(1(x1))))))
   5(1(0(1(x1)))) -> 0(5(1(4(3(1(x1))))))
   5(1(1(0(x1)))) -> 0(5(1(5(1(x1)))))
   5(1(2(0(x1)))) -> 3(1(3(5(0(2(x1))))))
   5(1(5(0(x1)))) -> 5(3(5(0(1(x1)))))
   5(2(0(1(x1)))) -> 5(1(0(3(2(x1)))))
   5(3(1(1(x1)))) -> 5(3(1(3(1(5(x1))))))
   5(4(1(1(x1)))) -> 5(1(4(1(4(5(x1))))))

popout

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

job log

popout

actions all output return to SRS Standard