Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381716764
details
property
value
status
complete
benchmark
Ex15_Luc98_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n096.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
ttt2-1.17+nonreach
configuration
ttt2-1.17+nonreach
runtime (wallclock)
3.99544095993 seconds
cpu usage
13.174010297
max memory
5.0876416E8
stage attributes
key
value
output-size
29372
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: active(and(true(),X)) -> mark(X) active(and(false(),Y)) -> mark(false()) active(if(true(),X,Y)) -> mark(X) active(if(false(),X,Y)) -> mark(Y) active(add(0(),X)) -> mark(X) active(add(s(X),Y)) -> mark(s(add(X,Y))) active(first(0(),X)) -> mark(nil()) active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) active(from(X)) -> mark(cons(X,from(s(X)))) active(and(X1,X2)) -> and(active(X1),X2) active(if(X1,X2,X3)) -> if(active(X1),X2,X3) active(add(X1,X2)) -> add(active(X1),X2) active(first(X1,X2)) -> first(active(X1),X2) active(first(X1,X2)) -> first(X1,active(X2)) and(mark(X1),X2) -> mark(and(X1,X2)) if(mark(X1),X2,X3) -> mark(if(X1,X2,X3)) add(mark(X1),X2) -> mark(add(X1,X2)) first(mark(X1),X2) -> mark(first(X1,X2)) first(X1,mark(X2)) -> mark(first(X1,X2)) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(true()) -> ok(true()) proper(false()) -> ok(false()) proper(if(X1,X2,X3)) -> if(proper(X1),proper(X2),proper(X3)) proper(add(X1,X2)) -> add(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(s(X)) -> s(proper(X)) proper(first(X1,X2)) -> first(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(from(X)) -> from(proper(X)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) if(ok(X1),ok(X2),ok(X3)) -> ok(if(X1,X2,X3)) add(ok(X1),ok(X2)) -> ok(add(X1,X2)) s(ok(X)) -> ok(s(X)) first(ok(X1),ok(X2)) -> ok(first(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) from(ok(X)) -> ok(from(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Proof: Matrix Interpretation Processor: dim=3 interpretation: [1 1 0] [0] [top](x0) = [0 1 0]x0 + [0] [0 0 0] [1], [1 0 1] [ok](x0) = [0 1 0]x0 [1 0 0] , [proper](x0) = x0 , [1 0 1] [0] [from](x0) = [0 0 0]x0 + [1] [1 0 0] [0], [1 0 0] [1 0 0] [cons](x0, x1) = [0 0 0]x0 + [0 0 0]x1 [0 0 1] [0 0 1] , [0] [nil] = [0] [0], [0] [first](x0, x1) = x0 + x1 + [1] [0], [1 0 0] [s](x0) = [0 0 0]x0 [0 0 1] , [0] [add](x0, x1) = x0 + x1 + [1] [0], [0] [0] = [0] [0], [0] [if](x0, x1, x2) = x0 + x1 + x2 + [1] [0], [0] [false] = [0] [0],
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472