details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	15.3418149948 seconds
cpu usage	57.564460079
max memory	7.017259008E9

stage attributes

key	value
output-size	471398
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) FlatCCProof [EQUIVALENT, 0 ms] (4) QTRS (5) RootLabelingProof [EQUIVALENT, 22 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 1939 ms] (8) QTRS (9) QTRSRRRProof [EQUIVALENT, 16 ms] (10) QTRS (11) RisEmptyProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: 0(0(x1)) -> 1(1(0(x1))) 0(0(x1)) -> 1(1(1(1(x1)))) 2(0(2(x1))) -> 2(1(1(1(x1)))) 2(0(0(1(x1)))) -> 1(1(1(2(2(1(x1)))))) 2(2(2(1(x1)))) -> 2(1(1(2(1(x1))))) 0(0(0(2(0(x1))))) -> 1(2(2(1(1(2(x1)))))) 0(0(0(2(0(x1))))) -> 2(1(2(1(1(1(0(x1))))))) 0(1(0(1(0(1(x1)))))) -> 2(1(2(1(1(2(1(1(1(x1))))))))) 0(2(0(0(0(1(0(x1))))))) -> 1(1(1(2(1(1(0(0(x1)))))))) 0(2(0(0(1(2(2(x1))))))) -> 1(1(1(0(1(0(1(1(x1)))))))) 0(2(2(1(0(1(0(x1))))))) -> 0(2(2(1(2(1(1(1(x1)))))))) 1(0(1(2(0(0(1(x1))))))) -> 2(2(2(1(0(1(1(1(x1)))))))) 1(0(2(0(2(2(0(x1))))))) -> 0(1(1(1(1(1(0(0(1(x1))))))))) 2(1(0(2(0(2(1(x1))))))) -> 0(2(0(0(2(1(1(1(x1)))))))) 0(0(0(0(0(2(2(2(x1)))))))) -> 1(2(2(1(1(1(1(1(2(1(x1)))))))))) 0(0(1(2(2(0(1(2(x1)))))))) -> 2(0(0(1(2(2(1(1(1(x1))))))))) 2(1(2(1(0(2(1(2(x1)))))))) -> 1(0(1(2(1(1(1(2(1(x1))))))))) 0(0(2(2(1(0(0(2(0(x1))))))))) -> 1(2(0(0(1(2(1(1(0(1(1(x1))))))))))) 2(0(0(2(2(0(0(0(2(x1))))))))) -> 1(1(2(0(2(0(1(1(2(0(1(x1))))))))))) 2(2(2(0(2(0(1(2(2(x1))))))))) -> 2(1(2(1(1(1(2(1(1(2(x1)))))))))) 1(2(2(1(2(2(0(1(1(0(x1)))))))))) -> 1(2(1(2(0(1(1(0(1(1(1(1(x1)))))))))))) 0(1(0(0(1(2(1(0(2(1(2(x1))))))))))) -> 2(2(2(1(1(1(1(1(1(1(1(0(1(2(2(0(2(x1))))))))))))))))) 0(2(2(1(0(0(1(2(0(0(1(x1))))))))))) -> 0(1(0(1(2(2(1(1(2(1(1(1(x1)))))))))))) 1(1(2(0(2(0(0(0(0(0(2(x1))))))))))) -> 0(2(2(0(1(1(1(1(1(0(1(1(2(1(1(1(1(x1))))))))))))))))) 2(2(0(0(2(0(1(2(2(0(0(x1))))))))))) -> 2(2(1(2(2(1(2(1(1(1(1(1(1(x1))))))))))))) 0(0(0(0(2(0(2(1(2(2(0(0(x1)))))))))))) -> 1(0(2(2(1(1(1(1(1(0(2(1(1(0(x1)))))))))))))) 0(1(0(2(0(0(0(0(0(0(0(2(x1)))))))))))) -> 2(2(1(1(1(0(1(0(1(1(0(1(1(x1))))))))))))) 2(0(0(0(2(2(2(0(2(1(0(2(x1)))))))))))) -> 2(0(1(2(2(1(1(0(1(0(2(0(2(x1))))))))))))) 2(2(0(2(2(1(1(2(2(0(1(0(x1)))))))))))) -> 0(1(2(0(2(1(1(1(1(1(0(2(1(x1))))))))))))) 0(0(2(0(1(1(2(2(0(0(0(0(0(x1))))))))))))) -> 1(1(0(1(1(1(1(2(1(2(2(2(1(1(2(x1))))))))))))))) 0(1(2(2(2(2(1(2(0(0(0(1(2(x1))))))))))))) -> 1(1(1(2(1(2(2(0(2(0(0(0(1(2(x1)))))))))))))) 1(0(2(0(0(0(0(2(0(0(0(0(2(x1))))))))))))) -> 0(2(2(2(1(1(1(1(0(0(1(2(0(0(2(x1))))))))))))))) 2(2(0(0(0(2(2(1(2(0(2(2(1(x1))))))))))))) -> 2(0(1(2(0(1(1(0(2(2(1(1(1(2(1(x1))))))))))))))) 0(2(0(0(0(1(0(1(0(1(0(1(0(0(x1)))))))))))))) -> 2(0(1(1(1(0(0(1(2(0(2(0(1(1(1(2(1(1(x1)))))))))))))))))) 1(0(0(1(0(2(0(1(2(0(2(2(0(0(x1)))))))))))))) -> 1(2(1(1(1(1(1(1(0(2(2(1(0(0(2(2(2(x1))))))))))))))))) 2(0(1(0(2(0(2(0(0(0(0(0(0(2(x1)))))))))))))) -> 1(0(2(0(0(0(1(2(1(0(2(0(1(1(2(x1))))))))))))))) 0(1(1(1(2(2(0(2(0(2(1(1(2(2(0(x1))))))))))))))) -> 2(0(2(2(2(0(2(1(1(1(1(1(0(2(0(x1))))))))))))))) 1(0(1(0(0(1(0(2(0(1(0(0(2(1(2(x1))))))))))))))) -> 2(0(2(0(2(1(1(1(0(1(1(2(2(0(2(1(x1)))))))))))))))) 0(0(2(0(0(2(0(2(2(1(1(0(1(1(0(2(x1)))))))))))))))) -> 1(1(2(2(2(2(1(2(1(1(2(0(0(0(1(1(2(x1))))))))))))))))) 0(1(2(0(1(0(1(0(0(2(1(2(0(2(2(0(x1)))))))))))))))) -> 1(2(1(2(1(1(2(2(2(0(2(1(1(1(2(1(1(1(x1)))))))))))))))))) 0(2(1(1(0(1(0(2(2(2(0(2(2(0(0(0(x1)))))))))))))))) -> 0(1(1(0(0(1(0(1(1(1(2(2(2(1(1(1(2(2(2(x1))))))))))))))))))) 1(0(1(1(0(1(1(2(1(1(2(0(2(0(2(0(x1)))))))))))))))) -> 1(1(1(2(1(1(1(0(0(2(1(0(2(1(1(1(1(1(1(x1))))))))))))))))))) 1(2(0(1(0(0(2(2(0(1(1(0(1(0(1(1(x1)))))))))))))))) -> 1(0(1(1(1(2(2(1(1(2(2(1(1(2(1(2(1(x1))))))))))))))))) 2(0(0(2(2(0(0(2(2(0(2(2(2(1(2(2(x1)))))))))))))))) -> 2(2(1(0(1(1(1(0(0(1(0(0(0(1(2(2(1(1(x1)))))))))))))))))) 2(1(1(0(1(0(0(1(2(0(1(1(0(0(2(2(x1)))))))))))))))) -> 0(1(1(2(2(2(1(1(1(0(1(1(2(0(1(0(2(x1))))))))))))))))) 2(1(2(1(0(0(1(1(2(1(2(2(0(1(0(1(x1)))))))))))))))) -> 1(1(2(0(1(1(1(0(0(1(2(1(2(2(2(1(1(x1))))))))))))))))) 0(0(0(0(1(2(2(2(1(2(0(2(1(1(1(0(2(x1))))))))))))))))) -> 2(2(1(0(1(1(0(2(2(1(2(0(1(1(1(2(0(2(x1)))))))))))))))))) 0(0(0(0(2(0(0(0(2(2(2(2(2(1(0(2(0(x1))))))))))))))))) -> 2(0(1(0(1(1(0(0(1(1(2(2(2(2(2(1(2(1(1(0(x1)))))))))))))))))))) 0(0(2(2(0(2(2(1(2(2(0(0(0(1(0(0(0(x1))))))))))))))))) -> 0(1(1(2(0(0(1(0(2(1(1(2(1(2(0(1(1(0(1(1(1(x1))))))))))))))))))))) 0(2(2(1(2(2(1(1(2(1(2(1(0(0(2(2(2(x1))))))))))))))))) -> 0(2(0(2(2(1(0(1(1(2(1(2(2(2(1(2(2(x1))))))))))))))))) 1(2(1(2(0(1(0(1(0(0(2(0(1(0(0(2(0(x1))))))))))))))))) -> 2(1(1(2(0(2(2(0(1(1(0(1(0(1(2(2(1(2(x1)))))))))))))))))) 2(1(0(2(2(2(1(0(2(1(0(1(0(2(0(0(2(x1))))))))))))))))) -> 0(2(2(2(2(1(0(1(1(2(2(0(2(1(0(1(1(1(1(x1))))))))))))))))))) 2(1(1(0(2(1(2(0(2(0(0(0(0(2(0(2(0(x1))))))))))))))))) -> 1(1(1(1(0(1(1(2(1(0(0(1(0(0(0(1(2(0(x1)))))))))))))))))) 2(1(2(0(1(0(1(2(2(2(2(1(2(0(2(1(0(x1))))))))))))))))) -> 0(2(0(2(2(1(1(0(1(1(1(1(0(1(1(0(0(2(1(1(0(x1))))))))))))))))))))) 0(0(0(1(2(0(2(0(0(0(1(2(1(2(1(0(2(2(x1)))))))))))))))))) -> 0(0(1(0(0(2(1(1(2(2(1(0(1(1(1(1(2(2(2(2(1(1(x1)))))))))))))))))))))) 0(0(1(0(2(1(1(0(2(0(0(2(1(0(2(1(0(1(x1)))))))))))))))))) -> 2(1(2(1(0(1(2(2(1(0(1(2(0(1(1(1(0(1(1(x1))))))))))))))))))) 0(0(2(2(1(2(0(0(2(2(1(0(0(2(2(2(0(0(x1)))))))))))))))))) -> 0(1(1(0(2(2(2(1(1(2(2(0(2(1(1(2(0(1(1(1(x1)))))))))))))))))))) 0(1(1(0(2(2(1(0(2(1(0(2(0(2(2(0(2(0(x1)))))))))))))))))) -> 0(2(1(1(2(0(0(1(0(1(1(1(1(1(2(0(1(2(1(1(1(1(1(0(1(0(x1)))))))))))))))))))))))))) 0(2(1(0(0(1(2(0(1(1(2(0(0(1(0(2(2(0(x1)))))))))))))))))) -> 0(2(1(1(1(2(2(2(1(1(1(0(1(2(0(2(0(2(1(0(x1)))))))))))))))))))) 1(0(1(0(2(2(2(0(0(2(0(1(0(0(2(0(2(2(x1)))))))))))))))))) -> 1(0(1(2(0(1(2(2(1(1(2(1(1(1(1(0(0(2(2(x1))))))))))))))))))) 1(0(2(1(0(2(0(1(0(1(2(1(2(0(0(1(2(0(x1)))))))))))))))))) -> 1(0(0(1(1(1(1(2(2(0(1(2(2(2(0(0(1(0(0(x1))))))))))))))))))) 2(0(0(2(0(0(1(0(2(0(1(2(0(0(1(0(1(0(x1)))))))))))))))))) -> 0(2(0(1(0(0(2(0(0(1(2(1(1(0(2(1(1(1(0(x1))))))))))))))))))) 1(0(2(2(2(2(2(2(2(2(1(0(1(2(1(0(1(2(1(x1))))))))))))))))))) -> 1(0(2(2(2(1(2(2(0(2(2(1(2(0(2(1(1(2(1(x1))))))))))))))))))) 1(2(1(0(0(0(0(2(1(0(1(0(1(2(1(0(1(0(2(x1))))))))))))))))))) -> 0(1(1(1(2(1(1(1(1(2(1(1(2(0(2(1(1(1(2(2(1(2(2(0(2(x1))))))))))))))))))))))))) 2(0(2(2(1(2(0(2(2(2(2(1(2(0(0(1(0(1(0(x1))))))))))))))))))) -> 1(1(2(2(0(2(2(2(2(0(1(0(2(1(0(0(0(1(1(1(1(1(1(x1))))))))))))))))))))))) popout

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

job log

popout

actions

all output return to SRS Stand 10685