details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	47.6793 seconds
cpu usage	184.839
user time	177.541
system time	7.29867
max virtual memory	2.1185128E7
max residence set size	9875636.0

stage attributes

key	value
starexec-result	YES

output

YES proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination of the given RelTRS could be proven: (0) RelTRS (1) RelTRS Reverse [EQUIVALENT, 0 ms] (2) RelTRS (3) FlatCCProof [EQUIVALENT, 285 ms] (4) RelTRS (5) RootLabelingProof [EQUIVALENT, 3920 ms] (6) RelTRS (7) RelTRSRRRProof [EQUIVALENT, 4220 ms] (8) RelTRS (9) RelTRSRRRProof [EQUIVALENT, 45 ms] (10) RelTRS (11) RelTRSRRRProof [EQUIVALENT, 0 ms] (12) RelTRS (13) RelTRSRRRProof [EQUIVALENT, 9 ms] (14) RelTRS (15) SIsEmptyProof [EQUIVALENT, 0 ms] (16) QTRS (17) RFCMatchBoundsTRSProof [EQUIVALENT, 17 ms] (18) YES ---------------------------------------- (0) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: 0(1(1(2(x1)))) -> 0(2(3(0(2(0(0(0(2(0(x1)))))))))) 1(1(3(3(1(x1))))) -> 5(3(3(2(3(0(2(2(2(0(x1)))))))))) 1(3(3(4(4(x1))))) -> 0(3(5(5(3(0(2(0(0(1(x1)))))))))) 3(1(3(5(2(x1))))) -> 5(3(1(5(3(0(0(2(2(2(x1)))))))))) 4(2(3(3(3(x1))))) -> 5(0(3(0(2(0(0(2(0(0(x1)))))))))) 0(1(2(1(1(4(x1)))))) -> 0(0(4(2(3(0(2(2(0(4(x1)))))))))) 2(4(4(3(4(2(x1)))))) -> 2(4(5(0(3(0(0(2(2(0(x1)))))))))) 3(3(0(3(3(3(x1)))))) -> 5(1(4(5(4(0(3(0(2(0(x1)))))))))) 3(5(2(5(4(1(x1)))))) -> 3(0(2(0(0(4(2(3(0(0(x1)))))))))) 0(1(3(1(3(1(0(x1))))))) -> 2(3(0(2(0(1(4(3(1(0(x1)))))))))) 0(1(3(3(3(5(3(x1))))))) -> 0(0(0(4(0(2(4(2(3(0(x1)))))))))) 0(1(3(3(4(3(4(x1))))))) -> 0(3(0(2(0(4(2(0(2(4(x1)))))))))) 0(2(3(3(5(1(3(x1))))))) -> 2(3(2(0(2(0(0(0(5(3(x1)))))))))) 1(1(1(3(1(2(1(x1))))))) -> 1(2(5(3(0(2(2(2(5(1(x1)))))))))) 1(1(3(1(2(3(3(x1))))))) -> 3(0(2(1(5(3(2(5(3(0(x1)))))))))) 1(1(3(3(4(0(1(x1))))))) -> 3(2(1(0(5(1(2(3(2(2(x1)))))))))) 1(2(4(3(4(3(3(x1))))))) -> 3(0(2(1(0(1(1(5(5(3(x1)))))))))) 1(3(0(5(4(1(3(x1))))))) -> 1(3(2(4(0(0(2(2(5(3(x1)))))))))) 1(3(3(0(3(2(4(x1))))))) -> 1(5(2(3(2(4(0(0(0(2(x1)))))))))) 1(3(3(3(3(1(3(x1))))))) -> 1(3(0(2(4(1(4(2(2(3(x1)))))))))) 1(3(3(3(3(4(4(x1))))))) -> 1(0(0(4(5(5(5(1(1(4(x1)))))))))) 1(3(3(4(1(1(2(x1))))))) -> 3(1(5(2(4(3(0(2(2(0(x1)))))))))) 1(3(3(5(1(1(1(x1))))))) -> 1(0(0(3(1(0(0(2(2(2(x1)))))))))) 1(3(4(4(1(3(5(x1))))))) -> 1(3(3(3(0(2(0(2(1(5(x1)))))))))) 1(3(5(0(2(3(4(x1))))))) -> 3(3(4(5(5(5(0(3(5(4(x1)))))))))) 1(3(5(1(1(5(1(x1))))))) -> 1(0(0(4(4(0(0(4(0(0(x1)))))))))) 1(3(5(1(3(4(3(x1))))))) -> 2(5(0(0(5(5(5(1(1(3(x1)))))))))) 2(1(3(3(3(3(1(x1))))))) -> 2(3(0(2(0(4(0(0(3(1(x1)))))))))) 2(3(1(1(1(1(0(x1))))))) -> 2(1(5(0(3(5(5(4(0(0(x1)))))))))) 2(3(1(3(3(1(1(x1))))))) -> 2(2(2(2(2(0(5(5(5(1(x1)))))))))) 2(3(3(5(1(3(3(x1))))))) -> 2(4(4(5(5(3(4(3(2(3(x1)))))))))) 2(4(3(3(4(2(5(x1))))))) -> 0(4(2(4(0(2(5(1(0(5(x1)))))))))) 2(5(2(0(3(5(1(x1))))))) -> 2(5(2(0(4(0(2(0(0(2(x1)))))))))) 3(1(3(1(1(1(4(x1))))))) -> 5(3(5(3(0(0(4(0(1(4(x1)))))))))) 3(1(3(1(4(4(0(x1))))))) -> 3(2(1(4(0(2(0(0(4(2(x1)))))))))) 3(2(5(4(4(2(4(x1))))))) -> 5(3(1(0(2(2(2(0(0(4(x1)))))))))) 3(3(3(3(4(5(2(x1))))))) -> 5(5(1(1(2(4(0(0(2(1(x1)))))))))) 3(3(5(1(5(1(1(x1))))))) -> 5(3(0(2(4(5(5(4(3(1(x1)))))))))) 3(3(5(2(5(0(4(x1))))))) -> 5(5(1(0(1(5(5(3(0(2(x1)))))))))) 3(3(5(3(0(1(1(x1))))))) -> 5(1(4(5(5(3(5(4(5(1(x1)))))))))) 3(4(1(1(3(1(1(x1))))))) -> 1(2(2(4(5(3(5(5(5(1(x1)))))))))) 3(4(2(0(4(1(1(x1))))))) -> 5(3(3(0(2(0(2(5(5(1(x1)))))))))) 3(4(2(5(0(2(3(x1))))))) -> 5(5(1(0(0(5(3(5(5(3(x1)))))))))) 4(1(1(1(4(5(1(x1))))))) -> 5(3(0(4(3(0(2(4(0(2(x1)))))))))) 4(2(1(3(3(3(4(x1))))))) -> 5(4(2(0(0(0(5(1(4(5(x1)))))))))) 4(3(3(5(1(4(1(x1))))))) -> 5(3(5(0(0(5(3(2(0(4(x1)))))))))) 4(4(0(4(3(3(3(x1))))))) -> 4(5(3(0(2(2(3(2(1(3(x1)))))))))) 4(4(3(3(3(4(1(x1))))))) -> 4(0(1(0(2(1(0(2(0(2(x1)))))))))) 4(5(1(5(2(4(3(x1))))))) -> 4(3(3(0(2(0(0(0(0(3(x1)))))))))) 4(5(2(0(3(2(5(x1))))))) -> 5(0(3(4(5(4(0(0(0(5(x1)))))))))) 4(5(2(5(4(1(3(x1))))))) -> 5(0(3(2(1(4(3(0(2(4(x1)))))))))) 5(0(1(3(2(5(4(x1))))))) -> 4(2(3(0(0(0(0(2(5(1(x1)))))))))) 5(1(1(1(1(5(0(x1))))))) -> 3(4(5(5(4(2(0(0(5(0(x1)))))))))) 5(1(1(2(1(1(1(x1))))))) -> 0(5(0(0(5(1(2(0(2(1(x1)))))))))) 5(2(1(3(5(2(2(x1))))))) -> 4(2(1(2(3(0(0(0(0(0(x1)))))))))) The relative TRS consists of the following S rules: 2(3(1(1(x1)))) -> 1(4(5(5(3(0(0(2(0(0(x1)))))))))) 3(2(1(1(3(x1))))) -> 3(0(2(0(2(0(1(0(4(0(x1)))))))))) 0(1(1(1(3(3(3(x1))))))) -> 3(5(4(5(3(2(1(5(2(3(x1)))))))))) 0(3(5(1(1(2(4(x1))))))) -> 0(5(4(0(0(5(2(0(0(4(x1)))))))))) 1(1(4(5(2(1(5(x1))))))) -> 5(1(2(1(4(0(2(0(1(5(x1)))))))))) popout

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

job log

popout

actions

all output return to SRS Relative