SRS Standard pair #516970084

details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	14.4076399803 seconds
cpu usage	53.355219662
max memory	2.142519296E9

stage attributes

key	value
output-size	88987
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: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished


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

(0) QTRS
(1) DependencyPairsProof [EQUIVALENT, 296 ms]
(2) QDP
(3) DependencyGraphProof [EQUIVALENT, 0 ms]
(4) QDP
(5) QDPOrderProof [EQUIVALENT, 422 ms]
(6) QDP
(7) DependencyGraphProof [EQUIVALENT, 0 ms]
(8) QDP
(9) QDPOrderProof [EQUIVALENT, 262 ms]
(10) QDP
(11) DependencyGraphProof [EQUIVALENT, 0 ms]
(12) AND
    (13) QDP
        (14) QDPOrderProof [EQUIVALENT, 82 ms]
        (15) QDP
        (16) QDPOrderProof [EQUIVALENT, 66 ms]
        (17) QDP
        (18) QDPOrderProof [EQUIVALENT, 58 ms]
        (19) QDP
        (20) QDPOrderProof [EQUIVALENT, 49 ms]
        (21) QDP
        (22) QDPOrderProof [EQUIVALENT, 51 ms]
        (23) QDP
        (24) PisEmptyProof [EQUIVALENT, 0 ms]
        (25) YES
    (26) QDP
        (27) QDPOrderProof [EQUIVALENT, 67 ms]
        (28) QDP
        (29) PisEmptyProof [EQUIVALENT, 0 ms]
        (30) YES
    (31) QDP
        (32) QDPOrderProof [EQUIVALENT, 68 ms]
        (33) QDP
        (34) PisEmptyProof [EQUIVALENT, 0 ms]
        (35) YES
    (36) QDP
        (37) QDPOrderProof [EQUIVALENT, 69 ms]
        (38) QDP
        (39) PisEmptyProof [EQUIVALENT, 0 ms]
        (40) YES


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

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

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

popout

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

job log

popout

actions all output return to SRS Standard