Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381715869
details
property
value
status
complete
benchmark
Ex1_Zan97_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n091.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
ttt2-1.17+nonreach
configuration
ttt2-1.17+nonreach
runtime (wallclock)
0.448329925537 seconds
cpu usage
0.618795573
max memory
9.9078144E7
stage attributes
key
value
output-size
3886
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem: a__g(X) -> a__h(X) a__c() -> d() a__h(d()) -> a__g(c()) mark(g(X)) -> a__g(X) mark(h(X)) -> a__h(X) mark(c()) -> a__c() mark(d()) -> d() a__g(X) -> g(X) a__h(X) -> h(X) a__c() -> c() Proof: Matrix Interpretation Processor: dim=3 interpretation: [1 0 1] [0] [h](x0) = [0 0 0]x0 + [1] [0 0 0] [1], [1 0 0] [1] [mark](x0) = [0 1 0]x0 + [0] [0 0 0] [1], [1 0 1] [0] [g](x0) = [0 0 0]x0 + [1] [0 0 0] [1], [0] [c] = [0] [0], [0] [d] = [0] [1], [1] [a__c] = [0] [1], [1 0 1] [0] [a__h](x0) = [0 0 0]x0 + [1] [0 0 0] [1], [1 0 1] [1] [a__g](x0) = [0 0 0]x0 + [1] [0 0 0] [1] orientation: [1 0 1] [1] [1 0 1] [0] a__g(X) = [0 0 0]X + [1] >= [0 0 0]X + [1] = a__h(X) [0 0 0] [1] [0 0 0] [1] [1] [0] a__c() = [0] >= [0] = d() [1] [1] [1] [1] a__h(d()) = [1] >= [1] = a__g(c()) [1] [1] [1 0 1] [1] [1 0 1] [1] mark(g(X)) = [0 0 0]X + [1] >= [0 0 0]X + [1] = a__g(X) [0 0 0] [1] [0 0 0] [1] [1 0 1] [1] [1 0 1] [0] mark(h(X)) = [0 0 0]X + [1] >= [0 0 0]X + [1] = a__h(X) [0 0 0] [1] [0 0 0] [1] [1] [1] mark(c()) = [0] >= [0] = a__c() [1] [1] [1] [0] mark(d()) = [0] >= [0] = d() [1] [1] [1 0 1] [1] [1 0 1] [0] a__g(X) = [0 0 0]X + [1] >= [0 0 0]X + [1] = g(X) [0 0 0] [1] [0 0 0] [1] [1 0 1] [0] [1 0 1] [0] a__h(X) = [0 0 0]X + [1] >= [0 0 0]X + [1] = h(X) [0 0 0] [1] [0 0 0] [1] [1] [0] a__c() = [0] >= [0] = c() [1] [0] problem: a__h(d()) -> a__g(c()) mark(g(X)) -> a__g(X) mark(c()) -> a__c() a__h(X) -> h(X)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472