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	n116.star.cs.uiowa.edu
space	ICFP_2010

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	41.7338590622 seconds
cpu usage	162.452142262
max memory	4.120977408E9

stage attributes

key	value
output-size	405474
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: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRS Reverse [EQUIVALENT, 0 ms] (2) QTRS (3) FlatCCProof [EQUIVALENT, 0 ms] (4) QTRS (5) RootLabelingProof [EQUIVALENT, 35 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 10.3 s] (8) QTRS (9) QTRSRRRProof [EQUIVALENT, 34 ms] (10) QTRS (11) QTRSRRRProof [EQUIVALENT, 38 ms] (12) QTRS (13) QTRSRRRProof [EQUIVALENT, 52 ms] (14) QTRS (15) QTRSRRRProof [EQUIVALENT, 30 ms] (16) QTRS (17) QTRSRRRProof [EQUIVALENT, 15 ms] (18) QTRS (19) QTRSRRRProof [EQUIVALENT, 27 ms] (20) QTRS (21) DependencyPairsProof [EQUIVALENT, 13 ms] (22) QDP (23) DependencyGraphProof [EQUIVALENT, 0 ms] (24) QDP (25) UsableRulesProof [EQUIVALENT, 0 ms] (26) QDP (27) DependencyGraphProof [EQUIVALENT, 0 ms] (28) QDP (29) UsableRulesProof [EQUIVALENT, 0 ms] (30) QDP (31) QDPOrderProof [EQUIVALENT, 5 ms] (32) QDP (33) DependencyGraphProof [EQUIVALENT, 0 ms] (34) QDP (35) QDPOrderProof [EQUIVALENT, 0 ms] (36) QDP (37) DependencyGraphProof [EQUIVALENT, 0 ms] (38) QDP (39) QDPOrderProof [EQUIVALENT, 2 ms] (40) QDP (41) PisEmptyProof [EQUIVALENT, 0 ms] (42) 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))))) popout

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

job log

popout

actions

all output return to SRS Standard