details

property	value
status	complete
benchmark	tricky1.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n136.star.cs.uiowa.edu
space	Strategy_removed_mixed_05

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	0.569488048553 seconds
cpu usage	0.824534957
max memory	1.6623616E8

stage attributes

key	value
output-size	2535
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_ttt2 /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem: f(g(x),g(y)) -> f(p(f(g(x),s(y))),g(s(p(x)))) p(0()) -> g(0()) g(s(p(x))) -> p(x) Proof: DP Processor: DPs: f#(g(x),g(y)) -> p#(x) f#(g(x),g(y)) -> g#(s(p(x))) f#(g(x),g(y)) -> f#(g(x),s(y)) f#(g(x),g(y)) -> p#(f(g(x),s(y))) f#(g(x),g(y)) -> f#(p(f(g(x),s(y))),g(s(p(x)))) p#(0()) -> g#(0()) TRS: f(g(x),g(y)) -> f(p(f(g(x),s(y))),g(s(p(x)))) p(0()) -> g(0()) g(s(p(x))) -> p(x) TDG Processor: DPs: f#(g(x),g(y)) -> p#(x) f#(g(x),g(y)) -> g#(s(p(x))) f#(g(x),g(y)) -> f#(g(x),s(y)) f#(g(x),g(y)) -> p#(f(g(x),s(y))) f#(g(x),g(y)) -> f#(p(f(g(x),s(y))),g(s(p(x)))) p#(0()) -> g#(0()) TRS: f(g(x),g(y)) -> f(p(f(g(x),s(y))),g(s(p(x)))) p(0()) -> g(0()) g(s(p(x))) -> p(x) graph: f#(g(x),g(y)) -> p#(f(g(x),s(y))) -> p#(0()) -> g#(0()) f#(g(x),g(y)) -> p#(x) -> p#(0()) -> g#(0()) f#(g(x),g(y)) -> f#(p(f(g(x),s(y))),g(s(p(x)))) -> f#(g(x),g(y)) -> f#(p(f(g(x),s(y))),g(s(p(x)))) f#(g(x),g(y)) -> f#(p(f(g(x),s(y))),g(s(p(x)))) -> f#(g(x),g(y)) -> p#(f(g(x),s(y))) f#(g(x),g(y)) -> f#(p(f(g(x),s(y))),g(s(p(x)))) -> f#(g(x),g(y)) -> f#(g(x),s(y)) f#(g(x),g(y)) -> f#(p(f(g(x),s(y))),g(s(p(x)))) -> f#(g(x),g(y)) -> g#(s(p(x))) f#(g(x),g(y)) -> f#(p(f(g(x),s(y))),g(s(p(x)))) -> f#(g(x),g(y)) -> p#(x) f#(g(x),g(y)) -> f#(g(x),s(y)) -> f#(g(x),g(y)) -> f#(p(f(g(x),s(y))),g(s(p(x)))) f#(g(x),g(y)) -> f#(g(x),s(y)) -> f#(g(x),g(y)) -> p#(f(g(x),s(y))) f#(g(x),g(y)) -> f#(g(x),s(y)) -> f#(g(x),g(y)) -> f#(g(x),s(y)) f#(g(x),g(y)) -> f#(g(x),s(y)) -> f#(g(x),g(y)) -> g#(s(p(x))) f#(g(x),g(y)) -> f#(g(x),s(y)) -> f#(g(x),g(y)) -> p#(x) SCC Processor: #sccs: 1 #rules: 2 #arcs: 12/36 DPs: f#(g(x),g(y)) -> f#(p(f(g(x),s(y))),g(s(p(x)))) f#(g(x),g(y)) -> f#(g(x),s(y)) TRS: f(g(x),g(y)) -> f(p(f(g(x),s(y))),g(s(p(x)))) p(0()) -> g(0()) g(s(p(x))) -> p(x) EDG Processor: DPs: f#(g(x),g(y)) -> f#(p(f(g(x),s(y))),g(s(p(x)))) f#(g(x),g(y)) -> f#(g(x),s(y)) TRS: f(g(x),g(y)) -> f(p(f(g(x),s(y))),g(s(p(x)))) p(0()) -> g(0()) g(s(p(x))) -> p(x) graph: SCC Processor: #sccs: 0 #rules: 0 #arcs: 0/4 popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to TRS Standard