SRS Stand 10685 pair #381723712

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	247.77511692 seconds
cpu usage	981.407999406
max memory	1.5828824064E10

stage attributes

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


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

(0) QTRS
(1) QTRS Reverse [EQUIVALENT, 0 ms]
(2) QTRS
(3) DependencyPairsProof [EQUIVALENT, 298 ms]
(4) QDP
(5) DependencyGraphProof [EQUIVALENT, 0 ms]
(6) QDP
(7) QDPOrderProof [EQUIVALENT, 5171 ms]
(8) QDP
(9) QDPOrderProof [EQUIVALENT, 4597 ms]
(10) QDP
(11) QDPOrderProof [EQUIVALENT, 3024 ms]
(12) QDP
(13) QDPOrderProof [EQUIVALENT, 3995 ms]
(14) QDP
(15) QDPOrderProof [EQUIVALENT, 4003 ms]
(16) QDP
(17) QDPOrderProof [EQUIVALENT, 4558 ms]
(18) QDP
(19) QDPOrderProof [EQUIVALENT, 7443 ms]
(20) QDP
(21) DependencyGraphProof [EQUIVALENT, 0 ms]
(22) QDP
(23) QDPOrderProof [EQUIVALENT, 1194 ms]
(24) QDP
(25) QDPOrderProof [EQUIVALENT, 5228 ms]
(26) QDP
(27) QDPOrderProof [EQUIVALENT, 5302 ms]
(28) QDP
(29) QDPOrderProof [EQUIVALENT, 6906 ms]
(30) QDP
(31) QDPOrderProof [EQUIVALENT, 7886 ms]
(32) QDP
(33) QDPOrderProof [EQUIVALENT, 2745 ms]
(34) QDP
(35) DependencyGraphProof [EQUIVALENT, 0 ms]
(36) AND
    (37) QDP
        (38) QDPOrderProof [EQUIVALENT, 5426 ms]
        (39) QDP
        (40) PisEmptyProof [EQUIVALENT, 0 ms]
        (41) YES
    (42) QDP
        (43) QDPOrderProof [EQUIVALENT, 1373 ms]
        (44) QDP
        (45) QDPOrderProof [EQUIVALENT, 1220 ms]
        (46) QDP
        (47) QDPOrderProof [EQUIVALENT, 21 ms]
        (48) QDP
        (49) PisEmptyProof [EQUIVALENT, 0 ms]
        (50) YES


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

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

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

popout

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

job log

popout

actions all output return to SRS Stand 10685