Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381709865
details
property
value
status
complete
benchmark
10.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n010.star.cs.uiowa.edu
space
Beerendonk_07
run statistics
property
value
solver
ttt2-1.17+nonreach
configuration
ttt2-1.17+nonreach
runtime (wallclock)
2.31839418411 seconds
cpu usage
7.76925482
max memory
7.50792704E8
stage attributes
key
value
output-size
13617
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: cond1(true(),x) -> cond2(even(x),x) cond2(true(),x) -> cond1(neq(x,0()),div2(x)) cond2(false(),x) -> cond1(neq(x,0()),p(x)) neq(0(),0()) -> false() neq(0(),s(x)) -> true() neq(s(x),0()) -> true() neq(s(x),s(y())) -> neq(x,y()) even(0()) -> true() even(s(0())) -> false() even(s(s(x))) -> even(x) div2(0()) -> 0() div2(s(0())) -> 0() div2(s(s(x))) -> s(div2(x)) p(0()) -> 0() p(s(x)) -> x Proof: DP Processor: DPs: cond1#(true(),x) -> even#(x) cond1#(true(),x) -> cond2#(even(x),x) cond2#(true(),x) -> div2#(x) cond2#(true(),x) -> neq#(x,0()) cond2#(true(),x) -> cond1#(neq(x,0()),div2(x)) cond2#(false(),x) -> p#(x) cond2#(false(),x) -> neq#(x,0()) cond2#(false(),x) -> cond1#(neq(x,0()),p(x)) neq#(s(x),s(y())) -> neq#(x,y()) even#(s(s(x))) -> even#(x) div2#(s(s(x))) -> div2#(x) TRS: cond1(true(),x) -> cond2(even(x),x) cond2(true(),x) -> cond1(neq(x,0()),div2(x)) cond2(false(),x) -> cond1(neq(x,0()),p(x)) neq(0(),0()) -> false() neq(0(),s(x)) -> true() neq(s(x),0()) -> true() neq(s(x),s(y())) -> neq(x,y()) even(0()) -> true() even(s(0())) -> false() even(s(s(x))) -> even(x) div2(0()) -> 0() div2(s(0())) -> 0() div2(s(s(x))) -> s(div2(x)) p(0()) -> 0() p(s(x)) -> x TDG Processor: DPs: cond1#(true(),x) -> even#(x) cond1#(true(),x) -> cond2#(even(x),x) cond2#(true(),x) -> div2#(x) cond2#(true(),x) -> neq#(x,0()) cond2#(true(),x) -> cond1#(neq(x,0()),div2(x)) cond2#(false(),x) -> p#(x) cond2#(false(),x) -> neq#(x,0()) cond2#(false(),x) -> cond1#(neq(x,0()),p(x)) neq#(s(x),s(y())) -> neq#(x,y()) even#(s(s(x))) -> even#(x) div2#(s(s(x))) -> div2#(x) TRS: cond1(true(),x) -> cond2(even(x),x) cond2(true(),x) -> cond1(neq(x,0()),div2(x)) cond2(false(),x) -> cond1(neq(x,0()),p(x)) neq(0(),0()) -> false() neq(0(),s(x)) -> true() neq(s(x),0()) -> true() neq(s(x),s(y())) -> neq(x,y()) even(0()) -> true() even(s(0())) -> false() even(s(s(x))) -> even(x) div2(0()) -> 0() div2(s(0())) -> 0() div2(s(s(x))) -> s(div2(x)) p(0()) -> 0() p(s(x)) -> x graph: neq#(s(x),s(y())) -> neq#(x,y()) -> neq#(s(x),s(y())) -> neq#(x,y()) div2#(s(s(x))) -> div2#(x) -> div2#(s(s(x))) -> div2#(x) cond2#(false(),x) -> neq#(x,0()) -> neq#(s(x),s(y())) -> neq#(x,y()) cond2#(false(),x) -> cond1#(neq(x,0()),p(x)) -> cond1#(true(),x) -> cond2#(even(x),x) cond2#(false(),x) -> cond1#(neq(x,0()),p(x)) -> cond1#(true(),x) -> even#(x) cond2#(true(),x) -> neq#(x,0()) -> neq#(s(x),s(y())) -> neq#(x,y()) cond2#(true(),x) -> div2#(x) -> div2#(s(s(x))) -> div2#(x) cond2#(true(),x) -> cond1#(neq(x,0()),div2(x)) -> cond1#(true(),x) -> cond2#(even(x),x) cond2#(true(),x) -> cond1#(neq(x,0()),div2(x)) -> cond1#(true(),x) -> even#(x)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472