TSTP Solution File: SWC265-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SWC265-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n024.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:03 EDT 2022
% Result : Unknown 82.28s 82.52s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC265-1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n024.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:48:55 EDT 2022
% 0.12/0.33 % CPUTime :
% 9.95/10.15 ----- Otter 3.3f, August 2004 -----
% 9.95/10.15 The process was started by sandbox on n024.cluster.edu,
% 9.95/10.15 Wed Jul 27 04:48:55 2022
% 9.95/10.15 The command was "./otter". The process ID is 16810.
% 9.95/10.15
% 9.95/10.15 set(prolog_style_variables).
% 9.95/10.15 set(auto).
% 9.95/10.15 dependent: set(auto1).
% 9.95/10.15 dependent: set(process_input).
% 9.95/10.15 dependent: clear(print_kept).
% 9.95/10.15 dependent: clear(print_new_demod).
% 9.95/10.15 dependent: clear(print_back_demod).
% 9.95/10.15 dependent: clear(print_back_sub).
% 9.95/10.15 dependent: set(control_memory).
% 9.95/10.15 dependent: assign(max_mem, 12000).
% 9.95/10.15 dependent: assign(pick_given_ratio, 4).
% 9.95/10.15 dependent: assign(stats_level, 1).
% 9.95/10.15 dependent: assign(max_seconds, 10800).
% 9.95/10.15 clear(print_given).
% 9.95/10.15
% 9.95/10.15 list(usable).
% 9.95/10.15 0 [] A=A.
% 9.95/10.15 0 [] e_qualelemsP(nil).
% 9.95/10.15 0 [] duplicatefreeP(nil).
% 9.95/10.15 0 [] strictorderedP(nil).
% 9.95/10.15 0 [] totalorderedP(nil).
% 9.95/10.15 0 [] strictorderP(nil).
% 9.95/10.15 0 [] totalorderP(nil).
% 9.95/10.15 0 [] cyclefreeP(nil).
% 9.95/10.15 0 [] ssList(nil).
% 9.95/10.15 0 [] ssItem(skac3).
% 9.95/10.15 0 [] ssItem(skac2).
% 9.95/10.15 0 [] -singletonP(nil).
% 9.95/10.15 0 [] ssItem(skaf83(U)).
% 9.95/10.15 0 [] ssList(skaf82(U)).
% 9.95/10.15 0 [] ssList(skaf81(U)).
% 9.95/10.15 0 [] ssList(skaf80(U)).
% 9.95/10.15 0 [] ssItem(skaf79(U)).
% 9.95/10.15 0 [] ssItem(skaf78(U)).
% 9.95/10.15 0 [] ssList(skaf77(U)).
% 9.95/10.15 0 [] ssList(skaf76(U)).
% 9.95/10.15 0 [] ssList(skaf75(U)).
% 9.95/10.15 0 [] ssItem(skaf74(U)).
% 9.95/10.15 0 [] ssList(skaf73(U)).
% 9.95/10.15 0 [] ssList(skaf72(U)).
% 9.95/10.15 0 [] ssList(skaf71(U)).
% 9.95/10.15 0 [] ssItem(skaf70(U)).
% 9.95/10.15 0 [] ssItem(skaf69(U)).
% 9.95/10.15 0 [] ssList(skaf68(U)).
% 9.95/10.15 0 [] ssList(skaf67(U)).
% 9.95/10.15 0 [] ssList(skaf66(U)).
% 9.95/10.15 0 [] ssItem(skaf65(U)).
% 9.95/10.15 0 [] ssItem(skaf64(U)).
% 9.95/10.15 0 [] ssList(skaf63(U)).
% 9.95/10.15 0 [] ssList(skaf62(U)).
% 9.95/10.15 0 [] ssList(skaf61(U)).
% 9.95/10.15 0 [] ssItem(skaf60(U)).
% 9.95/10.15 0 [] ssItem(skaf59(U)).
% 9.95/10.15 0 [] ssList(skaf58(U)).
% 9.95/10.15 0 [] ssList(skaf57(U)).
% 9.95/10.15 0 [] ssList(skaf56(U)).
% 9.95/10.15 0 [] ssItem(skaf55(U)).
% 9.95/10.15 0 [] ssItem(skaf54(U)).
% 9.95/10.15 0 [] ssList(skaf53(U)).
% 9.95/10.15 0 [] ssList(skaf52(U)).
% 9.95/10.15 0 [] ssList(skaf51(U)).
% 9.95/10.15 0 [] ssItem(skaf50(U)).
% 9.95/10.15 0 [] ssItem(skaf49(U)).
% 9.95/10.15 0 [] ssItem(skaf44(U)).
% 9.95/10.15 0 [] ssList(skaf48(U,V)).
% 9.95/10.15 0 [] ssList(skaf47(U,V)).
% 9.95/10.15 0 [] ssList(skaf46(U,V)).
% 9.95/10.15 0 [] ssList(skaf45(U,V)).
% 9.95/10.15 0 [] ssList(skaf43(U,V)).
% 9.95/10.15 0 [] ssList(skaf42(U,V)).
% 9.95/10.15 0 [] skac3!=skac2.
% 9.95/10.15 0 [] -ssItem(U)|ge_q(U,U).
% 9.95/10.15 0 [] -ssList(U)|segmentP(U,nil).
% 9.95/10.15 0 [] -ssList(U)|segmentP(U,U).
% 9.95/10.15 0 [] -ssList(U)|rearsegP(U,nil).
% 9.95/10.15 0 [] -ssList(U)|rearsegP(U,U).
% 9.95/10.15 0 [] -ssList(U)|frontsegP(U,nil).
% 9.95/10.15 0 [] -ssList(U)|frontsegP(U,U).
% 9.95/10.15 0 [] -ssItem(U)|le_q(U,U).
% 9.95/10.15 0 [] -lt(U,U)| -ssItem(U).
% 9.95/10.15 0 [] -ssItem(U)|e_qualelemsP(cons(U,nil)).
% 9.95/10.15 0 [] -ssItem(U)|duplicatefreeP(cons(U,nil)).
% 9.95/10.15 0 [] -ssItem(U)|strictorderedP(cons(U,nil)).
% 9.95/10.15 0 [] -ssItem(U)|totalorderedP(cons(U,nil)).
% 9.95/10.15 0 [] -ssItem(U)|strictorderP(cons(U,nil)).
% 9.95/10.15 0 [] -ssItem(U)|totalorderP(cons(U,nil)).
% 9.95/10.15 0 [] -ssItem(U)|cyclefreeP(cons(U,nil)).
% 9.95/10.15 0 [] -memberP(nil,U)| -ssItem(U).
% 9.95/10.15 0 [] -ssList(U)|duplicatefreeP(U)|ssItem(V).
% 9.95/10.15 0 [] -ssList(U)|app(U,nil)=U.
% 9.95/10.15 0 [] -ssList(U)|app(nil,U)=U.
% 9.95/10.15 0 [] -ssList(U)|ssList(tl(U))|nil=U.
% 9.95/10.15 0 [] -ssList(U)|ssItem(hd(U))|nil=U.
% 9.95/10.15 0 [] -ssList(U)|ssList(tl(U))|nil=U.
% 9.95/10.15 0 [] -ssList(U)|ssItem(hd(U))|nil=U.
% 9.95/10.15 0 [] nil!=U| -ssList(U)|segmentP(nil,U).
% 9.95/10.15 0 [] -segmentP(nil,U)| -ssList(U)|nil=U.
% 9.95/10.15 0 [] nil!=U| -ssList(U)|rearsegP(nil,U).
% 9.95/10.15 0 [] -rearsegP(nil,U)| -ssList(U)|nil=U.
% 9.95/10.15 0 [] nil!=U| -ssList(U)|frontsegP(nil,U).
% 9.95/10.15 0 [] -frontsegP(nil,U)| -ssList(U)|nil=U.
% 9.95/10.15 0 [] -ssList(U)| -ssList(V)|ssList(app(V,U)).
% 9.95/10.15 0 [] -ssItem(U)| -ssList(V)|ssList(cons(U,V)).
% 9.95/10.15 0 [] -ssList(U)|cyclefreeP(U)|le_q(skaf50(U),skaf49(U)).
% 9.95/10.15 0 [] -ssList(U)|cyclefreeP(U)|le_q(skaf49(U),skaf50(U)).
% 9.95/10.15 0 [] skaf79(U)!=skaf78(U)| -ssList(U)|e_qualelemsP(U).
% 9.95/10.15 0 [] -lt(skaf69(U),skaf70(U))| -ssList(U)|strictorderedP(U).
% 9.95/10.15 0 [] -le_q(skaf64(U),skaf65(U))| -ssList(U)|totalorderedP(U).
% 9.95/10.15 0 [] -lt(skaf60(U),skaf59(U))| -ssList(U)|strictorderP(U).
% 9.95/10.15 0 [] -lt(skaf59(U),skaf60(U))| -ssList(U)|strictorderP(U).
% 9.95/10.15 0 [] -le_q(skaf55(U),skaf54(U))| -ssList(U)|totalorderP(U).
% 9.95/10.15 0 [] -le_q(skaf54(U),skaf55(U))| -ssList(U)|totalorderP(U).
% 9.95/10.15 0 [] -ssItem(U)| -ssList(V)|tl(cons(U,V))=V.
% 9.95/10.15 0 [] -ssItem(U)| -ssList(V)|hd(cons(U,V))=U.
% 9.95/10.15 0 [] cons(U,V)!=nil| -ssItem(U)| -ssList(V).
% 9.95/10.15 0 [] cons(U,V)!=V| -ssItem(U)| -ssList(V).
% 9.95/10.15 0 [] -ssList(U)| -ssList(V)|ne_q(V,U)|V=U.
% 9.95/10.15 0 [] -singletonP(U)| -ssList(U)|cons(skaf44(U),nil)=U.
% 9.95/10.15 0 [] -ssItem(U)| -ssItem(V)|ne_q(V,U)|V=U.
% 9.95/10.15 0 [] -lt(U,V)| -ssItem(V)| -ssItem(U)|le_q(U,V).
% 9.95/10.15 0 [] -ssList(U)|cons(hd(U),tl(U))=U|nil=U.
% 9.95/10.15 0 [] -gt(U,V)| -ssItem(V)| -ssItem(U)|lt(V,U).
% 9.95/10.15 0 [] -lt(U,V)| -ssItem(U)| -ssItem(V)|gt(V,U).
% 9.95/10.15 0 [] -ge_q(U,V)| -ssItem(V)| -ssItem(U)|le_q(V,U).
% 9.95/10.15 0 [] -le_q(U,V)| -ssItem(U)| -ssItem(V)|ge_q(V,U).
% 9.95/10.15 0 [] -ssList(U)|cons(skaf83(U),skaf82(U))=U|nil=U.
% 9.95/10.15 0 [] -gt(U,V)| -gt(V,U)| -ssItem(U)| -ssItem(V).
% 9.95/10.15 0 [] U!=V| -lt(U,V)| -ssItem(V)| -ssItem(U).
% 9.95/10.15 0 [] nil!=U| -ssList(U)| -ssItem(V)|strictorderedP(cons(V,U)).
% 9.95/10.15 0 [] nil!=U| -ssList(U)| -ssItem(V)|totalorderedP(cons(V,U)).
% 9.95/10.15 0 [] -lt(U,V)| -lt(V,U)| -ssItem(U)| -ssItem(V).
% 9.95/10.15 0 [] U!=V| -ne_q(U,V)| -ssList(V)| -ssList(U).
% 9.95/10.15 0 [] cons(U,nil)!=V| -ssItem(U)| -ssList(V)|singletonP(V).
% 9.95/10.15 0 [] U!=V| -ne_q(U,V)| -ssItem(V)| -ssItem(U).
% 9.95/10.15 0 [] app(U,V)!=nil| -ssList(V)| -ssList(U)|nil=U.
% 9.95/10.15 0 [] app(U,V)!=nil| -ssList(V)| -ssList(U)|nil=V.
% 9.95/10.15 0 [] -ssItem(U)| -ssList(V)|app(cons(U,nil),V)=cons(U,V).
% 9.95/10.15 0 [] -le_q(U,V)| -ssItem(V)| -ssItem(U)|lt(U,V)|U=V.
% 9.95/10.15 0 [] -le_q(U,V)| -ssItem(V)| -ssItem(U)|lt(U,V)|U=V.
% 9.95/10.15 0 [] -ssList(U)| -ssList(V)|nil=V|hd(app(V,U))=hd(V).
% 9.95/10.15 0 [] -strictorderedP(cons(U,V))| -ssList(V)| -ssItem(U)|strictorderedP(V)|nil=V.
% 9.95/10.15 0 [] -totalorderedP(cons(U,V))| -ssList(V)| -ssItem(U)|totalorderedP(V)|nil=V.
% 9.95/10.15 0 [] -ge_q(U,V)| -ge_q(V,U)| -ssItem(U)| -ssItem(V)|V=U.
% 9.95/10.15 0 [] -segmentP(U,V)| -segmentP(V,U)| -ssList(U)| -ssList(V)|V=U.
% 9.95/10.15 0 [] -rearsegP(U,V)| -rearsegP(V,U)| -ssList(U)| -ssList(V)|V=U.
% 9.95/10.15 0 [] -frontsegP(U,V)| -frontsegP(V,U)| -ssList(U)| -ssList(V)|V=U.
% 9.95/10.15 0 [] -le_q(U,V)| -le_q(V,U)| -ssItem(U)| -ssItem(V)|V=U.
% 9.95/10.15 0 [] -rearsegP(U,V)| -ssList(V)| -ssList(U)|app(skaf46(U,V),V)=U.
% 9.95/10.15 0 [] -frontsegP(U,V)| -ssList(V)| -ssList(U)|app(V,skaf45(U,V))=U.
% 9.95/10.15 0 [] -ssList(U)| -ssList(V)|nil=V|tl(app(V,U))=app(tl(V),U).
% 9.95/10.15 0 [] -strictorderedP(cons(U,V))| -ssList(V)| -ssItem(U)|lt(U,hd(V))|nil=V.
% 9.95/10.15 0 [] -totalorderedP(cons(U,V))| -ssList(V)| -ssItem(U)|le_q(U,hd(V))|nil=V.
% 9.95/10.15 0 [] -rearsegP(U,V)| -ssList(W)| -ssList(V)| -ssList(U)|rearsegP(app(W,U),V).
% 9.95/10.15 0 [] -frontsegP(U,V)| -ssList(W)| -ssList(V)| -ssList(U)|frontsegP(app(U,W),V).
% 9.95/10.15 0 [] U!=V| -ssList(W)| -ssItem(V)| -ssItem(U)|memberP(cons(V,W),U).
% 9.95/10.15 0 [] -memberP(U,V)| -ssList(U)| -ssItem(W)| -ssItem(V)|memberP(cons(W,U),V).
% 9.95/10.15 0 [] -memberP(U,V)| -ssList(W)| -ssList(U)| -ssItem(V)|memberP(app(U,W),V).
% 9.95/10.15 0 [] -memberP(U,V)| -ssList(U)| -ssList(W)| -ssItem(V)|memberP(app(W,U),V).
% 9.95/10.15 0 [] -ssList(U)|e_qualelemsP(U)|app(skaf80(U),cons(skaf78(U),cons(skaf79(U),skaf81(U))))=U.
% 9.95/10.15 0 [] app(U,V)!=W| -ssList(U)| -ssList(V)| -ssList(W)|rearsegP(W,V).
% 9.95/10.15 0 [] app(U,V)!=W| -ssList(V)| -ssList(U)| -ssList(W)|frontsegP(W,U).
% 9.95/10.15 0 [] nil!=U|nil!=V| -ssList(V)| -ssList(U)|app(U,V)=nil.
% 9.95/10.15 0 [] -gt(U,V)| -gt(V,W)| -ssItem(W)| -ssItem(V)| -ssItem(U)|gt(U,W).
% 9.95/10.15 0 [] -le_q(U,V)| -lt(V,W)| -ssItem(W)| -ssItem(V)| -ssItem(U)|lt(U,W).
% 9.95/10.15 0 [] -ge_q(U,V)| -ge_q(V,W)| -ssItem(W)| -ssItem(V)| -ssItem(U)|ge_q(U,W).
% 9.95/10.15 0 [] -ssList(U)| -ssList(V)| -ssList(W)|app(app(W,V),U)=app(W,app(V,U)).
% 9.95/10.15 0 [] app(U,V)!=app(U,W)| -ssList(V)| -ssList(U)| -ssList(W)|V=W.
% 9.95/10.15 0 [] app(U,V)!=app(W,V)| -ssList(U)| -ssList(V)| -ssList(W)|U=W.
% 9.95/10.15 0 [] -segmentP(U,V)| -segmentP(V,W)| -ssList(W)| -ssList(V)| -ssList(U)|segmentP(U,W).
% 9.95/10.15 0 [] -rearsegP(U,V)| -rearsegP(V,W)| -ssList(W)| -ssList(V)| -ssList(U)|rearsegP(U,W).
% 9.95/10.15 0 [] -frontsegP(U,V)| -frontsegP(V,W)| -ssList(W)| -ssList(V)| -ssList(U)|frontsegP(U,W).
% 9.95/10.15 0 [] -lt(U,V)| -lt(V,W)| -ssItem(W)| -ssItem(V)| -ssItem(U)|lt(U,W).
% 9.95/10.15 0 [] -le_q(U,V)| -le_q(V,W)| -ssItem(W)| -ssItem(V)| -ssItem(U)|le_q(U,W).
% 9.95/10.15 0 [] -ssItem(U)| -ssList(V)| -ssList(W)|cons(U,app(V,W))=app(cons(U,V),W).
% 9.95/10.15 0 [] -memberP(app(U,V),W)| -ssList(V)| -ssList(U)| -ssItem(W)|memberP(V,W)|memberP(U,W).
% 9.95/10.15 0 [] -le_q(U,hd(V))| -totalorderedP(V)| -ssList(V)| -ssItem(U)|totalorderedP(cons(U,V))|nil=V.
% 9.95/10.15 0 [] -lt(U,hd(V))| -strictorderedP(V)| -ssList(V)| -ssItem(U)|strictorderedP(cons(U,V))|nil=V.
% 9.95/10.15 0 [] -memberP(cons(U,V),W)| -ssList(V)| -ssItem(U)| -ssItem(W)|memberP(V,W)|W=U.
% 9.95/10.15 0 [] -ssList(U)|duplicatefreeP(U)|app(app(skaf75(U),cons(skaf74(U),skaf76(U))),cons(skaf74(U),skaf77(U)))=U.
% 9.95/10.15 0 [] -ssList(U)|strictorderedP(U)|app(app(skaf71(U),cons(skaf69(U),skaf72(U))),cons(skaf70(U),skaf73(U)))=U.
% 9.95/10.15 0 [] -ssList(U)|totalorderedP(U)|app(app(skaf66(U),cons(skaf64(U),skaf67(U))),cons(skaf65(U),skaf68(U)))=U.
% 9.95/10.15 0 [] -ssList(U)|strictorderP(U)|app(app(skaf61(U),cons(skaf59(U),skaf62(U))),cons(skaf60(U),skaf63(U)))=U.
% 9.95/10.15 0 [] -ssList(U)|totalorderP(U)|app(app(skaf56(U),cons(skaf54(U),skaf57(U))),cons(skaf55(U),skaf58(U)))=U.
% 9.95/10.15 0 [] -ssList(U)|cyclefreeP(U)|app(app(skaf51(U),cons(skaf49(U),skaf52(U))),cons(skaf50(U),skaf53(U)))=U.
% 9.95/10.15 0 [] -segmentP(U,V)| -ssList(V)| -ssList(U)|app(app(skaf47(U,V),V),skaf48(V,U))=U.
% 9.95/10.15 0 [] -memberP(U,V)| -ssItem(V)| -ssList(U)|app(skaf42(U,V),cons(V,skaf43(V,U)))=U.
% 9.95/10.15 0 [] cons(U,V)!=cons(W,X)| -ssItem(W)| -ssItem(U)| -ssList(X)| -ssList(V)|U=W.
% 9.95/10.15 0 [] cons(U,V)!=cons(W,X)| -ssItem(W)| -ssItem(U)| -ssList(X)| -ssList(V)|X=V.
% 9.95/10.15 0 [] -segmentP(U,V)| -ssList(W)| -ssList(X)| -ssList(V)| -ssList(U)|segmentP(app(app(X,U),W),V).
% 9.95/10.15 0 [] app(app(U,V),W)!=X| -ssList(W)| -ssList(U)| -ssList(V)| -ssList(X)|segmentP(X,V).
% 9.95/10.15 0 [] -frontsegP(cons(U,V),cons(W,X))| -ssList(X)| -ssList(V)| -ssItem(W)| -ssItem(U)|frontsegP(V,X).
% 9.95/10.15 0 [] app(U,cons(V,W))!=X| -ssList(W)| -ssList(U)| -ssItem(V)| -ssList(X)|memberP(X,V).
% 9.95/10.15 0 [] -frontsegP(cons(U,V),cons(W,X))| -ssList(X)| -ssList(V)| -ssItem(W)| -ssItem(U)|U=W.
% 9.95/10.15 0 [] tl(U)!=tl(V)|hd(U)!=hd(V)| -ssList(U)| -ssList(V)|nil=V|U=V|nil=U.
% 9.95/10.15 0 [] -frontsegP(U,V)|W!=X| -ssList(V)| -ssList(U)| -ssItem(X)| -ssItem(W)|frontsegP(cons(W,U),cons(X,V)).
% 9.95/10.15 0 [] app(app(U,cons(V,W)),cons(V,X))!=Y| -ssList(X)| -ssList(W)| -ssList(U)| -ssItem(V)| -duplicatefreeP(Y)| -ssList(Y).
% 9.95/10.15 0 [] app(U,cons(V,cons(W,X)))!=Y| -ssList(X)| -ssList(U)| -ssItem(W)| -ssItem(V)| -e_qualelemsP(Y)| -ssList(Y)|V=W.
% 9.95/10.15 0 [] app(app(U,cons(V,W)),cons(X,Y))!=Z| -ssList(Y)| -ssList(W)| -ssList(U)| -ssItem(X)| -ssItem(V)| -strictorderedP(Z)| -ssList(Z)|lt(V,X).
% 9.95/10.15 0 [] app(app(U,cons(V,W)),cons(X,Y))!=Z| -ssList(Y)| -ssList(W)| -ssList(U)| -ssItem(X)| -ssItem(V)| -totalorderedP(Z)| -ssList(Z)|le_q(V,X).
% 9.95/10.15 0 [] app(app(U,cons(V,W)),cons(X,Y))!=Z| -ssList(Y)| -ssList(W)| -ssList(U)| -ssItem(X)| -ssItem(V)| -strictorderP(Z)| -ssList(Z)|lt(V,X)|lt(X,V).
% 9.95/10.15 0 [] app(app(U,cons(V,W)),cons(X,Y))!=Z| -ssList(Y)| -ssList(W)| -ssList(U)| -ssItem(X)| -ssItem(V)| -totalorderP(Z)| -ssList(Z)|le_q(V,X)|le_q(X,V).
% 9.95/10.15 0 [] -le_q(U,V)| -le_q(V,U)|app(app(W,cons(U,X)),cons(V,Y))!=Z| -ssList(Y)| -ssList(X)| -ssList(W)| -ssItem(V)| -ssItem(U)| -cyclefreeP(Z)| -ssList(Z).
% 9.95/10.15 0 [] ssList(sk1).
% 9.95/10.15 0 [] ssList(sk2).
% 9.95/10.15 0 [] ssList(sk3).
% 9.95/10.15 0 [] ssList(sk4).
% 9.95/10.15 0 [] sk2=sk4.
% 9.95/10.15 0 [] sk1=sk3.
% 9.95/10.15 0 [] -ssItem(A)| -ssList(B)| -ssList(C)|app(app(B,cons(A,nil)),C)!=sk3| -ssItem(D)|lt(A,D)| -memberP(C,D).
% 9.95/10.15 0 [] -ssItem(A)| -ssList(B)| -ssList(C)|app(app(B,cons(A,nil)),C)!=sk3| -ssItem(D)|lt(D,A)| -memberP(B,D).
% 9.95/10.15 0 [] -totalorderedP(sk1).
% 9.95/10.15 end_of_list.
% 9.95/10.15
% 9.95/10.15 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=10.
% 9.95/10.15
% 9.95/10.15 This ia a non-Horn set with equality. The strategy will be
% 9.95/10.15 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 9.95/10.15 deletion, with positive clauses in sos and nonpositive
% 9.95/10.15 clauses in usable.
% 9.95/10.15
% 9.95/10.15 dependent: set(knuth_bendix).
% 9.95/10.15 dependent: set(anl_eq).
% 9.95/10.15 dependent: set(para_from).
% 9.95/10.15 dependent: set(para_into).
% 9.95/10.15 dependent: clear(para_from_right).
% 9.95/10.15 dependent: clear(para_into_right).
% 9.95/10.15 dependent: set(para_from_vars).
% 9.95/10.15 dependent: set(eq_units_both_ways).
% 9.95/10.15 dependent: set(dynamic_demod_all).
% 9.95/10.15 dependent: set(dynamic_demod).
% 9.95/10.15 dependent: set(order_eq).
% 9.95/10.15 dependent: set(back_demod).
% 9.95/10.15 dependent: set(lrpo).
% 9.95/10.15 dependent: set(hyper_res).
% 9.95/10.15 dependent: set(unit_deletion).
% 9.95/10.15 dependent: set(factor).
% 9.95/10.15
% 9.95/10.15 ------------> process usable:
% 9.95/10.15 ** KEPT (pick-wt=2): 1 [] -singletonP(nil).
% 9.95/10.15 ** KEPT (pick-wt=3): 2 [] skac3!=skac2.
% 9.95/10.15 ** KEPT (pick-wt=5): 3 [] -ssItem(A)|ge_q(A,A).
% 9.95/10.15 ** KEPT (pick-wt=5): 4 [] -ssList(A)|segmentP(A,nil).
% 9.95/10.15 ** KEPT (pick-wt=5): 5 [] -ssList(A)|segmentP(A,A).
% 9.95/10.15 ** KEPT (pick-wt=5): 6 [] -ssList(A)|rearsegP(A,nil).
% 9.95/10.15 ** KEPT (pick-wt=5): 7 [] -ssList(A)|rearsegP(A,A).
% 9.95/10.15 ** KEPT (pick-wt=5): 8 [] -ssList(A)|frontsegP(A,nil).
% 9.95/10.15 ** KEPT (pick-wt=5): 9 [] -ssList(A)|frontsegP(A,A).
% 9.95/10.15 ** KEPT (pick-wt=5): 10 [] -ssItem(A)|le_q(A,A).
% 9.95/10.15 ** KEPT (pick-wt=5): 11 [] -lt(A,A)| -ssItem(A).
% 9.95/10.15 ** KEPT (pick-wt=6): 12 [] -ssItem(A)|e_qualelemsP(cons(A,nil)).
% 9.95/10.15 ** KEPT (pick-wt=6): 13 [] -ssItem(A)|duplicatefreeP(cons(A,nil)).
% 9.95/10.15 ** KEPT (pick-wt=6): 14 [] -ssItem(A)|strictorderedP(cons(A,nil)).
% 9.95/10.15 ** KEPT (pick-wt=6): 15 [] -ssItem(A)|totalorderedP(cons(A,nil)).
% 9.95/10.15 ** KEPT (pick-wt=6): 16 [] -ssItem(A)|strictorderP(cons(A,nil)).
% 9.95/10.15 ** KEPT (pick-wt=6): 17 [] -ssItem(A)|totalorderP(cons(A,nil)).
% 9.95/10.15 ** KEPT (pick-wt=6): 18 [] -ssItem(A)|cyclefreeP(cons(A,nil)).
% 9.95/10.15 ** KEPT (pick-wt=5): 19 [] -memberP(nil,A)| -ssItem(A).
% 9.95/10.15 ** KEPT (pick-wt=6): 20 [] -ssList(A)|duplicatefreeP(A)|ssItem(B).
% 9.95/10.15 ** KEPT (pick-wt=7): 21 [] -ssList(A)|app(A,nil)=A.
% 9.95/10.15 ** KEPT (pick-wt=7): 22 [] -ssList(A)|app(nil,A)=A.
% 9.95/10.15 ** KEPT (pick-wt=8): 23 [] -ssList(A)|ssList(tl(A))|nil=A.
% 9.95/10.15 ** KEPT (pick-wt=8): 24 [] -ssList(A)|ssItem(hd(A))|nil=A.
% 9.95/10.15 Following clause subsumed by 23 during input processing: 0 [] -ssList(A)|ssList(tl(A))|nil=A.
% 9.95/10.15 Following clause subsumed by 24 during input processing: 0 [] -ssList(A)|ssItem(hd(A))|nil=A.
% 9.95/10.15 ** KEPT (pick-wt=8): 25 [] nil!=A| -ssList(A)|segmentP(nil,A).
% 9.95/10.15 ** KEPT (pick-wt=8): 26 [] -segmentP(nil,A)| -ssList(A)|nil=A.
% 9.95/10.15 ** KEPT (pick-wt=8): 27 [] nil!=A| -ssList(A)|rearsegP(nil,A).
% 9.95/10.15 ** KEPT (pick-wt=8): 28 [] -rearsegP(nil,A)| -ssList(A)|nil=A.
% 9.95/10.15 ** KEPT (pick-wt=8): 29 [] nil!=A| -ssList(A)|frontsegP(nil,A).
% 9.95/10.15 ** KEPT (pick-wt=8): 30 [] -frontsegP(nil,A)| -ssList(A)|nil=A.
% 9.95/10.15 ** KEPT (pick-wt=8): 31 [] -ssList(A)| -ssList(B)|ssList(app(B,A)).
% 9.95/10.15 ** KEPT (pick-wt=8): 32 [] -ssItem(A)| -ssList(B)|ssList(cons(A,B)).
% 9.95/10.15 ** KEPT (pick-wt=9): 33 [] -ssList(A)|cyclefreeP(A)|le_q(skaf50(A),skaf49(A)).
% 9.95/10.15 ** KEPT (pick-wt=9): 34 [] -ssList(A)|cyclefreeP(A)|le_q(skaf49(A),skaf50(A)).
% 9.95/10.15 ** KEPT (pick-wt=9): 35 [] skaf79(A)!=skaf78(A)| -ssList(A)|e_qualelemsP(A).
% 9.95/10.15 ** KEPT (pick-wt=9): 36 [] -lt(skaf69(A),skaf70(A))| -ssList(A)|strictorderedP(A).
% 9.95/10.15 ** KEPT (pick-wt=9): 37 [] -le_q(skaf64(A),skaf65(A))| -ssList(A)|totalorderedP(A).
% 9.95/10.15 ** KEPT (pick-wt=9): 38 [] -lt(skaf60(A),skaf59(A))| -ssList(A)|strictorderP(A).
% 9.95/10.15 ** KEPT (pick-wt=9): 39 [] -lt(skaf59(A),skaf60(A))| -ssList(A)|strictorderP(A).
% 9.95/10.15 ** KEPT (pick-wt=9): 40 [] -le_q(skaf55(A),skaf54(A))| -ssList(A)|totalorderP(A).
% 9.95/10.15 ** KEPT (pick-wt=9): 41 [] -le_q(skaf54(A),skaf55(A))| -ssList(A)|totalorderP(A).
% 9.95/10.15 ** KEPT (pick-wt=10): 42 [] -ssItem(A)| -ssList(B)|tl(cons(A,B))=B.
% 9.95/10.15 ** KEPT (pick-wt=10): 43 [] -ssItem(A)| -ssList(B)|hd(cons(A,B))=A.
% 9.95/10.15 ** KEPT (pick-wt=9): 44 [] cons(A,B)!=nil| -ssItem(A)| -ssList(B).
% 9.95/10.15 ** KEPT (pick-wt=9): 45 [] cons(A,B)!=B| -ssItem(A)| -ssList(B).
% 9.95/10.15 ** KEPT (pick-wt=10): 46 [] -ssList(A)| -ssList(B)|ne_q(B,A)|B=A.
% 9.95/10.15 ** KEPT (pick-wt=10): 47 [] -singletonP(A)| -ssList(A)|cons(skaf44(A),nil)=A.
% 9.95/10.15 ** KEPT (pick-wt=10): 48 [] -ssItem(A)| -ssItem(B)|ne_q(B,A)|B=A.
% 9.95/10.15 ** KEPT (pick-wt=10): 49 [] -lt(A,B)| -ssItem(B)| -ssItem(A)|le_q(A,B).
% 9.95/10.15 ** KEPT (pick-wt=12): 50 [] -ssList(A)|cons(hd(A),tl(A))=A|nil=A.
% 9.95/10.15 ** KEPT (pick-wt=10): 51 [] -gt(A,B)| -ssItem(B)| -ssItem(A)|lt(B,A).
% 9.95/10.15 ** KEPT (pick-wt=10): 52 [] -lt(A,B)| -ssItem(A)| -ssItem(B)|gt(B,A).
% 9.95/10.15 ** KEPT (pick-wt=10): 53 [] -ge_q(A,B)| -ssItem(B)| -ssItem(A)|le_q(B,A).
% 9.95/10.15 ** KEPT (pick-wt=10): 54 [] -le_q(A,B)| -ssItem(A)| -ssItem(B)|ge_q(B,A).
% 9.95/10.15 ** KEPT (pick-wt=12): 55 [] -ssList(A)|cons(skaf83(A),skaf82(A))=A|nil=A.
% 9.95/10.15 ** KEPT (pick-wt=10): 56 [] -gt(A,B)| -gt(B,A)| -ssItem(A)| -ssItem(B).
% 9.95/10.15 ** KEPT (pick-wt=10): 57 [] A!=B| -lt(A,B)| -ssItem(B)| -ssItem(A).
% 9.95/10.15 ** KEPT (pick-wt=11): 58 [] nil!=A| -ssList(A)| -ssItem(B)|strictorderedP(cons(B,A)).
% 9.95/10.15 ** KEPT (pick-wt=11): 59 [] nil!=A| -ssList(A)| -ssItem(B)|totalorderedP(cons(B,A)).
% 9.95/10.15 ** KEPT (pick-wt=10): 60 [] -lt(A,B)| -lt(B,A)| -ssItem(A)| -ssItem(B).
% 9.95/10.15 ** KEPT (pick-wt=10): 61 [] A!=B| -ne_q(A,B)| -ssList(B)| -ssList(A).
% 9.95/10.15 ** KEPT (pick-wt=11): 62 [] cons(A,nil)!=B| -ssItem(A)| -ssList(B)|singletonP(B).
% 9.95/10.15 ** KEPT (pick-wt=10): 63 [] A!=B| -ne_q(A,B)| -ssItem(B)| -ssItem(A).
% 9.95/10.15 ** KEPT (pick-wt=12): 64 [] app(A,B)!=nil| -ssList(B)| -ssList(A)|nil=A.
% 9.95/10.15 ** KEPT (pick-wt=12): 65 [] app(A,B)!=nil| -ssList(B)| -ssList(A)|nil=B.
% 9.95/10.15 ** KEPT (pick-wt=13): 66 [] -ssItem(A)| -ssList(B)|app(cons(A,nil),B)=cons(A,B).
% 9.95/10.15 ** KEPT (pick-wt=13): 67 [] -le_q(A,B)| -ssItem(B)| -ssItem(A)|lt(A,B)|A=B.
% 9.95/10.15 Following clause subsumed by 67 during input processing: 0 [] -le_q(A,B)| -ssItem(B)| -ssItem(A)|lt(A,B)|A=B.
% 10.06/10.24 ** KEPT (pick-wt=14): 68 [] -ssList(A)| -ssList(B)|nil=B|hd(app(B,A))=hd(B).
% 10.06/10.24 ** KEPT (pick-wt=13): 69 [] -strictorderedP(cons(A,B))| -ssList(B)| -ssItem(A)|strictorderedP(B)|nil=B.
% 10.06/10.24 ** KEPT (pick-wt=13): 70 [] -totalorderedP(cons(A,B))| -ssList(B)| -ssItem(A)|totalorderedP(B)|nil=B.
% 10.06/10.24 ** KEPT (pick-wt=13): 71 [] -ge_q(A,B)| -ge_q(B,A)| -ssItem(A)| -ssItem(B)|B=A.
% 10.06/10.24 ** KEPT (pick-wt=13): 72 [] -segmentP(A,B)| -segmentP(B,A)| -ssList(A)| -ssList(B)|B=A.
% 10.06/10.24 ** KEPT (pick-wt=13): 73 [] -rearsegP(A,B)| -rearsegP(B,A)| -ssList(A)| -ssList(B)|B=A.
% 10.06/10.24 ** KEPT (pick-wt=13): 74 [] -frontsegP(A,B)| -frontsegP(B,A)| -ssList(A)| -ssList(B)|B=A.
% 10.06/10.24 ** KEPT (pick-wt=13): 75 [] -le_q(A,B)| -le_q(B,A)| -ssItem(A)| -ssItem(B)|B=A.
% 10.06/10.24 ** KEPT (pick-wt=14): 76 [] -rearsegP(A,B)| -ssList(B)| -ssList(A)|app(skaf46(A,B),B)=A.
% 10.06/10.24 ** KEPT (pick-wt=14): 77 [] -frontsegP(A,B)| -ssList(B)| -ssList(A)|app(B,skaf45(A,B))=A.
% 10.06/10.24 ** KEPT (pick-wt=16): 78 [] -ssList(A)| -ssList(B)|nil=B|tl(app(B,A))=app(tl(B),A).
% 10.06/10.24 ** KEPT (pick-wt=15): 79 [] -strictorderedP(cons(A,B))| -ssList(B)| -ssItem(A)|lt(A,hd(B))|nil=B.
% 10.06/10.24 ** KEPT (pick-wt=15): 80 [] -totalorderedP(cons(A,B))| -ssList(B)| -ssItem(A)|le_q(A,hd(B))|nil=B.
% 10.06/10.24 ** KEPT (pick-wt=14): 81 [] -rearsegP(A,B)| -ssList(C)| -ssList(B)| -ssList(A)|rearsegP(app(C,A),B).
% 10.06/10.24 ** KEPT (pick-wt=14): 82 [] -frontsegP(A,B)| -ssList(C)| -ssList(B)| -ssList(A)|frontsegP(app(A,C),B).
% 10.06/10.24 ** KEPT (pick-wt=14): 83 [] A!=B| -ssList(C)| -ssItem(B)| -ssItem(A)|memberP(cons(B,C),A).
% 10.06/10.24 ** KEPT (pick-wt=14): 84 [] -memberP(A,B)| -ssList(A)| -ssItem(C)| -ssItem(B)|memberP(cons(C,A),B).
% 10.06/10.24 ** KEPT (pick-wt=14): 85 [] -memberP(A,B)| -ssList(C)| -ssList(A)| -ssItem(B)|memberP(app(A,C),B).
% 10.06/10.24 ** KEPT (pick-wt=14): 86 [] -memberP(A,B)| -ssList(A)| -ssList(C)| -ssItem(B)|memberP(app(C,A),B).
% 10.06/10.24 ** KEPT (pick-wt=17): 87 [] -ssList(A)|e_qualelemsP(A)|app(skaf80(A),cons(skaf78(A),cons(skaf79(A),skaf81(A))))=A.
% 10.06/10.24 ** KEPT (pick-wt=14): 88 [] app(A,B)!=C| -ssList(A)| -ssList(B)| -ssList(C)|rearsegP(C,B).
% 10.06/10.24 ** KEPT (pick-wt=14): 89 [] app(A,B)!=C| -ssList(B)| -ssList(A)| -ssList(C)|frontsegP(C,A).
% 10.06/10.24 ** KEPT (pick-wt=15): 90 [] nil!=A|nil!=B| -ssList(B)| -ssList(A)|app(A,B)=nil.
% 10.06/10.24 ** KEPT (pick-wt=15): 91 [] -gt(A,B)| -gt(B,C)| -ssItem(C)| -ssItem(B)| -ssItem(A)|gt(A,C).
% 10.06/10.24 ** KEPT (pick-wt=15): 92 [] -le_q(A,B)| -lt(B,C)| -ssItem(C)| -ssItem(B)| -ssItem(A)|lt(A,C).
% 10.06/10.24 ** KEPT (pick-wt=15): 93 [] -ge_q(A,B)| -ge_q(B,C)| -ssItem(C)| -ssItem(B)| -ssItem(A)|ge_q(A,C).
% 10.06/10.24 ** KEPT (pick-wt=17): 94 [] -ssList(A)| -ssList(B)| -ssList(C)|app(app(C,B),A)=app(C,app(B,A)).
% 10.06/10.24 ** KEPT (pick-wt=16): 95 [] app(A,B)!=app(A,C)| -ssList(B)| -ssList(A)| -ssList(C)|B=C.
% 10.06/10.24 ** KEPT (pick-wt=16): 96 [] app(A,B)!=app(C,B)| -ssList(A)| -ssList(B)| -ssList(C)|A=C.
% 10.06/10.24 ** KEPT (pick-wt=15): 97 [] -segmentP(A,B)| -segmentP(B,C)| -ssList(C)| -ssList(B)| -ssList(A)|segmentP(A,C).
% 10.06/10.24 ** KEPT (pick-wt=15): 98 [] -rearsegP(A,B)| -rearsegP(B,C)| -ssList(C)| -ssList(B)| -ssList(A)|rearsegP(A,C).
% 10.06/10.24 ** KEPT (pick-wt=15): 99 [] -frontsegP(A,B)| -frontsegP(B,C)| -ssList(C)| -ssList(B)| -ssList(A)|frontsegP(A,C).
% 10.06/10.24 ** KEPT (pick-wt=15): 100 [] -lt(A,B)| -lt(B,C)| -ssItem(C)| -ssItem(B)| -ssItem(A)|lt(A,C).
% 10.06/10.24 ** KEPT (pick-wt=15): 101 [] -le_q(A,B)| -le_q(B,C)| -ssItem(C)| -ssItem(B)| -ssItem(A)|le_q(A,C).
% 10.06/10.24 ** KEPT (pick-wt=17): 102 [] -ssItem(A)| -ssList(B)| -ssList(C)|cons(A,app(B,C))=app(cons(A,B),C).
% 10.06/10.24 ** KEPT (pick-wt=17): 103 [] -memberP(app(A,B),C)| -ssList(B)| -ssList(A)| -ssItem(C)|memberP(B,C)|memberP(A,C).
% 10.06/10.24 ** KEPT (pick-wt=17): 104 [] -le_q(A,hd(B))| -totalorderedP(B)| -ssList(B)| -ssItem(A)|totalorderedP(cons(A,B))|nil=B.
% 10.06/10.24 ** KEPT (pick-wt=17): 105 [] -lt(A,hd(B))| -strictorderedP(B)| -ssList(B)| -ssItem(A)|strictorderedP(cons(A,B))|nil=B.
% 10.06/10.24 ** KEPT (pick-wt=17): 106 [] -memberP(cons(A,B),C)| -ssList(B)| -ssItem(A)| -ssItem(C)|memberP(B,C)|C=A.
% 10.06/10.24 ** KEPT (pick-wt=20): 107 [] -ssList(A)|duplicatefreeP(A)|app(app(skaf75(A),cons(skaf74(A),skaf76(A))),cons(skaf74(A),skaf77(A)))=A.
% 10.06/10.24 ** KEPT (pick-wt=20): 108 [] -ssList(A)|strictorderedP(A)|app(app(skaf71(A),cons(skaf69(A),skaf72(A))),cons(skaf70(A),skaf73(A)))=A.
% 10.06/10.24 ** KEPT (pick-wt=20): 109 [] -ssList(A)|totalorderedP(A)|app(app(skaf66(A),cons(skaf64(A),skaf67(A))),cons(skaf65(A),skaf68(A)))=A.
% 10.06/10.25 ** KEPT (pick-wt=20): 110 [] -ssList(A)|strictorderP(A)|app(app(skaf61(A),cons(skaf59(A),skaf62(A))),cons(skaf60(A),skaf63(A)))=A.
% 10.06/10.25 ** KEPT (pick-wt=20): 111 [] -ssList(A)|totalorderP(A)|app(app(skaf56(A),cons(skaf54(A),skaf57(A))),cons(skaf55(A),skaf58(A)))=A.
% 10.06/10.25 ** KEPT (pick-wt=20): 112 [] -ssList(A)|cyclefreeP(A)|app(app(skaf51(A),cons(skaf49(A),skaf52(A))),cons(skaf50(A),skaf53(A)))=A.
% 10.06/10.25 ** KEPT (pick-wt=18): 113 [] -segmentP(A,B)| -ssList(B)| -ssList(A)|app(app(skaf47(A,B),B),skaf48(B,A))=A.
% 10.06/10.25 ** KEPT (pick-wt=18): 114 [] -memberP(A,B)| -ssItem(B)| -ssList(A)|app(skaf42(A,B),cons(B,skaf43(B,A)))=A.
% 10.06/10.25 ** KEPT (pick-wt=18): 115 [] cons(A,B)!=cons(C,D)| -ssItem(C)| -ssItem(A)| -ssList(D)| -ssList(B)|A=C.
% 10.06/10.25 ** KEPT (pick-wt=18): 116 [] cons(A,B)!=cons(C,D)| -ssItem(C)| -ssItem(A)| -ssList(D)| -ssList(B)|D=B.
% 10.06/10.25 ** KEPT (pick-wt=18): 117 [] -segmentP(A,B)| -ssList(C)| -ssList(D)| -ssList(B)| -ssList(A)|segmentP(app(app(D,A),C),B).
% 10.06/10.25 ** KEPT (pick-wt=18): 118 [] app(app(A,B),C)!=D| -ssList(C)| -ssList(A)| -ssList(B)| -ssList(D)|segmentP(D,B).
% 10.06/10.25 ** KEPT (pick-wt=18): 119 [] -frontsegP(cons(A,B),cons(C,D))| -ssList(D)| -ssList(B)| -ssItem(C)| -ssItem(A)|frontsegP(B,D).
% 10.06/10.25 ** KEPT (pick-wt=18): 120 [] app(A,cons(B,C))!=D| -ssList(C)| -ssList(A)| -ssItem(B)| -ssList(D)|memberP(D,B).
% 10.06/10.25 ** KEPT (pick-wt=18): 121 [] -frontsegP(cons(A,B),cons(C,D))| -ssList(D)| -ssList(B)| -ssItem(C)| -ssItem(A)|A=C.
% 10.06/10.25 ** KEPT (pick-wt=23): 122 [] tl(A)!=tl(B)|hd(A)!=hd(B)| -ssList(A)| -ssList(B)|nil=B|A=B|nil=A.
% 10.06/10.25 ** KEPT (pick-wt=21): 123 [] -frontsegP(A,B)|C!=D| -ssList(B)| -ssList(A)| -ssItem(D)| -ssItem(C)|frontsegP(cons(C,A),cons(D,B)).
% 10.06/10.25 ** KEPT (pick-wt=23): 124 [] app(app(A,cons(B,C)),cons(B,D))!=E| -ssList(D)| -ssList(C)| -ssList(A)| -ssItem(B)| -duplicatefreeP(E)| -ssList(E).
% 10.06/10.25 ** KEPT (pick-wt=24): 125 [] app(A,cons(B,cons(C,D)))!=E| -ssList(D)| -ssList(A)| -ssItem(C)| -ssItem(B)| -e_qualelemsP(E)| -ssList(E)|B=C.
% 10.06/10.25 ** KEPT (pick-wt=28): 126 [] app(app(A,cons(B,C)),cons(D,E))!=F| -ssList(E)| -ssList(C)| -ssList(A)| -ssItem(D)| -ssItem(B)| -strictorderedP(F)| -ssList(F)|lt(B,D).
% 10.06/10.25 ** KEPT (pick-wt=28): 127 [] app(app(A,cons(B,C)),cons(D,E))!=F| -ssList(E)| -ssList(C)| -ssList(A)| -ssItem(D)| -ssItem(B)| -totalorderedP(F)| -ssList(F)|le_q(B,D).
% 10.06/10.25 ** KEPT (pick-wt=31): 128 [] app(app(A,cons(B,C)),cons(D,E))!=F| -ssList(E)| -ssList(C)| -ssList(A)| -ssItem(D)| -ssItem(B)| -strictorderP(F)| -ssList(F)|lt(B,D)|lt(D,B).
% 10.06/10.25 ** KEPT (pick-wt=31): 129 [] app(app(A,cons(B,C)),cons(D,E))!=F| -ssList(E)| -ssList(C)| -ssList(A)| -ssItem(D)| -ssItem(B)| -totalorderP(F)| -ssList(F)|le_q(B,D)|le_q(D,B).
% 10.06/10.25 ** KEPT (pick-wt=31): 130 [] -le_q(A,B)| -le_q(B,A)|app(app(C,cons(A,D)),cons(B,E))!=F| -ssList(E)| -ssList(D)| -ssList(C)| -ssItem(B)| -ssItem(A)| -cyclefreeP(F)| -ssList(F).
% 10.06/10.25 ** KEPT (pick-wt=23): 131 [] -ssItem(A)| -ssList(B)| -ssList(C)|app(app(B,cons(A,nil)),C)!=sk3| -ssItem(D)|lt(A,D)| -memberP(C,D).
% 10.06/10.25 ** KEPT (pick-wt=23): 132 [] -ssItem(A)| -ssList(B)| -ssList(C)|app(app(B,cons(A,nil)),C)!=sk3| -ssItem(D)|lt(D,A)| -memberP(B,D).
% 10.06/10.25 ** KEPT (pick-wt=2): 133 [] -totalorderedP(sk1).
% 10.06/10.25 138 back subsumes 137.
% 10.06/10.25 148 back subsumes 142.
% 10.06/10.25
% 10.06/10.25 ------------> process sos:
% 10.06/10.25 ** KEPT (pick-wt=3): 370 [] A=A.
% 10.06/10.25 ** KEPT (pick-wt=2): 371 [] e_qualelemsP(nil).
% 10.06/10.25 ** KEPT (pick-wt=2): 372 [] duplicatefreeP(nil).
% 10.06/10.25 ** KEPT (pick-wt=2): 373 [] strictorderedP(nil).
% 10.06/10.25 ** KEPT (pick-wt=2): 374 [] totalorderedP(nil).
% 10.06/10.25 ** KEPT (pick-wt=2): 375 [] strictorderP(nil).
% 10.06/10.25 ** KEPT (pick-wt=2): 376 [] totalorderP(nil).
% 10.06/10.25 ** KEPT (pick-wt=2): 377 [] cyclefreeP(nil).
% 10.06/10.25 ** KEPT (pick-wt=2): 378 [] ssList(nil).
% 10.06/10.25 ** KEPT (pick-wt=2): 379 [] ssItem(skac3).
% 10.06/10.25 ** KEPT (pick-wt=2): 380 [] ssItem(skac2).
% 10.06/10.25 ** KEPT (pick-wt=3): 381 [] ssItem(skaf83(A)).
% 10.06/10.25 ** KEPT (pick-wt=3): 382 [] ssList(skaf82(A)).
% 10.06/10.25 ** KEPT (pick-wt=3): 383 [] ssList(skaf81(A)).
% 10.06/10.25 ** KEPT (pick-wt=3): 384 [] ssList(skaf80(A)).
% 10.06/10.25 ** KEPT (pick-wt=3): 385 [] ssItem(skaf79(A)).
% 10.06/10.25 ** KEPT (pick-wt=3): 386 [] ssItem(skaf78(A)).
% 10.06/10.25 ** KEPT (pick-wt=3): 387 [] ssList(skaf77(A)).
% 10.06/10.25 ** KEPT (pick-wt=3): 388 [] ssList(skaf76(A)).
% 82.28/82.52 ** KEPT (pick-wt=3): 389 [] ssList(skaf75(A)).
% 82.28/82.52 ** KEPT (pick-wt=3): 390 [] ssItem(skaf74(A)).
% 82.28/82.52 ** KEPT (pick-wt=3): 391 [] ssList(skaf73(A)).
% 82.28/82.52 ** KEPT (pick-wt=3): 392 [] ssList(skaf72(A)).
% 82.28/82.52 ** KEPT (pick-wt=3): 393 [] ssList(skaf71(A)).
% 82.28/82.52 ** KEPT (pick-wt=3): 394 [] ssItem(skaf70(A)).
% 82.28/82.52 ** KEPT (pick-wt=3): 395 [] ssItem(skaf69(A)).
% 82.28/82.52 ** KEPT (pick-wt=3): 396 [] ssList(skaf68(A)).
% 82.28/82.52 ** KEPT (pick-wt=3): 397 [] ssList(skaf67(A)).
% 82.28/82.52 ** KEPT (pick-wt=3): 398 [] ssList(skaf66(A)).
% 82.28/82.52 ** KEPT (pick-wt=3): 399 [] ssItem(skaf65(A)).
% 82.28/82.52 ** KEPT (pick-wt=3): 400 [] ssItem(skaf64(A)).
% 82.28/82.52 ** KEPT (pick-wt=3): 401 [] ssList(skaf63(A)).
% 82.28/82.52 ** KEPT (pick-wt=3): 402 [] ssList(skaf62(A)).
% 82.28/82.52 ** KEPT (pick-wt=3): 403 [] ssList(skaf61(A)).
% 82.28/82.52 ** KEPT (pick-wt=3): 404 [] ssItem(skaf60(A)).
% 82.28/82.52 ** KEPT (pick-wt=3): 405 [] ssItem(skaf59(A)).
% 82.28/82.52 ** KEPT (pick-wt=3): 406 [] ssList(skaf58(A)).
% 82.28/82.52 ** KEPT (pick-wt=3): 407 [] ssList(skaf57(A)).
% 82.28/82.52 ** KEPT (pick-wt=3): 408 [] ssList(skaf56(A)).
% 82.28/82.52 ** KEPT (pick-wt=3): 409 [] ssItem(skaf55(A)).
% 82.28/82.52 ** KEPT (pick-wt=3): 410 [] ssItem(skaf54(A)).
% 82.28/82.52 ** KEPT (pick-wt=3): 411 [] ssList(skaf53(A)).
% 82.28/82.52 ** KEPT (pick-wt=3): 412 [] ssList(skaf52(A)).
% 82.28/82.52 ** KEPT (pick-wt=3): 413 [] ssList(skaf51(A)).
% 82.28/82.52 ** KEPT (pick-wt=3): 414 [] ssItem(skaf50(A)).
% 82.28/82.52 ** KEPT (pick-wt=3): 415 [] ssItem(skaf49(A)).
% 82.28/82.52 ** KEPT (pick-wt=3): 416 [] ssItem(skaf44(A)).
% 82.28/82.52 ** KEPT (pick-wt=4): 417 [] ssList(skaf48(A,B)).
% 82.28/82.52 ** KEPT (pick-wt=4): 418 [] ssList(skaf47(A,B)).
% 82.28/82.52 ** KEPT (pick-wt=4): 419 [] ssList(skaf46(A,B)).
% 82.28/82.52 ** KEPT (pick-wt=4): 420 [] ssList(skaf45(A,B)).
% 82.28/82.52 ** KEPT (pick-wt=4): 421 [] ssList(skaf43(A,B)).
% 82.28/82.52 ** KEPT (pick-wt=4): 422 [] ssList(skaf42(A,B)).
% 82.28/82.52 ** KEPT (pick-wt=2): 423 [] ssList(sk1).
% 82.28/82.52 ** KEPT (pick-wt=2): 424 [] ssList(sk2).
% 82.28/82.52 ** KEPT (pick-wt=2): 425 [] ssList(sk3).
% 82.28/82.52 ** KEPT (pick-wt=2): 426 [] ssList(sk4).
% 82.28/82.52 ** KEPT (pick-wt=3): 428 [copy,427,flip.1] sk4=sk2.
% 82.28/82.52 ---> New Demodulator: 429 [new_demod,428] sk4=sk2.
% 82.28/82.52 ** KEPT (pick-wt=3): 431 [copy,430,flip.1] sk3=sk1.
% 82.28/82.52 ---> New Demodulator: 432 [new_demod,431] sk3=sk1.
% 82.28/82.52 Following clause subsumed by 370 during input processing: 0 [copy,370,flip.1] A=A.
% 82.28/82.52 370 back subsumes 340.
% 82.28/82.52 370 back subsumes 283.
% 82.28/82.52 370 back subsumes 282.
% 82.28/82.52 370 back subsumes 281.
% 82.28/82.52 370 back subsumes 271.
% 82.28/82.52 370 back subsumes 258.
% 82.28/82.52 370 back subsumes 257.
% 82.28/82.52 370 back subsumes 256.
% 82.28/82.52 370 back subsumes 215.
% 82.28/82.52 370 back subsumes 203.
% 82.28/82.52 370 back subsumes 202.
% 82.28/82.52 370 back subsumes 201.
% 82.28/82.52 370 back subsumes 200.
% 82.28/82.52 370 back subsumes 183.
% 82.28/82.52 370 back subsumes 180.
% 82.28/82.52 370 back subsumes 178.
% 82.28/82.52 370 back subsumes 174.
% 82.28/82.52 370 back subsumes 171.
% 82.28/82.52 370 back subsumes 148.
% 82.28/82.52 370 back subsumes 147.
% 82.28/82.52 370 back subsumes 146.
% 82.28/82.52 370 back subsumes 145.
% 82.28/82.52 370 back subsumes 144.
% 82.28/82.52 370 back subsumes 136.
% 82.28/82.52 370 back subsumes 135.
% 82.28/82.52 >>>> Starting back demodulation with 429.
% 82.28/82.52 >> back demodulating 426 with 429.
% 82.28/82.52 >>>> Starting back demodulation with 432.
% 82.28/82.52 >> back demodulating 425 with 432.
% 82.28/82.52 >> back demodulating 337 with 432.
% 82.28/82.52 >> back demodulating 252 with 432.
% 82.28/82.52 >> back demodulating 251 with 432.
% 82.28/82.52 >> back demodulating 250 with 432.
% 82.28/82.52 >> back demodulating 249 with 432.
% 82.28/82.52 >> back demodulating 132 with 432.
% 82.28/82.52 >> back demodulating 131 with 432.
% 82.28/82.52
% 82.28/82.52 ======= end of input processing =======
% 82.28/82.52
% 82.28/82.52 =========== start of search ===========
% 82.28/82.52
% 82.28/82.52
% 82.28/82.52 Resetting weight limit to 3.
% 82.28/82.52
% 82.28/82.52
% 82.28/82.52 Resetting weight limit to 3.
% 82.28/82.52
% 82.28/82.52 sos_size=482
% 82.28/82.52
% 82.28/82.52 Search stopped because sos empty.
% 82.28/82.52
% 82.28/82.52
% 82.28/82.52 Search stopped because sos empty.
% 82.28/82.52
% 82.28/82.52 ============ end of search ============
% 82.28/82.52
% 82.28/82.52 -------------- statistics -------------
% 82.28/82.52 clauses given 506
% 82.28/82.52 clauses generated 255108
% 82.28/82.52 clauses kept 938
% 82.28/82.52 clauses forward subsumed 2725
% 82.28/82.52 clauses back subsumed 61
% 82.28/82.52 Kbytes malloced 5859
% 82.28/82.52
% 82.28/82.52 ----------- times (seconds) -----------
% 82.28/82.52 user CPU time 72.37 (0 hr, 1 min, 12 sec)
% 82.28/82.52 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 82.28/82.52 wall-clock time 82 (0 hr, 1 min, 22 sec)
% 82.28/82.52
% 82.28/82.52 Process 16810 finished Wed Jul 27 04:50:17 2022
% 82.28/82.52 Otter interrupted
% 82.28/82.52 PROOF NOT FOUND
%------------------------------------------------------------------------------