TSTP Solution File: SCT169+6 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : SCT169+6 : TPTP v8.1.0. Released v5.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n005.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Mon Jul 18 22:12:28 EDT 2022

% Result   : Unknown 0.44s 0.60s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SCT169+6 : TPTP v8.1.0. Released v5.3.0.
% 0.11/0.13  % Command  : sos-script %s
% 0.13/0.34  % Computer : n005.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Fri Jul  1 22:15:52 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.49  ----- Otter 3.2, August 2001 -----
% 0.20/0.49  The process was started by sandbox on n005.cluster.edu,
% 0.20/0.49  Fri Jul  1 22:15:52 2022
% 0.20/0.49  The command was "./sos".  The process ID is 23673.
% 0.20/0.49  
% 0.20/0.49  set(prolog_style_variables).
% 0.20/0.49  set(auto).
% 0.20/0.49     dependent: set(auto1).
% 0.20/0.49     dependent: set(process_input).
% 0.20/0.49     dependent: clear(print_kept).
% 0.20/0.49     dependent: clear(print_new_demod).
% 0.20/0.49     dependent: clear(print_back_demod).
% 0.20/0.49     dependent: clear(print_back_sub).
% 0.20/0.49     dependent: set(control_memory).
% 0.20/0.49     dependent: assign(max_mem, 12000).
% 0.20/0.49     dependent: assign(pick_given_ratio, 4).
% 0.20/0.49     dependent: assign(stats_level, 1).
% 0.20/0.49     dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.49     dependent: assign(sos_limit, 5000).
% 0.20/0.49     dependent: assign(max_weight, 60).
% 0.20/0.49  clear(print_given).
% 0.20/0.49  
% 0.20/0.49  formula_list(usable).
% 0.20/0.49  
% 0.20/0.49  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.20/0.49  
% 0.20/0.49  This ia a non-Horn set with equality.  The strategy will be
% 0.20/0.49  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.20/0.49  unit deletion, with positive clauses in sos and nonpositive
% 0.20/0.49  clauses in usable.
% 0.20/0.49  
% 0.20/0.49     dependent: set(knuth_bendix).
% 0.20/0.49     dependent: set(para_from).
% 0.20/0.49     dependent: set(para_into).
% 0.20/0.49     dependent: clear(para_from_right).
% 0.20/0.49     dependent: clear(para_into_right).
% 0.20/0.49     dependent: set(para_from_vars).
% 0.20/0.49     dependent: set(eq_units_both_ways).
% 0.20/0.49     dependent: set(dynamic_demod_all).
% 0.20/0.49     dependent: set(dynamic_demod).
% 0.20/0.49     dependent: set(order_eq).
% 0.20/0.49     dependent: set(back_demod).
% 0.20/0.49     dependent: set(lrpo).
% 0.20/0.49     dependent: set(hyper_res).
% 0.20/0.49     dependent: set(unit_deletion).
% 0.20/0.49     dependent: set(factor).
% 0.20/0.49  
% 0.20/0.49  ------------> process usable:
% 0.20/0.49    Following clause subsumed by 22 during input processing: 0 [] {-} hAPP(list(A),list(A),hAPP(A,fun(list(A),list(A)),cons(A),B),C)!=C.
% 0.20/0.49    Following clause subsumed by 33 during input processing: 0 [] {-} -hBOOL(hAPP(list(A),bool,null(A),B))|B=nil(A).
% 0.20/0.49    Following clause subsumed by 32 during input processing: 0 [] {-} hBOOL(hAPP(list(A),bool,null(A),B))|B!=nil(A).
% 0.20/0.49    Following clause subsumed by 45 during input processing: 0 [] {-} hAPP(list(A),list(A),hAPP(list(A),fun(list(A),list(A)),append(A),B),C)!=D|E!=hAPP(list(A),list(A),hAPP(list(A),fun(list(A),list(A)),append(A),C),F)|hAPP(list(A),list(A),hAPP(list(A),fun(list(A),list(A)),append(A),B),E)=hAPP(list(A),list(A),hAPP(list(A),fun(list(A),list(A)),append(A),D),F).
% 0.20/0.49    Following clause subsumed by 55 during input processing: 0 [] {-} hAPP(list(A),list(A),hAPP(list(A),fun(list(A),list(A)),append(A),B),C)!=B|C=nil(A).
% 0.20/0.49    Following clause subsumed by 57 during input processing: 0 [] {-} hAPP(list(A),list(A),hAPP(list(A),fun(list(A),list(A)),append(A),B),C)=B|C!=nil(A).
% 0.20/0.49    Following clause subsumed by 59 during input processing: 0 [] {-} hAPP(list(A),list(A),hAPP(list(A),fun(list(A),list(A)),append(A),B),C)!=C|B=nil(A).
% 0.20/0.49    Following clause subsumed by 61 during input processing: 0 [] {-} hAPP(list(A),list(A),hAPP(list(A),fun(list(A),list(A)),append(A),B),C)=C|B!=nil(A).
% 0.20/0.49    Following clause subsumed by 50 during input processing: 0 [] {-} hAPP(list(A),list(A),hAPP(A,fun(list(A),list(A)),cons(A),B),C)=hAPP(list(A),list(A),hAPP(list(A),fun(list(A),list(A)),append(A),D),E)|hAPP(list(A),list(A),hAPP(A,fun(list(A),list(A)),cons(A),B),F)!=D|C!=hAPP(list(A),list(A),hAPP(list(A),fun(list(A),list(A)),append(A),F),E).
% 0.20/0.49    Following clause subsumed by 100 during input processing: 0 [flip.1] {-} hAPP(list(A),list(A),rev(A),B)!=nil(A)|B=nil(A).
% 0.20/0.49    Following clause subsumed by 101 during input processing: 0 [flip.1] {-} hAPP(list(A),list(A),rev(A),B)=nil(A)|B!=nil(A).
% 0.20/0.49    Following clause subsumed by 115 during input processing: 0 [] {-} A!=nil(B)|hAPP(list(B),B,last(B),hAPP(list(B),list(B),hAPP(B,fun(list(B),list(B)),cons(B),C),A))=ti(B,C).
% 0.20/0.49    Following clause subsumed by 116 during input processing: 0 [] {-} A!=nil(B)|hAPP(list(B),B,last(B),hAPP(list(B),list(B),hAPP(list(B),fun(list(B),list(B)),append(B),C),A))=hAPP(list(B),B,last(B),C).
% 0.20/0.49    Following clause subsumed by 120 during input processing: 0 [] {-} -cl_HOL_Oequal(A)|fequal(A)=equal_equal(A).
% 0.20/0.49    Following clause subsumed by 142 during input processing: 0 [] {-} hAPP(A,list(A),hAPP(nat,fun(A,list(A)),replicate(A),B),C)!=nil(A)|B=zero_zero(nat).
% 0.20/0.49    Following clause subsumed by 144 during input processing: 0 [] {-} hAPP(A,list(A),hAPP(nat,fun(A,list(A)),replicate(A),B),C)=nil(A)|B!=zero_zero(nat).
% 0.20/0.49    Following clause subsumed by 183 during input processing: 0 [] {-} -bot(A)|hAPP(B,A,bot_bot(fun(B,A)),C)=bot_bot(A).
% 0.20/0.49    Following clause subsumed by 182 during input processing: 0 [] {-} -hBOOL(hAPP(fun(A,bool),bool,hAPP(A,fun(fun(A,bool),bool),member(A),B),bot_bot(fun(A,bool)))).
% 0.20/0.49    Following clause subsumed by 199 during input processing: 0 [flip.1] {-} hAPP(fun(A,bool),fun(A,bool),collect(A),B)!=bot_bot(fun(A,bool))| -hBOOL(hAPP(A,bool,B,C)).
% 0.20/0.49    Following clause subsumed by 198 during input processing: 0 [] {-} -hBOOL(hAPP(fun(A,bool),bool,hAPP(A,fun(fun(A,bool),bool),member(A),B),C))|ti(fun(A,bool),C)!=bot_bot(fun(A,bool)).
% 0.20/0.49    Following clause subsumed by 198 during input processing: 0 [] {-} -hBOOL(hAPP(fun(A,bool),bool,hAPP(A,fun(fun(A,bool),bool),member(A),B),C))|ti(fun(A,bool),C)!=bot_bot(fun(A,bool)).
% 0.20/0.49    Following clause subsumed by 202 during input processing: 0 [] {-} -linorder(A)|hAPP(A,A,hAPP(A,fun(A,A),ord_max(A),hAPP(A,A,hAPP(A,fun(A,A),ord_max(A),B),C)),D)=hAPP(A,A,hAPP(A,fun(A,A),ord_max(A),B),hAPP(A,A,hAPP(A,fun(A,A),ord_max(A),C),D)).
% 0.20/0.49    Following clause subsumed by 203 during input processing: 0 [] {-} -linorder(A)|hAPP(A,A,hAPP(A,fun(A,A),ord_max(A),B),hAPP(A,A,hAPP(A,fun(A,A),ord_max(A),C),D))=hAPP(A,A,hAPP(A,fun(A,A),ord_max(A),C),hAPP(A,A,hAPP(A,fun(A,A),ord_max(A),B),D)).
% 0.20/0.49    Following clause subsumed by 205 during input processing: 0 [] {-} -linorder(A)|hAPP(A,A,hAPP(A,fun(A,A),ord_max(A),B),C)=hAPP(A,A,hAPP(A,fun(A,A),ord_max(A),C),B).
% 0.20/0.49    Following clause subsumed by 206 during input processing: 0 [] {-} -linorder(A)|hAPP(A,A,hAPP(A,fun(A,A),ord_max(A),B),hAPP(A,A,hAPP(A,fun(A,A),ord_max(A),B),C))=hAPP(A,A,hAPP(A,fun(A,A),ord_max(A),B),C).
% 0.20/0.49    Following clause subsumed by 204 during input processing: 0 [] {-} -linorder(A)|hAPP(A,A,hAPP(A,fun(A,A),ord_max(A),B),B)=ti(A,B).
% 0.20/0.49    Following clause subsumed by 210 during input processing: 0 [] {-} A!=B| -hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),A),B)).
% 0.20/0.49    Following clause subsumed by 211 during input processing: 0 [] {-} A!=B| -hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),B),A)).
% 0.20/0.49    Following clause subsumed by 212 during input processing: 0 [] {-} -hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),A),A)).
% 0.20/0.49    Following clause subsumed by 209 during input processing: 0 [] {-} -hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),A),zero_zero(nat))).
% 0.20/0.49    Following clause subsumed by 213 during input processing: 0 [] {-} A!=zero_zero(nat)| -hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),zero_zero(nat)),A)).
% 0.20/0.49    Following clause subsumed by 209 during input processing: 0 [] {-} -hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),A),zero_zero(nat))).
% 0.20/0.49    Following clause subsumed by 215 during input processing: 0 [] {-} -linorder(A)|hBOOL(hAPP(A,bool,hAPP(A,fun(A,bool),ord_less(A),B),C))|hBOOL(hAPP(A,bool,hAPP(A,fun(A,bool),ord_less(A),C),B))|ti(A,B)=ti(A,C).
% 0.20/0.49    Following clause subsumed by 216 during input processing: 0 [] {-} -linorder(A)| -hBOOL(hAPP(A,bool,hAPP(A,fun(A,bool),ord_less(A),B),C))|ti(A,B)!=ti(A,C).
% 0.20/0.49    Following clause subsumed by 215 during input processing: 0 [] {-} -linorder(A)|hBOOL(hAPP(A,bool,hAPP(A,fun(A,bool),ord_less(A),B),C))|ti(A,B)=ti(A,C)|hBOOL(hAPP(A,bool,hAPP(A,fun(A,bool),ord_less(A),C),B)).
% 0.20/0.49    Following clause subsumed by 215 during input processing: 0 [] {-} -linorder(A)|hBOOL(hAPP(A,bool,hAPP(A,fun(A,bool),ord_less(A),B),C))|hBOOL(hAPP(A,bool,hAPP(A,fun(A,bool),ord_less(A),C),B))|ti(A,C)=ti(A,B).
% 0.20/0.49    Following clause subsumed by 216 during input processing: 0 [] {-} -linorder(A)|hBOOL(hAPP(A,bool,hAPP(A,fun(A,bool),ord_less(A),B),C))| -hBOOL(hAPP(A,bool,hAPP(A,fun(A,bool),ord_less(A),C),B))|ti(A,C)!=ti(A,B).
% 0.20/0.49    Following clause subsumed by 215 during input processing: 0 [] {-} -linorder(A)|ti(A,B)=ti(A,C)|hBOOL(hAPP(A,bool,hAPP(A,fun(A,bool),ord_less(A),B),C))|hBOOL(hAPP(A,bool,hAPP(A,fun(A,bool),ord_less(A),C),B)).
% 0.20/0.50    Following clause subsumed by 220 during input processing: 0 [] {-} -preorder(A)| -hBOOL(hAPP(A,bool,hAPP(A,fun(A,bool),ord_less(A),B),C))| -hBOOL(hAPP(A,bool,hAPP(A,fun(A,bool),ord_less(A),C),B)).
% 0.20/0.50    Following clause subsumed by 219 during input processing: 0 [] {-} -order(A)| -hBOOL(hAPP(A,bool,hAPP(A,fun(A,bool),ord_less(A),B),C))|B!=C.
% 0.20/0.50    Following clause subsumed by 220 during input processing: 0 [] {-} -preorder(A)| -hBOOL(hAPP(A,bool,hAPP(A,fun(A,bool),ord_less(A),B),C))| -hBOOL(hAPP(A,bool,hAPP(A,fun(A,bool),ord_less(A),C),B))|hBOOL(D).
% 0.20/0.50    Following clause subsumed by 220 during input processing: 0 [] {-} -preorder(A)| -hBOOL(hAPP(A,bool,hAPP(A,fun(A,bool),ord_less(A),B),C))| -hBOOL(hAPP(A,bool,hAPP(A,fun(A,bool),ord_less(A),C),B)).
% 0.20/0.50    Following clause subsumed by 220 during input processing: 0 [] {-} -preorder(A)| -hBOOL(hAPP(A,bool,hAPP(A,fun(A,bool),ord_less(A),B),C))| -hBOOL(hAPP(A,bool,hAPP(A,fun(A,bool),ord_less(A),C),B)).
% 0.20/0.50    Following clause subsumed by 215 during input processing: 0 [] {-} -linorder(A)|hBOOL(hAPP(A,bool,hAPP(A,fun(A,bool),ord_less(A),B),C))|ti(A,B)=ti(A,C)|hBOOL(hAPP(A,bool,hAPP(A,fun(A,bool),ord_less(A),C),B)).
% 0.20/0.50    Following clause subsumed by 240 during input processing: 0 [] {-} -linorder(A)| -hBOOL(hAPP(A,bool,hAPP(A,fun(A,bool),ord_less(A),B),C))|hBOOL(hAPP(A,bool,hAPP(A,fun(A,bool),ord_less(A),B),hAPP(A,A,hAPP(A,fun(A,A),ord_max(A),C),D))).
% 0.20/0.50    Following clause subsumed by 241 during input processing: 0 [] {-} -linorder(A)| -hBOOL(hAPP(A,bool,hAPP(A,fun(A,bool),ord_less(A),B),C))|hBOOL(hAPP(A,bool,hAPP(A,fun(A,bool),ord_less(A),B),hAPP(A,A,hAPP(A,fun(A,A),ord_max(A),D),C))).
% 0.20/0.50    Following clause subsumed by 176 during input processing: 0 [] {-} A!=B|hAPP(list(C),nat,size_size(list(C)),A)=hAPP(list(C),nat,size_size(list(C)),B).
% 0.20/0.50    Following clause subsumed by 256 during input processing: 0 [] {-} -hBOOL(hAPP(list(A),bool,distinct(A),B))| -hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),C),hAPP(list(A),nat,size_size(list(A)),B)))| -hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),D),hAPP(list(A),nat,size_size(list(A)),B)))|hAPP(nat,A,hAPP(list(A),fun(nat,A),nth(A),B),C)!=hAPP(nat,A,hAPP(list(A),fun(nat,A),nth(A),B),D)|C=D.
% 0.20/0.50    Following clause subsumed by 272 during input processing: 0 [] {-} hAPP(nat,nat,suc,A)!=hAPP(nat,nat,suc,B)|A=B.
% 0.20/0.50    Following clause subsumed by 281 during input processing: 0 [flip.1] {-} hAPP(nat,nat,suc,A)!=A.
% 0.20/0.50    Following clause subsumed by 294 during input processing: 0 [] {-} -cancel_semigroup_add(A)|hAPP(A,A,hAPP(A,fun(A,A),plus_plus(A),B),C)!=hAPP(A,A,hAPP(A,fun(A,A),plus_plus(A),D),C)|ti(A,B)=ti(A,D).
% 0.20/0.50    Following clause subsumed by 296 during input processing: 0 [] {-} -cancel_semigroup_add(A)|hAPP(A,A,hAPP(A,fun(A,A),plus_plus(A),B),C)!=hAPP(A,A,hAPP(A,fun(A,A),plus_plus(A),B),D)|ti(A,C)=ti(A,D).
% 0.20/0.50    Following clause subsumed by 306 during input processing: 0 [] {-} -ordere236663937imp_le(A)| -hBOOL(hAPP(A,bool,hAPP(A,fun(A,bool),ord_less(A),hAPP(A,A,hAPP(A,fun(A,A),plus_plus(A),B),C)),hAPP(A,A,hAPP(A,fun(A,A),plus_plus(A),B),D)))|hBOOL(hAPP(A,bool,hAPP(A,fun(A,bool),ord_less(A),C),D)).
% 0.20/0.50    Following clause subsumed by 307 during input processing: 0 [] {-} -ordere236663937imp_le(A)| -hBOOL(hAPP(A,bool,hAPP(A,fun(A,bool),ord_less(A),hAPP(A,A,hAPP(A,fun(A,A),plus_plus(A),B),C)),hAPP(A,A,hAPP(A,fun(A,A),plus_plus(A),D),C)))|hBOOL(hAPP(A,bool,hAPP(A,fun(A,bool),ord_less(A),B),D)).
% 0.20/0.50    Following clause subsumed by 313 during input processing: 0 [] {-} zero_zero(nat)!=hAPP(nat,nat,suc,A).
% 0.20/0.50    Following clause subsumed by 314 during input processing: 0 [] {-} hAPP(nat,nat,suc,A)!=zero_zero(nat).
% 0.20/0.50    Following clause subsumed by 313 during input processing: 0 [] {-} zero_zero(nat)!=hAPP(nat,nat,suc,A).
% 0.20/0.50    Following clause subsumed by 314 during input processing: 0 [] {-} hAPP(nat,nat,suc,A)!=zero_zero(nat).
% 0.20/0.50    Following clause subsumed by 271 during input processing: 0 [] {-} hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),hAPP(nat,nat,suc,A)),hAPP(nat,nat,suc,B)))| -hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),A),B)).
% 0.20/0.50    Following clause subsumed by 316 during input processing: 0 [] {-} hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),A),B))| -hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),A),hAPP(nat,nat,suc,B)))|A=B.
% 0.20/0.50    Following clause subsumed by 318 during input processing: 0 [] {-} hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),A),B))|hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),A),hAPP(nat,nat,suc,B)))|A!=B.
% 0.20/0.50    Following clause subsumed by 317 during input processing: 0 [] {-} -hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),A),B))|hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),A),hAPP(nat,nat,suc,B))).
% 0.20/0.50    Following clause subsumed by 316 during input processing: 0 [] {-} -hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),A),hAPP(nat,nat,suc,B)))|hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),A),B))|A=B.
% 0.20/0.50    Following clause subsumed by 319 during input processing: 0 [] {-} -hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),hAPP(nat,nat,suc,A)),hAPP(nat,nat,suc,B)))|hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),A),B)).
% 0.20/0.50    Following clause subsumed by 318 during input processing: 0 [] {-} hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),A),hAPP(nat,nat,suc,zero_zero(nat))))|A!=zero_zero(nat).
% 0.20/0.50    Following clause subsumed by 333 during input processing: 0 [] {-} hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),zero_zero(nat)),hAPP(nat,nat,hAPP(nat,fun(nat,nat),plus_plus(nat),A),B)))| -hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),zero_zero(nat)),A)).
% 0.20/0.50    Following clause subsumed by 334 during input processing: 0 [] {-} hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),zero_zero(nat)),hAPP(nat,nat,hAPP(nat,fun(nat,nat),plus_plus(nat),A),B)))| -hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),zero_zero(nat)),B)).
% 0.20/0.50    Following clause subsumed by 333 during input processing: 0 [] {-} -hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),A),B))|hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),A),hAPP(nat,nat,hAPP(nat,fun(nat,nat),plus_plus(nat),B),C))).
% 0.20/0.50    Following clause subsumed by 334 during input processing: 0 [] {-} -hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),A),B))|hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),A),hAPP(nat,nat,hAPP(nat,fun(nat,nat),plus_plus(nat),C),B))).
% 0.20/0.50    Following clause subsumed by 425 during input processing: 0 [flip.2] {-} -comm_semiring_1(A)|hAPP(A,A,hAPP(A,fun(A,A),plus_plus(A),hAPP(A,A,hAPP(A,fun(A,A),plus_plus(A),B),C)),D)=hAPP(A,A,hAPP(A,fun(A,A),plus_plus(A),B),hAPP(A,A,hAPP(A,fun(A,A),plus_plus(A),C),D)).
% 0.20/0.50    Following clause subsumed by 454 during input processing: 0 [] {-} -minus(A)|hAPP(B,A,hAPP(fun(B,A),fun(B,A),hAPP(fun(B,A),fun(fun(B,A),fun(B,A)),minus_minus(fun(B,A)),C),D),E)=hAPP(A,A,hAPP(A,fun(A,A),minus_minus(A),hAPP(B,A,C,E)),hAPP(B,A,D,E)).
% 0.20/0.50    Following clause subsumed by 458 during input processing: 0 [] {-} -hBOOL(hAPP(nat,bool,A,hAPP(nat,nat,hAPP(nat,fun(nat,nat),minus_minus(nat),B),C)))| -hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),B),C))|hBOOL(hAPP(nat,bool,A,zero_zero(nat))).
% 0.20/0.50    Following clause subsumed by 459 during input processing: 0 [] {-} -hBOOL(hAPP(nat,bool,A,hAPP(nat,nat,hAPP(nat,fun(nat,nat),minus_minus(nat),B),C)))|B!=hAPP(nat,nat,hAPP(nat,fun(nat,nat),plus_plus(nat),C),D)|hBOOL(hAPP(nat,bool,A,D)).
% 0.20/0.50    Following clause subsumed by 229 during input processing: 0 [] {-} -hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),A),hAPP(list(B),nat,size_size(list(B)),C)))|hAPP(B,list(B),hAPP(nat,fun(B,list(B)),hAPP(list(B),fun(nat,fun(B,list(B))),list_update(B),hAPP(list(B),list(B),hAPP(list(B),fun(list(B),list(B)),append(B),C),D)),A),E)=hAPP(list(B),list(B),hAPP(list(B),fun(list(B),list(B)),append(B),hAPP(B,list(B),hAPP(nat,fun(B,list(B)),hAPP(list(B),fun(nat,fun(B,list(B))),list_update(B),C),A),E)),D).
% 0.20/0.50    Following clause subsumed by 478 during input processing: 0 [] {-} -zero_neq_one(A)|zero_zero(A)!=one_one(A).
% 0.20/0.52    Following clause subsumed by 481 during input processing: 0 [] {-} -hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),zero_zero(nat)),A))|hAPP(nat,nat,suc,hAPP(nat,nat,hAPP(nat,fun(nat,nat),minus_minus(nat),A),one_one(nat)))=A.
% 0.20/0.52    Following clause subsumed by 405 during input processing: 0 [] {-} A!=zero_zero(nat)|hAPP(list(B),list(B),hAPP(nat,fun(list(B),list(B)),take(B),A),hAPP(list(B),list(B),hAPP(B,fun(list(B),list(B)),cons(B),C),D))=nil(B).
% 0.20/0.52    Following clause subsumed by 405 during input processing: 0 [] {-} hAPP(int,nat,number_number_of(nat),A)!=zero_zero(nat)|hAPP(list(B),list(B),hAPP(nat,fun(list(B),list(B)),take(B),hAPP(int,nat,number_number_of(nat),A)),hAPP(list(B),list(B),hAPP(B,fun(list(B),list(B)),cons(B),C),D))=nil(B).
% 0.20/0.52    Following clause subsumed by 491 during input processing: 0 [] {-} -hBOOL(hAPP(fun(A,bool),bool,hAPP(A,fun(fun(A,bool),bool),member(A),B),hAPP(fun(A,bool),fun(A,bool),hAPP(fun(A,bool),fun(fun(A,bool),fun(A,bool)),minus_minus(fun(A,bool)),C),D)))| -hBOOL(hAPP(fun(A,bool),bool,hAPP(A,fun(fun(A,bool),bool),member(A),B),D)).
% 0.20/0.52    Following clause subsumed by 490 during input processing: 0 [] {-} -hBOOL(hAPP(fun(A,bool),bool,hAPP(A,fun(fun(A,bool),bool),member(A),B),hAPP(fun(A,bool),fun(A,bool),hAPP(fun(A,bool),fun(fun(A,bool),fun(A,bool)),minus_minus(fun(A,bool)),C),D)))|hBOOL(hAPP(fun(A,bool),bool,hAPP(A,fun(fun(A,bool),bool),member(A),B),C)).
% 0.20/0.52    Following clause subsumed by 490 during input processing: 0 [] {-} -hBOOL(hAPP(fun(A,bool),bool,hAPP(A,fun(fun(A,bool),bool),member(A),B),hAPP(fun(A,bool),fun(A,bool),hAPP(fun(A,bool),fun(fun(A,bool),fun(A,bool)),minus_minus(fun(A,bool)),C),D)))|hBOOL(hAPP(fun(A,bool),bool,hAPP(A,fun(fun(A,bool),bool),member(A),B),C)).
% 0.20/0.52    Following clause subsumed by 491 during input processing: 0 [] {-} -hBOOL(hAPP(fun(A,bool),bool,hAPP(A,fun(fun(A,bool),bool),member(A),B),hAPP(fun(A,bool),fun(A,bool),hAPP(fun(A,bool),fun(fun(A,bool),fun(A,bool)),minus_minus(fun(A,bool)),C),D)))| -hBOOL(hAPP(fun(A,bool),bool,hAPP(A,fun(fun(A,bool),bool),member(A),B),D)).
% 0.20/0.52    Following clause subsumed by 492 during input processing: 0 [] {-} hBOOL(hAPP(fun(A,bool),bool,hAPP(A,fun(fun(A,bool),bool),member(A),B),hAPP(fun(A,bool),fun(A,bool),hAPP(fun(A,bool),fun(fun(A,bool),fun(A,bool)),minus_minus(fun(A,bool)),C),D)))| -hBOOL(hAPP(fun(A,bool),bool,hAPP(A,fun(fun(A,bool),bool),member(A),B),C))|hBOOL(hAPP(fun(A,bool),bool,hAPP(A,fun(fun(A,bool),bool),member(A),B),D)).
% 0.20/0.52    Following clause subsumed by 19 during input processing: 0 [copy,18,flip.1] {-} hAPP(list(A),list(A),hAPP(A,fun(list(A),list(A)),cons(A),B),C)!=nil(A).
% 0.20/0.52    Following clause subsumed by 18 during input processing: 0 [copy,19,flip.1] {-} nil(A)!=hAPP(list(A),list(A),hAPP(A,fun(list(A),list(A)),cons(A),B),C).
% 0.20/0.52    Following clause subsumed by 314 during input processing: 0 [copy,313,flip.1] {-} hAPP(nat,nat,suc,A)!=zero_zero(nat).
% 0.20/0.52    Following clause subsumed by 313 during input processing: 0 [copy,314,flip.1] {-} zero_zero(nat)!=hAPP(nat,nat,suc,A).
% 0.20/0.52  
% 0.20/0.52  ------------> process sos:
% 0.20/0.52    Following clause subsumed by 713 during input processing: 0 [] {-} A=nil(B)|hAPP(list(B),B,last(B),hAPP(list(B),list(B),hAPP(B,fun(list(B),list(B)),cons(B),C),A))=hAPP(list(B),B,last(B),A).
% 0.20/0.52    Following clause subsumed by 714 during input processing: 0 [] {-} A=nil(B)|hAPP(list(B),B,last(B),hAPP(list(B),list(B),hAPP(list(B),fun(list(B),list(B)),append(B),C),A))=hAPP(list(B),B,last(B),A).
% 0.20/0.52    Following clause subsumed by 717 during input processing: 0 [] {-} A=nil(B)|hAPP(list(B),B,hd(B),hAPP(list(B),list(B),hAPP(list(B),fun(list(B),list(B)),append(B),A),C))=hAPP(list(B),B,hd(B),A).
% 0.20/0.52    Following clause subsumed by 787 during input processing: 0 [] {-} A=B|hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),A),B))|hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),B),A)).
% 0.20/0.52    Following clause subsumed by 787 during input processing: 0 [] {-} A=B|hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),A),B))|hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),B),A)).
% 0.20/0.52    Following clause subsumed by 788 during input processing: 0 [] {-} A=zero_zero(nat)|hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),zero_zero(nat)),A)).
% 0.20/0.54    Following clause subsumed by 995 during input processing: 0 [demod,815,970] {-} hAPP(int,nat,number_number_of(nat),A)=bot_bot(nat)|hAPP(list(B),list(B),hAPP(nat,fun(list(B),list(B)),take(B),hAPP(int,nat,number_number_of(nat),A)),hAPP(list(B),list(B),hAPP(B,fun(list(B),list(B)),cons(B),C),D))=hAPP(list(B),list(B),hAPP(B,fun(list(B),list(B)),cons(B),C),hAPP(list(B),list(B),hAPP(nat,fun(list(B),list(B)),take(B),hAPP(nat,nat,hAPP(nat,fun(nat,nat),minus_minus(nat),hAPP(int,nat,number_number_of(nat),A)),hAPP(nat,nat,suc,bot_bot(nat)))),D)).
% 0.20/0.54    Following clause subsumed by 1065 during input processing: 0 [copy,796,flip.1] {-} nil(A)=nil(A).
% 0.20/0.54  801 back subsumes 231.
% 0.20/0.54    Following clause subsumed by 1065 during input processing: 0 [copy,805,flip.1] {-} hAPP(list(A),list(A),butlast(A),hAPP(list(A),list(A),hAPP(nat,fun(list(A),list(A)),drop(A),B),C))=hAPP(list(A),list(A),butlast(A),hAPP(list(A),list(A),hAPP(nat,fun(list(A),list(A)),drop(A),B),C)).
% 0.20/0.54    Following clause subsumed by 807 during input processing: 0 [copy,806,flip.1] {-} hAPP(list(A),list(A),hAPP(nat,fun(list(A),list(A)),drop(A),B),hAPP(list(A),list(A),tl(A),C))=hAPP(list(A),list(A),tl(A),hAPP(list(A),list(A),hAPP(nat,fun(list(A),list(A)),drop(A),B),C)).
% 0.20/0.54    Following clause subsumed by 806 during input processing: 0 [copy,807,flip.1] {-} hAPP(list(A),list(A),tl(A),hAPP(list(A),list(A),hAPP(nat,fun(list(A),list(A)),drop(A),B),C))=hAPP(list(A),list(A),hAPP(nat,fun(list(A),list(A)),drop(A),B),hAPP(list(A),list(A),tl(A),C)).
% 0.20/0.54    Following clause subsumed by 830 during input processing: 0 [copy,830,flip.1] {-} hAPP(nat,nat,hAPP(nat,fun(nat,nat),plus_plus(nat),A),hAPP(nat,nat,hAPP(nat,fun(nat,nat),plus_plus(nat),B),C))=hAPP(nat,nat,hAPP(nat,fun(nat,nat),plus_plus(nat),B),hAPP(nat,nat,hAPP(nat,fun(nat,nat),plus_plus(nat),A),C)).
% 0.20/0.54    Following clause subsumed by 1065 during input processing: 0 [copy,832,flip.1] {-} hAPP(nat,nat,suc,hAPP(nat,nat,hAPP(nat,fun(nat,nat),plus_plus(nat),A),B))=hAPP(nat,nat,suc,hAPP(nat,nat,hAPP(nat,fun(nat,nat),plus_plus(nat),A),B)).
% 0.20/0.54    Following clause subsumed by 833 during input processing: 0 [copy,833,flip.1] {-} hAPP(nat,nat,hAPP(nat,fun(nat,nat),plus_plus(nat),A),B)=hAPP(nat,nat,hAPP(nat,fun(nat,nat),plus_plus(nat),B),A).
% 0.20/0.54    Following clause subsumed by 917 during input processing: 0 [copy,917,flip.1] {-} hAPP(nat,nat,hAPP(nat,fun(nat,nat),minus_minus(nat),hAPP(nat,nat,hAPP(nat,fun(nat,nat),minus_minus(nat),A),B)),C)=hAPP(nat,nat,hAPP(nat,fun(nat,nat),minus_minus(nat),hAPP(nat,nat,hAPP(nat,fun(nat,nat),minus_minus(nat),A),C)),B).
% 0.20/0.54    Following clause subsumed by 1065 during input processing: 0 [copy,1065,flip.1] {-} A=A.
% 0.20/0.54  1065 back subsumes 832.
% 0.20/0.54  1065 back subsumes 805.
% 0.20/0.54  1065 back subsumes 796.
% 0.20/0.54  1065 back subsumes 541.
% 0.20/0.54  1065 back subsumes 527.
% 0.20/0.54  1065 back subsumes 526.
% 0.20/0.54  1065 back subsumes 521.
% 0.20/0.54    Following clause subsumed by 664 during input processing: 0 [copy,1066,flip.1] {-} hAPP(list(A),list(A),hAPP(list(A),fun(list(A),list(A)),splice(A),hAPP(list(A),list(A),hAPP(A,fun(list(A),list(A)),cons(A),B),C)),hAPP(list(A),list(A),hAPP(A,fun(list(A),list(A)),cons(A),D),E))=hAPP(list(A),list(A),hAPP(A,fun(list(A),list(A)),cons(A),B),hAPP(list(A),list(A),hAPP(A,fun(list(A),list(A)),cons(A),D),hAPP(list(A),list(A),hAPP(list(A),fun(list(A),list(A)),splice(A),C),E))).
% 0.20/0.54    Following clause subsumed by 671 during input processing: 0 [copy,1067,flip.1] {-} hAPP(list(A),B,hAPP(fun(A,fun(list(A),B)),fun(list(A),B),hAPP(B,fun(fun(A,fun(list(A),B)),fun(list(A),B)),list_case(B,A),C),D),nil(A))=ti(B,C).
% 0.20/0.54    Following clause subsumed by 672 during input processing: 0 [copy,1068,flip.1] {-} hAPP(list(A),B,hAPP(fun(A,fun(list(A),B)),fun(list(A),B),hAPP(B,fun(fun(A,fun(list(A),B)),fun(list(A),B)),list_case(B,A),C),D),hAPP(list(A),list(A),hAPP(A,fun(list(A),list(A)),cons(A),E),F))=hAPP(list(A),B,hAPP(A,fun(list(A),B),D,E),F).
% 0.20/0.54    Following clause subsumed by 673 during input processing: 0 [copy,1069,flip.1] {-} hAPP(list(A),B,hAPP(fun(A,fun(list(A),fun(B,B))),fun(list(A),B),hAPP(B,fun(fun(A,fun(list(A),fun(B,B))),fun(list(A),B)),list_rec(B,A),C),D),nil(A))=ti(B,C).
% 0.20/0.54    Following clause subsumed by 674 during input processing: 0 [copy,1070,flip.1] {-} hAPP(list(A),B,hAPP(fun(A,fun(list(A),fun(B,B))),fun(list(A),B),hAPP(B,fun(fun(A,fun(list(A),fun(B,B))),fun(list(A),B)),list_rec(B,A),C),D),hAPP(list(A),list(A),hAPP(A,fun(list(A),list(A)),cons(A),E),F))=hAPP(B,B,hAPP(list(A),fun(B,B),hAPP(A,fun(list(A),fun(B,B)),D,E),F),hAPP(list(A),B,hAPP(fun(A,fun(list(A),fun(B,B))),fun(list(A),B),hAPP(B,fun(fun(A,fun(list(A),fun(B,B))),fun(list(A),B)),list_rec(B,A),C),D),F)).
% 0.20/0.54    Following clause subsumed by 678 during input processing: 0 [copy,1071,flip.1] {-} hAPP(list(A),list(B),hAPP(fun(A,list(B)),fun(list(A),list(B)),maps(A,B),C),nil(A))=nil(B).
% 0.20/0.54    Following clause subsumed by 681 during input processing: 0 [copy,1072,flip.1] {-} hAPP(list(A),list(B),hAPP(fun(A,list(B)),fun(list(A),list(B)),maps(A,B),C),hAPP(list(A),list(A),hAPP(A,fun(list(A),list(A)),cons(A),D),E))=hAPP(list(B),list(B),hAPP(list(B),fun(list(B),list(B)),append(B),hAPP(A,list(B),C,D)),hAPP(list(A),list(B),hAPP(fun(A,list(B)),fun(list(A),list(B)),maps(A,B),C),E)).
% 0.20/0.54    Following clause subsumed by 695 during input processing: 0 [copy,1073,flip.1] {-} hAPP(list(A),list(A),rotate1(A),hAPP(list(A),list(A),hAPP(A,fun(list(A),list(A)),cons(A),B),C))=hAPP(list(A),list(A),hAPP(list(A),fun(list(A),list(A)),append(A),C),hAPP(list(A),list(A),hAPP(A,fun(list(A),list(A)),cons(A),B),nil(A))).
% 0.20/0.54    Following clause subsumed by 696 during input processing: 0 [copy,1074,flip.1] {-} hAPP(list(A),A,last(A),hAPP(list(A),list(A),hAPP(list(A),fun(list(A),list(A)),append(A),B),hAPP(list(A),list(A),hAPP(A,fun(list(A),list(A)),cons(A),C),nil(A))))=ti(A,C).
% 0.20/0.54    Following clause subsumed by 701 during input processing: 0 [copy,1075,flip.1] {-} hAPP(list(A),list(A),rev(A),hAPP(list(A),list(A),hAPP(A,fun(list(A),list(A)),cons(A),B),C))=hAPP(list(A),list(A),hAPP(list(A),fun(list(A),list(A)),append(A),hAPP(list(A),list(A),rev(A),C)),hAPP(list(A),list(A),hAPP(A,fun(list(A),list(A)),cons(A),B),nil(A))).
% 0.20/0.54    Following clause subsumed by 708 during input processing: 0 [copy,1076,flip.1] {-} hAPP(list(A),list(A),rev(A),hAPP(list(A),list(A),hAPP(list(A),fun(list(A),list(A)),append(A),B),C))=hAPP(list(A),list(A),hAPP(list(A),fun(list(A),list(A)),append(A),hAPP(list(A),list(A),rev(A),C)),hAPP(list(A),list(A),rev(A),B)).
% 0.20/0.54    Following clause subsumed by 1077 during input processing: 0 [copy,1077,flip.1] {-} hAPP(A,list(A),hAPP(nat,fun(A,list(A)),replicate(A),hAPP(nat,nat,hAPP(nat,fun(nat,nat),plus_plus(nat),B),C)),D)=hAPP(A,list(A),hAPP(nat,fun(A,list(A)),replicate(A),hAPP(nat,nat,hAPP(nat,fun(nat,nat),plus_plus(nat),C),B)),D).
% 0.20/0.54    Following clause subsumed by 710 during input processing: 0 [copy,1078,flip.1] {-} hAPP(fun(A,bool),fun(A,bool),collect(A),B)=ti(fun(A,bool),B).
% 0.20/0.54    Following clause subsumed by 724 during input processing: 0 [copy,1079,flip.1] {-} hAPP(list(A),A,hd(A),hAPP(list(A),list(A),hAPP(A,fun(list(A),list(A)),cons(A),B),C))=ti(A,B).
% 0.20/0.54    Following clause subsumed by 1097 during input processing: 0 [copy,1083,flip.1] {-} hAPP(nat,A,hAPP(list(A),fun(nat,A),nth(A),hAPP(list(A),list(A),hAPP(A,fun(list(A),list(A)),cons(A),B),C)),bot_bot(nat))=ti(A,B).
% 0.20/0.54    Following clause subsumed by 748 during input processing: 0 [copy,1084,flip.1] {-} hAPP(nat,A,hAPP(list(A),fun(nat,A),nth(A),hAPP(list(A),list(A),hAPP(list(A),fun(list(A),list(A)),append(A),B),hAPP(list(A),list(A),hAPP(A,fun(list(A),list(A)),cons(A),C),D))),hAPP(list(A),nat,size_size(list(A)),B))=ti(A,C).
% 0.20/0.54    Following clause subsumed by 762 during input processing: 0 [copy,1085,flip.1] {-} hAPP(A,A,hAPP(list(B),fun(A,A),hAPP(fun(B,fun(A,A)),fun(list(B),fun(A,A)),foldr(B,A),C),nil(B)),D)=ti(A,D).
% 0.20/0.54    Following clause subsumed by 780 during input processing: 0 [copy,1088,flip.1] {-} hAPP(A,list(A),hAPP(nat,fun(A,list(A)),hAPP(list(A),fun(nat,fun(A,list(A))),list_update(A),hAPP(list(A),list(A),hAPP(list(A),fun(list(A),list(A)),append(A),B),hAPP(list(A),list(A),hAPP(A,fun(list(A),list(A)),cons(A),C),D))),hAPP(list(A),nat,size_size(list(A)),B)),E)=hAPP(list(A),list(A),hAPP(list(A),fun(list(A),list(A)),append(A),B),hAPP(list(A),list(A),hAPP(A,fun(list(A),list(A)),cons(A),E),D)).
% 0.20/0.54    Following clause subsumed by 1091 during input processing: 0 [copy,1089,flip.1] {-} hAPP(A,list(A),hAPP(nat,fun(A,list(A)),hAPP(list(A),fun(nat,fun(A,list(A))),list_update(A),hAPP(list(A),list(A),hAPP(A,fun(list(A),list(A)),cons(A),B),C)),bot_bot(nat)),D)=hAPP(list(A),list(A),hAPP(A,fun(list(A),list(A)),cons(A),D),C).
% 0.20/0.54    Following clause subsumed by 1089 during input processing: 0 [copy,1091,flip.1] {-} hAPP(list(A),list(A),hAPP(A,fun(list(A),list(A)),cons(A),B),C)=hAPP(A,list(A),hAPP(nat,fun(A,list(A)),hAPP(list(A),fun(nat,fun(A,list(A))),list_update(A),hAPP(list(A),list(A),hAPP(A,fun(list(A),list(A)),cons(A),D),C)),bot_bot(nat)),B).
% 0.20/0.54    Following clause subsumed by 1083 during input processing: 0 [copy,1097,flip.1] {-} ti(A,B)=hAPP(nat,A,hAPP(list(A),fun(nat,A),nth(A),hAPP(list(A),list(A),hAPP(A,fun(list(A),list(A)),cons(A),B),C)),bot_bot(nat)).
% 0.20/0.54    Following clause subsumed by 1142 during input processing: 0 [copy,1141,flip.1] {-} bot_bot(nat)!=hAPP(nat,nat,suc,A).
% 0.20/0.54    Following clause subsumed by 1141 during input processing: 0 [copy,1142,flip.1] {-} hAPP(nat,nat,suc,A)!=bot_bot(nat).
% 0.20/0.54    Following clause subsumed by 852 during input processing: 0 [copy,1160,flip.1] {-} hAPP(list(A),nat,hAPP(fun(A,nat),fun(list(A),nat),list_size(A),B),hAPP(list(A),list(A),hAPP(A,fun(list(A),list(A)),cons(A),C),D))=hAPP(nat,nat,suc,hAPP(nat,nat,hAPP(nat,fun(nat,nat),plus_plus(nat),hAPP(A,nat,B,C)),hAPP(list(A),nat,hAPP(fun(A,nat),fun(list(A),nat),list_size(A),B),D))).
% 0.20/0.54    Following clause subsumed by 859 during input processing: 0 [copy,1161,flip.1] {-} hAPP(A,list(A),hAPP(nat,fun(A,list(A)),hAPP(list(A),fun(nat,fun(A,list(A))),list_update(A),hAPP(list(A),list(A),hAPP(A,fun(list(A),list(A)),cons(A),B),C)),hAPP(nat,nat,suc,D)),E)=hAPP(list(A),list(A),hAPP(A,fun(list(A),list(A)),cons(A),B),hAPP(A,list(A),hAPP(nat,fun(A,list(A)),hAPP(list(A),fun(nat,fun(A,list(A))),list_update(A),C),D),E)).
% 0.20/0.54    Following clause subsumed by 866 during input processing: 0 [copy,1162,flip.1] {-} hAPP(list(A),list(A),hAPP(nat,fun(list(A),list(A)),drop(A),hAPP(nat,nat,suc,B)),C)=hAPP(list(A),list(A),hAPP(nat,fun(list(A),list(A)),drop(A),B),hAPP(list(A),list(A),tl(A),C)).
% 0.20/0.54    Following clause subsumed by 875 during input processing: 0 [copy,1163,flip.1] {-} hAPP(list(A),list(A),hAPP(nat,fun(list(A),list(A)),take(A),B),hAPP(list(A),list(A),tl(A),C))=hAPP(list(A),list(A),tl(A),hAPP(list(A),list(A),hAPP(nat,fun(list(A),list(A)),take(A),hAPP(nat,nat,suc,B)),C)).
% 0.20/0.54    Following clause subsumed by 886 during input processing: 0 [copy,1164,flip.1] {-} hAPP(list(A),list(A),hAPP(nat,fun(list(A),list(A)),take(A),hAPP(nat,nat,suc,B)),hAPP(list(A),list(A),hAPP(A,fun(list(A),list(A)),cons(A),C),D))=hAPP(list(A),list(A),hAPP(A,fun(list(A),list(A)),cons(A),C),hAPP(list(A),list(A),hAPP(nat,fun(list(A),list(A)),take(A),B),D)).
% 0.20/0.54    Following clause subsumed by 890 during input processing: 0 [copy,1165,flip.1] {-} hAPP(list(A),list(A),hAPP(nat,fun(list(A),list(A)),take(A),hAPP(nat,nat,hAPP(nat,fun(nat,nat),plus_plus(nat),B),C)),D)=hAPP(list(A),list(A),hAPP(list(A),fun(list(A),list(A)),append(A),hAPP(list(A),list(A),hAPP(nat,fun(list(A),list(A)),take(A),B),D)),hAPP(list(A),list(A),hAPP(nat,fun(list(A),list(A)),take(A),C),hAPP(list(A),list(A),hAPP(nat,fun(list(A),list(A)),drop(A),B),D))).
% 0.20/0.54    Following clause subsumed by 905 during input processing: 0 [copy,1166,flip.1] {-} hAPP(nat,nat,hAPP(nat,fun(nat,nat),minus_minus(nat),hAPP(nat,nat,hAPP(nat,fun(nat,nat),minus_minus(nat),A),B)),C)=hAPP(nat,nat,hAPP(nat,fun(nat,nat),minus_minus(nat),A),hAPP(nat,nat,hAPP(nat,fun(nat,nat),plus_plus(nat),B),C)).
% 0.20/0.54    Following clause subsumed by 948 during input processing: 0 [copy,1167,flip.1] {-} hAPP(list(A),list(A),rev(A),hAPP(list(A),list(A),hAPP(nat,fun(list(A),list(A)),take(A),B),C))=hAPP(list(A),list(A),hAPP(nat,fun(list(A),list(A)),drop(A),hAPP(nat,nat,hAPP(nat,fun(nat,nat),minus_minus(nat),hAPP(list(A),nat,size_size(list(A)),C)),B)),hAPP(list(A),list(A),rev(A),C)).
% 0.20/0.55    Following clause subsumed by 952 during input processing: 0 [copy,1168,flip.1] {-} hAPP(fun(A,bool),fun(A,bool),hAPP(fun(A,bool),fun(fun(A,bool),fun(A,bool)),minus_minus(fun(A,bool)),B),bot_bot(fun(A,bool)))=ti(fun(A,bool),B).
% 0.20/0.55    Following clause subsumed by 972 during input processing: 0 [copy,1171,flip.1] {-} hAPP(list(A),list(A),hAPP(nat,fun(list(A),list(A)),take(A),hAPP(nat,nat,suc,bot_bot(nat))),hAPP(list(A),list(A),hAPP(A,fun(list(A),list(A)),cons(A),B),C))=hAPP(list(A),list(A),hAPP(A,fun(list(A),list(A)),cons(A),B),nil(A)).
% 0.20/0.55    Following clause subsumed by 980 during input processing: 0 [copy,1172,flip.1] {-} hAPP(list(A),list(A),tl(A),hAPP(list(A),list(A),hAPP(nat,fun(list(A),list(A)),take(A),B),C))=hAPP(list(A),list(A),hAPP(nat,fun(list(A),list(A)),take(A),hAPP(nat,nat,hAPP(nat,fun(nat,nat),minus_minus(nat),B),hAPP(nat,nat,suc,bot_bot(nat)))),hAPP(list(A),list(A),tl(A),C)).
% 0.20/0.55    Following clause subsumed by 1000 during input processing: 0 [copy,1173,flip.1] {-} hAPP(fun(A,bool),fun(A,bool),hAPP(fun(A,bool),fun(fun(A,bool),fun(A,bool)),minus_minus(fun(A,bool)),B),C)=hAPP(fun(A,bool),fun(A,bool),collect(A),hAPP(fun(A,bool),fun(A,bool),hAPP(fun(A,fun(bool,bool)),fun(fun(A,bool),fun(A,bool)),combs(A,bool,bool),hAPP(fun(A,bool),fun(A,fun(bool,bool)),hAPP(fun(bool,fun(bool,bool)),fun(fun(A,bool),fun(A,fun(bool,bool))),combb(bool,fun(bool,bool),A),fconj),hAPP(fun(A,bool),fun(A,bool),hAPP(fun(A,fun(fun(A,bool),bool)),fun(fun(A,bool),fun(A,bool)),combc(A,fun(A,bool),bool),member(A)),B))),hAPP(fun(A,bool),fun(A,bool),hAPP(fun(bool,bool),fun(fun(A,bool),fun(A,bool)),combb(bool,bool,A),fNot),hAPP(fun(A,bool),fun(A,bool),hAPP(fun(A,fun(fun(A,bool),bool)),fun(fun(A,bool),fun(A,bool)),combc(A,fun(A,bool),bool),member(A)),C)))).
% 0.20/0.55    Following clause subsumed by 1060 during input processing: 0 [copy,1174,flip.1] {-} hAPP(A,B,hAPP(fun(A,C),fun(A,B),hAPP(fun(C,B),fun(fun(A,C),fun(A,B)),combb(C,B,A),D),E),F)=hAPP(C,B,D,hAPP(A,C,E,F)).
% 0.20/0.55    Following clause subsumed by 1061 during input processing: 0 [copy,1175,flip.1] {-} hAPP(A,B,hAPP(C,fun(A,B),hAPP(fun(A,fun(C,B)),fun(C,fun(A,B)),combc(A,C,B),D),E),F)=hAPP(C,B,hAPP(A,fun(C,B),D,F),E).
% 0.20/0.55    Following clause subsumed by 1062 during input processing: 0 [copy,1176,flip.1] {-} hAPP(A,B,hAPP(B,fun(A,B),combk(B,A),C),D)=ti(B,C).
% 0.20/0.55    Following clause subsumed by 1063 during input processing: 0 [copy,1177,flip.1] {-} hAPP(A,B,hAPP(fun(A,C),fun(A,B),hAPP(fun(A,fun(C,B)),fun(fun(A,C),fun(A,B)),combs(A,C,B),D),E),F)=hAPP(C,B,hAPP(A,fun(C,B),D,F),hAPP(A,C,E,F)).
% 0.20/0.55  
% 0.20/0.55  ======= end of input processing =======
% 0.44/0.60  
% 0.44/0.60  Input error on line 564: clause (0) { p_hBOOL(f_hAPP(c_nat,c_bool,f_hAPP(c_nat,f_fun(c_nat,c_bool),f_ord_less(c_nat),v0),v1)), p_eq(f_hAPP(f_list(v2),c_nat,f_size_size(f_list(v2)),v4),v1) -> p_hBOOL(f_hAPP(v2,c_bool,f_hAPP(c_nat,f_fun(v2,c_bool),v3,v0),f_$f53(v2,v3,v1,v0))); p_hBOOL(f_hAPP(c_nat,c_bool,f_hAPP(c_nat,f_fun(c_nat,c_bool),f_ord_less(c_nat),f_$f54(v2,v3,v1,v4)),v1)). }
% 0.44/0.60  
% 0.44/0.60  
% 0.44/0.60  ( found where a function symbol was expected
% 0.44/0.60  
%------------------------------------------------------------------------------