Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Innermost pair #487524034
details
property
value
status
complete
benchmark
#4.25.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n146.star.cs.uiowa.edu
space
AG01_innermost
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
0.199452877045 seconds
cpu usage
0.120973208
max memory
3502080.0
stage attributes
key
value
output-size
7856
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR v_NonEmpty:S x:S) (RULES f(x:S,x:S) -> f(g(x:S),x:S) g(x:S) -> s(x:S) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: F(x:S,x:S) -> F(g(x:S),x:S) F(x:S,x:S) -> G(x:S) -> Rules: f(x:S,x:S) -> f(g(x:S),x:S) g(x:S) -> s(x:S) Problem 1: SCC Processor: -> Pairs: F(x:S,x:S) -> F(g(x:S),x:S) F(x:S,x:S) -> G(x:S) -> Rules: f(x:S,x:S) -> f(g(x:S),x:S) g(x:S) -> s(x:S) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(x:S,x:S) -> F(g(x:S),x:S) ->->-> Rules: f(x:S,x:S) -> f(g(x:S),x:S) g(x:S) -> s(x:S) Problem 1: Reduction Pair Processor: -> Pairs: F(x:S,x:S) -> F(g(x:S),x:S) -> Rules: f(x:S,x:S) -> f(g(x:S),x:S) g(x:S) -> s(x:S) -> Usable rules: g(x:S) -> s(x:S) ->Mace4 Output: ============================== Mace4 ================================= Mace4 (64) version 2009-11A, November 2009. Process 50127 was started by sandbox2 on n146.star.cs.uiowa.edu, Tue Jun 30 21:35:34 2020 The command was "./mace4 -c -f /tmp/mace4336465782861021530.in". ============================== end of head =========================== ============================== INPUT ================================= % Reading from file /tmp/mace4336465782861021530.in assign(max_seconds,20). formulas(assumptions). gtrsim_s0(x,y) & sqsupset_s0(y,z) -> sqsupset_s0(x,z) # label(compatibility). succeq_s0(x,y) & sqsupset_s0(y,z) -> sqsupset_s0(x,z) # label(compatibility). gtrsim_s0(x,y) & succeq_s0(y,z) -> gtrsim_s0(x,z) # label(compatibility). arrow_s0(x1,y) -> arrow_s0(f2(x1,x2),f2(y,x2)) # label(congruence). arrow_s0(x2,y) -> arrow_s0(f2(x1,x2),f2(x1,y)) # label(congruence). arrow_s0(x1,y) -> arrow_s0(f3(x1),f3(y)) # label(congruence). arrow_s0(x1,y) -> arrow_s0(f5(x1),f5(y)) # label(congruence). arrow_s0(x1,y) -> arrow_s0(f7(x1,x2),f7(y,x2)) # label(congruence). arrow_s0(x2,y) -> arrow_s0(f7(x1,x2),f7(x1,y)) # label(congruence). arrow_s0(x1,y) -> arrow_s0(f8(x1),f8(y)) # label(congruence). arrow_s0(f3(x1),f5(x1)) # label(replacement). arrow_s0(x,y) -> gtrsim_s0(x,y) # label(inclusion). sqsupset_s0(f7(x1,x1),f7(f3(x1),x1)) # label(replacement). sqsupset_s0(x,y) -> sqsupsetStar_s0(x,y) # label(inclusion). sqsupset_s0(x,y) & sqsupsetStar_s0(y,z) -> sqsupsetStar_s0(x,z) # label(compatibility). end_of_list. formulas(goals). (exists x sqsupsetStar_s0(x,x)) # label(wellfoundedness). end_of_list. ============================== end of input ========================== ============================== PROCESS NON-CLAUSAL FORMULAS ========== % Formulas that are not ordinary clauses: 1 gtrsim_s0(x,y) & sqsupset_s0(y,z) -> sqsupset_s0(x,z) # label(compatibility) # label(non_clause). [assumption]. 2 succeq_s0(x,y) & sqsupset_s0(y,z) -> sqsupset_s0(x,z) # label(compatibility) # label(non_clause). [assumption]. 3 gtrsim_s0(x,y) & succeq_s0(y,z) -> gtrsim_s0(x,z) # label(compatibility) # label(non_clause). [assumption]. 4 arrow_s0(x1,y) -> arrow_s0(f2(x1,x2),f2(y,x2)) # label(congruence) # label(non_clause). [assumption]. 5 arrow_s0(x2,y) -> arrow_s0(f2(x1,x2),f2(x1,y)) # label(congruence) # label(non_clause). [assumption].
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Innermost