Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS_Innermost 2019-03-28 22.12 pair #432270791
details
property
value
status
complete
benchmark
test833.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n140.star.cs.uiowa.edu
space
Mixed_innermost
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
0.197585 seconds
cpu usage
0.120635
user time
0.052781
system time
0.067854
max virtual memory
113176.0
max residence set size
5688.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.19 YES 0.00/0.19 0.00/0.19 Problem 1: 0.00/0.19 0.00/0.19 (VAR v_NonEmpty:S X:S) 0.00/0.19 (RULES 0.00/0.19 b -> c 0.00/0.19 f(X:S,X:S) -> f(a,b) 0.00/0.19 ) 0.00/0.19 (STRATEGY INNERMOST) 0.00/0.19 0.00/0.19 Problem 1: 0.00/0.19 0.00/0.19 Dependency Pairs Processor: 0.00/0.19 -> Pairs: 0.00/0.19 F(X:S,X:S) -> B 0.00/0.19 F(X:S,X:S) -> F(a,b) 0.00/0.19 -> Rules: 0.00/0.19 b -> c 0.00/0.19 f(X:S,X:S) -> f(a,b) 0.00/0.19 0.00/0.19 Problem 1: 0.00/0.19 0.00/0.19 SCC Processor: 0.00/0.19 -> Pairs: 0.00/0.19 F(X:S,X:S) -> B 0.00/0.19 F(X:S,X:S) -> F(a,b) 0.00/0.19 -> Rules: 0.00/0.19 b -> c 0.00/0.19 f(X:S,X:S) -> f(a,b) 0.00/0.19 ->Strongly Connected Components: 0.00/0.19 ->->Cycle: 0.00/0.19 ->->-> Pairs: 0.00/0.19 F(X:S,X:S) -> F(a,b) 0.00/0.19 ->->-> Rules: 0.00/0.19 b -> c 0.00/0.19 f(X:S,X:S) -> f(a,b) 0.00/0.19 0.00/0.19 Problem 1: 0.00/0.19 0.00/0.19 Reduction Pair Processor: 0.00/0.19 -> Pairs: 0.00/0.19 F(X:S,X:S) -> F(a,b) 0.00/0.19 -> Rules: 0.00/0.19 b -> c 0.00/0.19 f(X:S,X:S) -> f(a,b) 0.00/0.19 -> Usable rules: 0.00/0.19 b -> c 0.00/0.19 ->Mace4 Output: 0.00/0.19 ============================== Mace4 ================================= 0.00/0.19 Mace4 (64) version 2009-11A, November 2009. 0.00/0.19 Process 58069 was started by sandbox on n140.star.cs.uiowa.edu, 0.00/0.19 Thu Mar 28 22:14:43 2019 0.00/0.19 The command was "./mace4 -c -f /tmp/mace4336465782861021530.in". 0.00/0.19 ============================== end of head =========================== 0.00/0.19 0.00/0.19 ============================== INPUT ================================= 0.00/0.19 0.00/0.19 % Reading from file /tmp/mace4336465782861021530.in 0.00/0.19 0.00/0.19 assign(max_seconds,20). 0.00/0.19 0.00/0.19 formulas(assumptions). 0.00/0.19 gtrsim_s0(x,y) & sqsupset_s0(y,z) -> sqsupset_s0(x,z) # label(compatibility). 0.00/0.19 succeq_s0(x,y) & sqsupset_s0(y,z) -> sqsupset_s0(x,z) # label(compatibility). 0.00/0.19 gtrsim_s0(x,y) & succeq_s0(y,z) -> gtrsim_s0(x,z) # label(compatibility). 0.00/0.19 arrow_s0(x1,y) -> arrow_s0(f3(x1,x2),f3(y,x2)) # label(congruence). 0.00/0.19 arrow_s0(x2,y) -> arrow_s0(f3(x1,x2),f3(x1,y)) # label(congruence). 0.00/0.19 arrow_s0(x1,y) -> arrow_s0(f9(x1,x2),f9(y,x2)) # label(congruence). 0.00/0.19 arrow_s0(x2,y) -> arrow_s0(f9(x1,x2),f9(x1,y)) # label(congruence). 0.00/0.19 arrow_s0(f2,f5) # label(replacement). 0.00/0.19 arrow_s0(x,y) -> gtrsim_s0(x,y) # label(inclusion). 0.00/0.19 sqsupset_s0(f9(x1,x1),f9(f4,f2)) # label(replacement). 0.00/0.19 sqsupset_s0(x,y) -> sqsupsetStar_s0(x,y) # label(inclusion). 0.00/0.19 sqsupset_s0(x,y) & sqsupsetStar_s0(y,z) -> sqsupsetStar_s0(x,z) # label(compatibility). 0.00/0.19 end_of_list. 0.00/0.19 0.00/0.19 formulas(goals). 0.00/0.19 (exists x sqsupsetStar_s0(x,x)) # label(wellfoundedness). 0.00/0.19 end_of_list. 0.00/0.19 0.00/0.19 ============================== end of input ========================== 0.00/0.19 0.00/0.19 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.00/0.19 0.00/0.19 % Formulas that are not ordinary clauses: 0.00/0.19 1 gtrsim_s0(x,y) & sqsupset_s0(y,z) -> sqsupset_s0(x,z) # label(compatibility) # label(non_clause). [assumption]. 0.00/0.19 2 succeq_s0(x,y) & sqsupset_s0(y,z) -> sqsupset_s0(x,z) # label(compatibility) # label(non_clause). [assumption]. 0.00/0.19 3 gtrsim_s0(x,y) & succeq_s0(y,z) -> gtrsim_s0(x,z) # label(compatibility) # label(non_clause). [assumption]. 0.00/0.19 4 arrow_s0(x1,y) -> arrow_s0(f3(x1,x2),f3(y,x2)) # label(congruence) # label(non_clause). [assumption]. 0.00/0.19 5 arrow_s0(x2,y) -> arrow_s0(f3(x1,x2),f3(x1,y)) # label(congruence) # label(non_clause). [assumption]. 0.00/0.19 6 arrow_s0(x1,y) -> arrow_s0(f9(x1,x2),f9(y,x2)) # label(congruence) # label(non_clause). [assumption]. 0.00/0.19 7 arrow_s0(x2,y) -> arrow_s0(f9(x1,x2),f9(x1,y)) # label(congruence) # label(non_clause). [assumption]. 0.00/0.19 8 arrow_s0(x,y) -> gtrsim_s0(x,y) # label(inclusion) # label(non_clause). [assumption]. 0.00/0.19 9 sqsupset_s0(x,y) -> sqsupsetStar_s0(x,y) # label(inclusion) # label(non_clause). [assumption]. 0.00/0.19 10 sqsupset_s0(x,y) & sqsupsetStar_s0(y,z) -> sqsupsetStar_s0(x,z) # label(compatibility) # label(non_clause). [assumption]. 0.00/0.19 11 (exists x sqsupsetStar_s0(x,x)) # label(wellfoundedness) # label(non_clause) # label(goal). [goal]. 0.00/0.19 0.00/0.19 ============================== end of process non-clausal formulas === 0.00/0.19
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS_Innermost 2019-03-28 22.12