SRS Standard pair #487515491

details
property	value
status	complete
benchmark	43621.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n125.star.cs.uiowa.edu
space	ICFP_2010
run statistics
property	value
solver	AProVE
configuration	standard
runtime (wallclock)	293.191926003 seconds
cpu usage	1131.40780577
max memory	1.9594072064E10
stage attributes
key	value
output-size	1073523
starexec-result	YES
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


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


YES
proof of /export/starexec/sandbox/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, 6 ms]
(4) QTRS
(5) QTRSRRRProof [EQUIVALENT, 903 ms]
(6) QTRS
(7) QTRSRRRProof [EQUIVALENT, 58 ms]
(8) QTRS
(9) DependencyPairsProof [EQUIVALENT, 1702 ms]
(10) QDP
(11) QDPOrderProof [EQUIVALENT, 1818 ms]
(12) QDP
(13) QDPOrderProof [EQUIVALENT, 1412 ms]
(14) QDP
(15) QDPOrderProof [EQUIVALENT, 605 ms]
(16) QDP
(17) QDPOrderProof [EQUIVALENT, 986 ms]
(18) QDP
(19) DependencyGraphProof [EQUIVALENT, 0 ms]
(20) AND
    (21) QDP
        (22) QDPOrderProof [EQUIVALENT, 58 ms]
        (23) QDP
        (24) QDPOrderProof [EQUIVALENT, 45 ms]
        (25) QDP
        (26) PisEmptyProof [EQUIVALENT, 0 ms]
        (27) YES
    (28) QDP
        (29) QDPOrderProof [EQUIVALENT, 98 ms]
        (30) QDP
        (31) QDPOrderProof [EQUIVALENT, 61 ms]
        (32) QDP
        (33) QDPOrderProof [EQUIVALENT, 55 ms]
        (34) QDP
        (35) QDPOrderProof [EQUIVALENT, 2734 ms]
        (36) QDP
        (37) PisEmptyProof [EQUIVALENT, 0 ms]
        (38) YES
    (39) QDP
        (40) QDPOrderProof [EQUIVALENT, 3442 ms]
        (41) QDP
        (42) PisEmptyProof [EQUIVALENT, 0 ms]
        (43) YES
    (44) QDP
        (45) QDPOrderProof [EQUIVALENT, 54 ms]
        (46) QDP
        (47) QDPOrderProof [EQUIVALENT, 53 ms]
        (48) QDP
        (49) QDPOrderProof [EQUIVALENT, 47 ms]
        (50) QDP
        (51) PisEmptyProof [EQUIVALENT, 0 ms]
        (52) YES


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

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

   0(0(0(0(0(0(0(1(0(1(0(1(1(0(1(0(1(0(1(0(x1)))))))))))))))))))) -> 0(0(0(0(1(0(0(0(1(0(0(0(1(1(1(1(1(1(0(0(x1))))))))))))))))))))
   0(0(0(0(0(0(0(1(1(0(1(0(1(0(0(1(1(1(0(0(x1)))))))))))))))))))) -> 0(0(0(0(0(0(0(0(1(0(1(0(1(0(1(1(0(1(0(0(x1))))))))))))))))))))
   0(0(0(0(0(0(0(1(1(1(0(1(1(0(0(1(1(1(1(0(x1)))))))))))))))))))) -> 0(0(1(1(0(0(0(0(1(1(1(0(0(0(0(0(0(1(1(1(x1))))))))))))))))))))
   0(0(0(0(0(1(1(0(1(1(1(1(0(1(0(0(0(0(1(0(x1)))))))))))))))))))) -> 0(1(1(1(1(0(0(0(0(1(1(0(0(0(0(0(0(1(1(0(x1))))))))))))))))))))
   0(0(0(0(1(0(0(0(0(0(1(1(1(1(0(0(1(1(1(1(x1)))))))))))))))))))) -> 0(0(1(0(0(0(0(0(0(1(0(0(0(1(0(1(0(0(1(0(x1))))))))))))))))))))
   0(0(0(0(1(0(1(0(1(0(1(1(1(1(1(0(1(0(0(0(x1)))))))))))))))))))) -> 0(0(0(1(1(0(1(1(1(1(0(1(1(0(0(0(1(0(0(0(x1))))))))))))))))))))
   0(0(0(0(1(0(1(0(1(1(1(0(0(0(1(0(1(0(1(1(x1)))))))))))))))))))) -> 0(1(1(1(1(0(1(0(0(0(0(0(0(0(1(1(0(1(1(1(x1))))))))))))))))))))
   0(0(0(0(1(1(0(0(1(0(1(1(1(1(0(0(0(1(1(1(x1)))))))))))))))))))) -> 1(0(0(1(1(0(0(0(0(0(0(0(0(1(1(1(0(0(1(1(x1))))))))))))))))))))
   0(0(0(1(0(0(0(0(1(1(1(0(0(0(1(1(0(1(1(0(x1)))))))))))))))))))) -> 1(1(1(1(0(0(0(1(0(1(0(0(0(0(0(0(0(0(0(0(x1))))))))))))))))))))
   0(0(0(1(0(0(0(1(0(0(0(1(1(0(1(0(0(1(0(1(x1)))))))))))))))))))) -> 0(0(1(1(1(1(0(0(1(0(0(0(0(0(0(0(0(0(1(1(x1))))))))))))))))))))
   0(0(0(1(0(0(0(1(0(1(0(0(0(1(0(0(1(0(1(0(x1)))))))))))))))))))) -> 0(1(1(0(0(1(0(0(1(0(0(0(0(0(0(0(1(1(1(0(x1))))))))))))))))))))
   0(0(0(1(0(0(0(1(1(1(0(1(1(1(0(0(0(0(0(1(x1)))))))))))))))))))) -> 0(0(0(1(0(0(0(0(0(0(0(1(1(0(1(0(1(0(0(0(x1))))))))))))))))))))
   0(0(0(1(0(1(0(0(0(0(1(0(0(1(1(0(1(0(1(0(x1)))))))))))))))))))) -> 0(1(0(0(0(0(0(0(0(0(0(0(1(0(1(1(1(1(1(0(x1))))))))))))))))))))
   0(0(0(1(0(1(0(0(1(1(0(0(1(1(0(0(0(1(0(0(x1)))))))))))))))))))) -> 0(0(0(1(0(0(0(0(0(1(0(0(0(1(1(1(1(0(0(1(x1))))))))))))))))))))
   0(0(0(1(0(1(0(1(0(1(1(1(0(1(0(0(0(1(0(1(x1)))))))))))))))))))) -> 0(0(1(0(1(1(1(1(0(0(1(1(1(0(0(0(1(0(0(1(x1))))))))))))))))))))
   0(0(0(1(0(1(1(1(0(0(0(1(0(1(1(1(0(1(1(0(x1)))))))))))))))))))) -> 0(1(1(0(0(1(0(0(0(1(0(0(1(1(0(1(1(0(0(1(x1))))))))))))))))))))
   0(0(0(1(1(0(0(1(1(0(0(0(0(0(0(1(1(0(0(1(x1)))))))))))))))))))) -> 0(0(1(0(0(0(0(0(1(0(0(0(0(0(1(1(0(0(0(1(x1))))))))))))))))))))
   0(0(0(1(1(0(1(1(0(1(0(0(0(1(0(1(0(1(0(0(x1)))))))))))))))))))) -> 0(1(0(1(1(0(1(1(0(0(0(0(1(1(0(0(0(0(1(0(x1))))))))))))))))))))
   0(0(0(1(1(0(1(1(1(0(1(0(0(0(0(0(0(0(1(1(x1)))))))))))))))))))) -> 0(0(0(0(1(0(0(0(0(0(0(0(0(1(0(1(0(0(1(1(x1))))))))))))))))))))
   0(0(0(1(1(1(0(1(0(0(1(0(1(1(1(1(1(1(0(1(x1)))))))))))))))))))) -> 1(0(0(1(0(0(1(0(1(0(0(0(0(1(0(1(1(0(1(1(x1))))))))))))))))))))
   0(0(0(1(1(1(0(1(1(0(0(1(1(0(0(0(1(1(1(1(x1)))))))))))))))))))) -> 1(1(1(0(0(0(1(0(0(0(0(1(0(0(1(0(0(1(0(0(x1))))))))))))))))))))
   0(0(1(0(0(0(0(1(0(1(1(1(0(0(1(0(1(0(0(0(x1)))))))))))))))))))) -> 0(1(0(0(0(0(0(1(0(0(1(1(1(1(0(1(0(0(0(0(x1))))))))))))))))))))
   0(0(1(0(0(0(0(1(1(0(0(1(1(1(0(0(0(0(1(1(x1)))))))))))))))))))) -> 0(0(0(0(1(1(1(1(0(0(1(0(0(0(0(1(0(0(0(0(x1))))))))))))))))))))
   0(0(1(0(0(0(1(1(0(0(0(1(0(0(1(0(1(0(0(1(x1)))))))))))))))))))) -> 0(1(1(0(0(0(0(0(1(1(0(0(0(0(0(1(0(1(0(1(x1))))))))))))))))))))
   0(0(1(0(0(0(1(1(1(1(1(1(0(0(0(0(1(1(1(1(x1)))))))))))))))))))) -> 0(0(1(0(0(1(1(1(0(0(1(1(0(1(0(1(0(0(0(0(x1))))))))))))))))))))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions all output return to SRS Standard