TSTP Solution File: SWC257+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SWC257+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n010.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 : 300s
% DateTime : Wed Jul 27 13:19:01 EDT 2022
% Result : Unknown 199.00s 199.24s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWC257+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n010.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jul 27 04:36:10 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.08/2.28 ----- Otter 3.3f, August 2004 -----
% 2.08/2.28 The process was started by sandbox2 on n010.cluster.edu,
% 2.08/2.28 Wed Jul 27 04:36:10 2022
% 2.08/2.28 The command was "./otter". The process ID is 4779.
% 2.08/2.28
% 2.08/2.28 set(prolog_style_variables).
% 2.08/2.28 set(auto).
% 2.08/2.28 dependent: set(auto1).
% 2.08/2.28 dependent: set(process_input).
% 2.08/2.28 dependent: clear(print_kept).
% 2.08/2.28 dependent: clear(print_new_demod).
% 2.08/2.28 dependent: clear(print_back_demod).
% 2.08/2.28 dependent: clear(print_back_sub).
% 2.08/2.28 dependent: set(control_memory).
% 2.08/2.28 dependent: assign(max_mem, 12000).
% 2.08/2.28 dependent: assign(pick_given_ratio, 4).
% 2.08/2.28 dependent: assign(stats_level, 1).
% 2.08/2.28 dependent: assign(max_seconds, 10800).
% 2.08/2.28 clear(print_given).
% 2.08/2.28
% 2.08/2.28 formula_list(usable).
% 2.08/2.28 all A (A=A).
% 2.08/2.28 all U (ssItem(U)-> (all V (ssItem(V)-> (ne_q(U,V)<->U!=V)))).
% 2.08/2.28 exists U (ssItem(U)& (exists V (ssItem(V)&U!=V))).
% 2.08/2.28 all U (ssList(U)-> (all V (ssItem(V)-> (memberP(U,V)<-> (exists W (ssList(W)& (exists X (ssList(X)&app(W,cons(V,X))=U)))))))).
% 2.08/2.28 all U (ssList(U)-> (singletonP(U)<-> (exists V (ssItem(V)&cons(V,nil)=U)))).
% 2.08/2.28 all U (ssList(U)-> (all V (ssList(V)-> (frontsegP(U,V)<-> (exists W (ssList(W)&app(V,W)=U)))))).
% 2.08/2.28 all U (ssList(U)-> (all V (ssList(V)-> (rearsegP(U,V)<-> (exists W (ssList(W)&app(W,V)=U)))))).
% 2.08/2.28 all U (ssList(U)-> (all V (ssList(V)-> (segmentP(U,V)<-> (exists W (ssList(W)& (exists X (ssList(X)&app(app(W,V),X)=U)))))))).
% 2.08/2.28 all U (ssList(U)-> (cyclefreeP(U)<-> (all V (ssItem(V)-> (all W (ssItem(W)-> (all X (ssList(X)-> (all Y (ssList(Y)-> (all Z (ssList(Z)-> (app(app(X,cons(V,Y)),cons(W,Z))=U-> -(le_q(V,W)&le_q(W,V))))))))))))))).
% 2.08/2.28 all U (ssList(U)-> (totalorderP(U)<-> (all V (ssItem(V)-> (all W (ssItem(W)-> (all X (ssList(X)-> (all Y (ssList(Y)-> (all Z (ssList(Z)-> (app(app(X,cons(V,Y)),cons(W,Z))=U->le_q(V,W)|le_q(W,V)))))))))))))).
% 2.08/2.28 all U (ssList(U)-> (strictorderP(U)<-> (all V (ssItem(V)-> (all W (ssItem(W)-> (all X (ssList(X)-> (all Y (ssList(Y)-> (all Z (ssList(Z)-> (app(app(X,cons(V,Y)),cons(W,Z))=U->lt(V,W)|lt(W,V)))))))))))))).
% 2.08/2.28 all U (ssList(U)-> (totalorderedP(U)<-> (all V (ssItem(V)-> (all W (ssItem(W)-> (all X (ssList(X)-> (all Y (ssList(Y)-> (all Z (ssList(Z)-> (app(app(X,cons(V,Y)),cons(W,Z))=U->le_q(V,W)))))))))))))).
% 2.08/2.28 all U (ssList(U)-> (strictorderedP(U)<-> (all V (ssItem(V)-> (all W (ssItem(W)-> (all X (ssList(X)-> (all Y (ssList(Y)-> (all Z (ssList(Z)-> (app(app(X,cons(V,Y)),cons(W,Z))=U->lt(V,W)))))))))))))).
% 2.08/2.28 all U (ssList(U)-> (duplicatefreeP(U)<-> (all V (ssItem(V)-> (all W (ssItem(W)-> (all X (ssList(X)-> (all Y (ssList(Y)-> (all Z (ssList(Z)-> (app(app(X,cons(V,Y)),cons(W,Z))=U->V!=W))))))))))))).
% 2.08/2.28 all U (ssList(U)-> (e_qualelemsP(U)<-> (all V (ssItem(V)-> (all W (ssItem(W)-> (all X (ssList(X)-> (all Y (ssList(Y)-> (app(X,cons(V,cons(W,Y)))=U->V=W))))))))))).
% 2.08/2.28 all U (ssList(U)-> (all V (ssList(V)-> (ne_q(U,V)<->U!=V)))).
% 2.08/2.28 all U (ssList(U)-> (all V (ssItem(V)->ssList(cons(V,U))))).
% 2.08/2.28 ssList(nil).
% 2.08/2.28 all U (ssList(U)-> (all V (ssItem(V)->cons(V,U)!=U))).
% 2.08/2.28 all U (ssList(U)-> (all V (ssList(V)-> (all W (ssItem(W)-> (all X (ssItem(X)-> (cons(W,U)=cons(X,V)->W=X&V=U)))))))).
% 2.08/2.28 all U (ssList(U)->nil=U| (exists V (ssList(V)& (exists W (ssItem(W)&cons(W,V)=U))))).
% 2.08/2.28 all U (ssList(U)-> (all V (ssItem(V)->nil!=cons(V,U)))).
% 2.08/2.28 all U (ssList(U)-> (nil!=U->ssItem(hd(U)))).
% 2.08/2.28 all U (ssList(U)-> (all V (ssItem(V)->hd(cons(V,U))=V))).
% 2.08/2.28 all U (ssList(U)-> (nil!=U->ssList(tl(U)))).
% 2.08/2.28 all U (ssList(U)-> (all V (ssItem(V)->tl(cons(V,U))=U))).
% 2.08/2.28 all U (ssList(U)-> (all V (ssList(V)->ssList(app(U,V))))).
% 2.08/2.28 all U (ssList(U)-> (all V (ssList(V)-> (all W (ssItem(W)->cons(W,app(V,U))=app(cons(W,V),U)))))).
% 2.08/2.28 all U (ssList(U)->app(nil,U)=U).
% 2.08/2.28 all U (ssItem(U)-> (all V (ssItem(V)-> (le_q(U,V)&le_q(V,U)->U=V)))).
% 2.08/2.28 all U (ssItem(U)-> (all V (ssItem(V)-> (all W (ssItem(W)-> (le_q(U,V)&le_q(V,W)->le_q(U,W))))))).
% 2.08/2.28 all U (ssItem(U)->le_q(U,U)).
% 2.08/2.28 all U (ssItem(U)-> (all V (ssItem(V)-> (ge_q(U,V)<->le_q(V,U))))).
% 2.08/2.28 all U (ssItem(U)-> (all V (ssItem(V)-> (lt(U,V)-> -lt(V,U))))).
% 2.08/2.28 all U (ssItem(U)-> (all V (ssItem(V)-> (all W (ssItem(W)-> (lt(U,V)<(V,W)->lt(U,W))))))).
% 2.08/2.28 all U (ssItem(U)-> (all V (ssItem(V)-> (gt(U,V)<->lt(V,U))))).
% 2.08/2.28 all U (ssItem(U)-> (all V (ssList(V)-> (all W (ssList(W)-> (memberP(app(V,W),U)<->memberP(V,U)|memberP(W,U))))))).
% 2.08/2.28 all U (ssItem(U)-> (all V (ssItem(V)-> (all W (ssList(W)-> (memberP(cons(V,W),U)<->U=V|memberP(W,U))))))).
% 2.08/2.28 all U (ssItem(U)-> -memberP(nil,U)).
% 2.08/2.28 -singletonP(nil).
% 2.08/2.28 all U (ssList(U)-> (all V (ssList(V)-> (all W (ssList(W)-> (frontsegP(U,V)&frontsegP(V,W)->frontsegP(U,W))))))).
% 2.08/2.28 all U (ssList(U)-> (all V (ssList(V)-> (frontsegP(U,V)&frontsegP(V,U)->U=V)))).
% 2.08/2.28 all U (ssList(U)->frontsegP(U,U)).
% 2.08/2.28 all U (ssList(U)-> (all V (ssList(V)-> (all W (ssList(W)-> (frontsegP(U,V)->frontsegP(app(U,W),V))))))).
% 2.08/2.28 all U (ssItem(U)-> (all V (ssItem(V)-> (all W (ssList(W)-> (all X (ssList(X)-> (frontsegP(cons(U,W),cons(V,X))<->U=V&frontsegP(W,X))))))))).
% 2.08/2.28 all U (ssList(U)->frontsegP(U,nil)).
% 2.08/2.28 all U (ssList(U)-> (frontsegP(nil,U)<->nil=U)).
% 2.08/2.28 all U (ssList(U)-> (all V (ssList(V)-> (all W (ssList(W)-> (rearsegP(U,V)&rearsegP(V,W)->rearsegP(U,W))))))).
% 2.08/2.28 all U (ssList(U)-> (all V (ssList(V)-> (rearsegP(U,V)&rearsegP(V,U)->U=V)))).
% 2.08/2.28 all U (ssList(U)->rearsegP(U,U)).
% 2.08/2.28 all U (ssList(U)-> (all V (ssList(V)-> (all W (ssList(W)-> (rearsegP(U,V)->rearsegP(app(W,U),V))))))).
% 2.08/2.28 all U (ssList(U)->rearsegP(U,nil)).
% 2.08/2.28 all U (ssList(U)-> (rearsegP(nil,U)<->nil=U)).
% 2.08/2.28 all U (ssList(U)-> (all V (ssList(V)-> (all W (ssList(W)-> (segmentP(U,V)&segmentP(V,W)->segmentP(U,W))))))).
% 2.08/2.28 all U (ssList(U)-> (all V (ssList(V)-> (segmentP(U,V)&segmentP(V,U)->U=V)))).
% 2.08/2.28 all U (ssList(U)->segmentP(U,U)).
% 2.08/2.28 all U (ssList(U)-> (all V (ssList(V)-> (all W (ssList(W)-> (all X (ssList(X)-> (segmentP(U,V)->segmentP(app(app(W,U),X),V))))))))).
% 2.08/2.28 all U (ssList(U)->segmentP(U,nil)).
% 2.08/2.28 all U (ssList(U)-> (segmentP(nil,U)<->nil=U)).
% 2.08/2.28 all U (ssItem(U)->cyclefreeP(cons(U,nil))).
% 2.08/2.28 cyclefreeP(nil).
% 2.08/2.28 all U (ssItem(U)->totalorderP(cons(U,nil))).
% 2.08/2.28 totalorderP(nil).
% 2.08/2.28 all U (ssItem(U)->strictorderP(cons(U,nil))).
% 2.08/2.28 strictorderP(nil).
% 2.08/2.28 all U (ssItem(U)->totalorderedP(cons(U,nil))).
% 2.08/2.28 totalorderedP(nil).
% 2.08/2.28 all U (ssItem(U)-> (all V (ssList(V)-> (totalorderedP(cons(U,V))<->nil=V|nil!=V&totalorderedP(V)&le_q(U,hd(V)))))).
% 2.08/2.28 all U (ssItem(U)->strictorderedP(cons(U,nil))).
% 2.08/2.28 strictorderedP(nil).
% 2.08/2.28 all U (ssItem(U)-> (all V (ssList(V)-> (strictorderedP(cons(U,V))<->nil=V|nil!=V&strictorderedP(V)<(U,hd(V)))))).
% 2.08/2.28 all U (ssItem(U)->duplicatefreeP(cons(U,nil))).
% 2.08/2.28 duplicatefreeP(nil).
% 2.08/2.28 all U (ssItem(U)->e_qualelemsP(cons(U,nil))).
% 2.08/2.28 e_qualelemsP(nil).
% 2.08/2.28 all U (ssList(U)-> (nil!=U-> (exists V (ssItem(V)&hd(U)=V)))).
% 2.08/2.28 all U (ssList(U)-> (nil!=U-> (exists V (ssList(V)&tl(U)=V)))).
% 2.08/2.28 all U (ssList(U)-> (all V (ssList(V)-> (nil!=V&nil!=U&hd(V)=hd(U)&tl(V)=tl(U)->V=U)))).
% 2.08/2.28 all U (ssList(U)-> (nil!=U->cons(hd(U),tl(U))=U)).
% 2.08/2.28 all U (ssList(U)-> (all V (ssList(V)-> (all W (ssList(W)-> (app(W,V)=app(U,V)->W=U)))))).
% 2.08/2.28 all U (ssList(U)-> (all V (ssList(V)-> (all W (ssList(W)-> (app(V,W)=app(V,U)->W=U)))))).
% 2.08/2.28 all U (ssList(U)-> (all V (ssItem(V)->cons(V,U)=app(cons(V,nil),U)))).
% 2.08/2.28 all U (ssList(U)-> (all V (ssList(V)-> (all W (ssList(W)->app(app(U,V),W)=app(U,app(V,W))))))).
% 2.08/2.28 all U (ssList(U)-> (all V (ssList(V)-> (nil=app(U,V)<->nil=V&nil=U)))).
% 2.08/2.28 all U (ssList(U)->app(U,nil)=U).
% 2.08/2.28 all U (ssList(U)-> (all V (ssList(V)-> (nil!=U->hd(app(U,V))=hd(U))))).
% 2.08/2.28 all U (ssList(U)-> (all V (ssList(V)-> (nil!=U->tl(app(U,V))=app(tl(U),V))))).
% 2.08/2.28 all U (ssItem(U)-> (all V (ssItem(V)-> (ge_q(U,V)&ge_q(V,U)->U=V)))).
% 2.08/2.28 all U (ssItem(U)-> (all V (ssItem(V)-> (all W (ssItem(W)-> (ge_q(U,V)&ge_q(V,W)->ge_q(U,W))))))).
% 2.08/2.28 all U (ssItem(U)->ge_q(U,U)).
% 2.08/2.28 all U (ssItem(U)-> -lt(U,U)).
% 2.08/2.28 all U (ssItem(U)-> (all V (ssItem(V)-> (all W (ssItem(W)-> (le_q(U,V)<(V,W)->lt(U,W))))))).
% 2.08/2.28 all U (ssItem(U)-> (all V (ssItem(V)-> (le_q(U,V)->U=V|lt(U,V))))).
% 2.08/2.28 all U (ssItem(U)-> (all V (ssItem(V)-> (lt(U,V)<->U!=V&le_q(U,V))))).
% 2.08/2.28 all U (ssItem(U)-> (all V (ssItem(V)-> (gt(U,V)-> -gt(V,U))))).
% 2.08/2.28 all U (ssItem(U)-> (all V (ssItem(V)-> (all W (ssItem(W)-> (gt(U,V)>(V,W)->gt(U,W))))))).
% 2.08/2.28 -(all U (ssList(U)-> (all V (ssList(V)-> (all W (ssList(W)-> (all X (-ssList(X)|V!=X|U!=W|totalorderedP(U)| (all Y (-ssItem(Y)|cons(Y,nil)!=W| -memberP(X,Y)| (exists Z (ssItem(Z)&Y!=Z&memberP(X,Z)&le_q(Y,Z)))))& (nil!=X|nil!=W))))))))).
% 2.08/2.28 end_of_list.
% 2.08/2.28
% 2.08/2.28 -------> usable clausifies to:
% 2.08/2.28
% 2.08/2.28 list(usable).
% 2.08/2.28 0 [] A=A.
% 2.08/2.28 0 [] -ssItem(U)| -ssItem(V)| -ne_q(U,V)|U!=V.
% 2.08/2.28 0 [] -ssItem(U)| -ssItem(V)|ne_q(U,V)|U=V.
% 2.08/2.28 0 [] ssItem($c2).
% 2.08/2.28 0 [] ssItem($c1).
% 2.08/2.28 0 [] $c2!=$c1.
% 2.08/2.28 0 [] -ssList(U)| -ssItem(V)| -memberP(U,V)|ssList($f2(U,V)).
% 2.08/2.28 0 [] -ssList(U)| -ssItem(V)| -memberP(U,V)|ssList($f1(U,V)).
% 2.08/2.28 0 [] -ssList(U)| -ssItem(V)| -memberP(U,V)|app($f2(U,V),cons(V,$f1(U,V)))=U.
% 2.08/2.28 0 [] -ssList(U)| -ssItem(V)|memberP(U,V)| -ssList(W)| -ssList(X)|app(W,cons(V,X))!=U.
% 2.08/2.28 0 [] -ssList(U)| -singletonP(U)|ssItem($f3(U)).
% 2.08/2.28 0 [] -ssList(U)| -singletonP(U)|cons($f3(U),nil)=U.
% 2.08/2.28 0 [] -ssList(U)|singletonP(U)| -ssItem(V)|cons(V,nil)!=U.
% 2.08/2.28 0 [] -ssList(U)| -ssList(V)| -frontsegP(U,V)|ssList($f4(U,V)).
% 2.08/2.28 0 [] -ssList(U)| -ssList(V)| -frontsegP(U,V)|app(V,$f4(U,V))=U.
% 2.08/2.28 0 [] -ssList(U)| -ssList(V)|frontsegP(U,V)| -ssList(W)|app(V,W)!=U.
% 2.08/2.28 0 [] -ssList(U)| -ssList(V)| -rearsegP(U,V)|ssList($f5(U,V)).
% 2.08/2.28 0 [] -ssList(U)| -ssList(V)| -rearsegP(U,V)|app($f5(U,V),V)=U.
% 2.08/2.28 0 [] -ssList(U)| -ssList(V)|rearsegP(U,V)| -ssList(W)|app(W,V)!=U.
% 2.08/2.28 0 [] -ssList(U)| -ssList(V)| -segmentP(U,V)|ssList($f7(U,V)).
% 2.08/2.28 0 [] -ssList(U)| -ssList(V)| -segmentP(U,V)|ssList($f6(U,V)).
% 2.08/2.28 0 [] -ssList(U)| -ssList(V)| -segmentP(U,V)|app(app($f7(U,V),V),$f6(U,V))=U.
% 2.08/2.28 0 [] -ssList(U)| -ssList(V)|segmentP(U,V)| -ssList(W)| -ssList(X)|app(app(W,V),X)!=U.
% 2.08/2.28 0 [] -ssList(U)| -cyclefreeP(U)| -ssItem(V)| -ssItem(W)| -ssList(X)| -ssList(Y)| -ssList(Z)|app(app(X,cons(V,Y)),cons(W,Z))!=U| -le_q(V,W)| -le_q(W,V).
% 2.08/2.28 0 [] -ssList(U)|cyclefreeP(U)|ssItem($f12(U)).
% 2.08/2.28 0 [] -ssList(U)|cyclefreeP(U)|ssItem($f11(U)).
% 2.08/2.28 0 [] -ssList(U)|cyclefreeP(U)|ssList($f10(U)).
% 2.08/2.28 0 [] -ssList(U)|cyclefreeP(U)|ssList($f9(U)).
% 2.08/2.28 0 [] -ssList(U)|cyclefreeP(U)|ssList($f8(U)).
% 2.08/2.28 0 [] -ssList(U)|cyclefreeP(U)|app(app($f10(U),cons($f12(U),$f9(U))),cons($f11(U),$f8(U)))=U.
% 2.08/2.28 0 [] -ssList(U)|cyclefreeP(U)|le_q($f12(U),$f11(U)).
% 2.08/2.28 0 [] -ssList(U)|cyclefreeP(U)|le_q($f11(U),$f12(U)).
% 2.08/2.28 0 [] -ssList(U)| -totalorderP(U)| -ssItem(V)| -ssItem(W)| -ssList(X)| -ssList(Y)| -ssList(Z)|app(app(X,cons(V,Y)),cons(W,Z))!=U|le_q(V,W)|le_q(W,V).
% 2.08/2.28 0 [] -ssList(U)|totalorderP(U)|ssItem($f17(U)).
% 2.08/2.28 0 [] -ssList(U)|totalorderP(U)|ssItem($f16(U)).
% 2.08/2.28 0 [] -ssList(U)|totalorderP(U)|ssList($f15(U)).
% 2.08/2.28 0 [] -ssList(U)|totalorderP(U)|ssList($f14(U)).
% 2.08/2.28 0 [] -ssList(U)|totalorderP(U)|ssList($f13(U)).
% 2.08/2.28 0 [] -ssList(U)|totalorderP(U)|app(app($f15(U),cons($f17(U),$f14(U))),cons($f16(U),$f13(U)))=U.
% 2.08/2.28 0 [] -ssList(U)|totalorderP(U)| -le_q($f17(U),$f16(U)).
% 2.08/2.28 0 [] -ssList(U)|totalorderP(U)| -le_q($f16(U),$f17(U)).
% 2.08/2.28 0 [] -ssList(U)| -strictorderP(U)| -ssItem(V)| -ssItem(W)| -ssList(X)| -ssList(Y)| -ssList(Z)|app(app(X,cons(V,Y)),cons(W,Z))!=U|lt(V,W)|lt(W,V).
% 2.08/2.28 0 [] -ssList(U)|strictorderP(U)|ssItem($f22(U)).
% 2.08/2.28 0 [] -ssList(U)|strictorderP(U)|ssItem($f21(U)).
% 2.08/2.28 0 [] -ssList(U)|strictorderP(U)|ssList($f20(U)).
% 2.08/2.28 0 [] -ssList(U)|strictorderP(U)|ssList($f19(U)).
% 2.08/2.28 0 [] -ssList(U)|strictorderP(U)|ssList($f18(U)).
% 2.08/2.28 0 [] -ssList(U)|strictorderP(U)|app(app($f20(U),cons($f22(U),$f19(U))),cons($f21(U),$f18(U)))=U.
% 2.08/2.28 0 [] -ssList(U)|strictorderP(U)| -lt($f22(U),$f21(U)).
% 2.08/2.28 0 [] -ssList(U)|strictorderP(U)| -lt($f21(U),$f22(U)).
% 2.08/2.28 0 [] -ssList(U)| -totalorderedP(U)| -ssItem(V)| -ssItem(W)| -ssList(X)| -ssList(Y)| -ssList(Z)|app(app(X,cons(V,Y)),cons(W,Z))!=U|le_q(V,W).
% 2.08/2.28 0 [] -ssList(U)|totalorderedP(U)|ssItem($f27(U)).
% 2.08/2.28 0 [] -ssList(U)|totalorderedP(U)|ssItem($f26(U)).
% 2.08/2.28 0 [] -ssList(U)|totalorderedP(U)|ssList($f25(U)).
% 2.08/2.28 0 [] -ssList(U)|totalorderedP(U)|ssList($f24(U)).
% 2.08/2.28 0 [] -ssList(U)|totalorderedP(U)|ssList($f23(U)).
% 2.08/2.28 0 [] -ssList(U)|totalorderedP(U)|app(app($f25(U),cons($f27(U),$f24(U))),cons($f26(U),$f23(U)))=U.
% 2.08/2.28 0 [] -ssList(U)|totalorderedP(U)| -le_q($f27(U),$f26(U)).
% 2.08/2.28 0 [] -ssList(U)| -strictorderedP(U)| -ssItem(V)| -ssItem(W)| -ssList(X)| -ssList(Y)| -ssList(Z)|app(app(X,cons(V,Y)),cons(W,Z))!=U|lt(V,W).
% 2.08/2.28 0 [] -ssList(U)|strictorderedP(U)|ssItem($f32(U)).
% 2.08/2.28 0 [] -ssList(U)|strictorderedP(U)|ssItem($f31(U)).
% 2.08/2.28 0 [] -ssList(U)|strictorderedP(U)|ssList($f30(U)).
% 2.08/2.28 0 [] -ssList(U)|strictorderedP(U)|ssList($f29(U)).
% 2.08/2.28 0 [] -ssList(U)|strictorderedP(U)|ssList($f28(U)).
% 2.08/2.28 0 [] -ssList(U)|strictorderedP(U)|app(app($f30(U),cons($f32(U),$f29(U))),cons($f31(U),$f28(U)))=U.
% 2.08/2.28 0 [] -ssList(U)|strictorderedP(U)| -lt($f32(U),$f31(U)).
% 2.08/2.28 0 [] -ssList(U)| -duplicatefreeP(U)| -ssItem(V)| -ssItem(W)| -ssList(X)| -ssList(Y)| -ssList(Z)|app(app(X,cons(V,Y)),cons(W,Z))!=U|V!=W.
% 2.08/2.28 0 [] -ssList(U)|duplicatefreeP(U)|ssItem($f37(U)).
% 2.08/2.28 0 [] -ssList(U)|duplicatefreeP(U)|ssItem($f36(U)).
% 2.08/2.28 0 [] -ssList(U)|duplicatefreeP(U)|ssList($f35(U)).
% 2.08/2.28 0 [] -ssList(U)|duplicatefreeP(U)|ssList($f34(U)).
% 2.08/2.28 0 [] -ssList(U)|duplicatefreeP(U)|ssList($f33(U)).
% 2.08/2.28 0 [] -ssList(U)|duplicatefreeP(U)|app(app($f35(U),cons($f37(U),$f34(U))),cons($f36(U),$f33(U)))=U.
% 2.08/2.28 0 [] -ssList(U)|duplicatefreeP(U)|$f37(U)=$f36(U).
% 2.08/2.28 0 [] -ssList(U)| -e_qualelemsP(U)| -ssItem(V)| -ssItem(W)| -ssList(X)| -ssList(Y)|app(X,cons(V,cons(W,Y)))!=U|V=W.
% 2.08/2.28 0 [] -ssList(U)|e_qualelemsP(U)|ssItem($f41(U)).
% 2.08/2.28 0 [] -ssList(U)|e_qualelemsP(U)|ssItem($f40(U)).
% 2.08/2.28 0 [] -ssList(U)|e_qualelemsP(U)|ssList($f39(U)).
% 2.08/2.28 0 [] -ssList(U)|e_qualelemsP(U)|ssList($f38(U)).
% 2.08/2.28 0 [] -ssList(U)|e_qualelemsP(U)|app($f39(U),cons($f41(U),cons($f40(U),$f38(U))))=U.
% 2.08/2.28 0 [] -ssList(U)|e_qualelemsP(U)|$f41(U)!=$f40(U).
% 2.08/2.28 0 [] -ssList(U)| -ssList(V)| -ne_q(U,V)|U!=V.
% 2.08/2.28 0 [] -ssList(U)| -ssList(V)|ne_q(U,V)|U=V.
% 2.08/2.28 0 [] -ssList(U)| -ssItem(V)|ssList(cons(V,U)).
% 2.08/2.28 0 [] ssList(nil).
% 2.08/2.28 0 [] -ssList(U)| -ssItem(V)|cons(V,U)!=U.
% 2.08/2.28 0 [] -ssList(U)| -ssList(V)| -ssItem(W)| -ssItem(X)|cons(W,U)!=cons(X,V)|W=X.
% 2.08/2.28 0 [] -ssList(U)| -ssList(V)| -ssItem(W)| -ssItem(X)|cons(W,U)!=cons(X,V)|V=U.
% 2.08/2.28 0 [] -ssList(U)|nil=U|ssList($f43(U)).
% 2.08/2.28 0 [] -ssList(U)|nil=U|ssItem($f42(U)).
% 2.08/2.28 0 [] -ssList(U)|nil=U|cons($f42(U),$f43(U))=U.
% 2.08/2.28 0 [] -ssList(U)| -ssItem(V)|nil!=cons(V,U).
% 2.08/2.28 0 [] -ssList(U)|nil=U|ssItem(hd(U)).
% 2.08/2.28 0 [] -ssList(U)| -ssItem(V)|hd(cons(V,U))=V.
% 2.08/2.28 0 [] -ssList(U)|nil=U|ssList(tl(U)).
% 2.08/2.28 0 [] -ssList(U)| -ssItem(V)|tl(cons(V,U))=U.
% 2.08/2.28 0 [] -ssList(U)| -ssList(V)|ssList(app(U,V)).
% 2.08/2.28 0 [] -ssList(U)| -ssList(V)| -ssItem(W)|cons(W,app(V,U))=app(cons(W,V),U).
% 2.08/2.28 0 [] -ssList(U)|app(nil,U)=U.
% 2.08/2.28 0 [] -ssItem(U)| -ssItem(V)| -le_q(U,V)| -le_q(V,U)|U=V.
% 2.08/2.28 0 [] -ssItem(U)| -ssItem(V)| -ssItem(W)| -le_q(U,V)| -le_q(V,W)|le_q(U,W).
% 2.08/2.28 0 [] -ssItem(U)|le_q(U,U).
% 2.08/2.28 0 [] -ssItem(U)| -ssItem(V)| -ge_q(U,V)|le_q(V,U).
% 2.08/2.28 0 [] -ssItem(U)| -ssItem(V)|ge_q(U,V)| -le_q(V,U).
% 2.08/2.28 0 [] -ssItem(U)| -ssItem(V)| -lt(U,V)| -lt(V,U).
% 2.08/2.28 0 [] -ssItem(U)| -ssItem(V)| -ssItem(W)| -lt(U,V)| -lt(V,W)|lt(U,W).
% 2.08/2.28 0 [] -ssItem(U)| -ssItem(V)| -gt(U,V)|lt(V,U).
% 2.08/2.28 0 [] -ssItem(U)| -ssItem(V)|gt(U,V)| -lt(V,U).
% 2.08/2.28 0 [] -ssItem(U)| -ssList(V)| -ssList(W)| -memberP(app(V,W),U)|memberP(V,U)|memberP(W,U).
% 2.08/2.28 0 [] -ssItem(U)| -ssList(V)| -ssList(W)|memberP(app(V,W),U)| -memberP(V,U).
% 2.08/2.28 0 [] -ssItem(U)| -ssList(V)| -ssList(W)|memberP(app(V,W),U)| -memberP(W,U).
% 2.08/2.28 0 [] -ssItem(U)| -ssItem(V)| -ssList(W)| -memberP(cons(V,W),U)|U=V|memberP(W,U).
% 2.08/2.28 0 [] -ssItem(U)| -ssItem(V)| -ssList(W)|memberP(cons(V,W),U)|U!=V.
% 2.08/2.28 0 [] -ssItem(U)| -ssItem(V)| -ssList(W)|memberP(cons(V,W),U)| -memberP(W,U).
% 2.08/2.28 0 [] -ssItem(U)| -memberP(nil,U).
% 2.08/2.28 0 [] -singletonP(nil).
% 2.08/2.28 0 [] -ssList(U)| -ssList(V)| -ssList(W)| -frontsegP(U,V)| -frontsegP(V,W)|frontsegP(U,W).
% 2.08/2.28 0 [] -ssList(U)| -ssList(V)| -frontsegP(U,V)| -frontsegP(V,U)|U=V.
% 2.08/2.28 0 [] -ssList(U)|frontsegP(U,U).
% 2.08/2.28 0 [] -ssList(U)| -ssList(V)| -ssList(W)| -frontsegP(U,V)|frontsegP(app(U,W),V).
% 2.08/2.28 0 [] -ssItem(U)| -ssItem(V)| -ssList(W)| -ssList(X)| -frontsegP(cons(U,W),cons(V,X))|U=V.
% 2.08/2.28 0 [] -ssItem(U)| -ssItem(V)| -ssList(W)| -ssList(X)| -frontsegP(cons(U,W),cons(V,X))|frontsegP(W,X).
% 2.08/2.28 0 [] -ssItem(U)| -ssItem(V)| -ssList(W)| -ssList(X)|frontsegP(cons(U,W),cons(V,X))|U!=V| -frontsegP(W,X).
% 2.08/2.28 0 [] -ssList(U)|frontsegP(U,nil).
% 2.08/2.28 0 [] -ssList(U)| -frontsegP(nil,U)|nil=U.
% 2.08/2.28 0 [] -ssList(U)|frontsegP(nil,U)|nil!=U.
% 2.08/2.28 0 [] -ssList(U)| -ssList(V)| -ssList(W)| -rearsegP(U,V)| -rearsegP(V,W)|rearsegP(U,W).
% 2.08/2.28 0 [] -ssList(U)| -ssList(V)| -rearsegP(U,V)| -rearsegP(V,U)|U=V.
% 2.08/2.28 0 [] -ssList(U)|rearsegP(U,U).
% 2.08/2.28 0 [] -ssList(U)| -ssList(V)| -ssList(W)| -rearsegP(U,V)|rearsegP(app(W,U),V).
% 2.08/2.28 0 [] -ssList(U)|rearsegP(U,nil).
% 2.08/2.28 0 [] -ssList(U)| -rearsegP(nil,U)|nil=U.
% 2.08/2.28 0 [] -ssList(U)|rearsegP(nil,U)|nil!=U.
% 2.08/2.28 0 [] -ssList(U)| -ssList(V)| -ssList(W)| -segmentP(U,V)| -segmentP(V,W)|segmentP(U,W).
% 2.08/2.28 0 [] -ssList(U)| -ssList(V)| -segmentP(U,V)| -segmentP(V,U)|U=V.
% 2.08/2.28 0 [] -ssList(U)|segmentP(U,U).
% 2.08/2.28 0 [] -ssList(U)| -ssList(V)| -ssList(W)| -ssList(X)| -segmentP(U,V)|segmentP(app(app(W,U),X),V).
% 2.08/2.29 0 [] -ssList(U)|segmentP(U,nil).
% 2.08/2.29 0 [] -ssList(U)| -segmentP(nil,U)|nil=U.
% 2.08/2.29 0 [] -ssList(U)|segmentP(nil,U)|nil!=U.
% 2.08/2.29 0 [] -ssItem(U)|cyclefreeP(cons(U,nil)).
% 2.08/2.29 0 [] cyclefreeP(nil).
% 2.08/2.29 0 [] -ssItem(U)|totalorderP(cons(U,nil)).
% 2.08/2.29 0 [] totalorderP(nil).
% 2.08/2.29 0 [] -ssItem(U)|strictorderP(cons(U,nil)).
% 2.08/2.29 0 [] strictorderP(nil).
% 2.08/2.29 0 [] -ssItem(U)|totalorderedP(cons(U,nil)).
% 2.08/2.29 0 [] totalorderedP(nil).
% 2.08/2.29 0 [] -ssItem(U)| -ssList(V)| -totalorderedP(cons(U,V))|nil=V|totalorderedP(V).
% 2.08/2.29 0 [] -ssItem(U)| -ssList(V)| -totalorderedP(cons(U,V))|nil=V|le_q(U,hd(V)).
% 2.08/2.29 0 [] -ssItem(U)| -ssList(V)|totalorderedP(cons(U,V))|nil!=V.
% 2.08/2.29 0 [] -ssItem(U)| -ssList(V)|totalorderedP(cons(U,V))|nil=V| -totalorderedP(V)| -le_q(U,hd(V)).
% 2.08/2.29 0 [] -ssItem(U)|strictorderedP(cons(U,nil)).
% 2.08/2.29 0 [] strictorderedP(nil).
% 2.08/2.29 0 [] -ssItem(U)| -ssList(V)| -strictorderedP(cons(U,V))|nil=V|strictorderedP(V).
% 2.08/2.29 0 [] -ssItem(U)| -ssList(V)| -strictorderedP(cons(U,V))|nil=V|lt(U,hd(V)).
% 2.08/2.29 0 [] -ssItem(U)| -ssList(V)|strictorderedP(cons(U,V))|nil!=V.
% 2.08/2.29 0 [] -ssItem(U)| -ssList(V)|strictorderedP(cons(U,V))|nil=V| -strictorderedP(V)| -lt(U,hd(V)).
% 2.08/2.29 0 [] -ssItem(U)|duplicatefreeP(cons(U,nil)).
% 2.08/2.29 0 [] duplicatefreeP(nil).
% 2.08/2.29 0 [] -ssItem(U)|e_qualelemsP(cons(U,nil)).
% 2.08/2.29 0 [] e_qualelemsP(nil).
% 2.08/2.29 0 [] -ssList(U)|nil=U|ssItem($f44(U)).
% 2.08/2.29 0 [] -ssList(U)|nil=U|hd(U)=$f44(U).
% 2.08/2.29 0 [] -ssList(U)|nil=U|ssList($f45(U)).
% 2.08/2.29 0 [] -ssList(U)|nil=U|tl(U)=$f45(U).
% 2.08/2.29 0 [] -ssList(U)| -ssList(V)|nil=V|nil=U|hd(V)!=hd(U)|tl(V)!=tl(U)|V=U.
% 2.08/2.29 0 [] -ssList(U)|nil=U|cons(hd(U),tl(U))=U.
% 2.08/2.29 0 [] -ssList(U)| -ssList(V)| -ssList(W)|app(W,V)!=app(U,V)|W=U.
% 2.08/2.29 0 [] -ssList(U)| -ssList(V)| -ssList(W)|app(V,W)!=app(V,U)|W=U.
% 2.08/2.29 0 [] -ssList(U)| -ssItem(V)|cons(V,U)=app(cons(V,nil),U).
% 2.08/2.29 0 [] -ssList(U)| -ssList(V)| -ssList(W)|app(app(U,V),W)=app(U,app(V,W)).
% 2.08/2.29 0 [] -ssList(U)| -ssList(V)|nil!=app(U,V)|nil=V.
% 2.08/2.29 0 [] -ssList(U)| -ssList(V)|nil!=app(U,V)|nil=U.
% 2.08/2.29 0 [] -ssList(U)| -ssList(V)|nil=app(U,V)|nil!=V|nil!=U.
% 2.08/2.29 0 [] -ssList(U)|app(U,nil)=U.
% 2.08/2.29 0 [] -ssList(U)| -ssList(V)|nil=U|hd(app(U,V))=hd(U).
% 2.08/2.29 0 [] -ssList(U)| -ssList(V)|nil=U|tl(app(U,V))=app(tl(U),V).
% 2.08/2.29 0 [] -ssItem(U)| -ssItem(V)| -ge_q(U,V)| -ge_q(V,U)|U=V.
% 2.08/2.29 0 [] -ssItem(U)| -ssItem(V)| -ssItem(W)| -ge_q(U,V)| -ge_q(V,W)|ge_q(U,W).
% 2.08/2.29 0 [] -ssItem(U)|ge_q(U,U).
% 2.08/2.29 0 [] -ssItem(U)| -lt(U,U).
% 2.08/2.29 0 [] -ssItem(U)| -ssItem(V)| -ssItem(W)| -le_q(U,V)| -lt(V,W)|lt(U,W).
% 2.08/2.29 0 [] -ssItem(U)| -ssItem(V)| -le_q(U,V)|U=V|lt(U,V).
% 2.08/2.29 0 [] -ssItem(U)| -ssItem(V)| -lt(U,V)|U!=V.
% 2.08/2.29 0 [] -ssItem(U)| -ssItem(V)| -lt(U,V)|le_q(U,V).
% 2.08/2.29 0 [] -ssItem(U)| -ssItem(V)|lt(U,V)|U=V| -le_q(U,V).
% 2.08/2.29 0 [] -ssItem(U)| -ssItem(V)| -gt(U,V)| -gt(V,U).
% 2.08/2.29 0 [] -ssItem(U)| -ssItem(V)| -ssItem(W)| -gt(U,V)| -gt(V,W)|gt(U,W).
% 2.08/2.29 0 [] ssList($c7).
% 2.08/2.29 0 [] ssList($c6).
% 2.08/2.29 0 [] ssList($c5).
% 2.08/2.29 0 [] ssList($c4).
% 2.08/2.29 0 [] $c6=$c4.
% 2.08/2.29 0 [] $c7=$c5.
% 2.08/2.29 0 [] -totalorderedP($c7).
% 2.08/2.29 0 [] ssItem($c3)|nil=$c4.
% 2.08/2.29 0 [] ssItem($c3)|nil=$c5.
% 2.08/2.29 0 [] cons($c3,nil)=$c5|nil=$c4.
% 2.08/2.29 0 [] cons($c3,nil)=$c5|nil=$c5.
% 2.08/2.29 0 [] memberP($c4,$c3)|nil=$c4.
% 2.08/2.29 0 [] memberP($c4,$c3)|nil=$c5.
% 2.08/2.29 0 [] -ssItem(Z)|$c3=Z| -memberP($c4,Z)| -le_q($c3,Z)|nil=$c4.
% 2.08/2.29 0 [] -ssItem(Z)|$c3=Z| -memberP($c4,Z)| -le_q($c3,Z)|nil=$c5.
% 2.08/2.29 end_of_list.
% 2.08/2.29
% 2.08/2.29 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=10.
% 2.08/2.29
% 2.08/2.29 This ia a non-Horn set with equality. The strategy will be
% 2.08/2.29 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.08/2.29 deletion, with positive clauses in sos and nonpositive
% 2.08/2.29 clauses in usable.
% 2.08/2.29
% 2.08/2.29 dependent: set(knuth_bendix).
% 2.08/2.29 dependent: set(anl_eq).
% 2.08/2.29 dependent: set(para_from).
% 2.08/2.29 dependent: set(para_into).
% 2.08/2.29 dependent: clear(para_from_right).
% 2.08/2.29 dependent: clear(para_into_right).
% 2.08/2.29 dependent: set(para_from_vars).
% 2.08/2.29 dependent: set(eq_units_both_ways).
% 2.08/2.29 dependent: set(dynamic_demod_all).
% 2.08/2.29 dependent: set(dynamic_demod).
% 2.08/2.29 dependent: set(order_eq).
% 2.08/2.29 dependent: set(back_demod).
% 2.08/2.29 dependent: set(lrpo).
% 2.08/2.29 dependent: set(hyper_res).
% 2.08/2.29 dependent: set(unit_deletion).
% 2.08/2.29 dependent: set(factor).
% 2.08/2.29
% 2.08/2.29 ------------> process usable:
% 2.08/2.29 ** KEPT (pick-wt=10): 1 [] -ssItem(A)| -ssItem(B)| -ne_q(A,B)|A!=B.
% 2.08/2.29 ** KEPT (pick-wt=10): 2 [] -ssItem(A)| -ssItem(B)|ne_q(A,B)|A=B.
% 2.08/2.29 ** KEPT (pick-wt=3): 3 [] $c2!=$c1.
% 2.08/2.29 ** KEPT (pick-wt=11): 4 [] -ssList(A)| -ssItem(B)| -memberP(A,B)|ssList($f2(A,B)).
% 2.08/2.29 ** KEPT (pick-wt=11): 5 [] -ssList(A)| -ssItem(B)| -memberP(A,B)|ssList($f1(A,B)).
% 2.08/2.29 ** KEPT (pick-wt=18): 6 [] -ssList(A)| -ssItem(B)| -memberP(A,B)|app($f2(A,B),cons(B,$f1(A,B)))=A.
% 2.08/2.29 ** KEPT (pick-wt=18): 7 [] -ssList(A)| -ssItem(B)|memberP(A,B)| -ssList(C)| -ssList(D)|app(C,cons(B,D))!=A.
% 2.08/2.29 ** KEPT (pick-wt=7): 8 [] -ssList(A)| -singletonP(A)|ssItem($f3(A)).
% 2.08/2.29 ** KEPT (pick-wt=10): 9 [] -ssList(A)| -singletonP(A)|cons($f3(A),nil)=A.
% 2.08/2.29 ** KEPT (pick-wt=11): 10 [] -ssList(A)|singletonP(A)| -ssItem(B)|cons(B,nil)!=A.
% 2.08/2.29 ** KEPT (pick-wt=11): 11 [] -ssList(A)| -ssList(B)| -frontsegP(A,B)|ssList($f4(A,B)).
% 2.08/2.29 ** KEPT (pick-wt=14): 12 [] -ssList(A)| -ssList(B)| -frontsegP(A,B)|app(B,$f4(A,B))=A.
% 2.08/2.29 ** KEPT (pick-wt=14): 13 [] -ssList(A)| -ssList(B)|frontsegP(A,B)| -ssList(C)|app(B,C)!=A.
% 2.08/2.29 ** KEPT (pick-wt=11): 14 [] -ssList(A)| -ssList(B)| -rearsegP(A,B)|ssList($f5(A,B)).
% 2.08/2.29 ** KEPT (pick-wt=14): 15 [] -ssList(A)| -ssList(B)| -rearsegP(A,B)|app($f5(A,B),B)=A.
% 2.08/2.29 ** KEPT (pick-wt=14): 16 [] -ssList(A)| -ssList(B)|rearsegP(A,B)| -ssList(C)|app(C,B)!=A.
% 2.08/2.29 ** KEPT (pick-wt=11): 17 [] -ssList(A)| -ssList(B)| -segmentP(A,B)|ssList($f7(A,B)).
% 2.08/2.29 ** KEPT (pick-wt=11): 18 [] -ssList(A)| -ssList(B)| -segmentP(A,B)|ssList($f6(A,B)).
% 2.08/2.29 ** KEPT (pick-wt=18): 19 [] -ssList(A)| -ssList(B)| -segmentP(A,B)|app(app($f7(A,B),B),$f6(A,B))=A.
% 2.08/2.29 ** KEPT (pick-wt=18): 20 [] -ssList(A)| -ssList(B)|segmentP(A,B)| -ssList(C)| -ssList(D)|app(app(C,B),D)!=A.
% 2.08/2.29 ** KEPT (pick-wt=31): 21 [] -ssList(A)| -cyclefreeP(A)| -ssItem(B)| -ssItem(C)| -ssList(D)| -ssList(E)| -ssList(F)|app(app(D,cons(B,E)),cons(C,F))!=A| -le_q(B,C)| -le_q(C,B).
% 2.08/2.29 ** KEPT (pick-wt=7): 22 [] -ssList(A)|cyclefreeP(A)|ssItem($f12(A)).
% 2.08/2.29 ** KEPT (pick-wt=7): 23 [] -ssList(A)|cyclefreeP(A)|ssItem($f11(A)).
% 2.08/2.29 ** KEPT (pick-wt=7): 24 [] -ssList(A)|cyclefreeP(A)|ssList($f10(A)).
% 2.08/2.29 ** KEPT (pick-wt=7): 25 [] -ssList(A)|cyclefreeP(A)|ssList($f9(A)).
% 2.08/2.29 ** KEPT (pick-wt=7): 26 [] -ssList(A)|cyclefreeP(A)|ssList($f8(A)).
% 2.08/2.29 ** KEPT (pick-wt=20): 27 [] -ssList(A)|cyclefreeP(A)|app(app($f10(A),cons($f12(A),$f9(A))),cons($f11(A),$f8(A)))=A.
% 2.08/2.29 ** KEPT (pick-wt=9): 28 [] -ssList(A)|cyclefreeP(A)|le_q($f12(A),$f11(A)).
% 2.08/2.29 ** KEPT (pick-wt=9): 29 [] -ssList(A)|cyclefreeP(A)|le_q($f11(A),$f12(A)).
% 2.08/2.29 ** KEPT (pick-wt=31): 30 [] -ssList(A)| -totalorderP(A)| -ssItem(B)| -ssItem(C)| -ssList(D)| -ssList(E)| -ssList(F)|app(app(D,cons(B,E)),cons(C,F))!=A|le_q(B,C)|le_q(C,B).
% 2.08/2.29 ** KEPT (pick-wt=7): 31 [] -ssList(A)|totalorderP(A)|ssItem($f17(A)).
% 2.08/2.29 ** KEPT (pick-wt=7): 32 [] -ssList(A)|totalorderP(A)|ssItem($f16(A)).
% 2.08/2.29 ** KEPT (pick-wt=7): 33 [] -ssList(A)|totalorderP(A)|ssList($f15(A)).
% 2.08/2.29 ** KEPT (pick-wt=7): 34 [] -ssList(A)|totalorderP(A)|ssList($f14(A)).
% 2.08/2.29 ** KEPT (pick-wt=7): 35 [] -ssList(A)|totalorderP(A)|ssList($f13(A)).
% 2.08/2.29 ** KEPT (pick-wt=20): 36 [] -ssList(A)|totalorderP(A)|app(app($f15(A),cons($f17(A),$f14(A))),cons($f16(A),$f13(A)))=A.
% 2.08/2.29 ** KEPT (pick-wt=9): 37 [] -ssList(A)|totalorderP(A)| -le_q($f17(A),$f16(A)).
% 2.08/2.29 ** KEPT (pick-wt=9): 38 [] -ssList(A)|totalorderP(A)| -le_q($f16(A),$f17(A)).
% 2.08/2.29 ** KEPT (pick-wt=31): 39 [] -ssList(A)| -strictorderP(A)| -ssItem(B)| -ssItem(C)| -ssList(D)| -ssList(E)| -ssList(F)|app(app(D,cons(B,E)),cons(C,F))!=A|lt(B,C)|lt(C,B).
% 2.08/2.29 ** KEPT (pick-wt=7): 40 [] -ssList(A)|strictorderP(A)|ssItem($f22(A)).
% 2.08/2.29 ** KEPT (pick-wt=7): 41 [] -ssList(A)|strictorderP(A)|ssItem($f21(A)).
% 2.08/2.29 ** KEPT (pick-wt=7): 42 [] -ssList(A)|strictorderP(A)|ssList($f20(A)).
% 2.08/2.29 ** KEPT (pick-wt=7): 43 [] -ssList(A)|strictorderP(A)|ssList($f19(A)).
% 2.08/2.29 ** KEPT (pick-wt=7): 44 [] -ssList(A)|strictorderP(A)|ssList($f18(A)).
% 2.08/2.29 ** KEPT (pick-wt=20): 45 [] -ssList(A)|strictorderP(A)|app(app($f20(A),cons($f22(A),$f19(A))),cons($f21(A),$f18(A)))=A.
% 2.08/2.29 ** KEPT (pick-wt=9): 46 [] -ssList(A)|strictorderP(A)| -lt($f22(A),$f21(A)).
% 2.08/2.29 ** KEPT (pick-wt=9): 47 [] -ssList(A)|strictorderP(A)| -lt($f21(A),$f22(A)).
% 2.08/2.29 ** KEPT (pick-wt=28): 48 [] -ssList(A)| -totalorderedP(A)| -ssItem(B)| -ssItem(C)| -ssList(D)| -ssList(E)| -ssList(F)|app(app(D,cons(B,E)),cons(C,F))!=A|le_q(B,C).
% 2.08/2.29 ** KEPT (pick-wt=7): 49 [] -ssList(A)|totalorderedP(A)|ssItem($f27(A)).
% 2.08/2.29 ** KEPT (pick-wt=7): 50 [] -ssList(A)|totalorderedP(A)|ssItem($f26(A)).
% 2.08/2.29 ** KEPT (pick-wt=7): 51 [] -ssList(A)|totalorderedP(A)|ssList($f25(A)).
% 2.08/2.29 ** KEPT (pick-wt=7): 52 [] -ssList(A)|totalorderedP(A)|ssList($f24(A)).
% 2.08/2.29 ** KEPT (pick-wt=7): 53 [] -ssList(A)|totalorderedP(A)|ssList($f23(A)).
% 2.08/2.29 ** KEPT (pick-wt=20): 54 [] -ssList(A)|totalorderedP(A)|app(app($f25(A),cons($f27(A),$f24(A))),cons($f26(A),$f23(A)))=A.
% 2.08/2.29 ** KEPT (pick-wt=9): 55 [] -ssList(A)|totalorderedP(A)| -le_q($f27(A),$f26(A)).
% 2.08/2.29 ** KEPT (pick-wt=28): 56 [] -ssList(A)| -strictorderedP(A)| -ssItem(B)| -ssItem(C)| -ssList(D)| -ssList(E)| -ssList(F)|app(app(D,cons(B,E)),cons(C,F))!=A|lt(B,C).
% 2.08/2.29 ** KEPT (pick-wt=7): 57 [] -ssList(A)|strictorderedP(A)|ssItem($f32(A)).
% 2.08/2.29 ** KEPT (pick-wt=7): 58 [] -ssList(A)|strictorderedP(A)|ssItem($f31(A)).
% 2.08/2.29 ** KEPT (pick-wt=7): 59 [] -ssList(A)|strictorderedP(A)|ssList($f30(A)).
% 2.08/2.29 ** KEPT (pick-wt=7): 60 [] -ssList(A)|strictorderedP(A)|ssList($f29(A)).
% 2.08/2.29 ** KEPT (pick-wt=7): 61 [] -ssList(A)|strictorderedP(A)|ssList($f28(A)).
% 2.08/2.29 ** KEPT (pick-wt=20): 62 [] -ssList(A)|strictorderedP(A)|app(app($f30(A),cons($f32(A),$f29(A))),cons($f31(A),$f28(A)))=A.
% 2.08/2.29 ** KEPT (pick-wt=9): 63 [] -ssList(A)|strictorderedP(A)| -lt($f32(A),$f31(A)).
% 2.08/2.29 ** KEPT (pick-wt=28): 64 [] -ssList(A)| -duplicatefreeP(A)| -ssItem(B)| -ssItem(C)| -ssList(D)| -ssList(E)| -ssList(F)|app(app(D,cons(B,E)),cons(C,F))!=A|B!=C.
% 2.08/2.29 ** KEPT (pick-wt=7): 65 [] -ssList(A)|duplicatefreeP(A)|ssItem($f37(A)).
% 2.08/2.29 ** KEPT (pick-wt=7): 66 [] -ssList(A)|duplicatefreeP(A)|ssItem($f36(A)).
% 2.08/2.29 ** KEPT (pick-wt=7): 67 [] -ssList(A)|duplicatefreeP(A)|ssList($f35(A)).
% 2.08/2.29 ** KEPT (pick-wt=7): 68 [] -ssList(A)|duplicatefreeP(A)|ssList($f34(A)).
% 2.08/2.29 ** KEPT (pick-wt=7): 69 [] -ssList(A)|duplicatefreeP(A)|ssList($f33(A)).
% 2.08/2.29 ** KEPT (pick-wt=20): 70 [] -ssList(A)|duplicatefreeP(A)|app(app($f35(A),cons($f37(A),$f34(A))),cons($f36(A),$f33(A)))=A.
% 2.08/2.29 ** KEPT (pick-wt=9): 71 [] -ssList(A)|duplicatefreeP(A)|$f37(A)=$f36(A).
% 2.08/2.29 ** KEPT (pick-wt=24): 72 [] -ssList(A)| -e_qualelemsP(A)| -ssItem(B)| -ssItem(C)| -ssList(D)| -ssList(E)|app(D,cons(B,cons(C,E)))!=A|B=C.
% 2.08/2.29 ** KEPT (pick-wt=7): 73 [] -ssList(A)|e_qualelemsP(A)|ssItem($f41(A)).
% 2.08/2.29 ** KEPT (pick-wt=7): 74 [] -ssList(A)|e_qualelemsP(A)|ssItem($f40(A)).
% 2.08/2.29 ** KEPT (pick-wt=7): 75 [] -ssList(A)|e_qualelemsP(A)|ssList($f39(A)).
% 2.08/2.29 ** KEPT (pick-wt=7): 76 [] -ssList(A)|e_qualelemsP(A)|ssList($f38(A)).
% 2.08/2.29 ** KEPT (pick-wt=17): 77 [] -ssList(A)|e_qualelemsP(A)|app($f39(A),cons($f41(A),cons($f40(A),$f38(A))))=A.
% 2.08/2.29 ** KEPT (pick-wt=9): 78 [] -ssList(A)|e_qualelemsP(A)|$f41(A)!=$f40(A).
% 2.08/2.29 ** KEPT (pick-wt=10): 79 [] -ssList(A)| -ssList(B)| -ne_q(A,B)|A!=B.
% 2.08/2.29 ** KEPT (pick-wt=10): 80 [] -ssList(A)| -ssList(B)|ne_q(A,B)|A=B.
% 2.08/2.29 ** KEPT (pick-wt=8): 81 [] -ssList(A)| -ssItem(B)|ssList(cons(B,A)).
% 2.08/2.29 ** KEPT (pick-wt=9): 82 [] -ssList(A)| -ssItem(B)|cons(B,A)!=A.
% 2.08/2.29 ** KEPT (pick-wt=18): 83 [] -ssList(A)| -ssList(B)| -ssItem(C)| -ssItem(D)|cons(C,A)!=cons(D,B)|C=D.
% 2.08/2.29 ** KEPT (pick-wt=18): 84 [] -ssList(A)| -ssList(B)| -ssItem(C)| -ssItem(D)|cons(C,A)!=cons(D,B)|B=A.
% 2.08/2.29 ** KEPT (pick-wt=8): 85 [] -ssList(A)|nil=A|ssList($f43(A)).
% 2.08/2.29 ** KEPT (pick-wt=8): 86 [] -ssList(A)|nil=A|ssItem($f42(A)).
% 2.08/2.29 ** KEPT (pick-wt=12): 87 [] -ssList(A)|nil=A|cons($f42(A),$f43(A))=A.
% 2.08/2.29 ** KEPT (pick-wt=9): 89 [copy,88,flip.3] -ssList(A)| -ssItem(B)|cons(B,A)!=nil.
% 2.08/2.29 ** KEPT (pick-wt=8): 90 [] -ssList(A)|nil=A|ssItem(hd(A)).
% 2.08/2.29 ** KEPT (pick-wt=10): 91 [] -ssList(A)| -ssItem(B)|hd(cons(B,A))=B.
% 2.08/2.29 ** KEPT (pick-wt=8): 92 [] -ssList(A)|nil=A|ssList(tl(A)).
% 2.08/2.29 ** KEPT (pick-wt=10): 93 [] -ssList(A)| -ssItem(B)|tl(cons(B,A))=A.
% 2.08/2.29 ** KEPT (pick-wt=8): 94 [] -ssList(A)| -ssList(B)|ssList(app(A,B)).
% 2.08/2.29 ** KEPT (pick-wt=17): 95 [] -ssList(A)| -ssList(B)| -ssItem(C)|cons(C,app(B,A))=app(cons(C,B),A).
% 2.08/2.29 ** KEPT (pick-wt=7): 96 [] -ssList(A)|app(nil,A)=A.
% 2.08/2.29 ** KEPT (pick-wt=13): 97 [] -ssItem(A)| -ssItem(B)| -le_q(A,B)| -le_q(B,A)|A=B.
% 2.08/2.29 ** KEPT (pick-wt=15): 98 [] -ssItem(A)| -ssItem(B)| -ssItem(C)| -le_q(A,B)| -le_q(B,C)|le_q(A,C).
% 2.08/2.29 ** KEPT (pick-wt=5): 99 [] -ssItem(A)|le_q(A,A).
% 2.08/2.29 ** KEPT (pick-wt=10): 100 [] -ssItem(A)| -ssItem(B)| -ge_q(A,B)|le_q(B,A).
% 2.08/2.29 ** KEPT (pick-wt=10): 101 [] -ssItem(A)| -ssItem(B)|ge_q(A,B)| -le_q(B,A).
% 2.24/2.40 ** KEPT (pick-wt=10): 102 [] -ssItem(A)| -ssItem(B)| -lt(A,B)| -lt(B,A).
% 2.24/2.40 ** KEPT (pick-wt=15): 103 [] -ssItem(A)| -ssItem(B)| -ssItem(C)| -lt(A,B)| -lt(B,C)|lt(A,C).
% 2.24/2.40 ** KEPT (pick-wt=10): 104 [] -ssItem(A)| -ssItem(B)| -gt(A,B)|lt(B,A).
% 2.24/2.40 ** KEPT (pick-wt=10): 105 [] -ssItem(A)| -ssItem(B)|gt(A,B)| -lt(B,A).
% 2.24/2.40 ** KEPT (pick-wt=17): 106 [] -ssItem(A)| -ssList(B)| -ssList(C)| -memberP(app(B,C),A)|memberP(B,A)|memberP(C,A).
% 2.24/2.40 ** KEPT (pick-wt=14): 107 [] -ssItem(A)| -ssList(B)| -ssList(C)|memberP(app(B,C),A)| -memberP(B,A).
% 2.24/2.40 ** KEPT (pick-wt=14): 108 [] -ssItem(A)| -ssList(B)| -ssList(C)|memberP(app(B,C),A)| -memberP(C,A).
% 2.24/2.40 ** KEPT (pick-wt=17): 109 [] -ssItem(A)| -ssItem(B)| -ssList(C)| -memberP(cons(B,C),A)|A=B|memberP(C,A).
% 2.24/2.40 ** KEPT (pick-wt=14): 110 [] -ssItem(A)| -ssItem(B)| -ssList(C)|memberP(cons(B,C),A)|A!=B.
% 2.24/2.40 ** KEPT (pick-wt=14): 111 [] -ssItem(A)| -ssItem(B)| -ssList(C)|memberP(cons(B,C),A)| -memberP(C,A).
% 2.24/2.40 ** KEPT (pick-wt=5): 112 [] -ssItem(A)| -memberP(nil,A).
% 2.24/2.40 ** KEPT (pick-wt=2): 113 [] -singletonP(nil).
% 2.24/2.40 ** KEPT (pick-wt=15): 114 [] -ssList(A)| -ssList(B)| -ssList(C)| -frontsegP(A,B)| -frontsegP(B,C)|frontsegP(A,C).
% 2.24/2.40 ** KEPT (pick-wt=13): 115 [] -ssList(A)| -ssList(B)| -frontsegP(A,B)| -frontsegP(B,A)|A=B.
% 2.24/2.40 ** KEPT (pick-wt=5): 116 [] -ssList(A)|frontsegP(A,A).
% 2.24/2.40 ** KEPT (pick-wt=14): 117 [] -ssList(A)| -ssList(B)| -ssList(C)| -frontsegP(A,B)|frontsegP(app(A,C),B).
% 2.24/2.40 ** KEPT (pick-wt=18): 118 [] -ssItem(A)| -ssItem(B)| -ssList(C)| -ssList(D)| -frontsegP(cons(A,C),cons(B,D))|A=B.
% 2.24/2.40 ** KEPT (pick-wt=18): 119 [] -ssItem(A)| -ssItem(B)| -ssList(C)| -ssList(D)| -frontsegP(cons(A,C),cons(B,D))|frontsegP(C,D).
% 2.24/2.40 ** KEPT (pick-wt=21): 120 [] -ssItem(A)| -ssItem(B)| -ssList(C)| -ssList(D)|frontsegP(cons(A,C),cons(B,D))|A!=B| -frontsegP(C,D).
% 2.24/2.40 ** KEPT (pick-wt=5): 121 [] -ssList(A)|frontsegP(A,nil).
% 2.24/2.40 ** KEPT (pick-wt=8): 122 [] -ssList(A)| -frontsegP(nil,A)|nil=A.
% 2.24/2.40 ** KEPT (pick-wt=8): 123 [] -ssList(A)|frontsegP(nil,A)|nil!=A.
% 2.24/2.40 ** KEPT (pick-wt=15): 124 [] -ssList(A)| -ssList(B)| -ssList(C)| -rearsegP(A,B)| -rearsegP(B,C)|rearsegP(A,C).
% 2.24/2.40 ** KEPT (pick-wt=13): 125 [] -ssList(A)| -ssList(B)| -rearsegP(A,B)| -rearsegP(B,A)|A=B.
% 2.24/2.40 ** KEPT (pick-wt=5): 126 [] -ssList(A)|rearsegP(A,A).
% 2.24/2.40 ** KEPT (pick-wt=14): 127 [] -ssList(A)| -ssList(B)| -ssList(C)| -rearsegP(A,B)|rearsegP(app(C,A),B).
% 2.24/2.40 ** KEPT (pick-wt=5): 128 [] -ssList(A)|rearsegP(A,nil).
% 2.24/2.40 ** KEPT (pick-wt=8): 129 [] -ssList(A)| -rearsegP(nil,A)|nil=A.
% 2.24/2.40 ** KEPT (pick-wt=8): 130 [] -ssList(A)|rearsegP(nil,A)|nil!=A.
% 2.24/2.40 ** KEPT (pick-wt=15): 131 [] -ssList(A)| -ssList(B)| -ssList(C)| -segmentP(A,B)| -segmentP(B,C)|segmentP(A,C).
% 2.24/2.40 ** KEPT (pick-wt=13): 132 [] -ssList(A)| -ssList(B)| -segmentP(A,B)| -segmentP(B,A)|A=B.
% 2.24/2.40 ** KEPT (pick-wt=5): 133 [] -ssList(A)|segmentP(A,A).
% 2.24/2.40 ** KEPT (pick-wt=18): 134 [] -ssList(A)| -ssList(B)| -ssList(C)| -ssList(D)| -segmentP(A,B)|segmentP(app(app(C,A),D),B).
% 2.24/2.40 ** KEPT (pick-wt=5): 135 [] -ssList(A)|segmentP(A,nil).
% 2.24/2.40 ** KEPT (pick-wt=8): 136 [] -ssList(A)| -segmentP(nil,A)|nil=A.
% 2.24/2.40 ** KEPT (pick-wt=8): 137 [] -ssList(A)|segmentP(nil,A)|nil!=A.
% 2.24/2.40 ** KEPT (pick-wt=6): 138 [] -ssItem(A)|cyclefreeP(cons(A,nil)).
% 2.24/2.40 ** KEPT (pick-wt=6): 139 [] -ssItem(A)|totalorderP(cons(A,nil)).
% 2.24/2.40 ** KEPT (pick-wt=6): 140 [] -ssItem(A)|strictorderP(cons(A,nil)).
% 2.24/2.40 ** KEPT (pick-wt=6): 141 [] -ssItem(A)|totalorderedP(cons(A,nil)).
% 2.24/2.40 ** KEPT (pick-wt=13): 142 [] -ssItem(A)| -ssList(B)| -totalorderedP(cons(A,B))|nil=B|totalorderedP(B).
% 2.24/2.40 ** KEPT (pick-wt=15): 143 [] -ssItem(A)| -ssList(B)| -totalorderedP(cons(A,B))|nil=B|le_q(A,hd(B)).
% 2.24/2.40 ** KEPT (pick-wt=11): 144 [] -ssItem(A)| -ssList(B)|totalorderedP(cons(A,B))|nil!=B.
% 2.24/2.40 ** KEPT (pick-wt=17): 145 [] -ssItem(A)| -ssList(B)|totalorderedP(cons(A,B))|nil=B| -totalorderedP(B)| -le_q(A,hd(B)).
% 2.24/2.40 ** KEPT (pick-wt=6): 146 [] -ssItem(A)|strictorderedP(cons(A,nil)).
% 2.24/2.40 ** KEPT (pick-wt=13): 147 [] -ssItem(A)| -ssList(B)| -strictorderedP(cons(A,B))|nil=B|strictorderedP(B).
% 2.24/2.40 ** KEPT (pick-wt=15): 148 [] -ssItem(A)| -ssList(B)| -strictorderedP(cons(A,B))|nil=B|lt(A,hd(B)).
% 2.24/2.40 ** KEPT (pick-wt=11): 149 [] -ssItem(A)| -ssList(B)|strictorderedP(cons(A,B))|nil!=B.
% 2.24/2.40 ** KEPT (pick-wt=17): 150 [] -ssItem(A)| -ssList(B)|strictorderedP(cons(A,B))|nil=B| -strictorderedP(B)| -lt(A,hd(B)).
% 2.24/2.40 ** KEPT (pick-wt=6): 151 [] -ssItem(A)|duplicatefreeP(cons(A,nil)).
% 2.24/2.40 ** KEPT (pick-wt=6): 152 [] -ssItem(A)|e_qualelemsP(cons(A,nil)).
% 2.24/2.40 ** KEPT (pick-wt=8): 153 [] -ssList(A)|nil=A|ssItem($f44(A)).
% 2.24/2.40 ** KEPT (pick-wt=10): 154 [] -ssList(A)|nil=A|hd(A)=$f44(A).
% 2.24/2.40 ** KEPT (pick-wt=8): 155 [] -ssList(A)|nil=A|ssList($f45(A)).
% 2.24/2.40 ** KEPT (pick-wt=10): 156 [] -ssList(A)|nil=A|tl(A)=$f45(A).
% 2.24/2.40 ** KEPT (pick-wt=23): 157 [] -ssList(A)| -ssList(B)|nil=B|nil=A|hd(B)!=hd(A)|tl(B)!=tl(A)|B=A.
% 2.24/2.40 ** KEPT (pick-wt=12): 158 [] -ssList(A)|nil=A|cons(hd(A),tl(A))=A.
% 2.24/2.40 ** KEPT (pick-wt=16): 159 [] -ssList(A)| -ssList(B)| -ssList(C)|app(C,B)!=app(A,B)|C=A.
% 2.24/2.40 ** KEPT (pick-wt=16): 160 [] -ssList(A)| -ssList(B)| -ssList(C)|app(B,C)!=app(B,A)|C=A.
% 2.24/2.40 ** KEPT (pick-wt=13): 161 [] -ssList(A)| -ssItem(B)|cons(B,A)=app(cons(B,nil),A).
% 2.24/2.40 ** KEPT (pick-wt=17): 162 [] -ssList(A)| -ssList(B)| -ssList(C)|app(app(A,B),C)=app(A,app(B,C)).
% 2.24/2.40 ** KEPT (pick-wt=12): 164 [copy,163,flip.3] -ssList(A)| -ssList(B)|app(A,B)!=nil|nil=B.
% 2.24/2.40 ** KEPT (pick-wt=12): 166 [copy,165,flip.3] -ssList(A)| -ssList(B)|app(A,B)!=nil|nil=A.
% 2.24/2.40 ** KEPT (pick-wt=15): 168 [copy,167,flip.3] -ssList(A)| -ssList(B)|app(A,B)=nil|nil!=B|nil!=A.
% 2.24/2.40 ** KEPT (pick-wt=7): 169 [] -ssList(A)|app(A,nil)=A.
% 2.24/2.40 ** KEPT (pick-wt=14): 170 [] -ssList(A)| -ssList(B)|nil=A|hd(app(A,B))=hd(A).
% 2.24/2.40 ** KEPT (pick-wt=16): 171 [] -ssList(A)| -ssList(B)|nil=A|tl(app(A,B))=app(tl(A),B).
% 2.24/2.40 ** KEPT (pick-wt=13): 172 [] -ssItem(A)| -ssItem(B)| -ge_q(A,B)| -ge_q(B,A)|A=B.
% 2.24/2.40 ** KEPT (pick-wt=15): 173 [] -ssItem(A)| -ssItem(B)| -ssItem(C)| -ge_q(A,B)| -ge_q(B,C)|ge_q(A,C).
% 2.24/2.40 ** KEPT (pick-wt=5): 174 [] -ssItem(A)|ge_q(A,A).
% 2.24/2.40 ** KEPT (pick-wt=5): 175 [] -ssItem(A)| -lt(A,A).
% 2.24/2.40 ** KEPT (pick-wt=15): 176 [] -ssItem(A)| -ssItem(B)| -ssItem(C)| -le_q(A,B)| -lt(B,C)|lt(A,C).
% 2.24/2.40 ** KEPT (pick-wt=13): 177 [] -ssItem(A)| -ssItem(B)| -le_q(A,B)|A=B|lt(A,B).
% 2.24/2.40 ** KEPT (pick-wt=10): 178 [] -ssItem(A)| -ssItem(B)| -lt(A,B)|A!=B.
% 2.24/2.40 ** KEPT (pick-wt=10): 179 [] -ssItem(A)| -ssItem(B)| -lt(A,B)|le_q(A,B).
% 2.24/2.40 Following clause subsumed by 177 during input processing: 0 [] -ssItem(A)| -ssItem(B)|lt(A,B)|A=B| -le_q(A,B).
% 2.24/2.40 ** KEPT (pick-wt=10): 180 [] -ssItem(A)| -ssItem(B)| -gt(A,B)| -gt(B,A).
% 2.24/2.40 ** KEPT (pick-wt=15): 181 [] -ssItem(A)| -ssItem(B)| -ssItem(C)| -gt(A,B)| -gt(B,C)|gt(A,C).
% 2.24/2.40 ** KEPT (pick-wt=2): 182 [] -totalorderedP($c7).
% 2.24/2.40 ** KEPT (pick-wt=14): 183 [] -ssItem(A)|$c3=A| -memberP($c4,A)| -le_q($c3,A)|nil=$c4.
% 2.24/2.40 ** KEPT (pick-wt=14): 184 [] -ssItem(A)|$c3=A| -memberP($c4,A)| -le_q($c3,A)|nil=$c5.
% 2.24/2.40 303 back subsumes 259.
% 2.24/2.40
% 2.24/2.40 ------------> process sos:
% 2.24/2.40 ** KEPT (pick-wt=3): 434 [] A=A.
% 2.24/2.40 ** KEPT (pick-wt=2): 435 [] ssItem($c2).
% 2.24/2.40 ** KEPT (pick-wt=2): 436 [] ssItem($c1).
% 2.24/2.40 ** KEPT (pick-wt=2): 437 [] ssList(nil).
% 2.24/2.40 ** KEPT (pick-wt=2): 438 [] cyclefreeP(nil).
% 2.24/2.40 ** KEPT (pick-wt=2): 439 [] totalorderP(nil).
% 2.24/2.40 ** KEPT (pick-wt=2): 440 [] strictorderP(nil).
% 2.24/2.40 ** KEPT (pick-wt=2): 441 [] totalorderedP(nil).
% 2.24/2.40 ** KEPT (pick-wt=2): 442 [] strictorderedP(nil).
% 2.24/2.40 ** KEPT (pick-wt=2): 443 [] duplicatefreeP(nil).
% 2.24/2.40 ** KEPT (pick-wt=2): 444 [] e_qualelemsP(nil).
% 2.24/2.40 ** KEPT (pick-wt=2): 445 [] ssList($c7).
% 2.24/2.40 ** KEPT (pick-wt=2): 446 [] ssList($c6).
% 2.24/2.40 ** KEPT (pick-wt=2): 447 [] ssList($c5).
% 2.24/2.40 ** KEPT (pick-wt=2): 448 [] ssList($c4).
% 2.24/2.40 ** KEPT (pick-wt=3): 449 [] $c6=$c4.
% 2.24/2.40 ---> New Demodulator: 450 [new_demod,449] $c6=$c4.
% 2.24/2.40 ** KEPT (pick-wt=3): 451 [] $c7=$c5.
% 2.24/2.40 ---> New Demodulator: 452 [new_demod,451] $c7=$c5.
% 2.24/2.40 ** KEPT (pick-wt=5): 453 [] ssItem($c3)|nil=$c4.
% 2.24/2.40 ** KEPT (pick-wt=5): 454 [] ssItem($c3)|nil=$c5.
% 2.24/2.40 ** KEPT (pick-wt=8): 455 [] cons($c3,nil)=$c5|nil=$c4.
% 2.24/2.40 ** KEPT (pick-wt=8): 456 [] cons($c3,nil)=$c5|nil=$c5.
% 2.24/2.40 ** KEPT (pick-wt=6): 457 [] memberP($c4,$c3)|nil=$c4.
% 2.24/2.40 ** KEPT (pick-wt=6): 458 [] memberP($c4,$c3)|nil=$c5.
% 2.24/2.40 Following clause subsumed by 434 during input processing: 0 [copy,434,flip.1] A=A.
% 2.24/2.40 434 back subsumes 428.
% 2.24/2.40 434 back subsumes 392.
% 2.24/2.40 434 back subsumes 382.
% 2.24/2.40 434 back subsumes 380.
% 2.24/2.40 434 back subsumes 379.
% 2.24/2.40 434 back subsumes 378.
% 2.24/2.40 434 back subsumes 377.
% 2.24/2.40 434 back subsumes 376.
% 199.00/199.24 434 back subsumes 301.
% 199.00/199.24 434 back subsumes 292.
% 199.00/199.24 434 back subsumes 289.
% 199.00/199.24 434 back subsumes 287.
% 199.00/199.24 434 back subsumes 286.
% 199.00/199.24 434 back subsumes 285.
% 199.00/199.24 434 back subsumes 278.
% 199.00/199.24 434 back subsumes 274.
% 199.00/199.24 434 back subsumes 269.
% 199.00/199.24 434 back subsumes 265.
% 199.00/199.24 434 back subsumes 262.
% 199.00/199.24 434 back subsumes 258.
% 199.00/199.24 434 back subsumes 254.
% 199.00/199.24 434 back subsumes 253.
% 199.00/199.24 434 back subsumes 251.
% 199.00/199.24 434 back subsumes 248.
% 199.00/199.24 434 back subsumes 186.
% 199.00/199.24 >>>> Starting back demodulation with 450.
% 199.00/199.24 >> back demodulating 446 with 450.
% 199.00/199.24 >>>> Starting back demodulation with 452.
% 199.00/199.24 >> back demodulating 445 with 452.
% 199.00/199.24 >> back demodulating 182 with 452.
% 199.00/199.24
% 199.00/199.24 ======= end of input processing =======
% 199.00/199.24
% 199.00/199.24 =========== start of search ===========
% 199.00/199.24
% 199.00/199.24
% 199.00/199.24 Resetting weight limit to 4.
% 199.00/199.24
% 199.00/199.24
% 199.00/199.24 Resetting weight limit to 4.
% 199.00/199.24
% 199.00/199.24 sos_size=378
% 199.00/199.24
% 199.00/199.24 Search stopped because sos empty.
% 199.00/199.24
% 199.00/199.24
% 199.00/199.24 Search stopped because sos empty.
% 199.00/199.24
% 199.00/199.24 ============ end of search ============
% 199.00/199.24
% 199.00/199.24 -------------- statistics -------------
% 199.00/199.24 clauses given 235
% 199.00/199.24 clauses generated 88376
% 199.00/199.24 clauses kept 946
% 199.00/199.24 clauses forward subsumed 1487
% 199.00/199.24 clauses back subsumed 58
% 199.00/199.24 Kbytes malloced 4882
% 199.00/199.24
% 199.00/199.24 ----------- times (seconds) -----------
% 199.00/199.24 user CPU time 196.96 (0 hr, 3 min, 16 sec)
% 199.00/199.24 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 199.00/199.24 wall-clock time 198 (0 hr, 3 min, 18 sec)
% 199.00/199.24
% 199.00/199.24 Process 4779 finished Wed Jul 27 04:39:28 2022
% 199.00/199.24 Otter interrupted
% 199.00/199.24 PROOF NOT FOUND
%------------------------------------------------------------------------------