SRS Stand 10685 pair #381718198

details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	212.339173079 seconds
cpu usage	211.7305493
max memory	2.0740096E8

stage attributes

key	value
output-size	7128
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(0(0(0(x1)))) -> 0(1(1(1(x1))))
1(0(0(1(x1)))) -> 0(0(0(0(x1))))
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 0#(0(0(0(x1)))) -> 0#(1(1(1(x1))))
 0#(0(0(0(x1)))) -> 1#(1(1(x1)))
 0#(0(0(0(x1)))) -> 1#(1(x1))
 0#(0(0(0(x1)))) -> 1#(x1)
 1#(0(0(1(x1)))) -> 0#(0(0(0(x1))))
 1#(0(0(1(x1)))) -> 0#(0(0(x1)))
 1#(0(0(1(x1)))) -> 0#(0(x1))
 1#(0(0(1(x1)))) -> 0#(x1)
-> Rules:
 0(0(0(0(x1)))) -> 0(1(1(1(x1))))
 1(0(0(1(x1)))) -> 0(0(0(0(x1))))

Problem 1: 

SCC Processor:
-> Pairs:
 0#(0(0(0(x1)))) -> 0#(1(1(1(x1))))
 0#(0(0(0(x1)))) -> 1#(1(1(x1)))
 0#(0(0(0(x1)))) -> 1#(1(x1))
 0#(0(0(0(x1)))) -> 1#(x1)
 1#(0(0(1(x1)))) -> 0#(0(0(0(x1))))
 1#(0(0(1(x1)))) -> 0#(0(0(x1)))
 1#(0(0(1(x1)))) -> 0#(0(x1))
 1#(0(0(1(x1)))) -> 0#(x1)
-> Rules:
 0(0(0(0(x1)))) -> 0(1(1(1(x1))))
 1(0(0(1(x1)))) -> 0(0(0(0(x1))))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 0#(0(0(0(x1)))) -> 0#(1(1(1(x1))))
 0#(0(0(0(x1)))) -> 1#(1(1(x1)))
 0#(0(0(0(x1)))) -> 1#(1(x1))
 0#(0(0(0(x1)))) -> 1#(x1)
 1#(0(0(1(x1)))) -> 0#(0(0(0(x1))))
 1#(0(0(1(x1)))) -> 0#(0(0(x1)))
 1#(0(0(1(x1)))) -> 0#(0(x1))
 1#(0(0(1(x1)))) -> 0#(x1)
->->-> Rules:
 0(0(0(0(x1)))) -> 0(1(1(1(x1))))
 1(0(0(1(x1)))) -> 0(0(0(0(x1))))

Problem 1: 

Reduction Pair Processor:
-> Pairs:
 0#(0(0(0(x1)))) -> 0#(1(1(1(x1))))
 0#(0(0(0(x1)))) -> 1#(1(1(x1)))
 0#(0(0(0(x1)))) -> 1#(1(x1))
 0#(0(0(0(x1)))) -> 1#(x1)
 1#(0(0(1(x1)))) -> 0#(0(0(0(x1))))
 1#(0(0(1(x1)))) -> 0#(0(0(x1)))
 1#(0(0(1(x1)))) -> 0#(0(x1))
 1#(0(0(1(x1)))) -> 0#(x1)
-> Rules:
 0(0(0(0(x1)))) -> 0(1(1(1(x1))))
 1(0(0(1(x1)))) -> 0(0(0(0(x1))))
-> Usable rules:
 0(0(0(0(x1)))) -> 0(1(1(1(x1))))
 1(0(0(1(x1)))) -> 0(0(0(0(x1))))
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[0](X) = 2.X + 2
[1](X) = 2.X + 2
[0#](X) = X + 1
[1#](X) = 2.X + 2

Problem 1: 

SCC Processor:
-> Pairs:
 0#(0(0(0(x1)))) -> 0#(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