Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381710034
details
property
value
status
complete
benchmark
boolean_rings.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n101.star.cs.uiowa.edu
space
CiME_04
run statistics
property
value
solver
ttt2-1.17+nonreach
configuration
ttt2-1.17+nonreach
runtime (wallclock)
0.517153024673 seconds
cpu usage
0.86134051
max memory
1.7698816E8
stage attributes
key
value
output-size
3813
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: xor(x,F()) -> x xor(x,neg(x)) -> F() and(x,T()) -> x and(x,F()) -> F() and(x,x) -> x and(xor(x,y),z) -> xor(and(x,z),and(y,z)) xor(x,x) -> F() impl(x,y) -> xor(and(x,y),xor(x,T())) or(x,y) -> xor(and(x,y),xor(x,y)) equiv(x,y) -> xor(x,xor(y,T())) neg(x) -> xor(x,T()) Proof: DP Processor: DPs: and#(xor(x,y),z) -> and#(y,z) and#(xor(x,y),z) -> and#(x,z) and#(xor(x,y),z) -> xor#(and(x,z),and(y,z)) impl#(x,y) -> xor#(x,T()) impl#(x,y) -> and#(x,y) impl#(x,y) -> xor#(and(x,y),xor(x,T())) or#(x,y) -> xor#(x,y) or#(x,y) -> and#(x,y) or#(x,y) -> xor#(and(x,y),xor(x,y)) equiv#(x,y) -> xor#(y,T()) equiv#(x,y) -> xor#(x,xor(y,T())) neg#(x) -> xor#(x,T()) TRS: xor(x,F()) -> x xor(x,neg(x)) -> F() and(x,T()) -> x and(x,F()) -> F() and(x,x) -> x and(xor(x,y),z) -> xor(and(x,z),and(y,z)) xor(x,x) -> F() impl(x,y) -> xor(and(x,y),xor(x,T())) or(x,y) -> xor(and(x,y),xor(x,y)) equiv(x,y) -> xor(x,xor(y,T())) neg(x) -> xor(x,T()) TDG Processor: DPs: and#(xor(x,y),z) -> and#(y,z) and#(xor(x,y),z) -> and#(x,z) and#(xor(x,y),z) -> xor#(and(x,z),and(y,z)) impl#(x,y) -> xor#(x,T()) impl#(x,y) -> and#(x,y) impl#(x,y) -> xor#(and(x,y),xor(x,T())) or#(x,y) -> xor#(x,y) or#(x,y) -> and#(x,y) or#(x,y) -> xor#(and(x,y),xor(x,y)) equiv#(x,y) -> xor#(y,T()) equiv#(x,y) -> xor#(x,xor(y,T())) neg#(x) -> xor#(x,T()) TRS: xor(x,F()) -> x xor(x,neg(x)) -> F() and(x,T()) -> x and(x,F()) -> F() and(x,x) -> x and(xor(x,y),z) -> xor(and(x,z),and(y,z)) xor(x,x) -> F() impl(x,y) -> xor(and(x,y),xor(x,T())) or(x,y) -> xor(and(x,y),xor(x,y)) equiv(x,y) -> xor(x,xor(y,T())) neg(x) -> xor(x,T()) graph: or#(x,y) -> and#(x,y) -> and#(xor(x,y),z) -> xor#(and(x,z),and(y,z)) or#(x,y) -> and#(x,y) -> and#(xor(x,y),z) -> and#(x,z) or#(x,y) -> and#(x,y) -> and#(xor(x,y),z) -> and#(y,z) impl#(x,y) -> and#(x,y) -> and#(xor(x,y),z) -> xor#(and(x,z),and(y,z)) impl#(x,y) -> and#(x,y) -> and#(xor(x,y),z) -> and#(x,z) impl#(x,y) -> and#(x,y) -> and#(xor(x,y),z) -> and#(y,z) and#(xor(x,y),z) -> and#(y,z) -> and#(xor(x,y),z) -> xor#(and(x,z),and(y,z)) and#(xor(x,y),z) -> and#(y,z) -> and#(xor(x,y),z) -> and#(x,z) and#(xor(x,y),z) -> and#(y,z) -> and#(xor(x,y),z) -> and#(y,z) and#(xor(x,y),z) -> and#(x,z) -> and#(xor(x,y),z) -> xor#(and(x,z),and(y,z)) and#(xor(x,y),z) -> and#(x,z) -> and#(xor(x,y),z) -> and#(x,z) and#(xor(x,y),z) -> and#(x,z) -> and#(xor(x,y),z) -> and#(y,z) SCC Processor: #sccs: 1 #rules: 2 #arcs: 12/144 DPs: and#(xor(x,y),z) -> and#(y,z) and#(xor(x,y),z) -> and#(x,z) TRS: xor(x,F()) -> x xor(x,neg(x)) -> F() and(x,T()) -> x
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472