details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.35168 seconds
cpu usage	6.40258
user time	6.13362
system time	0.268958
max virtual memory	1.9011064E7
max residence set size	695904.0

stage attributes

key	value
starexec-result	YES

output

YES proof of /export/starexec/sandbox2/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) QTRS Reverse [EQUIVALENT, 0 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 67 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) QDP (7) UsableRulesProof [EQUIVALENT, 0 ms] (8) QDP (9) QDPSizeChangeProof [EQUIVALENT, 0 ms] (10) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: 4(2(4(x1))) -> 2(0(0(5(3(3(5(2(0(4(x1)))))))))) 4(4(2(4(2(x1))))) -> 2(0(5(2(1(4(0(2(0(1(x1)))))))))) 0(5(4(2(4(3(x1)))))) -> 5(1(5(5(3(5(3(0(0(0(x1)))))))))) 1(1(4(5(3(3(x1)))))) -> 1(3(1(1(3(0(1(2(2(1(x1)))))))))) 3(1(4(3(1(2(x1)))))) -> 0(0(1(1(4(2(3(0(0(3(x1)))))))))) 3(2(4(2(4(1(x1)))))) -> 0(2(1(1(1(5(3(1(3(3(x1)))))))))) 3(3(0(4(1(2(x1)))))) -> 3(5(1(2(0(2(0(5(3(1(x1)))))))))) 4(1(4(5(0(5(4(x1))))))) -> 4(1(5(3(1(0(5(3(1(0(x1)))))))))) 4(4(0(5(4(2(2(x1))))))) -> 4(0(4(3(4(4(4(5(4(1(x1)))))))))) 5(4(5(3(2(4(3(x1))))))) -> 2(5(5(5(0(4(5(0(1(4(x1)))))))))) Q is empty. ---------------------------------------- (1) QTRS Reverse (EQUIVALENT) We applied the QTRS Reverse Processor [REVERSE]. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: 4(2(4(x1))) -> 4(0(2(5(3(3(5(0(0(2(x1)))))))))) 2(4(2(4(4(x1))))) -> 1(0(2(0(4(1(2(5(0(2(x1)))))))))) 3(4(2(4(5(0(x1)))))) -> 0(0(0(3(5(3(5(5(1(5(x1)))))))))) 3(3(5(4(1(1(x1)))))) -> 1(2(2(1(0(3(1(1(3(1(x1)))))))))) 2(1(3(4(1(3(x1)))))) -> 3(0(0(3(2(4(1(1(0(0(x1)))))))))) 1(4(2(4(2(3(x1)))))) -> 3(3(1(3(5(1(1(1(2(0(x1)))))))))) 2(1(4(0(3(3(x1)))))) -> 1(3(5(0(2(0(2(1(5(3(x1)))))))))) 4(5(0(5(4(1(4(x1))))))) -> 0(1(3(5(0(1(3(5(1(4(x1)))))))))) 2(2(4(5(0(4(4(x1))))))) -> 1(4(5(4(4(4(3(4(0(4(x1)))))))))) 3(4(2(3(5(4(5(x1))))))) -> 4(1(0(5(4(0(5(5(5(2(x1)))))))))) Q is empty. ---------------------------------------- (3) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (4) Obligation: Q DP problem: The TRS P consists of the following rules: 4^1(2(4(x1))) -> 4^1(0(2(5(3(3(5(0(0(2(x1)))))))))) 4^1(2(4(x1))) -> 2^1(5(3(3(5(0(0(2(x1)))))))) 4^1(2(4(x1))) -> 3^1(3(5(0(0(2(x1)))))) 4^1(2(4(x1))) -> 3^1(5(0(0(2(x1))))) 4^1(2(4(x1))) -> 2^1(x1) 2^1(4(2(4(4(x1))))) -> 1^1(0(2(0(4(1(2(5(0(2(x1)))))))))) 2^1(4(2(4(4(x1))))) -> 2^1(0(4(1(2(5(0(2(x1)))))))) 2^1(4(2(4(4(x1))))) -> 4^1(1(2(5(0(2(x1)))))) 2^1(4(2(4(4(x1))))) -> 1^1(2(5(0(2(x1))))) 2^1(4(2(4(4(x1))))) -> 2^1(5(0(2(x1)))) 2^1(4(2(4(4(x1))))) -> 2^1(x1) 3^1(4(2(4(5(0(x1)))))) -> 3^1(5(3(5(5(1(5(x1))))))) 3^1(4(2(4(5(0(x1)))))) -> 3^1(5(5(1(5(x1))))) 3^1(4(2(4(5(0(x1)))))) -> 1^1(5(x1)) 3^1(3(5(4(1(1(x1)))))) -> 1^1(2(2(1(0(3(1(1(3(1(x1)))))))))) 3^1(3(5(4(1(1(x1)))))) -> 2^1(2(1(0(3(1(1(3(1(x1))))))))) 3^1(3(5(4(1(1(x1)))))) -> 2^1(1(0(3(1(1(3(1(x1)))))))) 3^1(3(5(4(1(1(x1)))))) -> 1^1(0(3(1(1(3(1(x1))))))) 3^1(3(5(4(1(1(x1)))))) -> 3^1(1(1(3(1(x1))))) 3^1(3(5(4(1(1(x1)))))) -> 1^1(1(3(1(x1)))) 3^1(3(5(4(1(1(x1)))))) -> 1^1(3(1(x1))) 3^1(3(5(4(1(1(x1)))))) -> 3^1(1(x1)) 2^1(1(3(4(1(3(x1)))))) -> 3^1(0(0(3(2(4(1(1(0(0(x1)))))))))) 2^1(1(3(4(1(3(x1)))))) -> 3^1(2(4(1(1(0(0(x1))))))) 2^1(1(3(4(1(3(x1)))))) -> 2^1(4(1(1(0(0(x1)))))) popout

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

job log

popout

actions

all output return to SRS Standard