details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0234811306 seconds
cpu usage	0.021132742
max memory	2232320.0

stage attributes

key	value
output-size	8985
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR p x xs y) (RULES app(app(and,false),y) -> false app(app(and,true),true) -> true app(app(and,x),false) -> false app(app(forall,p),app(app(cons,x),xs)) -> app(app(and,app(p,x)),app(app(forall,p),xs)) app(app(forall,p),nil) -> true app(app(forsome,p),app(app(cons,x),xs)) -> app(app(or,app(p,x)),app(app(forsome,p),xs)) app(app(forsome,p),nil) -> false app(app(or,false),false) -> false app(app(or,true),y) -> true app(app(or,x),true) -> true ) Problem 1: Innermost Equivalent Processor: -> Rules: app(app(and,false),y) -> false app(app(and,true),true) -> true app(app(and,x),false) -> false app(app(forall,p),app(app(cons,x),xs)) -> app(app(and,app(p,x)),app(app(forall,p),xs)) app(app(forall,p),nil) -> true app(app(forsome,p),app(app(cons,x),xs)) -> app(app(or,app(p,x)),app(app(forsome,p),xs)) app(app(forsome,p),nil) -> false app(app(or,false),false) -> false app(app(or,true),y) -> true app(app(or,x),true) -> true -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: APP(app(forall,p),app(app(cons,x),xs)) -> APP(app(and,app(p,x)),app(app(forall,p),xs)) APP(app(forall,p),app(app(cons,x),xs)) -> APP(app(forall,p),xs) APP(app(forall,p),app(app(cons,x),xs)) -> APP(and,app(p,x)) APP(app(forall,p),app(app(cons,x),xs)) -> APP(p,x) APP(app(forsome,p),app(app(cons,x),xs)) -> APP(app(forsome,p),xs) APP(app(forsome,p),app(app(cons,x),xs)) -> APP(app(or,app(p,x)),app(app(forsome,p),xs)) APP(app(forsome,p),app(app(cons,x),xs)) -> APP(or,app(p,x)) APP(app(forsome,p),app(app(cons,x),xs)) -> APP(p,x) -> Rules: app(app(and,false),y) -> false app(app(and,true),true) -> true app(app(and,x),false) -> false app(app(forall,p),app(app(cons,x),xs)) -> app(app(and,app(p,x)),app(app(forall,p),xs)) app(app(forall,p),nil) -> true app(app(forsome,p),app(app(cons,x),xs)) -> app(app(or,app(p,x)),app(app(forsome,p),xs)) app(app(forsome,p),nil) -> false app(app(or,false),false) -> false app(app(or,true),y) -> true app(app(or,x),true) -> true Problem 1: SCC Processor: -> Pairs: APP(app(forall,p),app(app(cons,x),xs)) -> APP(app(and,app(p,x)),app(app(forall,p),xs)) APP(app(forall,p),app(app(cons,x),xs)) -> APP(app(forall,p),xs) APP(app(forall,p),app(app(cons,x),xs)) -> APP(and,app(p,x)) APP(app(forall,p),app(app(cons,x),xs)) -> APP(p,x) APP(app(forsome,p),app(app(cons,x),xs)) -> APP(app(forsome,p),xs) APP(app(forsome,p),app(app(cons,x),xs)) -> APP(app(or,app(p,x)),app(app(forsome,p),xs)) APP(app(forsome,p),app(app(cons,x),xs)) -> APP(or,app(p,x)) APP(app(forsome,p),app(app(cons,x),xs)) -> APP(p,x) -> Rules: app(app(and,false),y) -> false app(app(and,true),true) -> true app(app(and,x),false) -> false app(app(forall,p),app(app(cons,x),xs)) -> app(app(and,app(p,x)),app(app(forall,p),xs)) app(app(forall,p),nil) -> true app(app(forsome,p),app(app(cons,x),xs)) -> app(app(or,app(p,x)),app(app(forsome,p),xs)) app(app(forsome,p),nil) -> false app(app(or,false),false) -> false app(app(or,true),y) -> true app(app(or,x),true) -> true ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: APP(app(forall,p),app(app(cons,x),xs)) -> APP(app(forall,p),xs) APP(app(forall,p),app(app(cons,x),xs)) -> APP(p,x) APP(app(forsome,p),app(app(cons,x),xs)) -> APP(app(forsome,p),xs) APP(app(forsome,p),app(app(cons,x),xs)) -> APP(p,x) ->->-> Rules: app(app(and,false),y) -> false app(app(and,true),true) -> true app(app(and,x),false) -> false app(app(forall,p),app(app(cons,x),xs)) -> app(app(and,app(p,x)),app(app(forall,p),xs)) popout

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

job log

popout

actions

all output return to TRS Stand 20472