SRS Stand 10685 pair #381718399

details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	216.466789007 seconds
cpu usage	209.033401835
max memory	3.0203904E7

stage attributes

key	value
output-size	38845
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


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


YES

Problem 1: 

(VAR x1)
(RULES
0(3(x1)) -> 5(3(x1))
2(4(x1)) -> 0(7(x1))
2(7(x1)) -> 1(8(x1))
2(8(1(x1))) -> 8(x1)
2(8(x1)) -> 4(x1)
2(8(x1)) -> 7(x1)
4(7(x1)) -> 1(3(x1))
4(x1) -> 5(2(3(x1)))
4(x1) -> 9(6(6(x1)))
5(2(6(x1))) -> 6(2(4(x1)))
5(9(x1)) -> 0(x1)
5(3(x1)) -> 6(0(x1))
6(2(x1)) -> 7(7(x1))
6(6(x1)) -> 3(x1)
6(9(x1)) -> 9(x1)
7(0(x1)) -> 9(3(x1))
7(2(x1)) -> 4(x1)
9(5(9(x1))) -> 5(7(x1))
9(7(x1)) -> 7(5(x1))
9(x1) -> 6(7(x1))
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 0#(3(x1)) -> 5#(3(x1))
 2#(4(x1)) -> 0#(7(x1))
 2#(4(x1)) -> 7#(x1)
 2#(8(x1)) -> 4#(x1)
 2#(8(x1)) -> 7#(x1)
 4#(x1) -> 6#(6(x1))
 4#(x1) -> 6#(x1)
 4#(x1) -> 9#(6(6(x1)))
 5#(2(6(x1))) -> 2#(4(x1))
 5#(2(6(x1))) -> 4#(x1)
 5#(2(6(x1))) -> 6#(2(4(x1)))
 5#(9(x1)) -> 0#(x1)
 5#(3(x1)) -> 0#(x1)
 5#(3(x1)) -> 6#(0(x1))
 6#(2(x1)) -> 7#(7(x1))
 6#(2(x1)) -> 7#(x1)
 7#(0(x1)) -> 9#(3(x1))
 7#(2(x1)) -> 4#(x1)
 9#(5(9(x1))) -> 5#(7(x1))
 9#(5(9(x1))) -> 7#(x1)
 9#(7(x1)) -> 5#(x1)
 9#(7(x1)) -> 7#(5(x1))
 9#(x1) -> 6#(7(x1))
 9#(x1) -> 7#(x1)
-> Rules:
 0(3(x1)) -> 5(3(x1))
 2(4(x1)) -> 0(7(x1))
 2(7(x1)) -> 1(8(x1))
 2(8(1(x1))) -> 8(x1)
 2(8(x1)) -> 4(x1)
 2(8(x1)) -> 7(x1)
 4(7(x1)) -> 1(3(x1))
 4(x1) -> 5(2(3(x1)))
 4(x1) -> 9(6(6(x1)))
 5(2(6(x1))) -> 6(2(4(x1)))
 5(9(x1)) -> 0(x1)
 5(3(x1)) -> 6(0(x1))
 6(2(x1)) -> 7(7(x1))
 6(6(x1)) -> 3(x1)
 6(9(x1)) -> 9(x1)
 7(0(x1)) -> 9(3(x1))
 7(2(x1)) -> 4(x1)
 9(5(9(x1))) -> 5(7(x1))
 9(7(x1)) -> 7(5(x1))
 9(x1) -> 6(7(x1))

Problem 1: 

SCC Processor:
-> Pairs:
 0#(3(x1)) -> 5#(3(x1))
 2#(4(x1)) -> 0#(7(x1))
 2#(4(x1)) -> 7#(x1)
 2#(8(x1)) -> 4#(x1)
 2#(8(x1)) -> 7#(x1)
 4#(x1) -> 6#(6(x1))
 4#(x1) -> 6#(x1)
 4#(x1) -> 9#(6(6(x1)))
 5#(2(6(x1))) -> 2#(4(x1))
 5#(2(6(x1))) -> 4#(x1)
 5#(2(6(x1))) -> 6#(2(4(x1)))
 5#(9(x1)) -> 0#(x1)

popout

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

job log

popout

actions all output return to SRS Stand 10685