Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381711844
details
property
value
status
complete
benchmark
logarquot.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n004.star.cs.uiowa.edu
space
Rubio_04
run statistics
property
value
solver
ttt2-1.17+nonreach
configuration
ttt2-1.17+nonreach
runtime (wallclock)
1.449229002 seconds
cpu usage
4.358038292
max memory
3.78683392E8
stage attributes
key
value
output-size
3935
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: min(X,0()) -> X min(s(X),s(Y)) -> min(X,Y) quot(0(),s(Y)) -> 0() quot(s(X),s(Y)) -> s(quot(min(X,Y),s(Y))) log(s(0())) -> 0() log(s(s(X))) -> s(log(s(quot(X,s(s(0())))))) Proof: DP Processor: DPs: min#(s(X),s(Y)) -> min#(X,Y) quot#(s(X),s(Y)) -> min#(X,Y) quot#(s(X),s(Y)) -> quot#(min(X,Y),s(Y)) log#(s(s(X))) -> quot#(X,s(s(0()))) log#(s(s(X))) -> log#(s(quot(X,s(s(0()))))) TRS: min(X,0()) -> X min(s(X),s(Y)) -> min(X,Y) quot(0(),s(Y)) -> 0() quot(s(X),s(Y)) -> s(quot(min(X,Y),s(Y))) log(s(0())) -> 0() log(s(s(X))) -> s(log(s(quot(X,s(s(0())))))) TDG Processor: DPs: min#(s(X),s(Y)) -> min#(X,Y) quot#(s(X),s(Y)) -> min#(X,Y) quot#(s(X),s(Y)) -> quot#(min(X,Y),s(Y)) log#(s(s(X))) -> quot#(X,s(s(0()))) log#(s(s(X))) -> log#(s(quot(X,s(s(0()))))) TRS: min(X,0()) -> X min(s(X),s(Y)) -> min(X,Y) quot(0(),s(Y)) -> 0() quot(s(X),s(Y)) -> s(quot(min(X,Y),s(Y))) log(s(0())) -> 0() log(s(s(X))) -> s(log(s(quot(X,s(s(0())))))) graph: log#(s(s(X))) -> log#(s(quot(X,s(s(0()))))) -> log#(s(s(X))) -> log#(s(quot(X,s(s(0()))))) log#(s(s(X))) -> log#(s(quot(X,s(s(0()))))) -> log#(s(s(X))) -> quot#(X,s(s(0()))) log#(s(s(X))) -> quot#(X,s(s(0()))) -> quot#(s(X),s(Y)) -> quot#(min(X,Y),s(Y)) log#(s(s(X))) -> quot#(X,s(s(0()))) -> quot#(s(X),s(Y)) -> min#(X,Y) quot#(s(X),s(Y)) -> quot#(min(X,Y),s(Y)) -> quot#(s(X),s(Y)) -> quot#(min(X,Y),s(Y)) quot#(s(X),s(Y)) -> quot#(min(X,Y),s(Y)) -> quot#(s(X),s(Y)) -> min#(X,Y) quot#(s(X),s(Y)) -> min#(X,Y) -> min#(s(X),s(Y)) -> min#(X,Y) min#(s(X),s(Y)) -> min#(X,Y) -> min#(s(X),s(Y)) -> min#(X,Y) SCC Processor: #sccs: 3 #rules: 3 #arcs: 8/25 DPs: log#(s(s(X))) -> log#(s(quot(X,s(s(0()))))) TRS: min(X,0()) -> X min(s(X),s(Y)) -> min(X,Y) quot(0(),s(Y)) -> 0() quot(s(X),s(Y)) -> s(quot(min(X,Y),s(Y))) log(s(0())) -> 0() log(s(s(X))) -> s(log(s(quot(X,s(s(0())))))) Subterm Criterion Processor: simple projection: pi(min) = 0 pi(s) = [0,0,0] pi(quot) = [0,0] pi(log#) = [0,0,0] problem: DPs: TRS: min(X,0()) -> X min(s(X),s(Y)) -> min(X,Y) quot(0(),s(Y)) -> 0() quot(s(X),s(Y)) -> s(quot(min(X,Y),s(Y))) log(s(0())) -> 0() log(s(s(X))) -> s(log(s(quot(X,s(s(0())))))) Qed DPs: quot#(s(X),s(Y)) -> quot#(min(X,Y),s(Y)) TRS: min(X,0()) -> X min(s(X),s(Y)) -> min(X,Y) quot(0(),s(Y)) -> 0() quot(s(X),s(Y)) -> s(quot(min(X,Y),s(Y))) log(s(0())) -> 0() log(s(s(X))) -> s(log(s(quot(X,s(s(0()))))))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472