Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381714742
details
property
value
status
complete
benchmark
MYNAT_nosorts_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n090.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.492291927338 seconds
cpu usage
0.734498084
max memory
1.11058944E8
stage attributes
key
value
output-size
2377
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem: and(tt(),X) -> activate(X) plus(N,0()) -> N plus(N,s(M)) -> s(plus(N,M)) x(N,0()) -> 0() x(N,s(M)) -> plus(x(N,M),N) activate(X) -> X Proof: DP Processor: DPs: and#(tt(),X) -> activate#(X) plus#(N,s(M)) -> plus#(N,M) x#(N,s(M)) -> x#(N,M) x#(N,s(M)) -> plus#(x(N,M),N) TRS: and(tt(),X) -> activate(X) plus(N,0()) -> N plus(N,s(M)) -> s(plus(N,M)) x(N,0()) -> 0() x(N,s(M)) -> plus(x(N,M),N) activate(X) -> X TDG Processor: DPs: and#(tt(),X) -> activate#(X) plus#(N,s(M)) -> plus#(N,M) x#(N,s(M)) -> x#(N,M) x#(N,s(M)) -> plus#(x(N,M),N) TRS: and(tt(),X) -> activate(X) plus(N,0()) -> N plus(N,s(M)) -> s(plus(N,M)) x(N,0()) -> 0() x(N,s(M)) -> plus(x(N,M),N) activate(X) -> X graph: x#(N,s(M)) -> x#(N,M) -> x#(N,s(M)) -> plus#(x(N,M),N) x#(N,s(M)) -> x#(N,M) -> x#(N,s(M)) -> x#(N,M) x#(N,s(M)) -> plus#(x(N,M),N) -> plus#(N,s(M)) -> plus#(N,M) plus#(N,s(M)) -> plus#(N,M) -> plus#(N,s(M)) -> plus#(N,M) SCC Processor: #sccs: 2 #rules: 2 #arcs: 4/16 DPs: x#(N,s(M)) -> x#(N,M) TRS: and(tt(),X) -> activate(X) plus(N,0()) -> N plus(N,s(M)) -> s(plus(N,M)) x(N,0()) -> 0() x(N,s(M)) -> plus(x(N,M),N) activate(X) -> X Subterm Criterion Processor: simple projection: pi(x#) = 1 problem: DPs: TRS: and(tt(),X) -> activate(X) plus(N,0()) -> N plus(N,s(M)) -> s(plus(N,M)) x(N,0()) -> 0() x(N,s(M)) -> plus(x(N,M),N) activate(X) -> X Qed DPs: plus#(N,s(M)) -> plus#(N,M) TRS: and(tt(),X) -> activate(X) plus(N,0()) -> N plus(N,s(M)) -> s(plus(N,M)) x(N,0()) -> 0() x(N,s(M)) -> plus(x(N,M),N) activate(X) -> X Subterm Criterion Processor: simple projection: pi(plus#) = 1 problem: DPs: TRS: and(tt(),X) -> activate(X) plus(N,0()) -> N plus(N,s(M)) -> s(plus(N,M)) x(N,0()) -> 0() x(N,s(M)) -> plus(x(N,M),N) activate(X) -> X Qed
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472