Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381713229
details
property
value
status
complete
benchmark
perfect.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n106.star.cs.uiowa.edu
space
Mixed_TRS
run statistics
property
value
solver
ttt2-1.17+nonreach
configuration
ttt2-1.17+nonreach
runtime (wallclock)
0.677958965302 seconds
cpu usage
1.449270608
max memory
2.56835584E8
stage attributes
key
value
output-size
3897
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: perfectp(0()) -> false() perfectp(s(x)) -> f(x,s(0()),s(x),s(x)) f(0(),y,0(),u) -> true() f(0(),y,s(z),u) -> false() f(s(x),0(),z,u) -> f(x,u,minus(z,s(x)),u) f(s(x),s(y),z,u) -> if(le(x,y),f(s(x),minus(y,x),z,u),f(x,u,z,u)) Proof: DP Processor: DPs: perfectp#(s(x)) -> f#(x,s(0()),s(x),s(x)) f#(s(x),0(),z,u) -> f#(x,u,minus(z,s(x)),u) f#(s(x),s(y),z,u) -> f#(x,u,z,u) f#(s(x),s(y),z,u) -> f#(s(x),minus(y,x),z,u) TRS: perfectp(0()) -> false() perfectp(s(x)) -> f(x,s(0()),s(x),s(x)) f(0(),y,0(),u) -> true() f(0(),y,s(z),u) -> false() f(s(x),0(),z,u) -> f(x,u,minus(z,s(x)),u) f(s(x),s(y),z,u) -> if(le(x,y),f(s(x),minus(y,x),z,u),f(x,u,z,u)) TDG Processor: DPs: perfectp#(s(x)) -> f#(x,s(0()),s(x),s(x)) f#(s(x),0(),z,u) -> f#(x,u,minus(z,s(x)),u) f#(s(x),s(y),z,u) -> f#(x,u,z,u) f#(s(x),s(y),z,u) -> f#(s(x),minus(y,x),z,u) TRS: perfectp(0()) -> false() perfectp(s(x)) -> f(x,s(0()),s(x),s(x)) f(0(),y,0(),u) -> true() f(0(),y,s(z),u) -> false() f(s(x),0(),z,u) -> f(x,u,minus(z,s(x)),u) f(s(x),s(y),z,u) -> if(le(x,y),f(s(x),minus(y,x),z,u),f(x,u,z,u)) graph: f#(s(x),s(y),z,u) -> f#(s(x),minus(y,x),z,u) -> f#(s(x),s(y),z,u) -> f#(s(x),minus(y,x),z,u) f#(s(x),s(y),z,u) -> f#(s(x),minus(y,x),z,u) -> f#(s(x),s(y),z,u) -> f#(x,u,z,u) f#(s(x),s(y),z,u) -> f#(s(x),minus(y,x),z,u) -> f#(s(x),0(),z,u) -> f#(x,u,minus(z,s(x)),u) f#(s(x),s(y),z,u) -> f#(x,u,z,u) -> f#(s(x),s(y),z,u) -> f#(s(x),minus(y,x),z,u) f#(s(x),s(y),z,u) -> f#(x,u,z,u) -> f#(s(x),s(y),z,u) -> f#(x,u,z,u) f#(s(x),s(y),z,u) -> f#(x,u,z,u) -> f#(s(x),0(),z,u) -> f#(x,u,minus(z,s(x)),u) f#(s(x),0(),z,u) -> f#(x,u,minus(z,s(x)),u) -> f#(s(x),s(y),z,u) -> f#(s(x),minus(y,x),z,u) f#(s(x),0(),z,u) -> f#(x,u,minus(z,s(x)),u) -> f#(s(x),s(y),z,u) -> f#(x,u,z,u) f#(s(x),0(),z,u) -> f#(x,u,minus(z,s(x)),u) -> f#(s(x),0(),z,u) -> f#(x,u,minus(z,s(x)),u) perfectp#(s(x)) -> f#(x,s(0()),s(x),s(x)) -> f#(s(x),s(y),z,u) -> f#(s(x),minus(y,x),z,u) perfectp#(s(x)) -> f#(x,s(0()),s(x),s(x)) -> f#(s(x),s(y),z,u) -> f#(x,u,z,u) perfectp#(s(x)) -> f#(x,s(0()),s(x),s(x)) -> f#(s(x),0(),z,u) -> f#(x,u,minus(z,s(x)),u) SCC Processor: #sccs: 1 #rules: 3 #arcs: 12/16 DPs: f#(s(x),s(y),z,u) -> f#(s(x),minus(y,x),z,u) f#(s(x),0(),z,u) -> f#(x,u,minus(z,s(x)),u) f#(s(x),s(y),z,u) -> f#(x,u,z,u) TRS: perfectp(0()) -> false() perfectp(s(x)) -> f(x,s(0()),s(x),s(x)) f(0(),y,0(),u) -> true() f(0(),y,s(z),u) -> false() f(s(x),0(),z,u) -> f(x,u,minus(z,s(x)),u) f(s(x),s(y),z,u) -> if(le(x,y),f(s(x),minus(y,x),z,u),f(x,u,z,u)) Subterm Criterion Processor: simple projection: pi(f#) = 0 problem: DPs: f#(s(x),s(y),z,u) -> f#(s(x),minus(y,x),z,u) TRS: perfectp(0()) -> false() perfectp(s(x)) -> f(x,s(0()),s(x),s(x)) f(0(),y,0(),u) -> true() f(0(),y,s(z),u) -> false() f(s(x),0(),z,u) -> f(x,u,minus(z,s(x)),u) f(s(x),s(y),z,u) -> if(le(x,y),f(s(x),minus(y,x),z,u),f(x,u,z,u)) EDG Processor: DPs: f#(s(x),s(y),z,u) -> f#(s(x),minus(y,x),z,u) TRS: perfectp(0()) -> false()
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472