%------------------------------------------------------------------------------
% File     : iProverMo---2.5-0.1
% Problem  : SWC128-1 : TPTP v8.1.0. Bugfixed v3.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : iprover_modulo %s %d

% Computer : n026.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 : Tue Jul 19 20:52:30 EDT 2022

% Result   : Unsatisfiable 0.22s 0.51s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named input)

% Comments : 
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy Equiv(ClausalAll)
% Orienting axioms whose shape is orientable
cnf(clause54,axiom,
    skac3 != skac2,
    input ).

fof(clause54_0,plain,
    ( skac3 != skac2
    | $false ),
    inference(orientation,[status(thm)],[clause54]) ).

cnf(clause53,axiom,
    ssList(skaf42(U,V)),
    input ).

fof(clause53_0,plain,
    ! [U,V] :
      ( ssList(skaf42(U,V))
      | $false ),
    inference(orientation,[status(thm)],[clause53]) ).

cnf(clause52,axiom,
    ssList(skaf43(U,V)),
    input ).

fof(clause52_0,plain,
    ! [U,V] :
      ( ssList(skaf43(U,V))
      | $false ),
    inference(orientation,[status(thm)],[clause52]) ).

cnf(clause51,axiom,
    ssList(skaf45(U,V)),
    input ).

fof(clause51_0,plain,
    ! [U,V] :
      ( ssList(skaf45(U,V))
      | $false ),
    inference(orientation,[status(thm)],[clause51]) ).

cnf(clause50,axiom,
    ssList(skaf46(U,V)),
    input ).

fof(clause50_0,plain,
    ! [U,V] :
      ( ssList(skaf46(U,V))
      | $false ),
    inference(orientation,[status(thm)],[clause50]) ).

cnf(clause49,axiom,
    ssList(skaf47(U,V)),
    input ).

fof(clause49_0,plain,
    ! [U,V] :
      ( ssList(skaf47(U,V))
      | $false ),
    inference(orientation,[status(thm)],[clause49]) ).

cnf(clause48,axiom,
    ssList(skaf48(U,V)),
    input ).

fof(clause48_0,plain,
    ! [U,V] :
      ( ssList(skaf48(U,V))
      | $false ),
    inference(orientation,[status(thm)],[clause48]) ).

cnf(clause47,axiom,
    ssItem(skaf44(U)),
    input ).

fof(clause47_0,plain,
    ! [U] :
      ( ssItem(skaf44(U))
      | $false ),
    inference(orientation,[status(thm)],[clause47]) ).

cnf(clause46,axiom,
    ssItem(skaf49(U)),
    input ).

fof(clause46_0,plain,
    ! [U] :
      ( ssItem(skaf49(U))
      | $false ),
    inference(orientation,[status(thm)],[clause46]) ).

cnf(clause45,axiom,
    ssItem(skaf50(U)),
    input ).

fof(clause45_0,plain,
    ! [U] :
      ( ssItem(skaf50(U))
      | $false ),
    inference(orientation,[status(thm)],[clause45]) ).

cnf(clause44,axiom,
    ssList(skaf51(U)),
    input ).

fof(clause44_0,plain,
    ! [U] :
      ( ssList(skaf51(U))
      | $false ),
    inference(orientation,[status(thm)],[clause44]) ).

cnf(clause43,axiom,
    ssList(skaf52(U)),
    input ).

fof(clause43_0,plain,
    ! [U] :
      ( ssList(skaf52(U))
      | $false ),
    inference(orientation,[status(thm)],[clause43]) ).

cnf(clause42,axiom,
    ssList(skaf53(U)),
    input ).

fof(clause42_0,plain,
    ! [U] :
      ( ssList(skaf53(U))
      | $false ),
    inference(orientation,[status(thm)],[clause42]) ).

cnf(clause41,axiom,
    ssItem(skaf54(U)),
    input ).

fof(clause41_0,plain,
    ! [U] :
      ( ssItem(skaf54(U))
      | $false ),
    inference(orientation,[status(thm)],[clause41]) ).

cnf(clause40,axiom,
    ssItem(skaf55(U)),
    input ).

fof(clause40_0,plain,
    ! [U] :
      ( ssItem(skaf55(U))
      | $false ),
    inference(orientation,[status(thm)],[clause40]) ).

cnf(clause39,axiom,
    ssList(skaf56(U)),
    input ).

fof(clause39_0,plain,
    ! [U] :
      ( ssList(skaf56(U))
      | $false ),
    inference(orientation,[status(thm)],[clause39]) ).

cnf(clause38,axiom,
    ssList(skaf57(U)),
    input ).

fof(clause38_0,plain,
    ! [U] :
      ( ssList(skaf57(U))
      | $false ),
    inference(orientation,[status(thm)],[clause38]) ).

cnf(clause37,axiom,
    ssList(skaf58(U)),
    input ).

fof(clause37_0,plain,
    ! [U] :
      ( ssList(skaf58(U))
      | $false ),
    inference(orientation,[status(thm)],[clause37]) ).

cnf(clause36,axiom,
    ssItem(skaf59(U)),
    input ).

fof(clause36_0,plain,
    ! [U] :
      ( ssItem(skaf59(U))
      | $false ),
    inference(orientation,[status(thm)],[clause36]) ).

cnf(clause35,axiom,
    ssItem(skaf60(U)),
    input ).

fof(clause35_0,plain,
    ! [U] :
      ( ssItem(skaf60(U))
      | $false ),
    inference(orientation,[status(thm)],[clause35]) ).

cnf(clause34,axiom,
    ssList(skaf61(U)),
    input ).

fof(clause34_0,plain,
    ! [U] :
      ( ssList(skaf61(U))
      | $false ),
    inference(orientation,[status(thm)],[clause34]) ).

cnf(clause33,axiom,
    ssList(skaf62(U)),
    input ).

fof(clause33_0,plain,
    ! [U] :
      ( ssList(skaf62(U))
      | $false ),
    inference(orientation,[status(thm)],[clause33]) ).

cnf(clause32,axiom,
    ssList(skaf63(U)),
    input ).

fof(clause32_0,plain,
    ! [U] :
      ( ssList(skaf63(U))
      | $false ),
    inference(orientation,[status(thm)],[clause32]) ).

cnf(clause31,axiom,
    ssItem(skaf64(U)),
    input ).

fof(clause31_0,plain,
    ! [U] :
      ( ssItem(skaf64(U))
      | $false ),
    inference(orientation,[status(thm)],[clause31]) ).

cnf(clause30,axiom,
    ssItem(skaf65(U)),
    input ).

fof(clause30_0,plain,
    ! [U] :
      ( ssItem(skaf65(U))
      | $false ),
    inference(orientation,[status(thm)],[clause30]) ).

cnf(clause29,axiom,
    ssList(skaf66(U)),
    input ).

fof(clause29_0,plain,
    ! [U] :
      ( ssList(skaf66(U))
      | $false ),
    inference(orientation,[status(thm)],[clause29]) ).

cnf(clause28,axiom,
    ssList(skaf67(U)),
    input ).

fof(clause28_0,plain,
    ! [U] :
      ( ssList(skaf67(U))
      | $false ),
    inference(orientation,[status(thm)],[clause28]) ).

cnf(clause27,axiom,
    ssList(skaf68(U)),
    input ).

fof(clause27_0,plain,
    ! [U] :
      ( ssList(skaf68(U))
      | $false ),
    inference(orientation,[status(thm)],[clause27]) ).

cnf(clause26,axiom,
    ssItem(skaf69(U)),
    input ).

fof(clause26_0,plain,
    ! [U] :
      ( ssItem(skaf69(U))
      | $false ),
    inference(orientation,[status(thm)],[clause26]) ).

cnf(clause25,axiom,
    ssItem(skaf70(U)),
    input ).

fof(clause25_0,plain,
    ! [U] :
      ( ssItem(skaf70(U))
      | $false ),
    inference(orientation,[status(thm)],[clause25]) ).

cnf(clause24,axiom,
    ssList(skaf71(U)),
    input ).

fof(clause24_0,plain,
    ! [U] :
      ( ssList(skaf71(U))
      | $false ),
    inference(orientation,[status(thm)],[clause24]) ).

cnf(clause23,axiom,
    ssList(skaf72(U)),
    input ).

fof(clause23_0,plain,
    ! [U] :
      ( ssList(skaf72(U))
      | $false ),
    inference(orientation,[status(thm)],[clause23]) ).

cnf(clause22,axiom,
    ssList(skaf73(U)),
    input ).

fof(clause22_0,plain,
    ! [U] :
      ( ssList(skaf73(U))
      | $false ),
    inference(orientation,[status(thm)],[clause22]) ).

cnf(clause21,axiom,
    ssItem(skaf74(U)),
    input ).

fof(clause21_0,plain,
    ! [U] :
      ( ssItem(skaf74(U))
      | $false ),
    inference(orientation,[status(thm)],[clause21]) ).

cnf(clause20,axiom,
    ssList(skaf75(U)),
    input ).

fof(clause20_0,plain,
    ! [U] :
      ( ssList(skaf75(U))
      | $false ),
    inference(orientation,[status(thm)],[clause20]) ).

cnf(clause19,axiom,
    ssList(skaf76(U)),
    input ).

fof(clause19_0,plain,
    ! [U] :
      ( ssList(skaf76(U))
      | $false ),
    inference(orientation,[status(thm)],[clause19]) ).

cnf(clause18,axiom,
    ssList(skaf77(U)),
    input ).

fof(clause18_0,plain,
    ! [U] :
      ( ssList(skaf77(U))
      | $false ),
    inference(orientation,[status(thm)],[clause18]) ).

cnf(clause17,axiom,
    ssItem(skaf78(U)),
    input ).

fof(clause17_0,plain,
    ! [U] :
      ( ssItem(skaf78(U))
      | $false ),
    inference(orientation,[status(thm)],[clause17]) ).

cnf(clause16,axiom,
    ssItem(skaf79(U)),
    input ).

fof(clause16_0,plain,
    ! [U] :
      ( ssItem(skaf79(U))
      | $false ),
    inference(orientation,[status(thm)],[clause16]) ).

cnf(clause15,axiom,
    ssList(skaf80(U)),
    input ).

fof(clause15_0,plain,
    ! [U] :
      ( ssList(skaf80(U))
      | $false ),
    inference(orientation,[status(thm)],[clause15]) ).

cnf(clause14,axiom,
    ssList(skaf81(U)),
    input ).

fof(clause14_0,plain,
    ! [U] :
      ( ssList(skaf81(U))
      | $false ),
    inference(orientation,[status(thm)],[clause14]) ).

cnf(clause13,axiom,
    ssList(skaf82(U)),
    input ).

fof(clause13_0,plain,
    ! [U] :
      ( ssList(skaf82(U))
      | $false ),
    inference(orientation,[status(thm)],[clause13]) ).

cnf(clause12,axiom,
    ssItem(skaf83(U)),
    input ).

fof(clause12_0,plain,
    ! [U] :
      ( ssItem(skaf83(U))
      | $false ),
    inference(orientation,[status(thm)],[clause12]) ).

cnf(clause11,axiom,
    ~ singletonP(nil),
    input ).

fof(clause11_0,plain,
    ( ~ singletonP(nil)
    | $false ),
    inference(orientation,[status(thm)],[clause11]) ).

cnf(clause10,axiom,
    ssItem(skac2),
    input ).

fof(clause10_0,plain,
    ( ssItem(skac2)
    | $false ),
    inference(orientation,[status(thm)],[clause10]) ).

cnf(clause9,axiom,
    ssItem(skac3),
    input ).

fof(clause9_0,plain,
    ( ssItem(skac3)
    | $false ),
    inference(orientation,[status(thm)],[clause9]) ).

cnf(clause8,axiom,
    ssList(nil),
    input ).

fof(clause8_0,plain,
    ( ssList(nil)
    | $false ),
    inference(orientation,[status(thm)],[clause8]) ).

cnf(clause7,axiom,
    cyclefreeP(nil),
    input ).

fof(clause7_0,plain,
    ( cyclefreeP(nil)
    | $false ),
    inference(orientation,[status(thm)],[clause7]) ).

cnf(clause6,axiom,
    totalorderP(nil),
    input ).

fof(clause6_0,plain,
    ( totalorderP(nil)
    | $false ),
    inference(orientation,[status(thm)],[clause6]) ).

cnf(clause5,axiom,
    strictorderP(nil),
    input ).

fof(clause5_0,plain,
    ( strictorderP(nil)
    | $false ),
    inference(orientation,[status(thm)],[clause5]) ).

cnf(clause4,axiom,
    totalorderedP(nil),
    input ).

fof(clause4_0,plain,
    ( totalorderedP(nil)
    | $false ),
    inference(orientation,[status(thm)],[clause4]) ).

cnf(clause3,axiom,
    strictorderedP(nil),
    input ).

fof(clause3_0,plain,
    ( strictorderedP(nil)
    | $false ),
    inference(orientation,[status(thm)],[clause3]) ).

cnf(clause2,axiom,
    duplicatefreeP(nil),
    input ).

fof(clause2_0,plain,
    ( duplicatefreeP(nil)
    | $false ),
    inference(orientation,[status(thm)],[clause2]) ).

cnf(clause1,axiom,
    equalelemsP(nil),
    input ).

fof(clause1_0,plain,
    ( equalelemsP(nil)
    | $false ),
    inference(orientation,[status(thm)],[clause1]) ).

fof(def_lhs_atom1,axiom,
    ( lhs_atom1
  <=> equalelemsP(nil) ),
    inference(definition,[],]) ).

fof(to_be_clausified_0,plain,
    ( lhs_atom1
    | $false ),
    inference(fold_definition,[status(thm)],[clause1_0,def_lhs_atom1]) ).

fof(def_lhs_atom2,axiom,
    ( lhs_atom2
  <=> duplicatefreeP(nil) ),
    inference(definition,[],]) ).

fof(to_be_clausified_1,plain,
    ( lhs_atom2
    | $false ),
    inference(fold_definition,[status(thm)],[clause2_0,def_lhs_atom2]) ).

fof(def_lhs_atom3,axiom,
    ( lhs_atom3
  <=> strictorderedP(nil) ),
    inference(definition,[],]) ).

fof(to_be_clausified_2,plain,
    ( lhs_atom3
    | $false ),
    inference(fold_definition,[status(thm)],[clause3_0,def_lhs_atom3]) ).

fof(def_lhs_atom4,axiom,
    ( lhs_atom4
  <=> totalorderedP(nil) ),
    inference(definition,[],]) ).

fof(to_be_clausified_3,plain,
    ( lhs_atom4
    | $false ),
    inference(fold_definition,[status(thm)],[clause4_0,def_lhs_atom4]) ).

fof(def_lhs_atom5,axiom,
    ( lhs_atom5
  <=> strictorderP(nil) ),
    inference(definition,[],]) ).

fof(to_be_clausified_4,plain,
    ( lhs_atom5
    | $false ),
    inference(fold_definition,[status(thm)],[clause5_0,def_lhs_atom5]) ).

fof(def_lhs_atom6,axiom,
    ( lhs_atom6
  <=> totalorderP(nil) ),
    inference(definition,[],]) ).

fof(to_be_clausified_5,plain,
    ( lhs_atom6
    | $false ),
    inference(fold_definition,[status(thm)],[clause6_0,def_lhs_atom6]) ).

fof(def_lhs_atom7,axiom,
    ( lhs_atom7
  <=> cyclefreeP(nil) ),
    inference(definition,[],]) ).

fof(to_be_clausified_6,plain,
    ( lhs_atom7
    | $false ),
    inference(fold_definition,[status(thm)],[clause7_0,def_lhs_atom7]) ).

fof(def_lhs_atom8,axiom,
    ( lhs_atom8
  <=> ssList(nil) ),
    inference(definition,[],]) ).

fof(to_be_clausified_7,plain,
    ( lhs_atom8
    | $false ),
    inference(fold_definition,[status(thm)],[clause8_0,def_lhs_atom8]) ).

fof(def_lhs_atom9,axiom,
    ( lhs_atom9
  <=> ssItem(skac3) ),
    inference(definition,[],]) ).

fof(to_be_clausified_8,plain,
    ( lhs_atom9
    | $false ),
    inference(fold_definition,[status(thm)],[clause9_0,def_lhs_atom9]) ).

fof(def_lhs_atom10,axiom,
    ( lhs_atom10
  <=> ssItem(skac2) ),
    inference(definition,[],]) ).

fof(to_be_clausified_9,plain,
    ( lhs_atom10
    | $false ),
    inference(fold_definition,[status(thm)],[clause10_0,def_lhs_atom10]) ).

fof(def_lhs_atom11,axiom,
    ( lhs_atom11
  <=> ~ singletonP(nil) ),
    inference(definition,[],]) ).

fof(to_be_clausified_10,plain,
    ( lhs_atom11
    | $false ),
    inference(fold_definition,[status(thm)],[clause11_0,def_lhs_atom11]) ).

fof(def_lhs_atom12,axiom,
    ! [U] :
      ( lhs_atom12(U)
    <=> ssItem(skaf83(U)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_11,plain,
    ! [U] :
      ( lhs_atom12(U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause12_0,def_lhs_atom12]) ).

fof(def_lhs_atom13,axiom,
    ! [U] :
      ( lhs_atom13(U)
    <=> ssList(skaf82(U)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_12,plain,
    ! [U] :
      ( lhs_atom13(U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause13_0,def_lhs_atom13]) ).

fof(def_lhs_atom14,axiom,
    ! [U] :
      ( lhs_atom14(U)
    <=> ssList(skaf81(U)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_13,plain,
    ! [U] :
      ( lhs_atom14(U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause14_0,def_lhs_atom14]) ).

fof(def_lhs_atom15,axiom,
    ! [U] :
      ( lhs_atom15(U)
    <=> ssList(skaf80(U)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_14,plain,
    ! [U] :
      ( lhs_atom15(U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause15_0,def_lhs_atom15]) ).

fof(def_lhs_atom16,axiom,
    ! [U] :
      ( lhs_atom16(U)
    <=> ssItem(skaf79(U)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_15,plain,
    ! [U] :
      ( lhs_atom16(U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause16_0,def_lhs_atom16]) ).

fof(def_lhs_atom17,axiom,
    ! [U] :
      ( lhs_atom17(U)
    <=> ssItem(skaf78(U)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_16,plain,
    ! [U] :
      ( lhs_atom17(U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause17_0,def_lhs_atom17]) ).

fof(def_lhs_atom18,axiom,
    ! [U] :
      ( lhs_atom18(U)
    <=> ssList(skaf77(U)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_17,plain,
    ! [U] :
      ( lhs_atom18(U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause18_0,def_lhs_atom18]) ).

fof(def_lhs_atom19,axiom,
    ! [U] :
      ( lhs_atom19(U)
    <=> ssList(skaf76(U)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_18,plain,
    ! [U] :
      ( lhs_atom19(U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause19_0,def_lhs_atom19]) ).

fof(def_lhs_atom20,axiom,
    ! [U] :
      ( lhs_atom20(U)
    <=> ssList(skaf75(U)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_19,plain,
    ! [U] :
      ( lhs_atom20(U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause20_0,def_lhs_atom20]) ).

fof(def_lhs_atom21,axiom,
    ! [U] :
      ( lhs_atom21(U)
    <=> ssItem(skaf74(U)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_20,plain,
    ! [U] :
      ( lhs_atom21(U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause21_0,def_lhs_atom21]) ).

fof(def_lhs_atom22,axiom,
    ! [U] :
      ( lhs_atom22(U)
    <=> ssList(skaf73(U)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_21,plain,
    ! [U] :
      ( lhs_atom22(U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause22_0,def_lhs_atom22]) ).

fof(def_lhs_atom23,axiom,
    ! [U] :
      ( lhs_atom23(U)
    <=> ssList(skaf72(U)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_22,plain,
    ! [U] :
      ( lhs_atom23(U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause23_0,def_lhs_atom23]) ).

fof(def_lhs_atom24,axiom,
    ! [U] :
      ( lhs_atom24(U)
    <=> ssList(skaf71(U)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_23,plain,
    ! [U] :
      ( lhs_atom24(U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause24_0,def_lhs_atom24]) ).

fof(def_lhs_atom25,axiom,
    ! [U] :
      ( lhs_atom25(U)
    <=> ssItem(skaf70(U)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_24,plain,
    ! [U] :
      ( lhs_atom25(U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause25_0,def_lhs_atom25]) ).

fof(def_lhs_atom26,axiom,
    ! [U] :
      ( lhs_atom26(U)
    <=> ssItem(skaf69(U)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_25,plain,
    ! [U] :
      ( lhs_atom26(U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause26_0,def_lhs_atom26]) ).

fof(def_lhs_atom27,axiom,
    ! [U] :
      ( lhs_atom27(U)
    <=> ssList(skaf68(U)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_26,plain,
    ! [U] :
      ( lhs_atom27(U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause27_0,def_lhs_atom27]) ).

fof(def_lhs_atom28,axiom,
    ! [U] :
      ( lhs_atom28(U)
    <=> ssList(skaf67(U)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_27,plain,
    ! [U] :
      ( lhs_atom28(U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause28_0,def_lhs_atom28]) ).

fof(def_lhs_atom29,axiom,
    ! [U] :
      ( lhs_atom29(U)
    <=> ssList(skaf66(U)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_28,plain,
    ! [U] :
      ( lhs_atom29(U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause29_0,def_lhs_atom29]) ).

fof(def_lhs_atom30,axiom,
    ! [U] :
      ( lhs_atom30(U)
    <=> ssItem(skaf65(U)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_29,plain,
    ! [U] :
      ( lhs_atom30(U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause30_0,def_lhs_atom30]) ).

fof(def_lhs_atom31,axiom,
    ! [U] :
      ( lhs_atom31(U)
    <=> ssItem(skaf64(U)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_30,plain,
    ! [U] :
      ( lhs_atom31(U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause31_0,def_lhs_atom31]) ).

fof(def_lhs_atom32,axiom,
    ! [U] :
      ( lhs_atom32(U)
    <=> ssList(skaf63(U)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_31,plain,
    ! [U] :
      ( lhs_atom32(U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause32_0,def_lhs_atom32]) ).

fof(def_lhs_atom33,axiom,
    ! [U] :
      ( lhs_atom33(U)
    <=> ssList(skaf62(U)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_32,plain,
    ! [U] :
      ( lhs_atom33(U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause33_0,def_lhs_atom33]) ).

fof(def_lhs_atom34,axiom,
    ! [U] :
      ( lhs_atom34(U)
    <=> ssList(skaf61(U)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_33,plain,
    ! [U] :
      ( lhs_atom34(U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause34_0,def_lhs_atom34]) ).

fof(def_lhs_atom35,axiom,
    ! [U] :
      ( lhs_atom35(U)
    <=> ssItem(skaf60(U)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_34,plain,
    ! [U] :
      ( lhs_atom35(U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause35_0,def_lhs_atom35]) ).

fof(def_lhs_atom36,axiom,
    ! [U] :
      ( lhs_atom36(U)
    <=> ssItem(skaf59(U)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_35,plain,
    ! [U] :
      ( lhs_atom36(U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause36_0,def_lhs_atom36]) ).

fof(def_lhs_atom37,axiom,
    ! [U] :
      ( lhs_atom37(U)
    <=> ssList(skaf58(U)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_36,plain,
    ! [U] :
      ( lhs_atom37(U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause37_0,def_lhs_atom37]) ).

fof(def_lhs_atom38,axiom,
    ! [U] :
      ( lhs_atom38(U)
    <=> ssList(skaf57(U)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_37,plain,
    ! [U] :
      ( lhs_atom38(U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause38_0,def_lhs_atom38]) ).

fof(def_lhs_atom39,axiom,
    ! [U] :
      ( lhs_atom39(U)
    <=> ssList(skaf56(U)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_38,plain,
    ! [U] :
      ( lhs_atom39(U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause39_0,def_lhs_atom39]) ).

fof(def_lhs_atom40,axiom,
    ! [U] :
      ( lhs_atom40(U)
    <=> ssItem(skaf55(U)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_39,plain,
    ! [U] :
      ( lhs_atom40(U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause40_0,def_lhs_atom40]) ).

fof(def_lhs_atom41,axiom,
    ! [U] :
      ( lhs_atom41(U)
    <=> ssItem(skaf54(U)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_40,plain,
    ! [U] :
      ( lhs_atom41(U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause41_0,def_lhs_atom41]) ).

fof(def_lhs_atom42,axiom,
    ! [U] :
      ( lhs_atom42(U)
    <=> ssList(skaf53(U)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_41,plain,
    ! [U] :
      ( lhs_atom42(U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause42_0,def_lhs_atom42]) ).

fof(def_lhs_atom43,axiom,
    ! [U] :
      ( lhs_atom43(U)
    <=> ssList(skaf52(U)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_42,plain,
    ! [U] :
      ( lhs_atom43(U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause43_0,def_lhs_atom43]) ).

fof(def_lhs_atom44,axiom,
    ! [U] :
      ( lhs_atom44(U)
    <=> ssList(skaf51(U)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_43,plain,
    ! [U] :
      ( lhs_atom44(U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause44_0,def_lhs_atom44]) ).

fof(def_lhs_atom45,axiom,
    ! [U] :
      ( lhs_atom45(U)
    <=> ssItem(skaf50(U)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_44,plain,
    ! [U] :
      ( lhs_atom45(U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause45_0,def_lhs_atom45]) ).

fof(def_lhs_atom46,axiom,
    ! [U] :
      ( lhs_atom46(U)
    <=> ssItem(skaf49(U)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_45,plain,
    ! [U] :
      ( lhs_atom46(U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause46_0,def_lhs_atom46]) ).

fof(def_lhs_atom47,axiom,
    ! [U] :
      ( lhs_atom47(U)
    <=> ssItem(skaf44(U)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_46,plain,
    ! [U] :
      ( lhs_atom47(U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause47_0,def_lhs_atom47]) ).

fof(def_lhs_atom48,axiom,
    ! [V,U] :
      ( lhs_atom48(V,U)
    <=> ssList(skaf48(U,V)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_47,plain,
    ! [U,V] :
      ( lhs_atom48(V,U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause48_0,def_lhs_atom48]) ).

fof(def_lhs_atom49,axiom,
    ! [V,U] :
      ( lhs_atom49(V,U)
    <=> ssList(skaf47(U,V)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_48,plain,
    ! [U,V] :
      ( lhs_atom49(V,U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause49_0,def_lhs_atom49]) ).

fof(def_lhs_atom50,axiom,
    ! [V,U] :
      ( lhs_atom50(V,U)
    <=> ssList(skaf46(U,V)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_49,plain,
    ! [U,V] :
      ( lhs_atom50(V,U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause50_0,def_lhs_atom50]) ).

fof(def_lhs_atom51,axiom,
    ! [V,U] :
      ( lhs_atom51(V,U)
    <=> ssList(skaf45(U,V)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_50,plain,
    ! [U,V] :
      ( lhs_atom51(V,U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause51_0,def_lhs_atom51]) ).

fof(def_lhs_atom52,axiom,
    ! [V,U] :
      ( lhs_atom52(V,U)
    <=> ssList(skaf43(U,V)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_51,plain,
    ! [U,V] :
      ( lhs_atom52(V,U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause52_0,def_lhs_atom52]) ).

fof(def_lhs_atom53,axiom,
    ! [V,U] :
      ( lhs_atom53(V,U)
    <=> ssList(skaf42(U,V)) ),
    inference(definition,[],]) ).

fof(to_be_clausified_52,plain,
    ! [U,V] :
      ( lhs_atom53(V,U)
      | $false ),
    inference(fold_definition,[status(thm)],[clause53_0,def_lhs_atom53]) ).

fof(def_lhs_atom54,axiom,
    ( lhs_atom54
  <=> skac3 != skac2 ),
    inference(definition,[],]) ).

fof(to_be_clausified_53,plain,
    ( lhs_atom54
    | $false ),
    inference(fold_definition,[status(thm)],[clause54_0,def_lhs_atom54]) ).

% Start CNF derivation
fof(c_0_0,axiom,
    ! [X2,X1] :
      ( lhs_atom53(X2,X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_52) ).

fof(c_0_1,axiom,
    ! [X2,X1] :
      ( lhs_atom52(X2,X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_51) ).

fof(c_0_2,axiom,
    ! [X2,X1] :
      ( lhs_atom51(X2,X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_50) ).

fof(c_0_3,axiom,
    ! [X2,X1] :
      ( lhs_atom50(X2,X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_49) ).

fof(c_0_4,axiom,
    ! [X2,X1] :
      ( lhs_atom49(X2,X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_48) ).

fof(c_0_5,axiom,
    ! [X2,X1] :
      ( lhs_atom48(X2,X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_47) ).

fof(c_0_6,axiom,
    ! [X1] :
      ( lhs_atom47(X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_46) ).

fof(c_0_7,axiom,
    ! [X1] :
      ( lhs_atom46(X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_45) ).

fof(c_0_8,axiom,
    ! [X1] :
      ( lhs_atom45(X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_44) ).

fof(c_0_9,axiom,
    ! [X1] :
      ( lhs_atom44(X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_43) ).

fof(c_0_10,axiom,
    ! [X1] :
      ( lhs_atom43(X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_42) ).

fof(c_0_11,axiom,
    ! [X1] :
      ( lhs_atom42(X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_41) ).

fof(c_0_12,axiom,
    ! [X1] :
      ( lhs_atom41(X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_40) ).

fof(c_0_13,axiom,
    ! [X1] :
      ( lhs_atom40(X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_39) ).

fof(c_0_14,axiom,
    ! [X1] :
      ( lhs_atom39(X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_38) ).

fof(c_0_15,axiom,
    ! [X1] :
      ( lhs_atom38(X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_37) ).

fof(c_0_16,axiom,
    ! [X1] :
      ( lhs_atom37(X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_36) ).

fof(c_0_17,axiom,
    ! [X1] :
      ( lhs_atom36(X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_35) ).

fof(c_0_18,axiom,
    ! [X1] :
      ( lhs_atom35(X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_34) ).

fof(c_0_19,axiom,
    ! [X1] :
      ( lhs_atom34(X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_33) ).

fof(c_0_20,axiom,
    ! [X1] :
      ( lhs_atom33(X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_32) ).

fof(c_0_21,axiom,
    ! [X1] :
      ( lhs_atom32(X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_31) ).

fof(c_0_22,axiom,
    ! [X1] :
      ( lhs_atom31(X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_30) ).

fof(c_0_23,axiom,
    ! [X1] :
      ( lhs_atom30(X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_29) ).

fof(c_0_24,axiom,
    ! [X1] :
      ( lhs_atom29(X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_28) ).

fof(c_0_25,axiom,
    ! [X1] :
      ( lhs_atom28(X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_27) ).

fof(c_0_26,axiom,
    ! [X1] :
      ( lhs_atom27(X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_26) ).

fof(c_0_27,axiom,
    ! [X1] :
      ( lhs_atom26(X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_25) ).

fof(c_0_28,axiom,
    ! [X1] :
      ( lhs_atom25(X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_24) ).

fof(c_0_29,axiom,
    ! [X1] :
      ( lhs_atom24(X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_23) ).

fof(c_0_30,axiom,
    ! [X1] :
      ( lhs_atom23(X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_22) ).

fof(c_0_31,axiom,
    ! [X1] :
      ( lhs_atom22(X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_21) ).

fof(c_0_32,axiom,
    ! [X1] :
      ( lhs_atom21(X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_20) ).

fof(c_0_33,axiom,
    ! [X1] :
      ( lhs_atom20(X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_19) ).

fof(c_0_34,axiom,
    ! [X1] :
      ( lhs_atom19(X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_18) ).

fof(c_0_35,axiom,
    ! [X1] :
      ( lhs_atom18(X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_17) ).

fof(c_0_36,axiom,
    ! [X1] :
      ( lhs_atom17(X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_16) ).

fof(c_0_37,axiom,
    ! [X1] :
      ( lhs_atom16(X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_15) ).

fof(c_0_38,axiom,
    ! [X1] :
      ( lhs_atom15(X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_14) ).

fof(c_0_39,axiom,
    ! [X1] :
      ( lhs_atom14(X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_13) ).

fof(c_0_40,axiom,
    ! [X1] :
      ( lhs_atom13(X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_12) ).

fof(c_0_41,axiom,
    ! [X1] :
      ( lhs_atom12(X1)
      | ~ $true ),
    file('<stdin>',to_be_clausified_11) ).

fof(c_0_42,axiom,
    ( lhs_atom54
    | ~ $true ),
    file('<stdin>',to_be_clausified_53) ).

fof(c_0_43,axiom,
    ( lhs_atom11
    | ~ $true ),
    file('<stdin>',to_be_clausified_10) ).

fof(c_0_44,axiom,
    ( lhs_atom10
    | ~ $true ),
    file('<stdin>',to_be_clausified_9) ).

fof(c_0_45,axiom,
    ( lhs_atom9
    | ~ $true ),
    file('<stdin>',to_be_clausified_8) ).

fof(c_0_46,axiom,
    ( lhs_atom8
    | ~ $true ),
    file('<stdin>',to_be_clausified_7) ).

fof(c_0_47,axiom,
    ( lhs_atom7
    | ~ $true ),
    file('<stdin>',to_be_clausified_6) ).

fof(c_0_48,axiom,
    ( lhs_atom6
    | ~ $true ),
    file('<stdin>',to_be_clausified_5) ).

fof(c_0_49,axiom,
    ( lhs_atom5
    | ~ $true ),
    file('<stdin>',to_be_clausified_4) ).

fof(c_0_50,axiom,
    ( lhs_atom4
    | ~ $true ),
    file('<stdin>',to_be_clausified_3) ).

fof(c_0_51,axiom,
    ( lhs_atom3
    | ~ $true ),
    file('<stdin>',to_be_clausified_2) ).

fof(c_0_52,axiom,
    ( lhs_atom2
    | ~ $true ),
    file('<stdin>',to_be_clausified_1) ).

fof(c_0_53,axiom,
    ( lhs_atom1
    | ~ $true ),
    file('<stdin>',to_be_clausified_0) ).

fof(c_0_54,plain,
    ! [X2,X1] : lhs_atom53(X2,X1),
    inference(fof_simplification,[status(thm)],[c_0_0]) ).

fof(c_0_55,plain,
    ! [X2,X1] : lhs_atom52(X2,X1),
    inference(fof_simplification,[status(thm)],[c_0_1]) ).

fof(c_0_56,plain,
    ! [X2,X1] : lhs_atom51(X2,X1),
    inference(fof_simplification,[status(thm)],[c_0_2]) ).

fof(c_0_57,plain,
    ! [X2,X1] : lhs_atom50(X2,X1),
    inference(fof_simplification,[status(thm)],[c_0_3]) ).

fof(c_0_58,plain,
    ! [X2,X1] : lhs_atom49(X2,X1),
    inference(fof_simplification,[status(thm)],[c_0_4]) ).

fof(c_0_59,plain,
    ! [X2,X1] : lhs_atom48(X2,X1),
    inference(fof_simplification,[status(thm)],[c_0_5]) ).

fof(c_0_60,plain,
    ! [X1] : lhs_atom47(X1),
    inference(fof_simplification,[status(thm)],[c_0_6]) ).

fof(c_0_61,plain,
    ! [X1] : lhs_atom46(X1),
    inference(fof_simplification,[status(thm)],[c_0_7]) ).

fof(c_0_62,plain,
    ! [X1] : lhs_atom45(X1),
    inference(fof_simplification,[status(thm)],[c_0_8]) ).

fof(c_0_63,plain,
    ! [X1] : lhs_atom44(X1),
    inference(fof_simplification,[status(thm)],[c_0_9]) ).

fof(c_0_64,plain,
    ! [X1] : lhs_atom43(X1),
    inference(fof_simplification,[status(thm)],[c_0_10]) ).

fof(c_0_65,plain,
    ! [X1] : lhs_atom42(X1),
    inference(fof_simplification,[status(thm)],[c_0_11]) ).

fof(c_0_66,plain,
    ! [X1] : lhs_atom41(X1),
    inference(fof_simplification,[status(thm)],[c_0_12]) ).

fof(c_0_67,plain,
    ! [X1] : lhs_atom40(X1),
    inference(fof_simplification,[status(thm)],[c_0_13]) ).

fof(c_0_68,plain,
    ! [X1] : lhs_atom39(X1),
    inference(fof_simplification,[status(thm)],[c_0_14]) ).

fof(c_0_69,plain,
    ! [X1] : lhs_atom38(X1),
    inference(fof_simplification,[status(thm)],[c_0_15]) ).

fof(c_0_70,plain,
    ! [X1] : lhs_atom37(X1),
    inference(fof_simplification,[status(thm)],[c_0_16]) ).

fof(c_0_71,plain,
    ! [X1] : lhs_atom36(X1),
    inference(fof_simplification,[status(thm)],[c_0_17]) ).

fof(c_0_72,plain,
    ! [X1] : lhs_atom35(X1),
    inference(fof_simplification,[status(thm)],[c_0_18]) ).

fof(c_0_73,plain,
    ! [X1] : lhs_atom34(X1),
    inference(fof_simplification,[status(thm)],[c_0_19]) ).

fof(c_0_74,plain,
    ! [X1] : lhs_atom33(X1),
    inference(fof_simplification,[status(thm)],[c_0_20]) ).

fof(c_0_75,plain,
    ! [X1] : lhs_atom32(X1),
    inference(fof_simplification,[status(thm)],[c_0_21]) ).

fof(c_0_76,plain,
    ! [X1] : lhs_atom31(X1),
    inference(fof_simplification,[status(thm)],[c_0_22]) ).

fof(c_0_77,plain,
    ! [X1] : lhs_atom30(X1),
    inference(fof_simplification,[status(thm)],[c_0_23]) ).

fof(c_0_78,plain,
    ! [X1] : lhs_atom29(X1),
    inference(fof_simplification,[status(thm)],[c_0_24]) ).

fof(c_0_79,plain,
    ! [X1] : lhs_atom28(X1),
    inference(fof_simplification,[status(thm)],[c_0_25]) ).

fof(c_0_80,plain,
    ! [X1] : lhs_atom27(X1),
    inference(fof_simplification,[status(thm)],[c_0_26]) ).

fof(c_0_81,plain,
    ! [X1] : lhs_atom26(X1),
    inference(fof_simplification,[status(thm)],[c_0_27]) ).

fof(c_0_82,plain,
    ! [X1] : lhs_atom25(X1),
    inference(fof_simplification,[status(thm)],[c_0_28]) ).

fof(c_0_83,plain,
    ! [X1] : lhs_atom24(X1),
    inference(fof_simplification,[status(thm)],[c_0_29]) ).

fof(c_0_84,plain,
    ! [X1] : lhs_atom23(X1),
    inference(fof_simplification,[status(thm)],[c_0_30]) ).

fof(c_0_85,plain,
    ! [X1] : lhs_atom22(X1),
    inference(fof_simplification,[status(thm)],[c_0_31]) ).

fof(c_0_86,plain,
    ! [X1] : lhs_atom21(X1),
    inference(fof_simplification,[status(thm)],[c_0_32]) ).

fof(c_0_87,plain,
    ! [X1] : lhs_atom20(X1),
    inference(fof_simplification,[status(thm)],[c_0_33]) ).

fof(c_0_88,plain,
    ! [X1] : lhs_atom19(X1),
    inference(fof_simplification,[status(thm)],[c_0_34]) ).

fof(c_0_89,plain,
    ! [X1] : lhs_atom18(X1),
    inference(fof_simplification,[status(thm)],[c_0_35]) ).

fof(c_0_90,plain,
    ! [X1] : lhs_atom17(X1),
    inference(fof_simplification,[status(thm)],[c_0_36]) ).

fof(c_0_91,plain,
    ! [X1] : lhs_atom16(X1),
    inference(fof_simplification,[status(thm)],[c_0_37]) ).

fof(c_0_92,plain,
    ! [X1] : lhs_atom15(X1),
    inference(fof_simplification,[status(thm)],[c_0_38]) ).

fof(c_0_93,plain,
    ! [X1] : lhs_atom14(X1),
    inference(fof_simplification,[status(thm)],[c_0_39]) ).

fof(c_0_94,plain,
    ! [X1] : lhs_atom13(X1),
    inference(fof_simplification,[status(thm)],[c_0_40]) ).

fof(c_0_95,plain,
    ! [X1] : lhs_atom12(X1),
    inference(fof_simplification,[status(thm)],[c_0_41]) ).

fof(c_0_96,plain,
    lhs_atom54,
    inference(fof_simplification,[status(thm)],[c_0_42]) ).

fof(c_0_97,plain,
    lhs_atom11,
    inference(fof_simplification,[status(thm)],[c_0_43]) ).

fof(c_0_98,plain,
    lhs_atom10,
    inference(fof_simplification,[status(thm)],[c_0_44]) ).

fof(c_0_99,plain,
    lhs_atom9,
    inference(fof_simplification,[status(thm)],[c_0_45]) ).

fof(c_0_100,plain,
    lhs_atom8,
    inference(fof_simplification,[status(thm)],[c_0_46]) ).

fof(c_0_101,plain,
    lhs_atom7,
    inference(fof_simplification,[status(thm)],[c_0_47]) ).

fof(c_0_102,plain,
    lhs_atom6,
    inference(fof_simplification,[status(thm)],[c_0_48]) ).

fof(c_0_103,plain,
    lhs_atom5,
    inference(fof_simplification,[status(thm)],[c_0_49]) ).

fof(c_0_104,plain,
    lhs_atom4,
    inference(fof_simplification,[status(thm)],[c_0_50]) ).

fof(c_0_105,plain,
    lhs_atom3,
    inference(fof_simplification,[status(thm)],[c_0_51]) ).

fof(c_0_106,plain,
    lhs_atom2,
    inference(fof_simplification,[status(thm)],[c_0_52]) ).

fof(c_0_107,plain,
    lhs_atom1,
    inference(fof_simplification,[status(thm)],[c_0_53]) ).

fof(c_0_108,plain,
    ! [X3,X4] : lhs_atom53(X3,X4),
    inference(variable_rename,[status(thm)],[c_0_54]) ).

fof(c_0_109,plain,
    ! [X3,X4] : lhs_atom52(X3,X4),
    inference(variable_rename,[status(thm)],[c_0_55]) ).

fof(c_0_110,plain,
    ! [X3,X4] : lhs_atom51(X3,X4),
    inference(variable_rename,[status(thm)],[c_0_56]) ).

fof(c_0_111,plain,
    ! [X3,X4] : lhs_atom50(X3,X4),
    inference(variable_rename,[status(thm)],[c_0_57]) ).

fof(c_0_112,plain,
    ! [X3,X4] : lhs_atom49(X3,X4),
    inference(variable_rename,[status(thm)],[c_0_58]) ).

fof(c_0_113,plain,
    ! [X3,X4] : lhs_atom48(X3,X4),
    inference(variable_rename,[status(thm)],[c_0_59]) ).

fof(c_0_114,plain,
    ! [X2] : lhs_atom47(X2),
    inference(variable_rename,[status(thm)],[c_0_60]) ).

fof(c_0_115,plain,
    ! [X2] : lhs_atom46(X2),
    inference(variable_rename,[status(thm)],[c_0_61]) ).

fof(c_0_116,plain,
    ! [X2] : lhs_atom45(X2),
    inference(variable_rename,[status(thm)],[c_0_62]) ).

fof(c_0_117,plain,
    ! [X2] : lhs_atom44(X2),
    inference(variable_rename,[status(thm)],[c_0_63]) ).

fof(c_0_118,plain,
    ! [X2] : lhs_atom43(X2),
    inference(variable_rename,[status(thm)],[c_0_64]) ).

fof(c_0_119,plain,
    ! [X2] : lhs_atom42(X2),
    inference(variable_rename,[status(thm)],[c_0_65]) ).

fof(c_0_120,plain,
    ! [X2] : lhs_atom41(X2),
    inference(variable_rename,[status(thm)],[c_0_66]) ).

fof(c_0_121,plain,
    ! [X2] : lhs_atom40(X2),
    inference(variable_rename,[status(thm)],[c_0_67]) ).

fof(c_0_122,plain,
    ! [X2] : lhs_atom39(X2),
    inference(variable_rename,[status(thm)],[c_0_68]) ).

fof(c_0_123,plain,
    ! [X2] : lhs_atom38(X2),
    inference(variable_rename,[status(thm)],[c_0_69]) ).

fof(c_0_124,plain,
    ! [X2] : lhs_atom37(X2),
    inference(variable_rename,[status(thm)],[c_0_70]) ).

fof(c_0_125,plain,
    ! [X2] : lhs_atom36(X2),
    inference(variable_rename,[status(thm)],[c_0_71]) ).

fof(c_0_126,plain,
    ! [X2] : lhs_atom35(X2),
    inference(variable_rename,[status(thm)],[c_0_72]) ).

fof(c_0_127,plain,
    ! [X2] : lhs_atom34(X2),
    inference(variable_rename,[status(thm)],[c_0_73]) ).

fof(c_0_128,plain,
    ! [X2] : lhs_atom33(X2),
    inference(variable_rename,[status(thm)],[c_0_74]) ).

fof(c_0_129,plain,
    ! [X2] : lhs_atom32(X2),
    inference(variable_rename,[status(thm)],[c_0_75]) ).

fof(c_0_130,plain,
    ! [X2] : lhs_atom31(X2),
    inference(variable_rename,[status(thm)],[c_0_76]) ).

fof(c_0_131,plain,
    ! [X2] : lhs_atom30(X2),
    inference(variable_rename,[status(thm)],[c_0_77]) ).

fof(c_0_132,plain,
    ! [X2] : lhs_atom29(X2),
    inference(variable_rename,[status(thm)],[c_0_78]) ).

fof(c_0_133,plain,
    ! [X2] : lhs_atom28(X2),
    inference(variable_rename,[status(thm)],[c_0_79]) ).

fof(c_0_134,plain,
    ! [X2] : lhs_atom27(X2),
    inference(variable_rename,[status(thm)],[c_0_80]) ).

fof(c_0_135,plain,
    ! [X2] : lhs_atom26(X2),
    inference(variable_rename,[status(thm)],[c_0_81]) ).

fof(c_0_136,plain,
    ! [X2] : lhs_atom25(X2),
    inference(variable_rename,[status(thm)],[c_0_82]) ).

fof(c_0_137,plain,
    ! [X2] : lhs_atom24(X2),
    inference(variable_rename,[status(thm)],[c_0_83]) ).

fof(c_0_138,plain,
    ! [X2] : lhs_atom23(X2),
    inference(variable_rename,[status(thm)],[c_0_84]) ).

fof(c_0_139,plain,
    ! [X2] : lhs_atom22(X2),
    inference(variable_rename,[status(thm)],[c_0_85]) ).

fof(c_0_140,plain,
    ! [X2] : lhs_atom21(X2),
    inference(variable_rename,[status(thm)],[c_0_86]) ).

fof(c_0_141,plain,
    ! [X2] : lhs_atom20(X2),
    inference(variable_rename,[status(thm)],[c_0_87]) ).

fof(c_0_142,plain,
    ! [X2] : lhs_atom19(X2),
    inference(variable_rename,[status(thm)],[c_0_88]) ).

fof(c_0_143,plain,
    ! [X2] : lhs_atom18(X2),
    inference(variable_rename,[status(thm)],[c_0_89]) ).

fof(c_0_144,plain,
    ! [X2] : lhs_atom17(X2),
    inference(variable_rename,[status(thm)],[c_0_90]) ).

fof(c_0_145,plain,
    ! [X2] : lhs_atom16(X2),
    inference(variable_rename,[status(thm)],[c_0_91]) ).

fof(c_0_146,plain,
    ! [X2] : lhs_atom15(X2),
    inference(variable_rename,[status(thm)],[c_0_92]) ).

fof(c_0_147,plain,
    ! [X2] : lhs_atom14(X2),
    inference(variable_rename,[status(thm)],[c_0_93]) ).

fof(c_0_148,plain,
    ! [X2] : lhs_atom13(X2),
    inference(variable_rename,[status(thm)],[c_0_94]) ).

fof(c_0_149,plain,
    ! [X2] : lhs_atom12(X2),
    inference(variable_rename,[status(thm)],[c_0_95]) ).

fof(c_0_150,plain,
    lhs_atom54,
    c_0_96 ).

fof(c_0_151,plain,
    lhs_atom11,
    c_0_97 ).

fof(c_0_152,plain,
    lhs_atom10,
    c_0_98 ).

fof(c_0_153,plain,
    lhs_atom9,
    c_0_99 ).

fof(c_0_154,plain,
    lhs_atom8,
    c_0_100 ).

fof(c_0_155,plain,
    lhs_atom7,
    c_0_101 ).

fof(c_0_156,plain,
    lhs_atom6,
    c_0_102 ).

fof(c_0_157,plain,
    lhs_atom5,
    c_0_103 ).

fof(c_0_158,plain,
    lhs_atom4,
    c_0_104 ).

fof(c_0_159,plain,
    lhs_atom3,
    c_0_105 ).

fof(c_0_160,plain,
    lhs_atom2,
    c_0_106 ).

fof(c_0_161,plain,
    lhs_atom1,
    c_0_107 ).

cnf(c_0_162,plain,
    lhs_atom53(X1,X2),
    inference(split_conjunct,[status(thm)],[c_0_108]) ).

cnf(c_0_163,plain,
    lhs_atom52(X1,X2),
    inference(split_conjunct,[status(thm)],[c_0_109]) ).

cnf(c_0_164,plain,
    lhs_atom51(X1,X2),
    inference(split_conjunct,[status(thm)],[c_0_110]) ).

cnf(c_0_165,plain,
    lhs_atom50(X1,X2),
    inference(split_conjunct,[status(thm)],[c_0_111]) ).

cnf(c_0_166,plain,
    lhs_atom49(X1,X2),
    inference(split_conjunct,[status(thm)],[c_0_112]) ).

cnf(c_0_167,plain,
    lhs_atom48(X1,X2),
    inference(split_conjunct,[status(thm)],[c_0_113]) ).

cnf(c_0_168,plain,
    lhs_atom47(X1),
    inference(split_conjunct,[status(thm)],[c_0_114]) ).

cnf(c_0_169,plain,
    lhs_atom46(X1),
    inference(split_conjunct,[status(thm)],[c_0_115]) ).

cnf(c_0_170,plain,
    lhs_atom45(X1),
    inference(split_conjunct,[status(thm)],[c_0_116]) ).

cnf(c_0_171,plain,
    lhs_atom44(X1),
    inference(split_conjunct,[status(thm)],[c_0_117]) ).

cnf(c_0_172,plain,
    lhs_atom43(X1),
    inference(split_conjunct,[status(thm)],[c_0_118]) ).

cnf(c_0_173,plain,
    lhs_atom42(X1),
    inference(split_conjunct,[status(thm)],[c_0_119]) ).

cnf(c_0_174,plain,
    lhs_atom41(X1),
    inference(split_conjunct,[status(thm)],[c_0_120]) ).

cnf(c_0_175,plain,
    lhs_atom40(X1),
    inference(split_conjunct,[status(thm)],[c_0_121]) ).

cnf(c_0_176,plain,
    lhs_atom39(X1),
    inference(split_conjunct,[status(thm)],[c_0_122]) ).

cnf(c_0_177,plain,
    lhs_atom38(X1),
    inference(split_conjunct,[status(thm)],[c_0_123]) ).

cnf(c_0_178,plain,
    lhs_atom37(X1),
    inference(split_conjunct,[status(thm)],[c_0_124]) ).

cnf(c_0_179,plain,
    lhs_atom36(X1),
    inference(split_conjunct,[status(thm)],[c_0_125]) ).

cnf(c_0_180,plain,
    lhs_atom35(X1),
    inference(split_conjunct,[status(thm)],[c_0_126]) ).

cnf(c_0_181,plain,
    lhs_atom34(X1),
    inference(split_conjunct,[status(thm)],[c_0_127]) ).

cnf(c_0_182,plain,
    lhs_atom33(X1),
    inference(split_conjunct,[status(thm)],[c_0_128]) ).

cnf(c_0_183,plain,
    lhs_atom32(X1),
    inference(split_conjunct,[status(thm)],[c_0_129]) ).

cnf(c_0_184,plain,
    lhs_atom31(X1),
    inference(split_conjunct,[status(thm)],[c_0_130]) ).

cnf(c_0_185,plain,
    lhs_atom30(X1),
    inference(split_conjunct,[status(thm)],[c_0_131]) ).

cnf(c_0_186,plain,
    lhs_atom29(X1),
    inference(split_conjunct,[status(thm)],[c_0_132]) ).

cnf(c_0_187,plain,
    lhs_atom28(X1),
    inference(split_conjunct,[status(thm)],[c_0_133]) ).

cnf(c_0_188,plain,
    lhs_atom27(X1),
    inference(split_conjunct,[status(thm)],[c_0_134]) ).

cnf(c_0_189,plain,
    lhs_atom26(X1),
    inference(split_conjunct,[status(thm)],[c_0_135]) ).

cnf(c_0_190,plain,
    lhs_atom25(X1),
    inference(split_conjunct,[status(thm)],[c_0_136]) ).

cnf(c_0_191,plain,
    lhs_atom24(X1),
    inference(split_conjunct,[status(thm)],[c_0_137]) ).

cnf(c_0_192,plain,
    lhs_atom23(X1),
    inference(split_conjunct,[status(thm)],[c_0_138]) ).

cnf(c_0_193,plain,
    lhs_atom22(X1),
    inference(split_conjunct,[status(thm)],[c_0_139]) ).

cnf(c_0_194,plain,
    lhs_atom21(X1),
    inference(split_conjunct,[status(thm)],[c_0_140]) ).

cnf(c_0_195,plain,
    lhs_atom20(X1),
    inference(split_conjunct,[status(thm)],[c_0_141]) ).

cnf(c_0_196,plain,
    lhs_atom19(X1),
    inference(split_conjunct,[status(thm)],[c_0_142]) ).

cnf(c_0_197,plain,
    lhs_atom18(X1),
    inference(split_conjunct,[status(thm)],[c_0_143]) ).

cnf(c_0_198,plain,
    lhs_atom17(X1),
    inference(split_conjunct,[status(thm)],[c_0_144]) ).

cnf(c_0_199,plain,
    lhs_atom16(X1),
    inference(split_conjunct,[status(thm)],[c_0_145]) ).

cnf(c_0_200,plain,
    lhs_atom15(X1),
    inference(split_conjunct,[status(thm)],[c_0_146]) ).

cnf(c_0_201,plain,
    lhs_atom14(X1),
    inference(split_conjunct,[status(thm)],[c_0_147]) ).

cnf(c_0_202,plain,
    lhs_atom13(X1),
    inference(split_conjunct,[status(thm)],[c_0_148]) ).

cnf(c_0_203,plain,
    lhs_atom12(X1),
    inference(split_conjunct,[status(thm)],[c_0_149]) ).

cnf(c_0_204,plain,
    lhs_atom54,
    inference(split_conjunct,[status(thm)],[c_0_150]) ).

cnf(c_0_205,plain,
    lhs_atom11,
    inference(split_conjunct,[status(thm)],[c_0_151]) ).

cnf(c_0_206,plain,
    lhs_atom10,
    inference(split_conjunct,[status(thm)],[c_0_152]) ).

cnf(c_0_207,plain,
    lhs_atom9,
    inference(split_conjunct,[status(thm)],[c_0_153]) ).

cnf(c_0_208,plain,
    lhs_atom8,
    inference(split_conjunct,[status(thm)],[c_0_154]) ).

cnf(c_0_209,plain,
    lhs_atom7,
    inference(split_conjunct,[status(thm)],[c_0_155]) ).

cnf(c_0_210,plain,
    lhs_atom6,
    inference(split_conjunct,[status(thm)],[c_0_156]) ).

cnf(c_0_211,plain,
    lhs_atom5,
    inference(split_conjunct,[status(thm)],[c_0_157]) ).

cnf(c_0_212,plain,
    lhs_atom4,
    inference(split_conjunct,[status(thm)],[c_0_158]) ).

cnf(c_0_213,plain,
    lhs_atom3,
    inference(split_conjunct,[status(thm)],[c_0_159]) ).

cnf(c_0_214,plain,
    lhs_atom2,
    inference(split_conjunct,[status(thm)],[c_0_160]) ).

cnf(c_0_215,plain,
    lhs_atom1,
    inference(split_conjunct,[status(thm)],[c_0_161]) ).

cnf(c_0_216,plain,
    lhs_atom53(X1,X2),
    c_0_162,
    [final] ).

cnf(c_0_217,plain,
    lhs_atom52(X1,X2),
    c_0_163,
    [final] ).

cnf(c_0_218,plain,
    lhs_atom51(X1,X2),
    c_0_164,
    [final] ).

cnf(c_0_219,plain,
    lhs_atom50(X1,X2),
    c_0_165,
    [final] ).

cnf(c_0_220,plain,
    lhs_atom49(X1,X2),
    c_0_166,
    [final] ).

cnf(c_0_221,plain,
    lhs_atom48(X1,X2),
    c_0_167,
    [final] ).

cnf(c_0_222,plain,
    lhs_atom47(X1),
    c_0_168,
    [final] ).

cnf(c_0_223,plain,
    lhs_atom46(X1),
    c_0_169,
    [final] ).

cnf(c_0_224,plain,
    lhs_atom45(X1),
    c_0_170,
    [final] ).

cnf(c_0_225,plain,
    lhs_atom44(X1),
    c_0_171,
    [final] ).

cnf(c_0_226,plain,
    lhs_atom43(X1),
    c_0_172,
    [final] ).

cnf(c_0_227,plain,
    lhs_atom42(X1),
    c_0_173,
    [final] ).

cnf(c_0_228,plain,
    lhs_atom41(X1),
    c_0_174,
    [final] ).

cnf(c_0_229,plain,
    lhs_atom40(X1),
    c_0_175,
    [final] ).

cnf(c_0_230,plain,
    lhs_atom39(X1),
    c_0_176,
    [final] ).

cnf(c_0_231,plain,
    lhs_atom38(X1),
    c_0_177,
    [final] ).

cnf(c_0_232,plain,
    lhs_atom37(X1),
    c_0_178,
    [final] ).

cnf(c_0_233,plain,
    lhs_atom36(X1),
    c_0_179,
    [final] ).

cnf(c_0_234,plain,
    lhs_atom35(X1),
    c_0_180,
    [final] ).

cnf(c_0_235,plain,
    lhs_atom34(X1),
    c_0_181,
    [final] ).

cnf(c_0_236,plain,
    lhs_atom33(X1),
    c_0_182,
    [final] ).

cnf(c_0_237,plain,
    lhs_atom32(X1),
    c_0_183,
    [final] ).

cnf(c_0_238,plain,
    lhs_atom31(X1),
    c_0_184,
    [final] ).

cnf(c_0_239,plain,
    lhs_atom30(X1),
    c_0_185,
    [final] ).

cnf(c_0_240,plain,
    lhs_atom29(X1),
    c_0_186,
    [final] ).

cnf(c_0_241,plain,
    lhs_atom28(X1),
    c_0_187,
    [final] ).

cnf(c_0_242,plain,
    lhs_atom27(X1),
    c_0_188,
    [final] ).

cnf(c_0_243,plain,
    lhs_atom26(X1),
    c_0_189,
    [final] ).

cnf(c_0_244,plain,
    lhs_atom25(X1),
    c_0_190,
    [final] ).

cnf(c_0_245,plain,
    lhs_atom24(X1),
    c_0_191,
    [final] ).

cnf(c_0_246,plain,
    lhs_atom23(X1),
    c_0_192,
    [final] ).

cnf(c_0_247,plain,
    lhs_atom22(X1),
    c_0_193,
    [final] ).

cnf(c_0_248,plain,
    lhs_atom21(X1),
    c_0_194,
    [final] ).

cnf(c_0_249,plain,
    lhs_atom20(X1),
    c_0_195,
    [final] ).

cnf(c_0_250,plain,
    lhs_atom19(X1),
    c_0_196,
    [final] ).

cnf(c_0_251,plain,
    lhs_atom18(X1),
    c_0_197,
    [final] ).

cnf(c_0_252,plain,
    lhs_atom17(X1),
    c_0_198,
    [final] ).

cnf(c_0_253,plain,
    lhs_atom16(X1),
    c_0_199,
    [final] ).

cnf(c_0_254,plain,
    lhs_atom15(X1),
    c_0_200,
    [final] ).

cnf(c_0_255,plain,
    lhs_atom14(X1),
    c_0_201,
    [final] ).

cnf(c_0_256,plain,
    lhs_atom13(X1),
    c_0_202,
    [final] ).

cnf(c_0_257,plain,
    lhs_atom12(X1),
    c_0_203,
    [final] ).

cnf(c_0_258,plain,
    lhs_atom54,
    c_0_204,
    [final] ).

cnf(c_0_259,plain,
    lhs_atom11,
    c_0_205,
    [final] ).

cnf(c_0_260,plain,
    lhs_atom10,
    c_0_206,
    [final] ).

cnf(c_0_261,plain,
    lhs_atom9,
    c_0_207,
    [final] ).

cnf(c_0_262,plain,
    lhs_atom8,
    c_0_208,
    [final] ).

cnf(c_0_263,plain,
    lhs_atom7,
    c_0_209,
    [final] ).

cnf(c_0_264,plain,
    lhs_atom6,
    c_0_210,
    [final] ).

cnf(c_0_265,plain,
    lhs_atom5,
    c_0_211,
    [final] ).

cnf(c_0_266,plain,
    lhs_atom4,
    c_0_212,
    [final] ).

cnf(c_0_267,plain,
    lhs_atom3,
    c_0_213,
    [final] ).

cnf(c_0_268,plain,
    lhs_atom2,
    c_0_214,
    [final] ).

cnf(c_0_269,plain,
    lhs_atom1,
    c_0_215,
    [final] ).

% End CNF derivation
cnf(c_0_216_0,axiom,
    ssList(skaf42(X2,X1)),
    inference(unfold_definition,[status(thm)],[c_0_216,def_lhs_atom53]) ).

cnf(c_0_217_0,axiom,
    ssList(skaf43(X2,X1)),
    inference(unfold_definition,[status(thm)],[c_0_217,def_lhs_atom52]) ).

cnf(c_0_218_0,axiom,
    ssList(skaf45(X2,X1)),
    inference(unfold_definition,[status(thm)],[c_0_218,def_lhs_atom51]) ).

cnf(c_0_219_0,axiom,
    ssList(skaf46(X2,X1)),
    inference(unfold_definition,[status(thm)],[c_0_219,def_lhs_atom50]) ).

cnf(c_0_220_0,axiom,
    ssList(skaf47(X2,X1)),
    inference(unfold_definition,[status(thm)],[c_0_220,def_lhs_atom49]) ).

cnf(c_0_221_0,axiom,
    ssList(skaf48(X2,X1)),
    inference(unfold_definition,[status(thm)],[c_0_221,def_lhs_atom48]) ).

cnf(c_0_222_0,axiom,
    ssItem(skaf44(X1)),
    inference(unfold_definition,[status(thm)],[c_0_222,def_lhs_atom47]) ).

cnf(c_0_223_0,axiom,
    ssItem(skaf49(X1)),
    inference(unfold_definition,[status(thm)],[c_0_223,def_lhs_atom46]) ).

cnf(c_0_224_0,axiom,
    ssItem(skaf50(X1)),
    inference(unfold_definition,[status(thm)],[c_0_224,def_lhs_atom45]) ).

cnf(c_0_225_0,axiom,
    ssList(skaf51(X1)),
    inference(unfold_definition,[status(thm)],[c_0_225,def_lhs_atom44]) ).

cnf(c_0_226_0,axiom,
    ssList(skaf52(X1)),
    inference(unfold_definition,[status(thm)],[c_0_226,def_lhs_atom43]) ).

cnf(c_0_227_0,axiom,
    ssList(skaf53(X1)),
    inference(unfold_definition,[status(thm)],[c_0_227,def_lhs_atom42]) ).

cnf(c_0_228_0,axiom,
    ssItem(skaf54(X1)),
    inference(unfold_definition,[status(thm)],[c_0_228,def_lhs_atom41]) ).

cnf(c_0_229_0,axiom,
    ssItem(skaf55(X1)),
    inference(unfold_definition,[status(thm)],[c_0_229,def_lhs_atom40]) ).

cnf(c_0_230_0,axiom,
    ssList(skaf56(X1)),
    inference(unfold_definition,[status(thm)],[c_0_230,def_lhs_atom39]) ).

cnf(c_0_231_0,axiom,
    ssList(skaf57(X1)),
    inference(unfold_definition,[status(thm)],[c_0_231,def_lhs_atom38]) ).

cnf(c_0_232_0,axiom,
    ssList(skaf58(X1)),
    inference(unfold_definition,[status(thm)],[c_0_232,def_lhs_atom37]) ).

cnf(c_0_233_0,axiom,
    ssItem(skaf59(X1)),
    inference(unfold_definition,[status(thm)],[c_0_233,def_lhs_atom36]) ).

cnf(c_0_234_0,axiom,
    ssItem(skaf60(X1)),
    inference(unfold_definition,[status(thm)],[c_0_234,def_lhs_atom35]) ).

cnf(c_0_235_0,axiom,
    ssList(skaf61(X1)),
    inference(unfold_definition,[status(thm)],[c_0_235,def_lhs_atom34]) ).

cnf(c_0_236_0,axiom,
    ssList(skaf62(X1)),
    inference(unfold_definition,[status(thm)],[c_0_236,def_lhs_atom33]) ).

cnf(c_0_237_0,axiom,
    ssList(skaf63(X1)),
    inference(unfold_definition,[status(thm)],[c_0_237,def_lhs_atom32]) ).

cnf(c_0_238_0,axiom,
    ssItem(skaf64(X1)),
    inference(unfold_definition,[status(thm)],[c_0_238,def_lhs_atom31]) ).

cnf(c_0_239_0,axiom,
    ssItem(skaf65(X1)),
    inference(unfold_definition,[status(thm)],[c_0_239,def_lhs_atom30]) ).

cnf(c_0_240_0,axiom,
    ssList(skaf66(X1)),
    inference(unfold_definition,[status(thm)],[c_0_240,def_lhs_atom29]) ).

cnf(c_0_241_0,axiom,
    ssList(skaf67(X1)),
    inference(unfold_definition,[status(thm)],[c_0_241,def_lhs_atom28]) ).

cnf(c_0_242_0,axiom,
    ssList(skaf68(X1)),
    inference(unfold_definition,[status(thm)],[c_0_242,def_lhs_atom27]) ).

cnf(c_0_243_0,axiom,
    ssItem(skaf69(X1)),
    inference(unfold_definition,[status(thm)],[c_0_243,def_lhs_atom26]) ).

cnf(c_0_244_0,axiom,
    ssItem(skaf70(X1)),
    inference(unfold_definition,[status(thm)],[c_0_244,def_lhs_atom25]) ).

cnf(c_0_245_0,axiom,
    ssList(skaf71(X1)),
    inference(unfold_definition,[status(thm)],[c_0_245,def_lhs_atom24]) ).

cnf(c_0_246_0,axiom,
    ssList(skaf72(X1)),
    inference(unfold_definition,[status(thm)],[c_0_246,def_lhs_atom23]) ).

cnf(c_0_247_0,axiom,
    ssList(skaf73(X1)),
    inference(unfold_definition,[status(thm)],[c_0_247,def_lhs_atom22]) ).

cnf(c_0_248_0,axiom,
    ssItem(skaf74(X1)),
    inference(unfold_definition,[status(thm)],[c_0_248,def_lhs_atom21]) ).

cnf(c_0_249_0,axiom,
    ssList(skaf75(X1)),
    inference(unfold_definition,[status(thm)],[c_0_249,def_lhs_atom20]) ).

cnf(c_0_250_0,axiom,
    ssList(skaf76(X1)),
    inference(unfold_definition,[status(thm)],[c_0_250,def_lhs_atom19]) ).

cnf(c_0_251_0,axiom,
    ssList(skaf77(X1)),
    inference(unfold_definition,[status(thm)],[c_0_251,def_lhs_atom18]) ).

cnf(c_0_252_0,axiom,
    ssItem(skaf78(X1)),
    inference(unfold_definition,[status(thm)],[c_0_252,def_lhs_atom17]) ).

cnf(c_0_253_0,axiom,
    ssItem(skaf79(X1)),
    inference(unfold_definition,[status(thm)],[c_0_253,def_lhs_atom16]) ).

cnf(c_0_254_0,axiom,
    ssList(skaf80(X1)),
    inference(unfold_definition,[status(thm)],[c_0_254,def_lhs_atom15]) ).

cnf(c_0_255_0,axiom,
    ssList(skaf81(X1)),
    inference(unfold_definition,[status(thm)],[c_0_255,def_lhs_atom14]) ).

cnf(c_0_256_0,axiom,
    ssList(skaf82(X1)),
    inference(unfold_definition,[status(thm)],[c_0_256,def_lhs_atom13]) ).

cnf(c_0_257_0,axiom,
    ssItem(skaf83(X1)),
    inference(unfold_definition,[status(thm)],[c_0_257,def_lhs_atom12]) ).

cnf(c_0_258_0,axiom,
    skac3 != skac2,
    inference(unfold_definition,[status(thm)],[c_0_258,def_lhs_atom54]) ).

cnf(c_0_259_0,axiom,
    ~ singletonP(nil),
    inference(unfold_definition,[status(thm)],[c_0_259,def_lhs_atom11]) ).

cnf(c_0_260_0,axiom,
    ssItem(skac2),
    inference(unfold_definition,[status(thm)],[c_0_260,def_lhs_atom10]) ).

cnf(c_0_261_0,axiom,
    ssItem(skac3),
    inference(unfold_definition,[status(thm)],[c_0_261,def_lhs_atom9]) ).

cnf(c_0_262_0,axiom,
    ssList(nil),
    inference(unfold_definition,[status(thm)],[c_0_262,def_lhs_atom8]) ).

cnf(c_0_263_0,axiom,
    cyclefreeP(nil),
    inference(unfold_definition,[status(thm)],[c_0_263,def_lhs_atom7]) ).

cnf(c_0_264_0,axiom,
    totalorderP(nil),
    inference(unfold_definition,[status(thm)],[c_0_264,def_lhs_atom6]) ).

cnf(c_0_265_0,axiom,
    strictorderP(nil),
    inference(unfold_definition,[status(thm)],[c_0_265,def_lhs_atom5]) ).

cnf(c_0_266_0,axiom,
    totalorderedP(nil),
    inference(unfold_definition,[status(thm)],[c_0_266,def_lhs_atom4]) ).

cnf(c_0_267_0,axiom,
    strictorderedP(nil),
    inference(unfold_definition,[status(thm)],[c_0_267,def_lhs_atom3]) ).

cnf(c_0_268_0,axiom,
    duplicatefreeP(nil),
    inference(unfold_definition,[status(thm)],[c_0_268,def_lhs_atom2]) ).

cnf(c_0_269_0,axiom,
    equalelemsP(nil),
    inference(unfold_definition,[status(thm)],[c_0_269,def_lhs_atom1]) ).

% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0_001,axiom,
    ! [X1,X2,X3,X4,X5,X6] :
      ( ~ leq(X6,X5)
      | ~ leq(X5,X6)
      | app(app(X4,cons(X6,X3)),cons(X5,X2)) != X1
      | ~ ssList(X2)
      | ~ ssList(X3)
      | ~ ssList(X4)
      | ~ ssItem(X5)
      | ~ ssItem(X6)
      | ~ cyclefreeP(X1)
      | ~ ssList(X1) ),
    file('<stdin>',clause185) ).

fof(c_0_1_002,axiom,
    ! [X1,X2,X3,X4,X5,X6] :
      ( app(app(X6,cons(X5,X4)),cons(X3,X2)) != X1
      | ~ ssList(X2)
      | ~ ssList(X4)
      | ~ ssList(X6)
      | ~ ssItem(X3)
      | ~ ssItem(X5)
      | ~ strictorderP(X1)
      | ~ ssList(X1)
      | lt(X5,X3)
      | lt(X3,X5) ),
    file('<stdin>',clause183) ).

fof(c_0_2_003,axiom,
    ! [X1,X2,X3,X4,X5,X6] :
      ( app(app(X6,cons(X5,X4)),cons(X3,X2)) != X1
      | ~ ssList(X2)
      | ~ ssList(X4)
      | ~ ssList(X6)
      | ~ ssItem(X3)
      | ~ ssItem(X5)
      | ~ totalorderP(X1)
      | ~ ssList(X1)
      | leq(X5,X3)
      | leq(X3,X5) ),
    file('<stdin>',clause184) ).

fof(c_0_3_004,axiom,
    ! [X1,X2,X3,X4,X5,X6] :
      ( app(app(X6,cons(X5,X4)),cons(X3,X2)) != X1
      | ~ ssList(X2)
      | ~ ssList(X4)
      | ~ ssList(X6)
      | ~ ssItem(X3)
      | ~ ssItem(X5)
      | ~ strictorderedP(X1)
      | ~ ssList(X1)
      | lt(X5,X3) ),
    file('<stdin>',clause181) ).

fof(c_0_4_005,axiom,
    ! [X1,X2,X3,X4,X5,X6] :
      ( app(app(X6,cons(X5,X4)),cons(X3,X2)) != X1
      | ~ ssList(X2)
      | ~ ssList(X4)
      | ~ ssList(X6)
      | ~ ssItem(X3)
      | ~ ssItem(X5)
      | ~ totalorderedP(X1)
      | ~ ssList(X1)
      | leq(X5,X3) ),
    file('<stdin>',clause182) ).

fof(c_0_5_006,axiom,
    ! [X2,X3,X4,X5,X6] :
      ( app(app(X6,cons(X5,X4)),cons(X5,X3)) != X2
      | ~ ssList(X3)
      | ~ ssList(X4)
      | ~ ssList(X6)
      | ~ ssItem(X5)
      | ~ duplicatefreeP(X2)
      | ~ ssList(X2) ),
    file('<stdin>',clause179) ).

fof(c_0_6_007,axiom,
    ! [X6] :
      ( ~ ssList(X6)
      | duplicatefreeP(X6)
      | app(app(skaf75(X6),cons(skaf74(X6),skaf76(X6))),cons(skaf74(X6),skaf77(X6))) = X6 ),
    file('<stdin>',clause162) ).

fof(c_0_7_008,axiom,
    ! [X6] :
      ( ~ ssList(X6)
      | strictorderedP(X6)
      | app(app(skaf71(X6),cons(skaf69(X6),skaf72(X6))),cons(skaf70(X6),skaf73(X6))) = X6 ),
    file('<stdin>',clause163) ).

fof(c_0_8_009,axiom,
    ! [X6] :
      ( ~ ssList(X6)
      | totalorderedP(X6)
      | app(app(skaf66(X6),cons(skaf64(X6),skaf67(X6))),cons(skaf65(X6),skaf68(X6))) = X6 ),
    file('<stdin>',clause164) ).

fof(c_0_9_010,axiom,
    ! [X6] :
      ( ~ ssList(X6)
      | strictorderP(X6)
      | app(app(skaf61(X6),cons(skaf59(X6),skaf62(X6))),cons(skaf60(X6),skaf63(X6))) = X6 ),
    file('<stdin>',clause165) ).

fof(c_0_10_011,axiom,
    ! [X6] :
      ( ~ ssList(X6)
      | totalorderP(X6)
      | app(app(skaf56(X6),cons(skaf54(X6),skaf57(X6))),cons(skaf55(X6),skaf58(X6))) = X6 ),
    file('<stdin>',clause166) ).

fof(c_0_11_012,axiom,
    ! [X6] :
      ( ~ ssList(X6)
      | cyclefreeP(X6)
      | app(app(skaf51(X6),cons(skaf49(X6),skaf52(X6))),cons(skaf50(X6),skaf53(X6))) = X6 ),
    file('<stdin>',clause167) ).

fof(c_0_12_013,axiom,
    ! [X2,X3,X4,X5,X6] :
      ( app(X6,cons(X5,cons(X4,X3))) != X2
      | ~ ssList(X3)
      | ~ ssList(X6)
      | ~ ssItem(X4)
      | ~ ssItem(X5)
      | ~ equalelemsP(X2)
      | ~ ssList(X2)
      | X5 = X4 ),
    file('<stdin>',clause180) ).

fof(c_0_13_014,axiom,
    ! [X6] :
      ( ~ ssList(X6)
      | equalelemsP(X6)
      | app(skaf80(X6),cons(skaf78(X6),cons(skaf79(X6),skaf81(X6)))) = X6 ),
    file('<stdin>',clause142) ).

fof(c_0_14_015,axiom,
    ! [X5,X6] :
      ( ~ segmentP(X6,X5)
      | ~ ssList(X5)
      | ~ ssList(X6)
      | app(app(skaf47(X6,X5),X5),skaf48(X5,X6)) = X6 ),
    file('<stdin>',clause168) ).

fof(c_0_15_016,axiom,
    ! [X5,X6] :
      ( ~ memberP(X6,X5)
      | ~ ssItem(X5)
      | ~ ssList(X6)
      | app(skaf42(X6,X5),cons(X5,skaf43(X5,X6))) = X6 ),
    file('<stdin>',clause169) ).

fof(c_0_16_017,axiom,
    ! [X3,X4,X5,X6] :
      ( ~ frontsegP(cons(X6,X5),cons(X4,X3))
      | ~ ssList(X3)
      | ~ ssList(X5)
      | ~ ssItem(X4)
      | ~ ssItem(X6)
      | frontsegP(X5,X3) ),
    file('<stdin>',clause174) ).

fof(c_0_17_018,axiom,
    ! [X3,X4,X5,X6] :
      ( ~ segmentP(X6,X5)
      | ~ ssList(X4)
      | ~ ssList(X3)
      | ~ ssList(X5)
      | ~ ssList(X6)
      | segmentP(app(app(X3,X6),X4),X5) ),
    file('<stdin>',clause172) ).

fof(c_0_18_019,axiom,
    ! [X3,X4,X5,X6] :
      ( ~ frontsegP(cons(X6,X5),cons(X4,X3))
      | ~ ssList(X3)
      | ~ ssList(X5)
      | ~ ssItem(X4)
      | ~ ssItem(X6)
      | X6 = X4 ),
    file('<stdin>',clause176) ).

fof(c_0_19_020,axiom,
    ! [X3,X4,X5,X6] :
      ( ~ frontsegP(X6,X5)
      | X4 != X3
      | ~ ssList(X5)
      | ~ ssList(X6)
      | ~ ssItem(X3)
      | ~ ssItem(X4)
      | frontsegP(cons(X4,X6),cons(X3,X5)) ),
    file('<stdin>',clause178) ).

fof(c_0_20_021,axiom,
    ! [X4,X5,X6] :
      ( ~ memberP(app(X6,X5),X4)
      | ~ ssList(X5)
      | ~ ssList(X6)
      | ~ ssItem(X4)
      | memberP(X5,X4)
      | memberP(X6,X4) ),
    file('<stdin>',clause158) ).

fof(c_0_21_022,axiom,
    ! [X3,X4,X5,X6] :
      ( app(app(X6,X5),X4) != X3
      | ~ ssList(X4)
      | ~ ssList(X6)
      | ~ ssList(X5)
      | ~ ssList(X3)
      | segmentP(X3,X5) ),
    file('<stdin>',clause173) ).

fof(c_0_22_023,axiom,
    ! [X3,X4,X5,X6] :
      ( app(X6,cons(X5,X4)) != X3
      | ~ ssList(X4)
      | ~ ssList(X6)
      | ~ ssItem(X5)
      | ~ ssList(X3)
      | memberP(X3,X5) ),
    file('<stdin>',clause175) ).

fof(c_0_23_024,axiom,
    ! [X4,X5,X6] :
      ( ~ memberP(cons(X6,X5),X4)
      | ~ ssList(X5)
      | ~ ssItem(X6)
      | ~ ssItem(X4)
      | memberP(X5,X4)
      | X4 = X6 ),
    file('<stdin>',clause161) ).

fof(c_0_24_025,axiom,
    ! [X4,X5,X6] :
      ( ~ ssList(X6)
      | ~ ssList(X5)
      | ~ ssList(X4)
      | app(app(X4,X5),X6) = app(X4,app(X5,X6)) ),
    file('<stdin>',clause149) ).

fof(c_0_25_026,axiom,
    ! [X4,X5,X6] :
      ( ~ ssItem(X6)
      | ~ ssList(X5)
      | ~ ssList(X4)
      | cons(X6,app(X5,X4)) = app(cons(X6,X5),X4) ),
    file('<stdin>',clause157) ).

fof(c_0_26_027,axiom,
    ! [X5,X6] :
      ( ~ leq(X6,hd(X5))
      | ~ totalorderedP(X5)
      | ~ ssList(X5)
      | ~ ssItem(X6)
      | totalorderedP(cons(X6,X5))
      | nil = X5 ),
    file('<stdin>',clause159) ).

fof(c_0_27_028,axiom,
    ! [X5,X6] :
      ( ~ lt(X6,hd(X5))
      | ~ strictorderedP(X5)
      | ~ ssList(X5)
      | ~ ssItem(X6)
      | strictorderedP(cons(X6,X5))
      | nil = X5 ),
    file('<stdin>',clause160) ).

fof(c_0_28_029,axiom,
    ! [X4,X5,X6] :
      ( ~ rearsegP(X6,X5)
      | ~ ssList(X4)
      | ~ ssList(X5)
      | ~ ssList(X6)
      | rearsegP(app(X4,X6),X5) ),
    file('<stdin>',clause136) ).

fof(c_0_29_030,axiom,
    ! [X4,X5,X6] :
      ( ~ frontsegP(X6,X5)
      | ~ ssList(X4)
      | ~ ssList(X5)
      | ~ ssList(X6)
      | frontsegP(app(X6,X4),X5) ),
    file('<stdin>',clause137) ).

fof(c_0_30_031,axiom,
    ! [X4,X5,X6] :
      ( ~ memberP(X6,X5)
      | ~ ssList(X6)
      | ~ ssItem(X4)
      | ~ ssItem(X5)
      | memberP(cons(X4,X6),X5) ),
    file('<stdin>',clause139) ).

fof(c_0_31_032,axiom,
    ! [X4,X5,X6] :
      ( ~ memberP(X6,X5)
      | ~ ssList(X4)
      | ~ ssList(X6)
      | ~ ssItem(X5)
      | memberP(app(X6,X4),X5) ),
    file('<stdin>',clause140) ).

fof(c_0_32_033,axiom,
    ! [X4,X5,X6] :
      ( ~ memberP(X6,X5)
      | ~ ssList(X6)
      | ~ ssList(X4)
      | ~ ssItem(X5)
      | memberP(app(X4,X6),X5) ),
    file('<stdin>',clause141) ).

fof(c_0_33_034,axiom,
    ! [X5,X6] :
      ( ~ strictorderedP(cons(X6,X5))
      | ~ ssList(X5)
      | ~ ssItem(X6)
      | lt(X6,hd(X5))
      | nil = X5 ),
    file('<stdin>',clause134) ).

fof(c_0_34_035,axiom,
    ! [X5,X6] :
      ( ~ totalorderedP(cons(X6,X5))
      | ~ ssList(X5)
      | ~ ssItem(X6)
      | leq(X6,hd(X5))
      | nil = X5 ),
    file('<stdin>',clause135) ).

fof(c_0_35_036,axiom,
    ! [X4,X5,X6] :
      ( ~ gt(X6,X5)
      | ~ gt(X5,X4)
      | ~ ssItem(X4)
      | ~ ssItem(X5)
      | ~ ssItem(X6)
      | gt(X6,X4) ),
    file('<stdin>',clause146) ).

fof(c_0_36_037,axiom,
    ! [X4,X5,X6] :
      ( ~ leq(X6,X5)
      | ~ lt(X5,X4)
      | ~ ssItem(X4)
      | ~ ssItem(X5)
      | ~ ssItem(X6)
      | lt(X6,X4) ),
    file('<stdin>',clause147) ).

fof(c_0_37_038,axiom,
    ! [X4,X5,X6] :
      ( ~ geq(X6,X5)
      | ~ geq(X5,X4)
      | ~ ssItem(X4)
      | ~ ssItem(X5)
      | ~ ssItem(X6)
      | geq(X6,X4) ),
    file('<stdin>',clause148) ).

fof(c_0_38_039,axiom,
    ! [X4,X5,X6] :
      ( ~ segmentP(X6,X5)
      | ~ segmentP(X5,X4)
      | ~ ssList(X4)
      | ~ ssList(X5)
      | ~ ssList(X6)
      | segmentP(X6,X4) ),
    file('<stdin>',clause152) ).

fof(c_0_39_040,axiom,
    ! [X4,X5,X6] :
      ( ~ rearsegP(X6,X5)
      | ~ rearsegP(X5,X4)
      | ~ ssList(X4)
      | ~ ssList(X5)
      | ~ ssList(X6)
      | rearsegP(X6,X4) ),
    file('<stdin>',clause153) ).

fof(c_0_40_041,axiom,
    ! [X4,X5,X6] :
      ( ~ frontsegP(X6,X5)
      | ~ frontsegP(X5,X4)
      | ~ ssList(X4)
      | ~ ssList(X5)
      | ~ ssList(X6)
      | frontsegP(X6,X4) ),
    file('<stdin>',clause154) ).

fof(c_0_41_042,axiom,
    ! [X4,X5,X6] :
      ( ~ lt(X6,X5)
      | ~ lt(X5,X4)
      | ~ ssItem(X4)
      | ~ ssItem(X5)
      | ~ ssItem(X6)
      | lt(X6,X4) ),
    file('<stdin>',clause155) ).

fof(c_0_42_043,axiom,
    ! [X4,X5,X6] :
      ( ~ leq(X6,X5)
      | ~ leq(X5,X4)
      | ~ ssItem(X4)
      | ~ ssItem(X5)
      | ~ ssItem(X6)
      | leq(X6,X4) ),
    file('<stdin>',clause156) ).

fof(c_0_43_044,axiom,
    ! [X5,X6] :
      ( ~ rearsegP(X6,X5)
      | ~ ssList(X5)
      | ~ ssList(X6)
      | app(skaf46(X6,X5),X5) = X6 ),
    file('<stdin>',clause131) ).

fof(c_0_44_045,axiom,
    ! [X5,X6] :
      ( ~ frontsegP(X6,X5)
      | ~ ssList(X5)
      | ~ ssList(X6)
      | app(X5,skaf45(X6,X5)) = X6 ),
    file('<stdin>',clause132) ).

fof(c_0_45_046,axiom,
    ! [X3,X4,X5,X6] :
      ( cons(X6,X5) != cons(X4,X3)
      | ~ ssItem(X4)
      | ~ ssItem(X6)
      | ~ ssList(X3)
      | ~ ssList(X5)
      | X6 = X4 ),
    file('<stdin>',clause170) ).

fof(c_0_46_047,axiom,
    ! [X3,X4,X5,X6] :
      ( cons(X6,X5) != cons(X4,X3)
      | ~ ssItem(X4)
      | ~ ssItem(X6)
      | ~ ssList(X3)
      | ~ ssList(X5)
      | X3 = X5 ),
    file('<stdin>',clause171) ).

fof(c_0_47_048,axiom,
    ! [X5,X6] :
      ( ~ strictorderedP(cons(X6,X5))
      | ~ ssList(X5)
      | ~ ssItem(X6)
      | strictorderedP(X5)
      | nil = X5 ),
    file('<stdin>',clause124) ).

fof(c_0_48_049,axiom,
    ! [X5,X6] :
      ( ~ totalorderedP(cons(X6,X5))
      | ~ ssList(X5)
      | ~ ssItem(X6)
      | totalorderedP(X5)
      | nil = X5 ),
    file('<stdin>',clause125) ).

fof(c_0_49_050,axiom,
    ! [X4,X5,X6] :
      ( app(X6,X5) != app(X6,X4)
      | ~ ssList(X5)
      | ~ ssList(X6)
      | ~ ssList(X4)
      | X5 = X4 ),
    file('<stdin>',clause150) ).

fof(c_0_50_051,axiom,
    ! [X4,X5,X6] :
      ( app(X6,X5) != app(X4,X5)
      | ~ ssList(X6)
      | ~ ssList(X5)
      | ~ ssList(X4)
      | X6 = X4 ),
    file('<stdin>',clause151) ).

fof(c_0_51_052,axiom,
    ! [X5,X6] :
      ( ~ ssList(X6)
      | ~ ssList(X5)
      | nil = X5
      | tl(app(X5,X6)) = app(tl(X5),X6) ),
    file('<stdin>',clause133) ).

fof(c_0_52_053,axiom,
    ! [X4,X5,X6] :
      ( X6 != X5
      | ~ ssList(X4)
      | ~ ssItem(X5)
      | ~ ssItem(X6)
      | memberP(cons(X5,X4),X6) ),
    file('<stdin>',clause138) ).

fof(c_0_53_054,axiom,
    ! [X5,X6] :
      ( ~ ssItem(X6)
      | ~ ssList(X5)
      | app(cons(X6,nil),X5) = cons(X6,X5) ),
    file('<stdin>',clause120) ).

fof(c_0_54_055,axiom,
    ! [X5,X6] :
      ( ~ geq(X6,X5)
      | ~ geq(X5,X6)
      | ~ ssItem(X6)
      | ~ ssItem(X5)
      | X5 = X6 ),
    file('<stdin>',clause126) ).

fof(c_0_55_056,axiom,
    ! [X5,X6] :
      ( ~ segmentP(X6,X5)
      | ~ segmentP(X5,X6)
      | ~ ssList(X6)
      | ~ ssList(X5)
      | X5 = X6 ),
    file('<stdin>',clause127) ).

fof(c_0_56_057,axiom,
    ! [X5,X6] :
      ( ~ rearsegP(X6,X5)
      | ~ rearsegP(X5,X6)
      | ~ ssList(X6)
      | ~ ssList(X5)
      | X5 = X6 ),
    file('<stdin>',clause128) ).

fof(c_0_57_058,axiom,
    ! [X5,X6] :
      ( ~ frontsegP(X6,X5)
      | ~ frontsegP(X5,X6)
      | ~ ssList(X6)
      | ~ ssList(X5)
      | X5 = X6 ),
    file('<stdin>',clause129) ).

fof(c_0_58_059,axiom,
    ! [X5,X6] :
      ( ~ leq(X6,X5)
      | ~ leq(X5,X6)
      | ~ ssItem(X6)
      | ~ ssItem(X5)
      | X5 = X6 ),
    file('<stdin>',clause130) ).

fof(c_0_59_060,axiom,
    ! [X4,X5,X6] :
      ( app(X6,X5) != X4
      | ~ ssList(X6)
      | ~ ssList(X5)
      | ~ ssList(X4)
      | rearsegP(X4,X5) ),
    file('<stdin>',clause143) ).

fof(c_0_60_061,axiom,
    ! [X4,X5,X6] :
      ( app(X6,X5) != X4
      | ~ ssList(X5)
      | ~ ssList(X6)
      | ~ ssList(X4)
      | frontsegP(X4,X6) ),
    file('<stdin>',clause144) ).

fof(c_0_61_062,axiom,
    ! [X5,X6] :
      ( ~ gt(X6,X5)
      | ~ gt(X5,X6)
      | ~ ssItem(X6)
      | ~ ssItem(X5) ),
    file('<stdin>',clause110) ).

fof(c_0_62_063,axiom,
    ! [X5,X6] :
      ( ~ lt(X6,X5)
      | ~ lt(X5,X6)
      | ~ ssItem(X6)
      | ~ ssItem(X5) ),
    file('<stdin>',clause114) ).

fof(c_0_63_064,axiom,
    ! [X5,X6] :
      ( ~ leq(X6,X5)
      | ~ ssItem(X5)
      | ~ ssItem(X6)
      | lt(X6,X5)
      | X6 = X5 ),
    file('<stdin>',clause121) ).

fof(c_0_64_065,axiom,
    ! [X5,X6] :
      ( ~ leq(X6,X5)
      | ~ ssItem(X5)
      | ~ ssItem(X6)
      | lt(X6,X5)
      | X6 = X5 ),
    file('<stdin>',clause122) ).

fof(c_0_65_066,axiom,
    ! [X6] :
      ( ~ lt(skaf69(X6),skaf70(X6))
      | ~ ssList(X6)
      | strictorderedP(X6) ),
    file('<stdin>',clause90) ).

fof(c_0_66_067,axiom,
    ! [X6] :
      ( ~ leq(skaf64(X6),skaf65(X6))
      | ~ ssList(X6)
      | totalorderedP(X6) ),
    file('<stdin>',clause91) ).

fof(c_0_67_068,axiom,
    ! [X6] :
      ( ~ lt(skaf60(X6),skaf59(X6))
      | ~ ssList(X6)
      | strictorderP(X6) ),
    file('<stdin>',clause92) ).

fof(c_0_68_069,axiom,
    ! [X6] :
      ( ~ lt(skaf59(X6),skaf60(X6))
      | ~ ssList(X6)
      | strictorderP(X6) ),
    file('<stdin>',clause93) ).

fof(c_0_69_070,axiom,
    ! [X6] :
      ( ~ leq(skaf55(X6),skaf54(X6))
      | ~ ssList(X6)
      | totalorderP(X6) ),
    file('<stdin>',clause94) ).

fof(c_0_70_071,axiom,
    ! [X6] :
      ( ~ leq(skaf54(X6),skaf55(X6))
      | ~ ssList(X6)
      | totalorderP(X6) ),
    file('<stdin>',clause95) ).

fof(c_0_71_072,axiom,
    ! [X5,X6] :
      ( ~ lt(X6,X5)
      | ~ ssItem(X5)
      | ~ ssItem(X6)
      | leq(X6,X5) ),
    file('<stdin>',clause103) ).

fof(c_0_72_073,axiom,
    ! [X5,X6] :
      ( ~ gt(X6,X5)
      | ~ ssItem(X5)
      | ~ ssItem(X6)
      | lt(X5,X6) ),
    file('<stdin>',clause105) ).

fof(c_0_73_074,axiom,
    ! [X5,X6] :
      ( ~ lt(X6,X5)
      | ~ ssItem(X6)
      | ~ ssItem(X5)
      | gt(X5,X6) ),
    file('<stdin>',clause106) ).

fof(c_0_74_075,axiom,
    ! [X5,X6] :
      ( ~ geq(X6,X5)
      | ~ ssItem(X5)
      | ~ ssItem(X6)
      | leq(X5,X6) ),
    file('<stdin>',clause107) ).

fof(c_0_75_076,axiom,
    ! [X5,X6] :
      ( ~ leq(X6,X5)
      | ~ ssItem(X6)
      | ~ ssItem(X5)
      | geq(X5,X6) ),
    file('<stdin>',clause108) ).

fof(c_0_76_077,axiom,
    ! [X5,X6] :
      ( ~ ssList(X6)
      | ~ ssList(X5)
      | nil = X5
      | hd(app(X5,X6)) = hd(X5) ),
    file('<stdin>',clause123) ).

fof(c_0_77_078,axiom,
    ! [X5,X6] :
      ( nil != X6
      | ~ ssList(X6)
      | ~ ssItem(X5)
      | strictorderedP(cons(X5,X6)) ),
    file('<stdin>',clause112) ).

fof(c_0_78_079,axiom,
    ! [X5,X6] :
      ( nil != X6
      | ~ ssList(X6)
      | ~ ssItem(X5)
      | totalorderedP(cons(X5,X6)) ),
    file('<stdin>',clause113) ).

fof(c_0_79_080,axiom,
    ! [X5,X6] :
      ( tl(X6) != tl(X5)
      | hd(X6) != hd(X5)
      | ~ ssList(X6)
      | ~ ssList(X5)
      | nil = X5
      | X6 = X5
      | nil = X6 ),
    file('<stdin>',clause177) ).

fof(c_0_80_081,axiom,
    ! [X5,X6] :
      ( ~ ssItem(X6)
      | ~ ssList(X5)
      | tl(cons(X6,X5)) = X5 ),
    file('<stdin>',clause96) ).

fof(c_0_81_082,axiom,
    ! [X5,X6] :
      ( ~ ssItem(X6)
      | ~ ssList(X5)
      | hd(cons(X6,X5)) = X6 ),
    file('<stdin>',clause97) ).

fof(c_0_82_083,axiom,
    ! [X5,X6] :
      ( ~ ssList(X6)
      | ~ ssList(X5)
      | ssList(app(X5,X6)) ),
    file('<stdin>',clause85) ).

fof(c_0_83_084,axiom,
    ! [X5,X6] :
      ( ~ ssItem(X6)
      | ~ ssList(X5)
      | ssList(cons(X6,X5)) ),
    file('<stdin>',clause86) ).

fof(c_0_84_085,axiom,
    ! [X5,X6] :
      ( X6 != X5
      | ~ lt(X6,X5)
      | ~ ssItem(X5)
      | ~ ssItem(X6) ),
    file('<stdin>',clause111) ).

fof(c_0_85_086,axiom,
    ! [X5,X6] :
      ( X6 != X5
      | ~ neq(X6,X5)
      | ~ ssList(X5)
      | ~ ssList(X6) ),
    file('<stdin>',clause115) ).

fof(c_0_86_087,axiom,
    ! [X5,X6] :
      ( X6 != X5
      | ~ neq(X6,X5)
      | ~ ssItem(X5)
      | ~ ssItem(X6) ),
    file('<stdin>',clause117) ).

fof(c_0_87_088,axiom,
    ! [X5,X6] :
      ( cons(X6,nil) != X5
      | ~ ssItem(X6)
      | ~ ssList(X5)
      | singletonP(X5) ),
    file('<stdin>',clause116) ).

fof(c_0_88_089,axiom,
    ! [X5,X6] :
      ( app(X6,X5) != nil
      | ~ ssList(X5)
      | ~ ssList(X6)
      | nil = X6 ),
    file('<stdin>',clause118) ).

fof(c_0_89_090,axiom,
    ! [X5,X6] :
      ( app(X6,X5) != nil
      | ~ ssList(X5)
      | ~ ssList(X6)
      | nil = X5 ),
    file('<stdin>',clause119) ).

fof(c_0_90_091,axiom,
    ! [X6] :
      ( ~ ssList(X6)
      | cyclefreeP(X6)
      | leq(skaf50(X6),skaf49(X6)) ),
    file('<stdin>',clause87) ).

fof(c_0_91_092,axiom,
    ! [X6] :
      ( ~ ssList(X6)
      | cyclefreeP(X6)
      | leq(skaf49(X6),skaf50(X6)) ),
    file('<stdin>',clause88) ).

fof(c_0_92_093,axiom,
    ! [X5,X6] :
      ( cons(X6,X5) != X5
      | ~ ssItem(X6)
      | ~ ssList(X5) ),
    file('<stdin>',clause99) ).

fof(c_0_93_094,axiom,
    ! [X5,X6] :
      ( cons(X6,X5) != nil
      | ~ ssItem(X6)
      | ~ ssList(X5) ),
    file('<stdin>',clause98) ).

fof(c_0_94_095,axiom,
    ! [X6] :
      ( ~ ssList(X6)
      | cons(hd(X6),tl(X6)) = X6
      | nil = X6 ),
    file('<stdin>',clause104) ).

fof(c_0_95_096,axiom,
    ! [X6] :
      ( ~ ssList(X6)
      | cons(skaf83(X6),skaf82(X6)) = X6
      | nil = X6 ),
    file('<stdin>',clause109) ).

fof(c_0_96_097,axiom,
    ! [X6] :
      ( ~ ssItem(X6)
      | equalelemsP(cons(X6,nil)) ),
    file('<stdin>',clause64) ).

fof(c_0_97_098,axiom,
    ! [X6] :
      ( ~ ssItem(X6)
      | duplicatefreeP(cons(X6,nil)) ),
    file('<stdin>',clause65) ).

fof(c_0_98_099,axiom,
    ! [X6] :
      ( ~ ssItem(X6)
      | strictorderedP(cons(X6,nil)) ),
    file('<stdin>',clause66) ).

fof(c_0_99_100,axiom,
    ! [X6] :
      ( ~ ssItem(X6)
      | totalorderedP(cons(X6,nil)) ),
    file('<stdin>',clause67) ).

fof(c_0_100_101,axiom,
    ! [X6] :
      ( ~ ssItem(X6)
      | strictorderP(cons(X6,nil)) ),
    file('<stdin>',clause68) ).

fof(c_0_101_102,axiom,
    ! [X6] :
      ( ~ ssItem(X6)
      | totalorderP(cons(X6,nil)) ),
    file('<stdin>',clause69) ).

fof(c_0_102_103,axiom,
    ! [X6] :
      ( ~ ssItem(X6)
      | cyclefreeP(cons(X6,nil)) ),
    file('<stdin>',clause70) ).

fof(c_0_103_104,axiom,
    ! [X6] :
      ( ~ singletonP(X6)
      | ~ ssList(X6)
      | cons(skaf44(X6),nil) = X6 ),
    file('<stdin>',clause101) ).

fof(c_0_104_105,axiom,
    ! [X5,X6] :
      ( nil != X6
      | nil != X5
      | ~ ssList(X5)
      | ~ ssList(X6)
      | app(X6,X5) = nil ),
    file('<stdin>',clause145) ).

fof(c_0_105_106,axiom,
    ! [X5,X6] :
      ( ~ ssList(X6)
      | ~ ssList(X5)
      | neq(X5,X6)
      | X5 = X6 ),
    file('<stdin>',clause100) ).

fof(c_0_106_107,axiom,
    ! [X5,X6] :
      ( ~ ssItem(X6)
      | ~ ssItem(X5)
      | neq(X5,X6)
      | X5 = X6 ),
    file('<stdin>',clause102) ).

fof(c_0_107_108,axiom,
    ! [X6] :
      ( ~ lt(X6,X6)
      | ~ ssItem(X6) ),
    file('<stdin>',clause63) ).

fof(c_0_108_109,axiom,
    ! [X6] :
      ( ~ segmentP(nil,X6)
      | ~ ssList(X6)
      | nil = X6 ),
    file('<stdin>',clause80) ).

fof(c_0_109_110,axiom,
    ! [X6] :
      ( ~ rearsegP(nil,X6)
      | ~ ssList(X6)
      | nil = X6 ),
    file('<stdin>',clause82) ).

fof(c_0_110_111,axiom,
    ! [X6] :
      ( ~ frontsegP(nil,X6)
      | ~ ssList(X6)
      | nil = X6 ),
    file('<stdin>',clause84) ).

fof(c_0_111_112,axiom,
    ! [X6] :
      ( ~ memberP(nil,X6)
      | ~ ssItem(X6) ),
    file('<stdin>',clause71) ).

fof(c_0_112_113,axiom,
    ! [X6] :
      ( skaf79(X6) != skaf78(X6)
      | ~ ssList(X6)
      | equalelemsP(X6) ),
    file('<stdin>',clause89) ).

fof(c_0_113_114,axiom,
    ! [X6] :
      ( nil != X6
      | ~ ssList(X6)
      | segmentP(nil,X6) ),
    file('<stdin>',clause79) ).

fof(c_0_114_115,axiom,
    ! [X6] :
      ( nil != X6
      | ~ ssList(X6)
      | rearsegP(nil,X6) ),
    file('<stdin>',clause81) ).

fof(c_0_115_116,axiom,
    ! [X6] :
      ( nil != X6
      | ~ ssList(X6)
      | frontsegP(nil,X6) ),
    file('<stdin>',clause83) ).

fof(c_0_116_117,axiom,
    ! [X6] :
      ( ~ ssItem(X6)
      | geq(X6,X6) ),
    file('<stdin>',clause55) ).

fof(c_0_117_118,axiom,
    ! [X6] :
      ( ~ ssList(X6)
      | segmentP(X6,X6) ),
    file('<stdin>',clause57) ).

fof(c_0_118_119,axiom,
    ! [X6] :
      ( ~ ssList(X6)
      | rearsegP(X6,X6) ),
    file('<stdin>',clause59) ).

fof(c_0_119_120,axiom,
    ! [X6] :
      ( ~ ssList(X6)
      | frontsegP(X6,X6) ),
    file('<stdin>',clause61) ).

fof(c_0_120_121,axiom,
    ! [X6] :
      ( ~ ssItem(X6)
      | leq(X6,X6) ),
    file('<stdin>',clause62) ).

fof(c_0_121_122,axiom,
    ! [X6] :
      ( ~ ssList(X6)
      | app(X6,nil) = X6 ),
    file('<stdin>',clause73) ).

fof(c_0_122_123,axiom,
    ! [X6] :
      ( ~ ssList(X6)
      | app(nil,X6) = X6 ),
    file('<stdin>',clause74) ).

fof(c_0_123_124,axiom,
    ! [X6] :
      ( ~ ssList(X6)
      | segmentP(X6,nil) ),
    file('<stdin>',clause56) ).

fof(c_0_124_125,axiom,
    ! [X6] :
      ( ~ ssList(X6)
      | rearsegP(X6,nil) ),
    file('<stdin>',clause58) ).

fof(c_0_125_126,axiom,
    ! [X6] :
      ( ~ ssList(X6)
      | frontsegP(X6,nil) ),
    file('<stdin>',clause60) ).

fof(c_0_126_127,axiom,
    ! [X6] :
      ( ~ ssList(X6)
      | ssList(tl(X6))
      | nil = X6 ),
    file('<stdin>',clause75) ).

fof(c_0_127_128,axiom,
    ! [X6] :
      ( ~ ssList(X6)
      | ssItem(hd(X6))
      | nil = X6 ),
    file('<stdin>',clause76) ).

fof(c_0_128_129,axiom,
    ! [X6] :
      ( ~ ssList(X6)
      | ssList(tl(X6))
      | nil = X6 ),
    file('<stdin>',clause77) ).

fof(c_0_129_130,axiom,
    ! [X6] :
      ( ~ ssList(X6)
      | ssItem(hd(X6))
      | nil = X6 ),
    file('<stdin>',clause78) ).

fof(c_0_130_131,axiom,
    ! [X5,X6] :
      ( ~ ssList(X6)
      | duplicatefreeP(X6)
      | ssItem(X5) ),
    file('<stdin>',clause72) ).

fof(c_0_131_132,plain,
    ! [X1,X2,X3,X4,X5,X6] :
      ( ~ leq(X6,X5)
      | ~ leq(X5,X6)
      | app(app(X4,cons(X6,X3)),cons(X5,X2)) != X1
      | ~ ssList(X2)
      | ~ ssList(X3)
      | ~ ssList(X4)
      | ~ ssItem(X5)
      | ~ ssItem(X6)
      | ~ cyclefreeP(X1)
      | ~ ssList(X1) ),
    inference(fof_simplification,[status(thm)],[c_0_0]) ).

fof(c_0_132_133,plain,
    ! [X1,X2,X3,X4,X5,X6] :
      ( app(app(X6,cons(X5,X4)),cons(X3,X2)) != X1
      | ~ ssList(X2)
      | ~ ssList(X4)
      | ~ ssList(X6)
      | ~ ssItem(X3)
      | ~ ssItem(X5)
      | ~ strictorderP(X1)
      | ~ ssList(X1)
      | lt(X5,X3)
      | lt(X3,X5) ),
    inference(fof_simplification,[status(thm)],[c_0_1]) ).

fof(c_0_133_134,plain,
    ! [X1,X2,X3,X4,X5,X6] :
      ( app(app(X6,cons(X5,X4)),cons(X3,X2)) != X1
      | ~ ssList(X2)
      | ~ ssList(X4)
      | ~ ssList(X6)
      | ~ ssItem(X3)
      | ~ ssItem(X5)
      | ~ totalorderP(X1)
      | ~ ssList(X1)
      | leq(X5,X3)
      | leq(X3,X5) ),
    inference(fof_simplification,[status(thm)],[c_0_2]) ).

fof(c_0_134_135,plain,
    ! [X1,X2,X3,X4,X5,X6] :
      ( app(app(X6,cons(X5,X4)),cons(X3,X2)) != X1
      | ~ ssList(X2)
      | ~ ssList(X4)
      | ~ ssList(X6)
      | ~ ssItem(X3)
      | ~ ssItem(X5)
      | ~ strictorderedP(X1)
      | ~ ssList(X1)
      | lt(X5,X3) ),
    inference(fof_simplification,[status(thm)],[c_0_3]) ).

fof(c_0_135_136,plain,
    ! [X1,X2,X3,X4,X5,X6] :
      ( app(app(X6,cons(X5,X4)),cons(X3,X2)) != X1
      | ~ ssList(X2)
      | ~ ssList(X4)
      | ~ ssList(X6)
      | ~ ssItem(X3)
      | ~ ssItem(X5)
      | ~ totalorderedP(X1)
      | ~ ssList(X1)
      | leq(X5,X3) ),
    inference(fof_simplification,[status(thm)],[c_0_4]) ).

fof(c_0_136_137,plain,
    ! [X2,X3,X4,X5,X6] :
      ( app(app(X6,cons(X5,X4)),cons(X5,X3)) != X2
      | ~ ssList(X3)
      | ~ ssList(X4)
      | ~ ssList(X6)
      | ~ ssItem(X5)
      | ~ duplicatefreeP(X2)
      | ~ ssList(X2) ),
    inference(fof_simplification,[status(thm)],[c_0_5]) ).

fof(c_0_137_138,plain,
    ! [X6] :
      ( ~ ssList(X6)
      | duplicatefreeP(X6)
      | app(app(skaf75(X6),cons(skaf74(X6),skaf76(X6))),cons(skaf74(X6),skaf77(X6))) = X6 ),
    inference(fof_simplification,[status(thm)],[c_0_6]) ).

fof(c_0_138_139,plain,
    ! [X6] :
      ( ~ ssList(X6)
      | strictorderedP(X6)
      | app(app(skaf71(X6),cons(skaf69(X6),skaf72(X6))),cons(skaf70(X6),skaf73(X6))) = X6 ),
    inference(fof_simplification,[status(thm)],[c_0_7]) ).

fof(c_0_139_140,plain,
    ! [X6] :
      ( ~ ssList(X6)
      | totalorderedP(X6)
      | app(app(skaf66(X6),cons(skaf64(X6),skaf67(X6))),cons(skaf65(X6),skaf68(X6))) = X6 ),
    inference(fof_simplification,[status(thm)],[c_0_8]) ).

fof(c_0_140_141,plain,
    ! [X6] :
      ( ~ ssList(X6)
      | strictorderP(X6)
      | app(app(skaf61(X6),cons(skaf59(X6),skaf62(X6))),cons(skaf60(X6),skaf63(X6))) = X6 ),
    inference(fof_simplification,[status(thm)],[c_0_9]) ).

fof(c_0_141_142,plain,
    ! [X6] :
      ( ~ ssList(X6)
      | totalorderP(X6)
      | app(app(skaf56(X6),cons(skaf54(X6),skaf57(X6))),cons(skaf55(X6),skaf58(X6))) = X6 ),
    inference(fof_simplification,[status(thm)],[c_0_10]) ).

fof(c_0_142_143,plain,
    ! [X6] :
      ( ~ ssList(X6)
      | cyclefreeP(X6)
      | app(app(skaf51(X6),cons(skaf49(X6),skaf52(X6))),cons(skaf50(X6),skaf53(X6))) = X6 ),
    inference(fof_simplification,[status(thm)],[c_0_11]) ).

fof(c_0_143_144,plain,
    ! [X2,X3,X4,X5,X6] :
      ( app(X6,cons(X5,cons(X4,X3))) != X2
      | ~ ssList(X3)
      | ~ ssList(X6)
      | ~ ssItem(X4)
      | ~ ssItem(X5)
      | ~ equalelemsP(X2)
      | ~ ssList(X2)
      | X5 = X4 ),
    inference(fof_simplification,[status(thm)],[c_0_12]) ).

fof(c_0_144_145,plain,
    ! [X6] :
      ( ~ ssList(X6)
      | equalelemsP(X6)
      | app(skaf80(X6),cons(skaf78(X6),cons(skaf79(X6),skaf81(X6)))) = X6 ),
    inference(fof_simplification,[status(thm)],[c_0_13]) ).

fof(c_0_145_146,plain,
    ! [X5,X6] :
      ( ~ segmentP(X6,X5)
      | ~ ssList(X5)
      | ~ ssList(X6)
      | app(app(skaf47(X6,X5),X5),skaf48(X5,X6)) = X6 ),
    inference(fof_simplification,[status(thm)],[c_0_14]) ).

fof(c_0_146_147,plain,
    ! [X5,X6] :
      ( ~ memberP(X6,X5)
      | ~ ssItem(X5)
      | ~ ssList(X6)
      | app(skaf42(X6,X5),cons(X5,skaf43(X5,X6))) = X6 ),
    inference(fof_simplification,[status(thm)],[c_0_15]) ).

fof(c_0_147_148,plain,
    ! [X3,X4,X5,X6] :
      ( ~ frontsegP(cons(X6,X5),cons(X4,X3))
      | ~ ssList(X3)
      | ~ ssList(X5)
      | ~ ssItem(X4)
      | ~ ssItem(X6)
      | frontsegP(X5,X3) ),
    inference(fof_simplification,[status(thm)],[c_0_16]) ).

fof(c_0_148_149,plain,
    ! [X3,X4,X5,X6] :
      ( ~ segmentP(X6,X5)
      | ~ ssList(X4)
      | ~ ssList(X3)
      | ~ ssList(X5)
      | ~ ssList(X6)
      | segmentP(app(app(X3,X6),X4),X5) ),
    inference(fof_simplification,[status(thm)],[c_0_17]) ).

fof(c_0_149_150,plain,
    ! [X3,X4,X5,X6] :
      ( ~ frontsegP(cons(X6,X5),cons(X4,X3))
      | ~ ssList(X3)
      | ~ ssList(X5)
      | ~ ssItem(X4)
      | ~ ssItem(X6)
      | X6 = X4 ),
    inference(fof_simplification,[status(thm)],[c_0_18]) ).

fof(c_0_150_151,plain,
    ! [X3,X4,X5,X6] :
      ( ~ frontsegP(X6,X5)
      | X4 != X3
      | ~ ssList(X5)
      | ~ ssList(X6)
      | ~ ssItem(X3)
      | ~ ssItem(X4)
      | frontsegP(cons(X4,X6),cons(X3,X5)) ),
    inference(fof_simplification,[status(thm)],[c_0_19]) ).

fof(c_0_151_152,plain,
    ! [X4,X5,X6] :
      ( ~ memberP(app(X6,X5),X4)
      | ~ ssList(X5)
      | ~ ssList(X6)
      | ~ ssItem(X4)
      | memberP(X5,X4)
      | memberP(X6,X4) ),
    inference(fof_simplification,[status(thm)],[c_0_20]) ).

fof(c_0_152_153,plain,
    ! [X3,X4,X5,X6] :
      ( app(app(X6,X5),X4) != X3
      | ~ ssList(X4)
      | ~ ssList(X6)
      | ~ ssList(X5)
      | ~ ssList(X3)
      | segmentP(X3,X5) ),
    inference(fof_simplification,[status(thm)],[c_0_21]) ).

fof(c_0_153_154,plain,
    ! [X3,X4,X5,X6] :
      ( app(X6,cons(X5,X4)) != X3
      | ~ ssList(X4)
      | ~ ssList(X6)
      | ~ ssItem(X5)
      | ~ ssList(X3)
      | memberP(X3,X5) ),
    inference(fof_simplification,[status(thm)],[c_0_22]) ).

fof(c_0_154_155,plain,
    ! [X4,X5,X6] :
      ( ~ memberP(cons(X6,X5),X4)
      | ~ ssList(X5)
      | ~ ssItem(X6)
      | ~ ssItem(X4)
      | memberP(X5,X4)
      | X4 = X6 ),
    inference(fof_simplification,[status(thm)],[c_0_23]) ).

fof(c_0_155_156,plain,
    ! [X4,X5,X6] :
      ( ~ ssList(X6)
      | ~ ssList(X5)
      | ~ ssList(X4)
      | app(app(X4,X5),X6) = app(X4,app(X5,X6)) ),
    inference(fof_simplification,[status(thm)],[c_0_24]) ).

fof(c_0_156_157,plain,
    ! [X4,X5,X6] :
      ( ~ ssItem(X6)
      | ~ ssList(X5)
      | ~ ssList(X4)
      | cons(X6,app(X5,X4)) = app(cons(X6,X5),X4) ),
    inference(fof_simplification,[status(thm)],[c_0_25]) ).

fof(c_0_157_158,plain,
    ! [X5,X6] :
      ( ~ leq(X6,hd(X5))
      | ~ totalorderedP(X5)
      | ~ ssList(X5)
      | ~ ssItem(X6)
      | totalorderedP(cons(X6,X5))
      | nil = X5 ),
    inference(fof_simplification,[status(thm)],[c_0_26]) ).

fof(c_0_158_159,plain,
    ! [X5,X6] :
      ( ~ lt(X6,hd(X5))
      | ~ strictorderedP(X5)
      | ~ ssList(X5)
      | ~ ssItem(X6)
      | strictorderedP(cons(X6,X5))
      | nil = X5 ),
    inference(fof_simplification,[status(thm)],[c_0_27]) ).

fof(c_0_159_160,plain,
    ! [X4,X5,X6] :
      ( ~ rearsegP(X6,X5)
      | ~ ssList(X4)
      | ~ ssList(X5)
      | ~ ssList(X6)
      | rearsegP(app(X4,X6),X5) ),
    inference(fof_simplification,[status(thm)],[c_0_28]) ).

fof(c_0_160_161,plain,
    ! [X4,X5,X6] :
      ( ~ frontsegP(X6,X5)
      | ~ ssList(X4)
      | ~ ssList(X5)
      | ~ ssList(X6)
      | frontsegP(app(X6,X4),X5) ),
    inference(fof_simplification,[status(thm)],[c_0_29]) ).

fof(c_0_161_162,plain,
    ! [X4,X5,X6] :
      ( ~ memberP(X6,X5)
      | ~ ssList(X6)
      | ~ ssItem(X4)
      | ~ ssItem(X5)
      | memberP(cons(X4,X6),X5) ),
    inference(fof_simplification,[status(thm)],[c_0_30]) ).

fof(c_0_162_163,plain,
    ! [X4,X5,X6] :
      ( ~ memberP(X6,X5)
      | ~ ssList(X4)
      | ~ ssList(X6)
      | ~ ssItem(X5)
      | memberP(app(X6,X4),X5) ),
    inference(fof_simplification,[status(thm)],[c_0_31]) ).

fof(c_0_163_164,plain,
    ! [X4,X5,X6] :
      ( ~ memberP(X6,X5)
      | ~ ssList(X6)
      | ~ ssList(X4)
      | ~ ssItem(X5)
      | memberP(app(X4,X6),X5) ),
    inference(fof_simplification,[status(thm)],[c_0_32]) ).

fof(c_0_164_165,plain,
    ! [X5,X6] :
      ( ~ strictorderedP(cons(X6,X5))
      | ~ ssList(X5)
      | ~ ssItem(X6)
      | lt(X6,hd(X5))
      | nil = X5 ),
    inference(fof_simplification,[status(thm)],[c_0_33]) ).

fof(c_0_165_166,plain,
    ! [X5,X6] :
      ( ~ totalorderedP(cons(X6,X5))
      | ~ ssList(X5)
      | ~ ssItem(X6)
      | leq(X6,hd(X5))
      | nil = X5 ),
    inference(fof_simplification,[status(thm)],[c_0_34]) ).

fof(c_0_166_167,plain,
    ! [X4,X5,X6] :
      ( ~ gt(X6,X5)
      | ~ gt(X5,X4)
      | ~ ssItem(X4)
      | ~ ssItem(X5)
      | ~ ssItem(X6)
      | gt(X6,X4) ),
    inference(fof_simplification,[status(thm)],[c_0_35]) ).

fof(c_0_167_168,plain,
    ! [X4,X5,X6] :
      ( ~ leq(X6,X5)
      | ~ lt(X5,X4)
      | ~ ssItem(X4)
      | ~ ssItem(X5)
      | ~ ssItem(X6)
      | lt(X6,X4) ),
    inference(fof_simplification,[status(thm)],[c_0_36]) ).

fof(c_0_168_169,plain,
    ! [X4,X5,X6] :
      ( ~ geq(X6,X5)
      | ~ geq(X5,X4)
      | ~ ssItem(X4)
      | ~ ssItem(X5)
      | ~ ssItem(X6)
      | geq(X6,X4) ),
    inference(fof_simplification,[status(thm)],[c_0_37]) ).

fof(c_0_169_170,plain,
    ! [X4,X5,X6] :
      ( ~ segmentP(X6,X5)
      | ~ segmentP(X5,X4)
      | ~ ssList(X4)
      | ~ ssList(X5)
      | ~ ssList(X6)
      | segmentP(X6,X4) ),
    inference(fof_simplification,[status(thm)],[c_0_38]) ).

fof(c_0_170_171,plain,
    ! [X4,X5,X6] :
      ( ~ rearsegP(X6,X5)
      | ~ rearsegP(X5,X4)
      | ~ ssList(X4)
      | ~ ssList(X5)
      | ~ ssList(X6)
      | rearsegP(X6,X4) ),
    inference(fof_simplification,[status(thm)],[c_0_39]) ).

fof(c_0_171_172,plain,
    ! [X4,X5,X6] :
      ( ~ frontsegP(X6,X5)
      | ~ frontsegP(X5,X4)
      | ~ ssList(X4)
      | ~ ssList(X5)
      | ~ ssList(X6)
      | frontsegP(X6,X4) ),
    inference(fof_simplification,[status(thm)],[c_0_40]) ).

fof(c_0_172_173,plain,
    ! [X4,X5,X6] :
      ( ~ lt(X6,X5)
      | ~ lt(X5,X4)
      | ~ ssItem(X4)
      | ~ ssItem(X5)
      | ~ ssItem(X6)
      | lt(X6,X4) ),
    inference(fof_simplification,[status(thm)],[c_0_41]) ).

fof(c_0_173_174,plain,
    ! [X4,X5,X6] :
      ( ~ leq(X6,X5)
      | ~ leq(X5,X4)
      | ~ ssItem(X4)
      | ~ ssItem(X5)
      | ~ ssItem(X6)
      | leq(X6,X4) ),
    inference(fof_simplification,[status(thm)],[c_0_42]) ).

fof(c_0_174_175,plain,
    ! [X5,X6] :
      ( ~ rearsegP(X6,X5)
      | ~ ssList(X5)
      | ~ ssList(X6)
      | app(skaf46(X6,X5),X5) = X6 ),
    inference(fof_simplification,[status(thm)],[c_0_43]) ).

fof(c_0_175_176,plain,
    ! [X5,X6] :
      ( ~ frontsegP(X6,X5)
      | ~ ssList(X5)
      | ~ ssList(X6)
      | app(X5,skaf45(X6,X5)) = X6 ),
    inference(fof_simplification,[status(thm)],[c_0_44]) ).

fof(c_0_176_177,plain,
    ! [X3,X4,X5,X6] :
      ( cons(X6,X5) != cons(X4,X3)
      | ~ ssItem(X4)
      | ~ ssItem(X6)
      | ~ ssList(X3)
      | ~ ssList(X5)
      | X6 = X4 ),
    inference(fof_simplification,[status(thm)],[c_0_45]) ).

fof(c_0_177_178,plain,
    ! [X3,X4,X5,X6] :
      ( cons(X6,X5) != cons(X4,X3)
      | ~ ssItem(X4)
      | ~ ssItem(X6)
      | ~ ssList(X3)
      | ~ ssList(X5)
      | X3 = X5 ),
    inference(fof_simplification,[status(thm)],[c_0_46]) ).

fof(c_0_178_179,plain,
    ! [X5,X6] :
      ( ~ strictorderedP(cons(X6,X5))
      | ~ ssList(X5)
      | ~ ssItem(X6)
      | strictorderedP(X5)
      | nil = X5 ),
    inference(fof_simplification,[status(thm)],[c_0_47]) ).

fof(c_0_179_180,plain,
    ! [X5,X6] :
      ( ~ totalorderedP(cons(X6,X5))
      | ~ ssList(X5)
      | ~ ssItem(X6)
      | totalorderedP(X5)
      | nil = X5 ),
    inference(fof_simplification,[status(thm)],[c_0_48]) ).

fof(c_0_180_181,plain,
    ! [X4,X5,X6] :
      ( app(X6,X5) != app(X6,X4)
      | ~ ssList(X5)
      | ~ ssList(X6)
      | ~ ssList(X4)
      | X5 = X4 ),
    inference(fof_simplification,[status(thm)],[c_0_49]) ).

fof(c_0_181_182,plain,
    ! [X4,X5,X6] :
      ( app(X6,X5) != app(X4,X5)
      | ~ ssList(X6)
      | ~ ssList(X5)
      | ~ ssList(X4)
      | X6 = X4 ),
    inference(fof_simplification,[status(thm)],[c_0_50]) ).

fof(c_0_182_183,plain,
    ! [X5,X6] :
      ( ~ ssList(X6)
      | ~ ssList(X5)
      | nil = X5
      | tl(app(X5,X6)) = app(tl(X5),X6) ),
    inference(fof_simplification,[status(thm)],[c_0_51]) ).

fof(c_0_183_184,plain,
    ! [X4,X5,X6] :
      ( X6 != X5
      | ~ ssList(X4)
      | ~ ssItem(X5)
      | ~ ssItem(X6)
      | memberP(cons(X5,X4),X6) ),
    inference(fof_simplification,[status(thm)],[c_0_52]) ).

fof(c_0_184_185,plain,
    ! [X5,X6] :
      ( ~ ssItem(X6)
      | ~ ssList(X5)
      | app(cons(X6,nil),X5) = cons(X6,X5) ),
    inference(fof_simplification,[status(thm)],[c_0_53]) ).

fof(c_0_185_186,plain,
    ! [X5,X6] :
      ( ~ geq(X6,X5)
      | ~ geq(X5,X6)
      | ~ ssItem(X6)
      | ~ ssItem(X5)
      | X5 = X6 ),
    inference(fof_simplification,[status(thm)],[c_0_54]) ).

fof(c_0_186_187,plain,
    ! [X5,X6] :
      ( ~ segmentP(X6,X5)
      | ~ segmentP(X5,X6)
      | ~ ssList(X6)
      | ~ ssList(X5)
      | X5 = X6 ),
    inference(fof_simplification,[status(thm)],[c_0_55]) ).

fof(c_0_187_188,plain,
    ! [X5,X6] :
      ( ~ rearsegP(X6,X5)
      | ~ rearsegP(X5,X6)
      | ~ ssList(X6)
      | ~ ssList(X5)
      | X5 = X6 ),
    inference(fof_simplification,[status(thm)],[c_0_56]) ).

fof(c_0_188_189,plain,
    ! [X5,X6] :
      ( ~ frontsegP(X6,X5)
      | ~ frontsegP(X5,X6)
      | ~ ssList(X6)
      | ~ ssList(X5)
      | X5 = X6 ),
    inference(fof_simplification,[status(thm)],[c_0_57]) ).

fof(c_0_189_190,plain,
    ! [X5,X6] :
      ( ~ leq(X6,X5)
      | ~ leq(X5,X6)
      | ~ ssItem(X6)
      | ~ ssItem(X5)
      | X5 = X6 ),
    inference(fof_simplification,[status(thm)],[c_0_58]) ).

fof(c_0_190_191,plain,
    ! [X4,X5,X6] :
      ( app(X6,X5) != X4
      | ~ ssList(X6)
      | ~ ssList(X5)
      | ~ ssList(X4)
      | rearsegP(X4,X5) ),
    inference(fof_simplification,[status(thm)],[c_0_59]) ).

fof(c_0_191_192,plain,
    ! [X4,X5,X6] :
      ( app(X6,X5) != X4
      | ~ ssList(X5)
      | ~ ssList(X6)
      | ~ ssList(X4)
      | frontsegP(X4,X6) ),
    inference(fof_simplification,[status(thm)],[c_0_60]) ).

fof(c_0_192_193,plain,
    ! [X5,X6] :
      ( ~ gt(X6,X5)
      | ~ gt(X5,X6)
      | ~ ssItem(X6)
      | ~ ssItem(X5) ),
    inference(fof_simplification,[status(thm)],[c_0_61]) ).

fof(c_0_193_194,plain,
    ! [X5,X6] :
      ( ~ lt(X6,X5)
      | ~ lt(X5,X6)
      | ~ ssItem(X6)
      | ~ ssItem(X5) ),
    inference(fof_simplification,[status(thm)],[c_0_62]) ).

fof(c_0_194_195,plain,
    ! [X5,X6] :
      ( ~ leq(X6,X5)
      | ~ ssItem(X5)
      | ~ ssItem(X6)
      | lt(X6,X5)
      | X6 = X5 ),
    inference(fof_simplification,[status(thm)],[c_0_63]) ).

fof(c_0_195_196,plain,
    ! [X5,X6] :
      ( ~ leq(X6,X5)
      | ~ ssItem(X5)
      | ~ ssItem(X6)
      | lt(X6,X5)
      | X6 = X5 ),
    inference(fof_simplification,[status(thm)],[c_0_64]) ).

fof(c_0_196_197,plain,
    ! [X6] :
      ( ~ lt(skaf69(X6),skaf70(X6))
      | ~ ssList(X6)
      | strictorderedP(X6) ),
    inference(fof_simplification,[status(thm)],[c_0_65]) ).

fof(c_0_197_198,plain,
    ! [X6] :
      ( ~ leq(skaf64(X6),skaf65(X6))
      | ~ ssList(X6)
      | totalorderedP(X6) ),
    inference(fof_simplification,[status(thm)],[c_0_66]) ).

fof(c_0_198_199,plain,
    ! [X6] :
      ( ~ lt(skaf60(X6),skaf59(X6))
      | ~ ssList(X6)
      | strictorderP(X6) ),
    inference(fof_simplification,[status(thm)],[c_0_67]) ).

fof(c_0_199_200,plain,
    ! [X6] :
      ( ~ lt(skaf59(X6),skaf60(X6))
      | ~ ssList(X6)
      | strictorderP(X6) ),
    inference(fof_simplification,[status(thm)],[c_0_68]) ).

fof(c_0_200_201,plain,
    ! [X6] :
      ( ~ leq(skaf55(X6),skaf54(X6))
      | ~ ssList(X6)
      | totalorderP(X6) ),
    inference(fof_simplification,[status(thm)],[c_0_69]) ).

fof(c_0_201_202,plain,
    ! [X6] :
      ( ~ leq(skaf54(X6),skaf55(X6))
      | ~ ssList(X6)
      | totalorderP(X6) ),
    inference(fof_simplification,[status(thm)],[c_0_70]) ).

fof(c_0_202_203,plain,
    ! [X5,X6] :
      ( ~ lt(X6,X5)
      | ~ ssItem(X5)
      | ~ ssItem(X6)
      | leq(X6,X5) ),
    inference(fof_simplification,[status(thm)],[c_0_71]) ).

fof(c_0_203_204,plain,
    ! [X5,X6] :
      ( ~ gt(X6,X5)
      | ~ ssItem(X5)
      | ~ ssItem(X6)
      | lt(X5,X6) ),
    inference(fof_simplification,[status(thm)],[c_0_72]) ).

fof(c_0_204_205,plain,
    ! [X5,X6] :
      ( ~ lt(X6,X5)
      | ~ ssItem(X6)
      | ~ ssItem(X5)
      | gt(X5,X6) ),
    inference(fof_simplification,[status(thm)],[c_0_73]) ).

fof(c_0_205_206,plain,
    ! [X5,X6] :
      ( ~ geq(X6,X5)
      | ~ ssItem(X5)
      | ~ ssItem(X6)
      | leq(X5,X6) ),
    inference(fof_simplification,[status(thm)],[c_0_74]) ).

fof(c_0_206_207,plain,
    ! [X5,X6] :
      ( ~ leq(X6,X5)
      | ~ ssItem(X6)
      | ~ ssItem(X5)
      | geq(X5,X6) ),
    inference(fof_simplification,[status(thm)],[c_0_75]) ).

fof(c_0_207_208,plain,
    ! [X5,X6] :
      ( ~ ssList(X6)
      | ~ ssList(X5)
      | nil = X5
      | hd(app(X5,X6)) = hd(X5) ),
    inference(fof_simplification,[status(thm)],[c_0_76]) ).

fof(c_0_208_209,plain,
    ! [X5,X6] :
      ( nil != X6
      | ~ ssList(X6)
      | ~ ssItem(X5)
      | strictorderedP(cons(X5,X6)) ),
    inference(fof_simplification,[status(thm)],[c_0_77]) ).

fof(c_0_209_210,plain,
    ! [X5,X6] :
      ( nil != X6
      | ~ ssList(X6)
      | ~ ssItem(X5)
      | totalorderedP(cons(X5,X6)) ),
    inference(fof_simplification,[status(thm)],[c_0_78]) ).

fof(c_0_210_211,plain,
    ! [X5,X6] :
      ( tl(X6) != tl(X5)
      | hd(X6) != hd(X5)
      | ~ ssList(X6)
      | ~ ssList(X5)
      | nil = X5
      | X6 = X5
      | nil = X6 ),
    inference(fof_simplification,[status(thm)],[c_0_79]) ).

fof(c_0_211_212,plain,
    ! [X5,X6] :
      ( ~ ssItem(X6)
      | ~ ssList(X5)
      | tl(cons(X6,X5)) = X5 ),
    inference(fof_simplification,[status(thm)],[c_0_80]) ).

fof(c_0_212_213,plain,
    ! [X5,X6] :
      ( ~ ssItem(X6)
      | ~ ssList(X5)
      | hd(cons(X6,X5)) = X6 ),
    inference(fof_simplification,[status(thm)],[c_0_81]) ).

fof(c_0_213_214,plain,
    ! [X5,X6] :
      ( ~ ssList(X6)
      | ~ ssList(X5)
      | ssList(app(X5,X6)) ),
    inference(fof_simplification,[status(thm)],[c_0_82]) ).

fof(c_0_214_215,plain,
    ! [X5,X6] :
      ( ~ ssItem(X6)
      | ~ ssList(X5)
      | ssList(cons(X6,X5)) ),
    inference(fof_simplification,[status(thm)],[c_0_83]) ).

fof(c_0_215_216,plain,
    ! [X5,X6] :
      ( X6 != X5
      | ~ lt(X6,X5)
      | ~ ssItem(X5)
      | ~ ssItem(X6) ),
    inference(fof_simplification,[status(thm)],[c_0_84]) ).

fof(c_0_216_217,plain,
    ! [X5,X6] :
      ( X6 != X5
      | ~ neq(X6,X5)
      | ~ ssList(X5)
      | ~ ssList(X6) ),
    inference(fof_simplification,[status(thm)],[c_0_85]) ).

fof(c_0_217_218,plain,
    ! [X5,X6] :
      ( X6 != X5
      | ~ neq(X6,X5)
      | ~ ssItem(X5)
      | ~ ssItem(X6) ),
    inference(fof_simplification,[status(thm)],[c_0_86]) ).

fof(c_0_218_219,plain,
    ! [X5,X6] :
      ( cons(X6,nil) != X5
      | ~ ssItem(X6)
      | ~ ssList(X5)
      | singletonP(X5) ),
    inference(fof_simplification,[status(thm)],[c_0_87]) ).

fof(c_0_219_220,plain,
    ! [X5,X6] :
      ( app(X6,X5) != nil
      | ~ ssList(X5)
      | ~ ssList(X6)
      | nil = X6 ),
    inference(fof_simplification,[status(thm)],[c_0_88]) ).

fof(c_0_220_221,plain,
    ! [X5,X6] :
      ( app(X6,X5) != nil
      | ~ ssList(X5)
      | ~ ssList(X6)
      | nil = X5 ),
    inference(fof_simplification,[status(thm)],[c_0_89]) ).

fof(c_0_221_222,plain,
    ! [X6] :
      ( ~ ssList(X6)
      | cyclefreeP(X6)
      | leq(skaf50(X6),skaf49(X6)) ),
    inference(fof_simplification,[status(thm)],[c_0_90]) ).

fof(c_0_222_223,plain,
    ! [X6] :
      ( ~ ssList(X6)
      | cyclefreeP(X6)
      | leq(skaf49(X6),skaf50(X6)) ),
    inference(fof_simplification,[status(thm)],[c_0_91]) ).

fof(c_0_223_224,plain,
    ! [X5,X6] :
      ( cons(X6,X5) != X5
      | ~ ssItem(X6)
      | ~ ssList(X5) ),
    inference(fof_simplification,[status(thm)],[c_0_92]) ).

fof(c_0_224_225,plain,
    ! [X5,X6] :
      ( cons(X6,X5) != nil
      | ~ ssItem(X6)
      | ~ ssList(X5) ),
    inference(fof_simplification,[status(thm)],[c_0_93]) ).

fof(c_0_225_226,plain,
    ! [X6] :
      ( ~ ssList(X6)
      | cons(hd(X6),tl(X6)) = X6
      | nil = X6 ),
    inference(fof_simplification,[status(thm)],[c_0_94]) ).

fof(c_0_226_227,plain,
    ! [X6] :
      ( ~ ssList(X6)
      | cons(skaf83(X6),skaf82(X6)) = X6
      | nil = X6 ),
    inference(fof_simplification,[status(thm)],[c_0_95]) ).

fof(c_0_227_228,plain,
    ! [X6] :
      ( ~ ssItem(X6)
      | equalelemsP(cons(X6,nil)) ),
    inference(fof_simplification,[status(thm)],[c_0_96]) ).

fof(c_0_228_229,plain,
    ! [X6] :
      ( ~ ssItem(X6)
      | duplicatefreeP(cons(X6,nil)) ),
    inference(fof_simplification,[status(thm)],[c_0_97]) ).

fof(c_0_229_230,plain,
    ! [X6] :
      ( ~ ssItem(X6)
      | strictorderedP(cons(X6,nil)) ),
    inference(fof_simplification,[status(thm)],[c_0_98]) ).

fof(c_0_230_231,plain,
    ! [X6] :
      ( ~ ssItem(X6)
      | totalorderedP(cons(X6,nil)) ),
    inference(fof_simplification,[status(thm)],[c_0_99]) ).

fof(c_0_231_232,plain,
    ! [X6] :
      ( ~ ssItem(X6)
      | strictorderP(cons(X6,nil)) ),
    inference(fof_simplification,[status(thm)],[c_0_100]) ).

fof(c_0_232_233,plain,
    ! [X6] :
      ( ~ ssItem(X6)
      | totalorderP(cons(X6,nil)) ),
    inference(fof_simplification,[status(thm)],[c_0_101]) ).

fof(c_0_233_234,plain,
    ! [X6] :
      ( ~ ssItem(X6)
      | cyclefreeP(cons(X6,nil)) ),
    inference(fof_simplification,[status(thm)],[c_0_102]) ).

fof(c_0_234_235,plain,
    ! [X6] :
      ( ~ singletonP(X6)
      | ~ ssList(X6)
      | cons(skaf44(X6),nil) = X6 ),
    inference(fof_simplification,[status(thm)],[c_0_103]) ).

fof(c_0_235_236,plain,
    ! [X5,X6] :
      ( nil != X6
      | nil != X5
      | ~ ssList(X5)
      | ~ ssList(X6)
      | app(X6,X5) = nil ),
    inference(fof_simplification,[status(thm)],[c_0_104]) ).

fof(c_0_236_237,plain,
    ! [X5,X6] :
      ( ~ ssList(X6)
      | ~ ssList(X5)
      | neq(X5,X6)
      | X5 = X6 ),
    inference(fof_simplification,[status(thm)],[c_0_105]) ).

fof(c_0_237_238,plain,
    ! [X5,X6] :
      ( ~ ssItem(X6)
      | ~ ssItem(X5)
      | neq(X5,X6)
      | X5 = X6 ),
    inference(fof_simplification,[status(thm)],[c_0_106]) ).

fof(c_0_238_239,plain,
    ! [X6] :
      ( ~ lt(X6,X6)
      | ~ ssItem(X6) ),
    inference(fof_simplification,[status(thm)],[c_0_107]) ).

fof(c_0_239_240,plain,
    ! [X6] :
      ( ~ segmentP(nil,X6)
      | ~ ssList(X6)
      | nil = X6 ),
    inference(fof_simplification,[status(thm)],[c_0_108]) ).

fof(c_0_240_241,plain,
    ! [X6] :
      ( ~ rearsegP(nil,X6)
      | ~ ssList(X6)
      | nil = X6 ),
    inference(fof_simplification,[status(thm)],[c_0_109]) ).

fof(c_0_241_242,plain,
    ! [X6] :
      ( ~ frontsegP(nil,X6)
      | ~ ssList(X6)
      | nil = X6 ),
    inference(fof_simplification,[status(thm)],[c_0_110]) ).

fof(c_0_242_243,plain,
    ! [X6] :
      ( ~ memberP(nil,X6)
      | ~ ssItem(X6) ),
    inference(fof_simplification,[status(thm)],[c_0_111]) ).

fof(c_0_243_244,plain,
    ! [X6] :
      ( skaf79(X6) != skaf78(X6)
      | ~ ssList(X6)
      | equalelemsP(X6) ),
    inference(fof_simplification,[status(thm)],[c_0_112]) ).

fof(c_0_244_245,plain,
    ! [X6] :
      ( nil != X6
      | ~ ssList(X6)
      | segmentP(nil,X6) ),
    inference(fof_simplification,[status(thm)],[c_0_113]) ).

fof(c_0_245_246,plain,
    ! [X6] :
      ( nil != X6
      | ~ ssList(X6)
      | rearsegP(nil,X6) ),
    inference(fof_simplification,[status(thm)],[c_0_114]) ).

fof(c_0_246_247,plain,
    ! [X6] :
      ( nil != X6
      | ~ ssList(X6)
      | frontsegP(nil,X6) ),
    inference(fof_simplification,[status(thm)],[c_0_115]) ).

fof(c_0_247_248,plain,
    ! [X6] :
      ( ~ ssItem(X6)
      | geq(X6,X6) ),
    inference(fof_simplification,[status(thm)],[c_0_116]) ).

fof(c_0_248_249,plain,
    ! [X6] :
      ( ~ ssList(X6)
      | segmentP(X6,X6) ),
    inference(fof_simplification,[status(thm)],[c_0_117]) ).

fof(c_0_249_250,plain,
    ! [X6] :
      ( ~ ssList(X6)
      | rearsegP(X6,X6) ),
    inference(fof_simplification,[status(thm)],[c_0_118]) ).

fof(c_0_250_251,plain,
    ! [X6] :
      ( ~ ssList(X6)
      | frontsegP(X6,X6) ),
    inference(fof_simplification,[status(thm)],[c_0_119]) ).

fof(c_0_251_252,plain,
    ! [X6] :
      ( ~ ssItem(X6)
      | leq(X6,X6) ),
    inference(fof_simplification,[status(thm)],[c_0_120]) ).

fof(c_0_252_253,plain,
    ! [X6] :
      ( ~ ssList(X6)
      | app(X6,nil) = X6 ),
    inference(fof_simplification,[status(thm)],[c_0_121]) ).

fof(c_0_253_254,plain,
    ! [X6] :
      ( ~ ssList(X6)
      | app(nil,X6) = X6 ),
    inference(fof_simplification,[status(thm)],[c_0_122]) ).

fof(c_0_254_255,plain,
    ! [X6] :
      ( ~ ssList(X6)
      | segmentP(X6,nil) ),
    inference(fof_simplification,[status(thm)],[c_0_123]) ).

fof(c_0_255_256,plain,
    ! [X6] :
      ( ~ ssList(X6)
      | rearsegP(X6,nil) ),
    inference(fof_simplification,[status(thm)],[c_0_124]) ).

fof(c_0_256_257,plain,
    ! [X6] :
      ( ~ ssList(X6)
      | frontsegP(X6,nil) ),
    inference(fof_simplification,[status(thm)],[c_0_125]) ).

fof(c_0_257_258,plain,
    ! [X6] :
      ( ~ ssList(X6)
      | ssList(tl(X6))
      | nil = X6 ),
    inference(fof_simplification,[status(thm)],[c_0_126]) ).

fof(c_0_258_259,plain,
    ! [X6] :
      ( ~ ssList(X6)
      | ssItem(hd(X6))
      | nil = X6 ),
    inference(fof_simplification,[status(thm)],[c_0_127]) ).

fof(c_0_259_260,plain,
    ! [X6] :
      ( ~ ssList(X6)
      | ssList(tl(X6))
      | nil = X6 ),
    inference(fof_simplification,[status(thm)],[c_0_128]) ).

fof(c_0_260_261,plain,
    ! [X6] :
      ( ~ ssList(X6)
      | ssItem(hd(X6))
      | nil = X6 ),
    inference(fof_simplification,[status(thm)],[c_0_129]) ).

fof(c_0_261_262,plain,
    ! [X5,X6] :
      ( ~ ssList(X6)
      | duplicatefreeP(X6)
      | ssItem(X5) ),
    inference(fof_simplification,[status(thm)],[c_0_130]) ).

fof(c_0_262_263,plain,
    ! [X7,X8,X9,X10,X11,X12] :
      ( ~ leq(X12,X11)
      | ~ leq(X11,X12)
      | app(app(X10,cons(X12,X9)),cons(X11,X8)) != X7
      | ~ ssList(X8)
      | ~ ssList(X9)
      | ~ ssList(X10)
      | ~ ssItem(X11)
      | ~ ssItem(X12)
      | ~ cyclefreeP(X7)
      | ~ ssList(X7) ),
    inference(variable_rename,[status(thm)],[c_0_131]) ).

fof(c_0_263_264,plain,
    ! [X7,X8,X9,X10,X11,X12] :
      ( app(app(X12,cons(X11,X10)),cons(X9,X8)) != X7
      | ~ ssList(X8)
      | ~ ssList(X10)
      | ~ ssList(X12)
      | ~ ssItem(X9)
      | ~ ssItem(X11)
      | ~ strictorderP(X7)
      | ~ ssList(X7)
      | lt(X11,X9)
      | lt(X9,X11) ),
    inference(variable_rename,[status(thm)],[c_0_132]) ).

fof(c_0_264_265,plain,
    ! [X7,X8,X9,X10,X11,X12] :
      ( app(app(X12,cons(X11,X10)),cons(X9,X8)) != X7
      | ~ ssList(X8)
      | ~ ssList(X10)
      | ~ ssList(X12)
      | ~ ssItem(X9)
      | ~ ssItem(X11)
      | ~ totalorderP(X7)
      | ~ ssList(X7)
      | leq(X11,X9)
      | leq(X9,X11) ),
    inference(variable_rename,[status(thm)],[c_0_133]) ).

fof(c_0_265_266,plain,
    ! [X7,X8,X9,X10,X11,X12] :
      ( app(app(X12,cons(X11,X10)),cons(X9,X8)) != X7
      | ~ ssList(X8)
      | ~ ssList(X10)
      | ~ ssList(X12)
      | ~ ssItem(X9)
      | ~ ssItem(X11)
      | ~ strictorderedP(X7)
      | ~ ssList(X7)
      | lt(X11,X9) ),
    inference(variable_rename,[status(thm)],[c_0_134]) ).

fof(c_0_266_267,plain,
    ! [X7,X8,X9,X10,X11,X12] :
      ( app(app(X12,cons(X11,X10)),cons(X9,X8)) != X7
      | ~ ssList(X8)
      | ~ ssList(X10)
      | ~ ssList(X12)
      | ~ ssItem(X9)
      | ~ ssItem(X11)
      | ~ totalorderedP(X7)
      | ~ ssList(X7)
      | leq(X11,X9) ),
    inference(variable_rename,[status(thm)],[c_0_135]) ).

fof(c_0_267_268,plain,
    ! [X7,X8,X9,X10,X11] :
      ( app(app(X11,cons(X10,X9)),cons(X10,X8)) != X7
      | ~ ssList(X8)
      | ~ ssList(X9)
      | ~ ssList(X11)
      | ~ ssItem(X10)
      | ~ duplicatefreeP(X7)
      | ~ ssList(X7) ),
    inference(variable_rename,[status(thm)],[c_0_136]) ).

fof(c_0_268_269,plain,
    ! [X7] :
      ( ~ ssList(X7)
      | duplicatefreeP(X7)
      | app(app(skaf75(X7),cons(skaf74(X7),skaf76(X7))),cons(skaf74(X7),skaf77(X7))) = X7 ),
    inference(variable_rename,[status(thm)],[c_0_137]) ).

fof(c_0_269_270,plain,
    ! [X7] :
      ( ~ ssList(X7)
      | strictorderedP(X7)
      | app(app(skaf71(X7),cons(skaf69(X7),skaf72(X7))),cons(skaf70(X7),skaf73(X7))) = X7 ),
    inference(variable_rename,[status(thm)],[c_0_138]) ).

fof(c_0_270,plain,
    ! [X7] :
      ( ~ ssList(X7)
      | totalorderedP(X7)
      | app(app(skaf66(X7),cons(skaf64(X7),skaf67(X7))),cons(skaf65(X7),skaf68(X7))) = X7 ),
    inference(variable_rename,[status(thm)],[c_0_139]) ).

fof(c_0_271,plain,
    ! [X7] :
      ( ~ ssList(X7)
      | strictorderP(X7)
      | app(app(skaf61(X7),cons(skaf59(X7),skaf62(X7))),cons(skaf60(X7),skaf63(X7))) = X7 ),
    inference(variable_rename,[status(thm)],[c_0_140]) ).

fof(c_0_272,plain,
    ! [X7] :
      ( ~ ssList(X7)
      | totalorderP(X7)
      | app(app(skaf56(X7),cons(skaf54(X7),skaf57(X7))),cons(skaf55(X7),skaf58(X7))) = X7 ),
    inference(variable_rename,[status(thm)],[c_0_141]) ).

fof(c_0_273,plain,
    ! [X7] :
      ( ~ ssList(X7)
      | cyclefreeP(X7)
      | app(app(skaf51(X7),cons(skaf49(X7),skaf52(X7))),cons(skaf50(X7),skaf53(X7))) = X7 ),
    inference(variable_rename,[status(thm)],[c_0_142]) ).

fof(c_0_274,plain,
    ! [X7,X8,X9,X10,X11] :
      ( app(X11,cons(X10,cons(X9,X8))) != X7
      | ~ ssList(X8)
      | ~ ssList(X11)
      | ~ ssItem(X9)
      | ~ ssItem(X10)
      | ~ equalelemsP(X7)
      | ~ ssList(X7)
      | X10 = X9 ),
    inference(variable_rename,[status(thm)],[c_0_143]) ).

fof(c_0_275,plain,
    ! [X7] :
      ( ~ ssList(X7)
      | equalelemsP(X7)
      | app(skaf80(X7),cons(skaf78(X7),cons(skaf79(X7),skaf81(X7)))) = X7 ),
    inference(variable_rename,[status(thm)],[c_0_144]) ).

fof(c_0_276,plain,
    ! [X7,X8] :
      ( ~ segmentP(X8,X7)
      | ~ ssList(X7)
      | ~ ssList(X8)
      | app(app(skaf47(X8,X7),X7),skaf48(X7,X8)) = X8 ),
    inference(variable_rename,[status(thm)],[c_0_145]) ).

fof(c_0_277,plain,
    ! [X7,X8] :
      ( ~ memberP(X8,X7)
      | ~ ssItem(X7)
      | ~ ssList(X8)
      | app(skaf42(X8,X7),cons(X7,skaf43(X7,X8))) = X8 ),
    inference(variable_rename,[status(thm)],[c_0_146]) ).

fof(c_0_278,plain,
    ! [X7,X8,X9,X10] :
      ( ~ frontsegP(cons(X10,X9),cons(X8,X7))
      | ~ ssList(X7)
      | ~ ssList(X9)
      | ~ ssItem(X8)
      | ~ ssItem(X10)
      | frontsegP(X9,X7) ),
    inference(variable_rename,[status(thm)],[c_0_147]) ).

fof(c_0_279,plain,
    ! [X7,X8,X9,X10] :
      ( ~ segmentP(X10,X9)
      | ~ ssList(X8)
      | ~ ssList(X7)
      | ~ ssList(X9)
      | ~ ssList(X10)
      | segmentP(app(app(X7,X10),X8),X9) ),
    inference(variable_rename,[status(thm)],[c_0_148]) ).

fof(c_0_280,plain,
    ! [X7,X8,X9,X10] :
      ( ~ frontsegP(cons(X10,X9),cons(X8,X7))
      | ~ ssList(X7)
      | ~ ssList(X9)
      | ~ ssItem(X8)
      | ~ ssItem(X10)
      | X10 = X8 ),
    inference(variable_rename,[status(thm)],[c_0_149]) ).

fof(c_0_281,plain,
    ! [X7,X8,X9,X10] :
      ( ~ frontsegP(X10,X9)
      | X8 != X7
      | ~ ssList(X9)
      | ~ ssList(X10)
      | ~ ssItem(X7)
      | ~ ssItem(X8)
      | frontsegP(cons(X8,X10),cons(X7,X9)) ),
    inference(variable_rename,[status(thm)],[c_0_150]) ).

fof(c_0_282,plain,
    ! [X7,X8,X9] :
      ( ~ memberP(app(X9,X8),X7)
      | ~ ssList(X8)
      | ~ ssList(X9)
      | ~ ssItem(X7)
      | memberP(X8,X7)
      | memberP(X9,X7) ),
    inference(variable_rename,[status(thm)],[c_0_151]) ).

fof(c_0_283,plain,
    ! [X7,X8,X9,X10] :
      ( app(app(X10,X9),X8) != X7
      | ~ ssList(X8)
      | ~ ssList(X10)
      | ~ ssList(X9)
      | ~ ssList(X7)
      | segmentP(X7,X9) ),
    inference(variable_rename,[status(thm)],[c_0_152]) ).

fof(c_0_284,plain,
    ! [X7,X8,X9,X10] :
      ( app(X10,cons(X9,X8)) != X7
      | ~ ssList(X8)
      | ~ ssList(X10)
      | ~ ssItem(X9)
      | ~ ssList(X7)
      | memberP(X7,X9) ),
    inference(variable_rename,[status(thm)],[c_0_153]) ).

fof(c_0_285,plain,
    ! [X7,X8,X9] :
      ( ~ memberP(cons(X9,X8),X7)
      | ~ ssList(X8)
      | ~ ssItem(X9)
      | ~ ssItem(X7)
      | memberP(X8,X7)
      | X7 = X9 ),
    inference(variable_rename,[status(thm)],[c_0_154]) ).

fof(c_0_286,plain,
    ! [X7,X8,X9] :
      ( ~ ssList(X9)
      | ~ ssList(X8)
      | ~ ssList(X7)
      | app(app(X7,X8),X9) = app(X7,app(X8,X9)) ),
    inference(variable_rename,[status(thm)],[c_0_155]) ).

fof(c_0_287,plain,
    ! [X7,X8,X9] :
      ( ~ ssItem(X9)
      | ~ ssList(X8)
      | ~ ssList(X7)
      | cons(X9,app(X8,X7)) = app(cons(X9,X8),X7) ),
    inference(variable_rename,[status(thm)],[c_0_156]) ).

fof(c_0_288,plain,
    ! [X7,X8] :
      ( ~ leq(X8,hd(X7))
      | ~ totalorderedP(X7)
      | ~ ssList(X7)
      | ~ ssItem(X8)
      | totalorderedP(cons(X8,X7))
      | nil = X7 ),
    inference(variable_rename,[status(thm)],[c_0_157]) ).

fof(c_0_289,plain,
    ! [X7,X8] :
      ( ~ lt(X8,hd(X7))
      | ~ strictorderedP(X7)
      | ~ ssList(X7)
      | ~ ssItem(X8)
      | strictorderedP(cons(X8,X7))
      | nil = X7 ),
    inference(variable_rename,[status(thm)],[c_0_158]) ).

fof(c_0_290,plain,
    ! [X7,X8,X9] :
      ( ~ rearsegP(X9,X8)
      | ~ ssList(X7)
      | ~ ssList(X8)
      | ~ ssList(X9)
      | rearsegP(app(X7,X9),X8) ),
    inference(variable_rename,[status(thm)],[c_0_159]) ).

fof(c_0_291,plain,
    ! [X7,X8,X9] :
      ( ~ frontsegP(X9,X8)
      | ~ ssList(X7)
      | ~ ssList(X8)
      | ~ ssList(X9)
      | frontsegP(app(X9,X7),X8) ),
    inference(variable_rename,[status(thm)],[c_0_160]) ).

fof(c_0_292,plain,
    ! [X7,X8,X9] :
      ( ~ memberP(X9,X8)
      | ~ ssList(X9)
      | ~ ssItem(X7)
      | ~ ssItem(X8)
      | memberP(cons(X7,X9),X8) ),
    inference(variable_rename,[status(thm)],[c_0_161]) ).

fof(c_0_293,plain,
    ! [X7,X8,X9] :
      ( ~ memberP(X9,X8)
      | ~ ssList(X7)
      | ~ ssList(X9)
      | ~ ssItem(X8)
      | memberP(app(X9,X7),X8) ),
    inference(variable_rename,[status(thm)],[c_0_162]) ).

fof(c_0_294,plain,
    ! [X7,X8,X9] :
      ( ~ memberP(X9,X8)
      | ~ ssList(X9)
      | ~ ssList(X7)
      | ~ ssItem(X8)
      | memberP(app(X7,X9),X8) ),
    inference(variable_rename,[status(thm)],[c_0_163]) ).

fof(c_0_295,plain,
    ! [X7,X8] :
      ( ~ strictorderedP(cons(X8,X7))
      | ~ ssList(X7)
      | ~ ssItem(X8)
      | lt(X8,hd(X7))
      | nil = X7 ),
    inference(variable_rename,[status(thm)],[c_0_164]) ).

fof(c_0_296,plain,
    ! [X7,X8] :
      ( ~ totalorderedP(cons(X8,X7))
      | ~ ssList(X7)
      | ~ ssItem(X8)
      | leq(X8,hd(X7))
      | nil = X7 ),
    inference(variable_rename,[status(thm)],[c_0_165]) ).

fof(c_0_297,plain,
    ! [X7,X8,X9] :
      ( ~ gt(X9,X8)
      | ~ gt(X8,X7)
      | ~ ssItem(X7)
      | ~ ssItem(X8)
      | ~ ssItem(X9)
      | gt(X9,X7) ),
    inference(variable_rename,[status(thm)],[c_0_166]) ).

fof(c_0_298,plain,
    ! [X7,X8,X9] :
      ( ~ leq(X9,X8)
      | ~ lt(X8,X7)
      | ~ ssItem(X7)
      | ~ ssItem(X8)
      | ~ ssItem(X9)
      | lt(X9,X7) ),
    inference(variable_rename,[status(thm)],[c_0_167]) ).

fof(c_0_299,plain,
    ! [X7,X8,X9] :
      ( ~ geq(X9,X8)
      | ~ geq(X8,X7)
      | ~ ssItem(X7)
      | ~ ssItem(X8)
      | ~ ssItem(X9)
      | geq(X9,X7) ),
    inference(variable_rename,[status(thm)],[c_0_168]) ).

fof(c_0_300,plain,
    ! [X7,X8,X9] :
      ( ~ segmentP(X9,X8)
      | ~ segmentP(X8,X7)
      | ~ ssList(X7)
      | ~ ssList(X8)
      | ~ ssList(X9)
      | segmentP(X9,X7) ),
    inference(variable_rename,[status(thm)],[c_0_169]) ).

fof(c_0_301,plain,
    ! [X7,X8,X9] :
      ( ~ rearsegP(X9,X8)
      | ~ rearsegP(X8,X7)
      | ~ ssList(X7)
      | ~ ssList(X8)
      | ~ ssList(X9)
      | rearsegP(X9,X7) ),
    inference(variable_rename,[status(thm)],[c_0_170]) ).

fof(c_0_302,plain,
    ! [X7,X8,X9] :
      ( ~ frontsegP(X9,X8)
      | ~ frontsegP(X8,X7)
      | ~ ssList(X7)
      | ~ ssList(X8)
      | ~ ssList(X9)
      | frontsegP(X9,X7) ),
    inference(variable_rename,[status(thm)],[c_0_171]) ).

fof(c_0_303,plain,
    ! [X7,X8,X9] :
      ( ~ lt(X9,X8)
      | ~ lt(X8,X7)
      | ~ ssItem(X7)
      | ~ ssItem(X8)
      | ~ ssItem(X9)
      | lt(X9,X7) ),
    inference(variable_rename,[status(thm)],[c_0_172]) ).

fof(c_0_304,plain,
    ! [X7,X8,X9] :
      ( ~ leq(X9,X8)
      | ~ leq(X8,X7)
      | ~ ssItem(X7)
      | ~ ssItem(X8)
      | ~ ssItem(X9)
      | leq(X9,X7) ),
    inference(variable_rename,[status(thm)],[c_0_173]) ).

fof(c_0_305,plain,
    ! [X7,X8] :
      ( ~ rearsegP(X8,X7)
      | ~ ssList(X7)
      | ~ ssList(X8)
      | app(skaf46(X8,X7),X7) = X8 ),
    inference(variable_rename,[status(thm)],[c_0_174]) ).

fof(c_0_306,plain,
    ! [X7,X8] :
      ( ~ frontsegP(X8,X7)
      | ~ ssList(X7)
      | ~ ssList(X8)
      | app(X7,skaf45(X8,X7)) = X8 ),
    inference(variable_rename,[status(thm)],[c_0_175]) ).

fof(c_0_307,plain,
    ! [X7,X8,X9,X10] :
      ( cons(X10,X9) != cons(X8,X7)
      | ~ ssItem(X8)
      | ~ ssItem(X10)
      | ~ ssList(X7)
      | ~ ssList(X9)
      | X10 = X8 ),
    inference(variable_rename,[status(thm)],[c_0_176]) ).

fof(c_0_308,plain,
    ! [X7,X8,X9,X10] :
      ( cons(X10,X9) != cons(X8,X7)
      | ~ ssItem(X8)
      | ~ ssItem(X10)
      | ~ ssList(X7)
      | ~ ssList(X9)
      | X7 = X9 ),
    inference(variable_rename,[status(thm)],[c_0_177]) ).

fof(c_0_309,plain,
    ! [X7,X8] :
      ( ~ strictorderedP(cons(X8,X7))
      | ~ ssList(X7)
      | ~ ssItem(X8)
      | strictorderedP(X7)
      | nil = X7 ),
    inference(variable_rename,[status(thm)],[c_0_178]) ).

fof(c_0_310,plain,
    ! [X7,X8] :
      ( ~ totalorderedP(cons(X8,X7))
      | ~ ssList(X7)
      | ~ ssItem(X8)
      | totalorderedP(X7)
      | nil = X7 ),
    inference(variable_rename,[status(thm)],[c_0_179]) ).

fof(c_0_311,plain,
    ! [X7,X8,X9] :
      ( app(X9,X8) != app(X9,X7)
      | ~ ssList(X8)
      | ~ ssList(X9)
      | ~ ssList(X7)
      | X8 = X7 ),
    inference(variable_rename,[status(thm)],[c_0_180]) ).

fof(c_0_312,plain,
    ! [X7,X8,X9] :
      ( app(X9,X8) != app(X7,X8)
      | ~ ssList(X9)
      | ~ ssList(X8)
      | ~ ssList(X7)
      | X9 = X7 ),
    inference(variable_rename,[status(thm)],[c_0_181]) ).

fof(c_0_313,plain,
    ! [X7,X8] :
      ( ~ ssList(X8)
      | ~ ssList(X7)
      | nil = X7
      | tl(app(X7,X8)) = app(tl(X7),X8) ),
    inference(variable_rename,[status(thm)],[c_0_182]) ).

fof(c_0_314,plain,
    ! [X7,X8,X9] :
      ( X9 != X8
      | ~ ssList(X7)
      | ~ ssItem(X8)
      | ~ ssItem(X9)
      | memberP(cons(X8,X7),X9) ),
    inference(variable_rename,[status(thm)],[c_0_183]) ).

fof(c_0_315,plain,
    ! [X7,X8] :
      ( ~ ssItem(X8)
      | ~ ssList(X7)
      | app(cons(X8,nil),X7) = cons(X8,X7) ),
    inference(variable_rename,[status(thm)],[c_0_184]) ).

fof(c_0_316,plain,
    ! [X7,X8] :
      ( ~ geq(X8,X7)
      | ~ geq(X7,X8)
      | ~ ssItem(X8)
      | ~ ssItem(X7)
      | X7 = X8 ),
    inference(variable_rename,[status(thm)],[c_0_185]) ).

fof(c_0_317,plain,
    ! [X7,X8] :
      ( ~ segmentP(X8,X7)
      | ~ segmentP(X7,X8)
      | ~ ssList(X8)
      | ~ ssList(X7)
      | X7 = X8 ),
    inference(variable_rename,[status(thm)],[c_0_186]) ).

fof(c_0_318,plain,
    ! [X7,X8] :
      ( ~ rearsegP(X8,X7)
      | ~ rearsegP(X7,X8)
      | ~ ssList(X8)
      | ~ ssList(X7)
      | X7 = X8 ),
    inference(variable_rename,[status(thm)],[c_0_187]) ).

fof(c_0_319,plain,
    ! [X7,X8] :
      ( ~ frontsegP(X8,X7)
      | ~ frontsegP(X7,X8)
      | ~ ssList(X8)
      | ~ ssList(X7)
      | X7 = X8 ),
    inference(variable_rename,[status(thm)],[c_0_188]) ).

fof(c_0_320,plain,
    ! [X7,X8] :
      ( ~ leq(X8,X7)
      | ~ leq(X7,X8)
      | ~ ssItem(X8)
      | ~ ssItem(X7)
      | X7 = X8 ),
    inference(variable_rename,[status(thm)],[c_0_189]) ).

fof(c_0_321,plain,
    ! [X7,X8,X9] :
      ( app(X9,X8) != X7
      | ~ ssList(X9)
      | ~ ssList(X8)
      | ~ ssList(X7)
      | rearsegP(X7,X8) ),
    inference(variable_rename,[status(thm)],[c_0_190]) ).

fof(c_0_322,plain,
    ! [X7,X8,X9] :
      ( app(X9,X8) != X7
      | ~ ssList(X8)
      | ~ ssList(X9)
      | ~ ssList(X7)
      | frontsegP(X7,X9) ),
    inference(variable_rename,[status(thm)],[c_0_191]) ).

fof(c_0_323,plain,
    ! [X7,X8] :
      ( ~ gt(X8,X7)
      | ~ gt(X7,X8)
      | ~ ssItem(X8)
      | ~ ssItem(X7) ),
    inference(variable_rename,[status(thm)],[c_0_192]) ).

fof(c_0_324,plain,
    ! [X7,X8] :
      ( ~ lt(X8,X7)
      | ~ lt(X7,X8)
      | ~ ssItem(X8)
      | ~ ssItem(X7) ),
    inference(variable_rename,[status(thm)],[c_0_193]) ).

fof(c_0_325,plain,
    ! [X7,X8] :
      ( ~ leq(X8,X7)
      | ~ ssItem(X7)
      | ~ ssItem(X8)
      | lt(X8,X7)
      | X8 = X7 ),
    inference(variable_rename,[status(thm)],[c_0_194]) ).

fof(c_0_326,plain,
    ! [X7,X8] :
      ( ~ leq(X8,X7)
      | ~ ssItem(X7)
      | ~ ssItem(X8)
      | lt(X8,X7)
      | X8 = X7 ),
    inference(variable_rename,[status(thm)],[c_0_195]) ).

fof(c_0_327,plain,
    ! [X7] :
      ( ~ lt(skaf69(X7),skaf70(X7))
      | ~ ssList(X7)
      | strictorderedP(X7) ),
    inference(variable_rename,[status(thm)],[c_0_196]) ).

fof(c_0_328,plain,
    ! [X7] :
      ( ~ leq(skaf64(X7),skaf65(X7))
      | ~ ssList(X7)
      | totalorderedP(X7) ),
    inference(variable_rename,[status(thm)],[c_0_197]) ).

fof(c_0_329,plain,
    ! [X7] :
      ( ~ lt(skaf60(X7),skaf59(X7))
      | ~ ssList(X7)
      | strictorderP(X7) ),
    inference(variable_rename,[status(thm)],[c_0_198]) ).

fof(c_0_330,plain,
    ! [X7] :
      ( ~ lt(skaf59(X7),skaf60(X7))
      | ~ ssList(X7)
      | strictorderP(X7) ),
    inference(variable_rename,[status(thm)],[c_0_199]) ).

fof(c_0_331,plain,
    ! [X7] :
      ( ~ leq(skaf55(X7),skaf54(X7))
      | ~ ssList(X7)
      | totalorderP(X7) ),
    inference(variable_rename,[status(thm)],[c_0_200]) ).

fof(c_0_332,plain,
    ! [X7] :
      ( ~ leq(skaf54(X7),skaf55(X7))
      | ~ ssList(X7)
      | totalorderP(X7) ),
    inference(variable_rename,[status(thm)],[c_0_201]) ).

fof(c_0_333,plain,
    ! [X7,X8] :
      ( ~ lt(X8,X7)
      | ~ ssItem(X7)
      | ~ ssItem(X8)
      | leq(X8,X7) ),
    inference(variable_rename,[status(thm)],[c_0_202]) ).

fof(c_0_334,plain,
    ! [X7,X8] :
      ( ~ gt(X8,X7)
      | ~ ssItem(X7)
      | ~ ssItem(X8)
      | lt(X7,X8) ),
    inference(variable_rename,[status(thm)],[c_0_203]) ).

fof(c_0_335,plain,
    ! [X7,X8] :
      ( ~ lt(X8,X7)
      | ~ ssItem(X8)
      | ~ ssItem(X7)
      | gt(X7,X8) ),
    inference(variable_rename,[status(thm)],[c_0_204]) ).

fof(c_0_336,plain,
    ! [X7,X8] :
      ( ~ geq(X8,X7)
      | ~ ssItem(X7)
      | ~ ssItem(X8)
      | leq(X7,X8) ),
    inference(variable_rename,[status(thm)],[c_0_205]) ).

fof(c_0_337,plain,
    ! [X7,X8] :
      ( ~ leq(X8,X7)
      | ~ ssItem(X8)
      | ~ ssItem(X7)
      | geq(X7,X8) ),
    inference(variable_rename,[status(thm)],[c_0_206]) ).

fof(c_0_338,plain,
    ! [X7,X8] :
      ( ~ ssList(X8)
      | ~ ssList(X7)
      | nil = X7
      | hd(app(X7,X8)) = hd(X7) ),
    inference(variable_rename,[status(thm)],[c_0_207]) ).

fof(c_0_339,plain,
    ! [X7,X8] :
      ( nil != X8
      | ~ ssList(X8)
      | ~ ssItem(X7)
      | strictorderedP(cons(X7,X8)) ),
    inference(variable_rename,[status(thm)],[c_0_208]) ).

fof(c_0_340,plain,
    ! [X7,X8] :
      ( nil != X8
      | ~ ssList(X8)
      | ~ ssItem(X7)
      | totalorderedP(cons(X7,X8)) ),
    inference(variable_rename,[status(thm)],[c_0_209]) ).

fof(c_0_341,plain,
    ! [X7,X8] :
      ( tl(X8) != tl(X7)
      | hd(X8) != hd(X7)
      | ~ ssList(X8)
      | ~ ssList(X7)
      | nil = X7
      | X8 = X7
      | nil = X8 ),
    inference(variable_rename,[status(thm)],[c_0_210]) ).

fof(c_0_342,plain,
    ! [X7,X8] :
      ( ~ ssItem(X8)
      | ~ ssList(X7)
      | tl(cons(X8,X7)) = X7 ),
    inference(variable_rename,[status(thm)],[c_0_211]) ).

fof(c_0_343,plain,
    ! [X7,X8] :
      ( ~ ssItem(X8)
      | ~ ssList(X7)
      | hd(cons(X8,X7)) = X8 ),
    inference(variable_rename,[status(thm)],[c_0_212]) ).

fof(c_0_344,plain,
    ! [X7,X8] :
      ( ~ ssList(X8)
      | ~ ssList(X7)
      | ssList(app(X7,X8)) ),
    inference(variable_rename,[status(thm)],[c_0_213]) ).

fof(c_0_345,plain,
    ! [X7,X8] :
      ( ~ ssItem(X8)
      | ~ ssList(X7)
      | ssList(cons(X8,X7)) ),
    inference(variable_rename,[status(thm)],[c_0_214]) ).

fof(c_0_346,plain,
    ! [X7,X8] :
      ( X8 != X7
      | ~ lt(X8,X7)
      | ~ ssItem(X7)
      | ~ ssItem(X8) ),
    inference(variable_rename,[status(thm)],[c_0_215]) ).

fof(c_0_347,plain,
    ! [X7,X8] :
      ( X8 != X7
      | ~ neq(X8,X7)
      | ~ ssList(X7)
      | ~ ssList(X8) ),
    inference(variable_rename,[status(thm)],[c_0_216]) ).

fof(c_0_348,plain,
    ! [X7,X8] :
      ( X8 != X7
      | ~ neq(X8,X7)
      | ~ ssItem(X7)
      | ~ ssItem(X8) ),
    inference(variable_rename,[status(thm)],[c_0_217]) ).

fof(c_0_349,plain,
    ! [X7,X8] :
      ( cons(X8,nil) != X7
      | ~ ssItem(X8)
      | ~ ssList(X7)
      | singletonP(X7) ),
    inference(variable_rename,[status(thm)],[c_0_218]) ).

fof(c_0_350,plain,
    ! [X7,X8] :
      ( app(X8,X7) != nil
      | ~ ssList(X7)
      | ~ ssList(X8)
      | nil = X8 ),
    inference(variable_rename,[status(thm)],[c_0_219]) ).

fof(c_0_351,plain,
    ! [X7,X8] :
      ( app(X8,X7) != nil
      | ~ ssList(X7)
      | ~ ssList(X8)
      | nil = X7 ),
    inference(variable_rename,[status(thm)],[c_0_220]) ).

fof(c_0_352,plain,
    ! [X7] :
      ( ~ ssList(X7)
      | cyclefreeP(X7)
      | leq(skaf50(X7),skaf49(X7)) ),
    inference(variable_rename,[status(thm)],[c_0_221]) ).

fof(c_0_353,plain,
    ! [X7] :
      ( ~ ssList(X7)
      | cyclefreeP(X7)
      | leq(skaf49(X7),skaf50(X7)) ),
    inference(variable_rename,[status(thm)],[c_0_222]) ).

fof(c_0_354,plain,
    ! [X7,X8] :
      ( cons(X8,X7) != X7
      | ~ ssItem(X8)
      | ~ ssList(X7) ),
    inference(variable_rename,[status(thm)],[c_0_223]) ).

fof(c_0_355,plain,
    ! [X7,X8] :
      ( cons(X8,X7) != nil
      | ~ ssItem(X8)
      | ~ ssList(X7) ),
    inference(variable_rename,[status(thm)],[c_0_224]) ).

fof(c_0_356,plain,
    ! [X7] :
      ( ~ ssList(X7)
      | cons(hd(X7),tl(X7)) = X7
      | nil = X7 ),
    inference(variable_rename,[status(thm)],[c_0_225]) ).

fof(c_0_357,plain,
    ! [X7] :
      ( ~ ssList(X7)
      | cons(skaf83(X7),skaf82(X7)) = X7
      | nil = X7 ),
    inference(variable_rename,[status(thm)],[c_0_226]) ).

fof(c_0_358,plain,
    ! [X7] :
      ( ~ ssItem(X7)
      | equalelemsP(cons(X7,nil)) ),
    inference(variable_rename,[status(thm)],[c_0_227]) ).

fof(c_0_359,plain,
    ! [X7] :
      ( ~ ssItem(X7)
      | duplicatefreeP(cons(X7,nil)) ),
    inference(variable_rename,[status(thm)],[c_0_228]) ).

fof(c_0_360,plain,
    ! [X7] :
      ( ~ ssItem(X7)
      | strictorderedP(cons(X7,nil)) ),
    inference(variable_rename,[status(thm)],[c_0_229]) ).

fof(c_0_361,plain,
    ! [X7] :
      ( ~ ssItem(X7)
      | totalorderedP(cons(X7,nil)) ),
    inference(variable_rename,[status(thm)],[c_0_230]) ).

fof(c_0_362,plain,
    ! [X7] :
      ( ~ ssItem(X7)
      | strictorderP(cons(X7,nil)) ),
    inference(variable_rename,[status(thm)],[c_0_231]) ).

fof(c_0_363,plain,
    ! [X7] :
      ( ~ ssItem(X7)
      | totalorderP(cons(X7,nil)) ),
    inference(variable_rename,[status(thm)],[c_0_232]) ).

fof(c_0_364,plain,
    ! [X7] :
      ( ~ ssItem(X7)
      | cyclefreeP(cons(X7,nil)) ),
    inference(variable_rename,[status(thm)],[c_0_233]) ).

fof(c_0_365,plain,
    ! [X7] :
      ( ~ singletonP(X7)
      | ~ ssList(X7)
      | cons(skaf44(X7),nil) = X7 ),
    inference(variable_rename,[status(thm)],[c_0_234]) ).

fof(c_0_366,plain,
    ! [X7,X8] :
      ( nil != X8
      | nil != X7
      | ~ ssList(X7)
      | ~ ssList(X8)
      | app(X8,X7) = nil ),
    inference(variable_rename,[status(thm)],[c_0_235]) ).

fof(c_0_367,plain,
    ! [X7,X8] :
      ( ~ ssList(X8)
      | ~ ssList(X7)
      | neq(X7,X8)
      | X7 = X8 ),
    inference(variable_rename,[status(thm)],[c_0_236]) ).

fof(c_0_368,plain,
    ! [X7,X8] :
      ( ~ ssItem(X8)
      | ~ ssItem(X7)
      | neq(X7,X8)
      | X7 = X8 ),
    inference(variable_rename,[status(thm)],[c_0_237]) ).

fof(c_0_369,plain,
    ! [X7] :
      ( ~ lt(X7,X7)
      | ~ ssItem(X7) ),
    inference(variable_rename,[status(thm)],[c_0_238]) ).

fof(c_0_370,plain,
    ! [X7] :
      ( ~ segmentP(nil,X7)
      | ~ ssList(X7)
      | nil = X7 ),
    inference(variable_rename,[status(thm)],[c_0_239]) ).

fof(c_0_371,plain,
    ! [X7] :
      ( ~ rearsegP(nil,X7)
      | ~ ssList(X7)
      | nil = X7 ),
    inference(variable_rename,[status(thm)],[c_0_240]) ).

fof(c_0_372,plain,
    ! [X7] :
      ( ~ frontsegP(nil,X7)
      | ~ ssList(X7)
      | nil = X7 ),
    inference(variable_rename,[status(thm)],[c_0_241]) ).

fof(c_0_373,plain,
    ! [X7] :
      ( ~ memberP(nil,X7)
      | ~ ssItem(X7) ),
    inference(variable_rename,[status(thm)],[c_0_242]) ).

fof(c_0_374,plain,
    ! [X7] :
      ( skaf79(X7) != skaf78(X7)
      | ~ ssList(X7)
      | equalelemsP(X7) ),
    inference(variable_rename,[status(thm)],[c_0_243]) ).

fof(c_0_375,plain,
    ! [X7] :
      ( nil != X7
      | ~ ssList(X7)
      | segmentP(nil,X7) ),
    inference(variable_rename,[status(thm)],[c_0_244]) ).

fof(c_0_376,plain,
    ! [X7] :
      ( nil != X7
      | ~ ssList(X7)
      | rearsegP(nil,X7) ),
    inference(variable_rename,[status(thm)],[c_0_245]) ).

fof(c_0_377,plain,
    ! [X7] :
      ( nil != X7
      | ~ ssList(X7)
      | frontsegP(nil,X7) ),
    inference(variable_rename,[status(thm)],[c_0_246]) ).

fof(c_0_378,plain,
    ! [X7] :
      ( ~ ssItem(X7)
      | geq(X7,X7) ),
    inference(variable_rename,[status(thm)],[c_0_247]) ).

fof(c_0_379,plain,
    ! [X7] :
      ( ~ ssList(X7)
      | segmentP(X7,X7) ),
    inference(variable_rename,[status(thm)],[c_0_248]) ).

fof(c_0_380,plain,
    ! [X7] :
      ( ~ ssList(X7)
      | rearsegP(X7,X7) ),
    inference(variable_rename,[status(thm)],[c_0_249]) ).

fof(c_0_381,plain,
    ! [X7] :
      ( ~ ssList(X7)
      | frontsegP(X7,X7) ),
    inference(variable_rename,[status(thm)],[c_0_250]) ).

fof(c_0_382,plain,
    ! [X7] :
      ( ~ ssItem(X7)
      | leq(X7,X7) ),
    inference(variable_rename,[status(thm)],[c_0_251]) ).

fof(c_0_383,plain,
    ! [X7] :
      ( ~ ssList(X7)
      | app(X7,nil) = X7 ),
    inference(variable_rename,[status(thm)],[c_0_252]) ).

fof(c_0_384,plain,
    ! [X7] :
      ( ~ ssList(X7)
      | app(nil,X7) = X7 ),
    inference(variable_rename,[status(thm)],[c_0_253]) ).

fof(c_0_385,plain,
    ! [X7] :
      ( ~ ssList(X7)
      | segmentP(X7,nil) ),
    inference(variable_rename,[status(thm)],[c_0_254]) ).

fof(c_0_386,plain,
    ! [X7] :
      ( ~ ssList(X7)
      | rearsegP(X7,nil) ),
    inference(variable_rename,[status(thm)],[c_0_255]) ).

fof(c_0_387,plain,
    ! [X7] :
      ( ~ ssList(X7)
      | frontsegP(X7,nil) ),
    inference(variable_rename,[status(thm)],[c_0_256]) ).

fof(c_0_388,plain,
    ! [X7] :
      ( ~ ssList(X7)
      | ssList(tl(X7))
      | nil = X7 ),
    inference(variable_rename,[status(thm)],[c_0_257]) ).

fof(c_0_389,plain,
    ! [X7] :
      ( ~ ssList(X7)
      | ssItem(hd(X7))
      | nil = X7 ),
    inference(variable_rename,[status(thm)],[c_0_258]) ).

fof(c_0_390,plain,
    ! [X7] :
      ( ~ ssList(X7)
      | ssList(tl(X7))
      | nil = X7 ),
    inference(variable_rename,[status(thm)],[c_0_259]) ).

fof(c_0_391,plain,
    ! [X7] :
      ( ~ ssList(X7)
      | ssItem(hd(X7))
      | nil = X7 ),
    inference(variable_rename,[status(thm)],[c_0_260]) ).

fof(c_0_392,plain,
    ! [X7,X8] :
      ( ~ ssList(X8)
      | duplicatefreeP(X8)
      | ssItem(X7) ),
    inference(variable_rename,[status(thm)],[c_0_261]) ).

cnf(c_0_393,plain,
    ( ~ ssList(X1)
    | ~ cyclefreeP(X1)
    | ~ ssItem(X2)
    | ~ ssItem(X3)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
    | ~ leq(X3,X2)
    | ~ leq(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_262]) ).

cnf(c_0_394,plain,
    ( lt(X1,X2)
    | lt(X2,X1)
    | ~ ssList(X3)
    | ~ strictorderP(X3)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X2,X5)),cons(X1,X6)) != X3 ),
    inference(split_conjunct,[status(thm)],[c_0_263]) ).

cnf(c_0_395,plain,
    ( leq(X1,X2)
    | leq(X2,X1)
    | ~ ssList(X3)
    | ~ totalorderP(X3)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X2,X5)),cons(X1,X6)) != X3 ),
    inference(split_conjunct,[status(thm)],[c_0_264]) ).

cnf(c_0_396,plain,
    ( lt(X1,X2)
    | ~ ssList(X3)
    | ~ strictorderedP(X3)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X1,X5)),cons(X2,X6)) != X3 ),
    inference(split_conjunct,[status(thm)],[c_0_265]) ).

cnf(c_0_397,plain,
    ( leq(X1,X2)
    | ~ ssList(X3)
    | ~ totalorderedP(X3)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X1,X5)),cons(X2,X6)) != X3 ),
    inference(split_conjunct,[status(thm)],[c_0_266]) ).

cnf(c_0_398,plain,
    ( ~ ssList(X1)
    | ~ duplicatefreeP(X1)
    | ~ ssItem(X2)
    | ~ ssList(X3)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | app(app(X3,cons(X2,X4)),cons(X2,X5)) != X1 ),
    inference(split_conjunct,[status(thm)],[c_0_267]) ).

cnf(c_0_399,plain,
    ( app(app(skaf75(X1),cons(skaf74(X1),skaf76(X1))),cons(skaf74(X1),skaf77(X1))) = X1
    | duplicatefreeP(X1)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_268]) ).

cnf(c_0_400,plain,
    ( app(app(skaf71(X1),cons(skaf69(X1),skaf72(X1))),cons(skaf70(X1),skaf73(X1))) = X1
    | strictorderedP(X1)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_269]) ).

cnf(c_0_401,plain,
    ( app(app(skaf66(X1),cons(skaf64(X1),skaf67(X1))),cons(skaf65(X1),skaf68(X1))) = X1
    | totalorderedP(X1)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_270]) ).

cnf(c_0_402,plain,
    ( app(app(skaf61(X1),cons(skaf59(X1),skaf62(X1))),cons(skaf60(X1),skaf63(X1))) = X1
    | strictorderP(X1)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_271]) ).

cnf(c_0_403,plain,
    ( app(app(skaf56(X1),cons(skaf54(X1),skaf57(X1))),cons(skaf55(X1),skaf58(X1))) = X1
    | totalorderP(X1)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_272]) ).

cnf(c_0_404,plain,
    ( app(app(skaf51(X1),cons(skaf49(X1),skaf52(X1))),cons(skaf50(X1),skaf53(X1))) = X1
    | cyclefreeP(X1)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_273]) ).

cnf(c_0_405,plain,
    ( X1 = X2
    | ~ ssList(X3)
    | ~ equalelemsP(X3)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | app(X4,cons(X1,cons(X2,X5))) != X3 ),
    inference(split_conjunct,[status(thm)],[c_0_274]) ).

cnf(c_0_406,plain,
    ( app(skaf80(X1),cons(skaf78(X1),cons(skaf79(X1),skaf81(X1)))) = X1
    | equalelemsP(X1)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_275]) ).

cnf(c_0_407,plain,
    ( app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ segmentP(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_276]) ).

cnf(c_0_408,plain,
    ( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
    | ~ ssList(X1)
    | ~ ssItem(X2)
    | ~ memberP(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_277]) ).

cnf(c_0_409,plain,
    ( frontsegP(X1,X2)
    | ~ ssItem(X3)
    | ~ ssItem(X4)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ frontsegP(cons(X3,X1),cons(X4,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_278]) ).

cnf(c_0_410,plain,
    ( segmentP(app(app(X1,X2),X3),X4)
    | ~ ssList(X2)
    | ~ ssList(X4)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ segmentP(X2,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_279]) ).

cnf(c_0_411,plain,
    ( X1 = X2
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ ssList(X3)
    | ~ ssList(X4)
    | ~ frontsegP(cons(X1,X3),cons(X2,X4)) ),
    inference(split_conjunct,[status(thm)],[c_0_280]) ).

cnf(c_0_412,plain,
    ( frontsegP(cons(X1,X2),cons(X3,X4))
    | ~ ssItem(X1)
    | ~ ssItem(X3)
    | ~ ssList(X2)
    | ~ ssList(X4)
    | X1 != X3
    | ~ frontsegP(X2,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_281]) ).

cnf(c_0_413,plain,
    ( memberP(X1,X2)
    | memberP(X3,X2)
    | ~ ssItem(X2)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ memberP(app(X1,X3),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_282]) ).

cnf(c_0_414,plain,
    ( segmentP(X1,X2)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | ~ ssList(X4)
    | app(app(X3,X2),X4) != X1 ),
    inference(split_conjunct,[status(thm)],[c_0_283]) ).

cnf(c_0_415,plain,
    ( memberP(X1,X2)
    | ~ ssList(X1)
    | ~ ssItem(X2)
    | ~ ssList(X3)
    | ~ ssList(X4)
    | app(X3,cons(X2,X4)) != X1 ),
    inference(split_conjunct,[status(thm)],[c_0_284]) ).

cnf(c_0_416,plain,
    ( X1 = X2
    | memberP(X3,X1)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ ssList(X3)
    | ~ memberP(cons(X2,X3),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_285]) ).

cnf(c_0_417,plain,
    ( app(app(X1,X2),X3) = app(X1,app(X2,X3))
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_286]) ).

cnf(c_0_418,plain,
    ( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_287]) ).

cnf(c_0_419,plain,
    ( nil = X1
    | totalorderedP(cons(X2,X1))
    | ~ ssItem(X2)
    | ~ ssList(X1)
    | ~ totalorderedP(X1)
    | ~ leq(X2,hd(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_288]) ).

cnf(c_0_420,plain,
    ( nil = X1
    | strictorderedP(cons(X2,X1))
    | ~ ssItem(X2)
    | ~ ssList(X1)
    | ~ strictorderedP(X1)
    | ~ lt(X2,hd(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_289]) ).

cnf(c_0_421,plain,
    ( rearsegP(app(X1,X2),X3)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | ~ rearsegP(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_290]) ).

cnf(c_0_422,plain,
    ( frontsegP(app(X1,X2),X3)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ frontsegP(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_291]) ).

cnf(c_0_423,plain,
    ( memberP(cons(X1,X2),X3)
    | ~ ssItem(X3)
    | ~ ssItem(X1)
    | ~ ssList(X2)
    | ~ memberP(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_292]) ).

cnf(c_0_424,plain,
    ( memberP(app(X1,X2),X3)
    | ~ ssItem(X3)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ memberP(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_293]) ).

cnf(c_0_425,plain,
    ( memberP(app(X1,X2),X3)
    | ~ ssItem(X3)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ memberP(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_294]) ).

cnf(c_0_426,plain,
    ( nil = X1
    | lt(X2,hd(X1))
    | ~ ssItem(X2)
    | ~ ssList(X1)
    | ~ strictorderedP(cons(X2,X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_295]) ).

cnf(c_0_427,plain,
    ( nil = X1
    | leq(X2,hd(X1))
    | ~ ssItem(X2)
    | ~ ssList(X1)
    | ~ totalorderedP(cons(X2,X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_296]) ).

cnf(c_0_428,plain,
    ( gt(X1,X2)
    | ~ ssItem(X1)
    | ~ ssItem(X3)
    | ~ ssItem(X2)
    | ~ gt(X3,X2)
    | ~ gt(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_297]) ).

cnf(c_0_429,plain,
    ( lt(X1,X2)
    | ~ ssItem(X1)
    | ~ ssItem(X3)
    | ~ ssItem(X2)
    | ~ lt(X3,X2)
    | ~ leq(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_298]) ).

cnf(c_0_430,plain,
    ( geq(X1,X2)
    | ~ ssItem(X1)
    | ~ ssItem(X3)
    | ~ ssItem(X2)
    | ~ geq(X3,X2)
    | ~ geq(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_299]) ).

cnf(c_0_431,plain,
    ( segmentP(X1,X2)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ segmentP(X3,X2)
    | ~ segmentP(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_300]) ).

cnf(c_0_432,plain,
    ( rearsegP(X1,X2)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ rearsegP(X3,X2)
    | ~ rearsegP(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_301]) ).

cnf(c_0_433,plain,
    ( frontsegP(X1,X2)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ frontsegP(X3,X2)
    | ~ frontsegP(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_302]) ).

cnf(c_0_434,plain,
    ( lt(X1,X2)
    | ~ ssItem(X1)
    | ~ ssItem(X3)
    | ~ ssItem(X2)
    | ~ lt(X3,X2)
    | ~ lt(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_303]) ).

cnf(c_0_435,plain,
    ( leq(X1,X2)
    | ~ ssItem(X1)
    | ~ ssItem(X3)
    | ~ ssItem(X2)
    | ~ leq(X3,X2)
    | ~ leq(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_304]) ).

cnf(c_0_436,plain,
    ( app(skaf46(X1,X2),X2) = X1
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ rearsegP(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_305]) ).

cnf(c_0_437,plain,
    ( app(X1,skaf45(X2,X1)) = X2
    | ~ ssList(X2)
    | ~ ssList(X1)
    | ~ frontsegP(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_306]) ).

cnf(c_0_438,plain,
    ( X1 = X2
    | ~ ssList(X3)
    | ~ ssList(X4)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | cons(X1,X3) != cons(X2,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_307]) ).

cnf(c_0_439,plain,
    ( X1 = X2
    | ~ ssList(X2)
    | ~ ssList(X1)
    | ~ ssItem(X3)
    | ~ ssItem(X4)
    | cons(X3,X2) != cons(X4,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_308]) ).

cnf(c_0_440,plain,
    ( nil = X1
    | strictorderedP(X1)
    | ~ ssItem(X2)
    | ~ ssList(X1)
    | ~ strictorderedP(cons(X2,X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_309]) ).

cnf(c_0_441,plain,
    ( nil = X1
    | totalorderedP(X1)
    | ~ ssItem(X2)
    | ~ ssList(X1)
    | ~ totalorderedP(cons(X2,X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_310]) ).

cnf(c_0_442,plain,
    ( X1 = X2
    | ~ ssList(X2)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | app(X3,X1) != app(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_311]) ).

cnf(c_0_443,plain,
    ( X1 = X2
    | ~ ssList(X2)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | app(X1,X3) != app(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_312]) ).

cnf(c_0_444,plain,
    ( tl(app(X1,X2)) = app(tl(X1),X2)
    | nil = X1
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_313]) ).

cnf(c_0_445,plain,
    ( memberP(cons(X1,X2),X3)
    | ~ ssItem(X3)
    | ~ ssItem(X1)
    | ~ ssList(X2)
    | X3 != X1 ),
    inference(split_conjunct,[status(thm)],[c_0_314]) ).

cnf(c_0_446,plain,
    ( app(cons(X1,nil),X2) = cons(X1,X2)
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_315]) ).

cnf(c_0_447,plain,
    ( X1 = X2
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ geq(X1,X2)
    | ~ geq(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_316]) ).

cnf(c_0_448,plain,
    ( X1 = X2
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ segmentP(X1,X2)
    | ~ segmentP(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_317]) ).

cnf(c_0_449,plain,
    ( X1 = X2
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ rearsegP(X1,X2)
    | ~ rearsegP(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_318]) ).

cnf(c_0_450,plain,
    ( X1 = X2
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ frontsegP(X1,X2)
    | ~ frontsegP(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_319]) ).

cnf(c_0_451,plain,
    ( X1 = X2
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ leq(X1,X2)
    | ~ leq(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_320]) ).

cnf(c_0_452,plain,
    ( rearsegP(X1,X2)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | app(X3,X2) != X1 ),
    inference(split_conjunct,[status(thm)],[c_0_321]) ).

cnf(c_0_453,plain,
    ( frontsegP(X1,X2)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | app(X2,X3) != X1 ),
    inference(split_conjunct,[status(thm)],[c_0_322]) ).

cnf(c_0_454,plain,
    ( ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ gt(X1,X2)
    | ~ gt(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_323]) ).

cnf(c_0_455,plain,
    ( ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ lt(X1,X2)
    | ~ lt(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_324]) ).

cnf(c_0_456,plain,
    ( X1 = X2
    | lt(X1,X2)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ leq(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_325]) ).

cnf(c_0_457,plain,
    ( X1 = X2
    | lt(X1,X2)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ leq(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_326]) ).

cnf(c_0_458,plain,
    ( strictorderedP(X1)
    | ~ ssList(X1)
    | ~ lt(skaf69(X1),skaf70(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_327]) ).

cnf(c_0_459,plain,
    ( totalorderedP(X1)
    | ~ ssList(X1)
    | ~ leq(skaf64(X1),skaf65(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_328]) ).

cnf(c_0_460,plain,
    ( strictorderP(X1)
    | ~ ssList(X1)
    | ~ lt(skaf60(X1),skaf59(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_329]) ).

cnf(c_0_461,plain,
    ( strictorderP(X1)
    | ~ ssList(X1)
    | ~ lt(skaf59(X1),skaf60(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_330]) ).

cnf(c_0_462,plain,
    ( totalorderP(X1)
    | ~ ssList(X1)
    | ~ leq(skaf55(X1),skaf54(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_331]) ).

cnf(c_0_463,plain,
    ( totalorderP(X1)
    | ~ ssList(X1)
    | ~ leq(skaf54(X1),skaf55(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_332]) ).

cnf(c_0_464,plain,
    ( leq(X1,X2)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ lt(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_333]) ).

cnf(c_0_465,plain,
    ( lt(X1,X2)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ gt(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_334]) ).

cnf(c_0_466,plain,
    ( gt(X1,X2)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ lt(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_335]) ).

cnf(c_0_467,plain,
    ( leq(X1,X2)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ geq(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_336]) ).

cnf(c_0_468,plain,
    ( geq(X1,X2)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ leq(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_337]) ).

cnf(c_0_469,plain,
    ( hd(app(X1,X2)) = hd(X1)
    | nil = X1
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_338]) ).

cnf(c_0_470,plain,
    ( strictorderedP(cons(X1,X2))
    | ~ ssItem(X1)
    | ~ ssList(X2)
    | nil != X2 ),
    inference(split_conjunct,[status(thm)],[c_0_339]) ).

cnf(c_0_471,plain,
    ( totalorderedP(cons(X1,X2))
    | ~ ssItem(X1)
    | ~ ssList(X2)
    | nil != X2 ),
    inference(split_conjunct,[status(thm)],[c_0_340]) ).

cnf(c_0_472,plain,
    ( nil = X1
    | X1 = X2
    | nil = X2
    | ~ ssList(X2)
    | ~ ssList(X1)
    | hd(X1) != hd(X2)
    | tl(X1) != tl(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_341]) ).

cnf(c_0_473,plain,
    ( tl(cons(X1,X2)) = X2
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_342]) ).

cnf(c_0_474,plain,
    ( hd(cons(X1,X2)) = X1
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_343]) ).

cnf(c_0_475,plain,
    ( ssList(app(X1,X2))
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_344]) ).

cnf(c_0_476,plain,
    ( ssList(cons(X1,X2))
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_345]) ).

cnf(c_0_477,plain,
    ( ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ lt(X1,X2)
    | X1 != X2 ),
    inference(split_conjunct,[status(thm)],[c_0_346]) ).

cnf(c_0_478,plain,
    ( ~ ssList(X1)
    | ~ ssList(X2)
    | ~ neq(X1,X2)
    | X1 != X2 ),
    inference(split_conjunct,[status(thm)],[c_0_347]) ).

cnf(c_0_479,plain,
    ( ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ neq(X1,X2)
    | X1 != X2 ),
    inference(split_conjunct,[status(thm)],[c_0_348]) ).

cnf(c_0_480,plain,
    ( singletonP(X1)
    | ~ ssList(X1)
    | ~ ssItem(X2)
    | cons(X2,nil) != X1 ),
    inference(split_conjunct,[status(thm)],[c_0_349]) ).

cnf(c_0_481,plain,
    ( nil = X1
    | ~ ssList(X1)
    | ~ ssList(X2)
    | app(X1,X2) != nil ),
    inference(split_conjunct,[status(thm)],[c_0_350]) ).

cnf(c_0_482,plain,
    ( nil = X1
    | ~ ssList(X2)
    | ~ ssList(X1)
    | app(X2,X1) != nil ),
    inference(split_conjunct,[status(thm)],[c_0_351]) ).

cnf(c_0_483,plain,
    ( leq(skaf50(X1),skaf49(X1))
    | cyclefreeP(X1)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_352]) ).

cnf(c_0_484,plain,
    ( leq(skaf49(X1),skaf50(X1))
    | cyclefreeP(X1)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_353]) ).

cnf(c_0_485,plain,
    ( ~ ssList(X1)
    | ~ ssItem(X2)
    | cons(X2,X1) != X1 ),
    inference(split_conjunct,[status(thm)],[c_0_354]) ).

cnf(c_0_486,plain,
    ( ~ ssList(X1)
    | ~ ssItem(X2)
    | cons(X2,X1) != nil ),
    inference(split_conjunct,[status(thm)],[c_0_355]) ).

cnf(c_0_487,plain,
    ( nil = X1
    | cons(hd(X1),tl(X1)) = X1
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_356]) ).

cnf(c_0_488,plain,
    ( nil = X1
    | cons(skaf83(X1),skaf82(X1)) = X1
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_357]) ).

cnf(c_0_489,plain,
    ( equalelemsP(cons(X1,nil))
    | ~ ssItem(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_358]) ).

cnf(c_0_490,plain,
    ( duplicatefreeP(cons(X1,nil))
    | ~ ssItem(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_359]) ).

cnf(c_0_491,plain,
    ( strictorderedP(cons(X1,nil))
    | ~ ssItem(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_360]) ).

cnf(c_0_492,plain,
    ( totalorderedP(cons(X1,nil))
    | ~ ssItem(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_361]) ).

cnf(c_0_493,plain,
    ( strictorderP(cons(X1,nil))
    | ~ ssItem(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_362]) ).

cnf(c_0_494,plain,
    ( totalorderP(cons(X1,nil))
    | ~ ssItem(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_363]) ).

cnf(c_0_495,plain,
    ( cyclefreeP(cons(X1,nil))
    | ~ ssItem(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_364]) ).

cnf(c_0_496,plain,
    ( cons(skaf44(X1),nil) = X1
    | ~ ssList(X1)
    | ~ singletonP(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_365]) ).

cnf(c_0_497,plain,
    ( app(X1,X2) = nil
    | ~ ssList(X1)
    | ~ ssList(X2)
    | nil != X2
    | nil != X1 ),
    inference(split_conjunct,[status(thm)],[c_0_366]) ).

cnf(c_0_498,plain,
    ( X1 = X2
    | neq(X1,X2)
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_367]) ).

cnf(c_0_499,plain,
    ( X1 = X2
    | neq(X1,X2)
    | ~ ssItem(X1)
    | ~ ssItem(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_368]) ).

cnf(c_0_500,plain,
    ( ~ ssItem(X1)
    | ~ lt(X1,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_369]) ).

cnf(c_0_501,plain,
    ( nil = X1
    | ~ ssList(X1)
    | ~ segmentP(nil,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_370]) ).

cnf(c_0_502,plain,
    ( nil = X1
    | ~ ssList(X1)
    | ~ rearsegP(nil,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_371]) ).

cnf(c_0_503,plain,
    ( nil = X1
    | ~ ssList(X1)
    | ~ frontsegP(nil,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_372]) ).

cnf(c_0_504,plain,
    ( ~ ssItem(X1)
    | ~ memberP(nil,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_373]) ).

cnf(c_0_505,plain,
    ( equalelemsP(X1)
    | ~ ssList(X1)
    | skaf79(X1) != skaf78(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_374]) ).

cnf(c_0_506,plain,
    ( segmentP(nil,X1)
    | ~ ssList(X1)
    | nil != X1 ),
    inference(split_conjunct,[status(thm)],[c_0_375]) ).

cnf(c_0_507,plain,
    ( rearsegP(nil,X1)
    | ~ ssList(X1)
    | nil != X1 ),
    inference(split_conjunct,[status(thm)],[c_0_376]) ).

cnf(c_0_508,plain,
    ( frontsegP(nil,X1)
    | ~ ssList(X1)
    | nil != X1 ),
    inference(split_conjunct,[status(thm)],[c_0_377]) ).

cnf(c_0_509,plain,
    ( geq(X1,X1)
    | ~ ssItem(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_378]) ).

cnf(c_0_510,plain,
    ( segmentP(X1,X1)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_379]) ).

cnf(c_0_511,plain,
    ( rearsegP(X1,X1)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_380]) ).

cnf(c_0_512,plain,
    ( frontsegP(X1,X1)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_381]) ).

cnf(c_0_513,plain,
    ( leq(X1,X1)
    | ~ ssItem(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_382]) ).

cnf(c_0_514,plain,
    ( app(X1,nil) = X1
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_383]) ).

cnf(c_0_515,plain,
    ( app(nil,X1) = X1
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_384]) ).

cnf(c_0_516,plain,
    ( segmentP(X1,nil)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_385]) ).

cnf(c_0_517,plain,
    ( rearsegP(X1,nil)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_386]) ).

cnf(c_0_518,plain,
    ( frontsegP(X1,nil)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_387]) ).

cnf(c_0_519,plain,
    ( nil = X1
    | ssList(tl(X1))
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_388]) ).

cnf(c_0_520,plain,
    ( nil = X1
    | ssItem(hd(X1))
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_389]) ).

cnf(c_0_521,plain,
    ( nil = X1
    | ssList(tl(X1))
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_390]) ).

cnf(c_0_522,plain,
    ( nil = X1
    | ssItem(hd(X1))
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_391]) ).

cnf(c_0_523,plain,
    ( ssItem(X1)
    | duplicatefreeP(X2)
    | ~ ssList(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_392]) ).

cnf(c_0_524,plain,
    ( ~ ssList(X1)
    | ~ cyclefreeP(X1)
    | ~ ssItem(X2)
    | ~ ssItem(X3)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
    | ~ leq(X3,X2)
    | ~ leq(X2,X3) ),
    c_0_393,
    [final] ).

cnf(c_0_525,plain,
    ( lt(X1,X2)
    | lt(X2,X1)
    | ~ ssList(X3)
    | ~ strictorderP(X3)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X2,X5)),cons(X1,X6)) != X3 ),
    c_0_394,
    [final] ).

cnf(c_0_526,plain,
    ( leq(X1,X2)
    | leq(X2,X1)
    | ~ ssList(X3)
    | ~ totalorderP(X3)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X2,X5)),cons(X1,X6)) != X3 ),
    c_0_395,
    [final] ).

cnf(c_0_527,plain,
    ( lt(X1,X2)
    | ~ ssList(X3)
    | ~ strictorderedP(X3)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X1,X5)),cons(X2,X6)) != X3 ),
    c_0_396,
    [final] ).

cnf(c_0_528,plain,
    ( leq(X1,X2)
    | ~ ssList(X3)
    | ~ totalorderedP(X3)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X1,X5)),cons(X2,X6)) != X3 ),
    c_0_397,
    [final] ).

cnf(c_0_529,plain,
    ( ~ ssList(X1)
    | ~ duplicatefreeP(X1)
    | ~ ssItem(X2)
    | ~ ssList(X3)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | app(app(X3,cons(X2,X4)),cons(X2,X5)) != X1 ),
    c_0_398,
    [final] ).

cnf(c_0_530,plain,
    ( app(app(skaf75(X1),cons(skaf74(X1),skaf76(X1))),cons(skaf74(X1),skaf77(X1))) = X1
    | duplicatefreeP(X1)
    | ~ ssList(X1) ),
    c_0_399,
    [final] ).

cnf(c_0_531,plain,
    ( app(app(skaf71(X1),cons(skaf69(X1),skaf72(X1))),cons(skaf70(X1),skaf73(X1))) = X1
    | strictorderedP(X1)
    | ~ ssList(X1) ),
    c_0_400,
    [final] ).

cnf(c_0_532,plain,
    ( app(app(skaf66(X1),cons(skaf64(X1),skaf67(X1))),cons(skaf65(X1),skaf68(X1))) = X1
    | totalorderedP(X1)
    | ~ ssList(X1) ),
    c_0_401,
    [final] ).

cnf(c_0_533,plain,
    ( app(app(skaf61(X1),cons(skaf59(X1),skaf62(X1))),cons(skaf60(X1),skaf63(X1))) = X1
    | strictorderP(X1)
    | ~ ssList(X1) ),
    c_0_402,
    [final] ).

cnf(c_0_534,plain,
    ( app(app(skaf56(X1),cons(skaf54(X1),skaf57(X1))),cons(skaf55(X1),skaf58(X1))) = X1
    | totalorderP(X1)
    | ~ ssList(X1) ),
    c_0_403,
    [final] ).

cnf(c_0_535,plain,
    ( app(app(skaf51(X1),cons(skaf49(X1),skaf52(X1))),cons(skaf50(X1),skaf53(X1))) = X1
    | cyclefreeP(X1)
    | ~ ssList(X1) ),
    c_0_404,
    [final] ).

cnf(c_0_536,plain,
    ( X1 = X2
    | ~ ssList(X3)
    | ~ equalelemsP(X3)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | app(X4,cons(X1,cons(X2,X5))) != X3 ),
    c_0_405,
    [final] ).

cnf(c_0_537,plain,
    ( app(skaf80(X1),cons(skaf78(X1),cons(skaf79(X1),skaf81(X1)))) = X1
    | equalelemsP(X1)
    | ~ ssList(X1) ),
    c_0_406,
    [final] ).

cnf(c_0_538,plain,
    ( app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ segmentP(X1,X2) ),
    c_0_407,
    [final] ).

cnf(c_0_539,plain,
    ( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
    | ~ ssList(X1)
    | ~ ssItem(X2)
    | ~ memberP(X1,X2) ),
    c_0_408,
    [final] ).

cnf(c_0_540,plain,
    ( frontsegP(X1,X2)
    | ~ ssItem(X3)
    | ~ ssItem(X4)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ frontsegP(cons(X3,X1),cons(X4,X2)) ),
    c_0_409,
    [final] ).

cnf(c_0_541,plain,
    ( segmentP(app(app(X1,X2),X3),X4)
    | ~ ssList(X2)
    | ~ ssList(X4)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ segmentP(X2,X4) ),
    c_0_410,
    [final] ).

cnf(c_0_542,plain,
    ( X1 = X2
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ ssList(X3)
    | ~ ssList(X4)
    | ~ frontsegP(cons(X1,X3),cons(X2,X4)) ),
    c_0_411,
    [final] ).

cnf(c_0_543,plain,
    ( frontsegP(cons(X1,X2),cons(X3,X4))
    | ~ ssItem(X1)
    | ~ ssItem(X3)
    | ~ ssList(X2)
    | ~ ssList(X4)
    | X1 != X3
    | ~ frontsegP(X2,X4) ),
    c_0_412,
    [final] ).

cnf(c_0_544,plain,
    ( memberP(X1,X2)
    | memberP(X3,X2)
    | ~ ssItem(X2)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ memberP(app(X1,X3),X2) ),
    c_0_413,
    [final] ).

cnf(c_0_545,plain,
    ( segmentP(X1,X2)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | ~ ssList(X4)
    | app(app(X3,X2),X4) != X1 ),
    c_0_414,
    [final] ).

cnf(c_0_546,plain,
    ( memberP(X1,X2)
    | ~ ssList(X1)
    | ~ ssItem(X2)
    | ~ ssList(X3)
    | ~ ssList(X4)
    | app(X3,cons(X2,X4)) != X1 ),
    c_0_415,
    [final] ).

cnf(c_0_547,plain,
    ( X1 = X2
    | memberP(X3,X1)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ ssList(X3)
    | ~ memberP(cons(X2,X3),X1) ),
    c_0_416,
    [final] ).

cnf(c_0_548,plain,
    ( app(app(X1,X2),X3) = app(X1,app(X2,X3))
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X3) ),
    c_0_417,
    [final] ).

cnf(c_0_549,plain,
    ( app(cons(X1,X2),X3) = cons(X1,app(X2,X3))
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    c_0_418,
    [final] ).

cnf(c_0_550,plain,
    ( nil = X1
    | totalorderedP(cons(X2,X1))
    | ~ ssItem(X2)
    | ~ ssList(X1)
    | ~ totalorderedP(X1)
    | ~ leq(X2,hd(X1)) ),
    c_0_419,
    [final] ).

cnf(c_0_551,plain,
    ( nil = X1
    | strictorderedP(cons(X2,X1))
    | ~ ssItem(X2)
    | ~ ssList(X1)
    | ~ strictorderedP(X1)
    | ~ lt(X2,hd(X1)) ),
    c_0_420,
    [final] ).

cnf(c_0_552,plain,
    ( rearsegP(app(X1,X2),X3)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | ~ rearsegP(X2,X3) ),
    c_0_421,
    [final] ).

cnf(c_0_553,plain,
    ( frontsegP(app(X1,X2),X3)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ frontsegP(X1,X3) ),
    c_0_422,
    [final] ).

cnf(c_0_554,plain,
    ( memberP(cons(X1,X2),X3)
    | ~ ssItem(X3)
    | ~ ssItem(X1)
    | ~ ssList(X2)
    | ~ memberP(X2,X3) ),
    c_0_423,
    [final] ).

cnf(c_0_555,plain,
    ( memberP(app(X1,X2),X3)
    | ~ ssItem(X3)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ memberP(X1,X3) ),
    c_0_424,
    [final] ).

cnf(c_0_556,plain,
    ( memberP(app(X1,X2),X3)
    | ~ ssItem(X3)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ memberP(X2,X3) ),
    c_0_425,
    [final] ).

cnf(c_0_557,plain,
    ( nil = X1
    | lt(X2,hd(X1))
    | ~ ssItem(X2)
    | ~ ssList(X1)
    | ~ strictorderedP(cons(X2,X1)) ),
    c_0_426,
    [final] ).

cnf(c_0_558,plain,
    ( nil = X1
    | leq(X2,hd(X1))
    | ~ ssItem(X2)
    | ~ ssList(X1)
    | ~ totalorderedP(cons(X2,X1)) ),
    c_0_427,
    [final] ).

cnf(c_0_559,plain,
    ( gt(X1,X2)
    | ~ ssItem(X1)
    | ~ ssItem(X3)
    | ~ ssItem(X2)
    | ~ gt(X3,X2)
    | ~ gt(X1,X3) ),
    c_0_428,
    [final] ).

cnf(c_0_560,plain,
    ( lt(X1,X2)
    | ~ ssItem(X1)
    | ~ ssItem(X3)
    | ~ ssItem(X2)
    | ~ lt(X3,X2)
    | ~ leq(X1,X3) ),
    c_0_429,
    [final] ).

cnf(c_0_561,plain,
    ( geq(X1,X2)
    | ~ ssItem(X1)
    | ~ ssItem(X3)
    | ~ ssItem(X2)
    | ~ geq(X3,X2)
    | ~ geq(X1,X3) ),
    c_0_430,
    [final] ).

cnf(c_0_562,plain,
    ( segmentP(X1,X2)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ segmentP(X3,X2)
    | ~ segmentP(X1,X3) ),
    c_0_431,
    [final] ).

cnf(c_0_563,plain,
    ( rearsegP(X1,X2)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ rearsegP(X3,X2)
    | ~ rearsegP(X1,X3) ),
    c_0_432,
    [final] ).

cnf(c_0_564,plain,
    ( frontsegP(X1,X2)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ frontsegP(X3,X2)
    | ~ frontsegP(X1,X3) ),
    c_0_433,
    [final] ).

cnf(c_0_565,plain,
    ( lt(X1,X2)
    | ~ ssItem(X1)
    | ~ ssItem(X3)
    | ~ ssItem(X2)
    | ~ lt(X3,X2)
    | ~ lt(X1,X3) ),
    c_0_434,
    [final] ).

cnf(c_0_566,plain,
    ( leq(X1,X2)
    | ~ ssItem(X1)
    | ~ ssItem(X3)
    | ~ ssItem(X2)
    | ~ leq(X3,X2)
    | ~ leq(X1,X3) ),
    c_0_435,
    [final] ).

cnf(c_0_567,plain,
    ( app(skaf46(X1,X2),X2) = X1
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ rearsegP(X1,X2) ),
    c_0_436,
    [final] ).

cnf(c_0_568,plain,
    ( app(X1,skaf45(X2,X1)) = X2
    | ~ ssList(X2)
    | ~ ssList(X1)
    | ~ frontsegP(X2,X1) ),
    c_0_437,
    [final] ).

cnf(c_0_569,plain,
    ( X1 = X2
    | ~ ssList(X3)
    | ~ ssList(X4)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | cons(X1,X3) != cons(X2,X4) ),
    c_0_438,
    [final] ).

cnf(c_0_570,plain,
    ( X1 = X2
    | ~ ssList(X2)
    | ~ ssList(X1)
    | ~ ssItem(X3)
    | ~ ssItem(X4)
    | cons(X3,X2) != cons(X4,X1) ),
    c_0_439,
    [final] ).

cnf(c_0_571,plain,
    ( nil = X1
    | strictorderedP(X1)
    | ~ ssItem(X2)
    | ~ ssList(X1)
    | ~ strictorderedP(cons(X2,X1)) ),
    c_0_440,
    [final] ).

cnf(c_0_572,plain,
    ( nil = X1
    | totalorderedP(X1)
    | ~ ssItem(X2)
    | ~ ssList(X1)
    | ~ totalorderedP(cons(X2,X1)) ),
    c_0_441,
    [final] ).

cnf(c_0_573,plain,
    ( X1 = X2
    | ~ ssList(X2)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | app(X3,X1) != app(X3,X2) ),
    c_0_442,
    [final] ).

cnf(c_0_574,plain,
    ( X1 = X2
    | ~ ssList(X2)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | app(X1,X3) != app(X2,X3) ),
    c_0_443,
    [final] ).

cnf(c_0_575,plain,
    ( tl(app(X1,X2)) = app(tl(X1),X2)
    | nil = X1
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    c_0_444,
    [final] ).

cnf(c_0_576,plain,
    ( memberP(cons(X1,X2),X3)
    | ~ ssItem(X3)
    | ~ ssItem(X1)
    | ~ ssList(X2)
    | X3 != X1 ),
    c_0_445,
    [final] ).

cnf(c_0_577,plain,
    ( app(cons(X1,nil),X2) = cons(X1,X2)
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    c_0_446,
    [final] ).

cnf(c_0_578,plain,
    ( X1 = X2
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ geq(X1,X2)
    | ~ geq(X2,X1) ),
    c_0_447,
    [final] ).

cnf(c_0_579,plain,
    ( X1 = X2
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ segmentP(X1,X2)
    | ~ segmentP(X2,X1) ),
    c_0_448,
    [final] ).

cnf(c_0_580,plain,
    ( X1 = X2
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ rearsegP(X1,X2)
    | ~ rearsegP(X2,X1) ),
    c_0_449,
    [final] ).

cnf(c_0_581,plain,
    ( X1 = X2
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ frontsegP(X1,X2)
    | ~ frontsegP(X2,X1) ),
    c_0_450,
    [final] ).

cnf(c_0_582,plain,
    ( X1 = X2
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ leq(X1,X2)
    | ~ leq(X2,X1) ),
    c_0_451,
    [final] ).

cnf(c_0_583,plain,
    ( rearsegP(X1,X2)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | app(X3,X2) != X1 ),
    c_0_452,
    [final] ).

cnf(c_0_584,plain,
    ( frontsegP(X1,X2)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | app(X2,X3) != X1 ),
    c_0_453,
    [final] ).

cnf(c_0_585,plain,
    ( ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ gt(X1,X2)
    | ~ gt(X2,X1) ),
    c_0_454,
    [final] ).

cnf(c_0_586,plain,
    ( ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ lt(X1,X2)
    | ~ lt(X2,X1) ),
    c_0_455,
    [final] ).

cnf(c_0_587,plain,
    ( X1 = X2
    | lt(X1,X2)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ leq(X1,X2) ),
    c_0_456,
    [final] ).

cnf(c_0_588,plain,
    ( X1 = X2
    | lt(X1,X2)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ leq(X1,X2) ),
    c_0_457,
    [final] ).

cnf(c_0_589,plain,
    ( strictorderedP(X1)
    | ~ ssList(X1)
    | ~ lt(skaf69(X1),skaf70(X1)) ),
    c_0_458,
    [final] ).

cnf(c_0_590,plain,
    ( totalorderedP(X1)
    | ~ ssList(X1)
    | ~ leq(skaf64(X1),skaf65(X1)) ),
    c_0_459,
    [final] ).

cnf(c_0_591,plain,
    ( strictorderP(X1)
    | ~ ssList(X1)
    | ~ lt(skaf60(X1),skaf59(X1)) ),
    c_0_460,
    [final] ).

cnf(c_0_592,plain,
    ( strictorderP(X1)
    | ~ ssList(X1)
    | ~ lt(skaf59(X1),skaf60(X1)) ),
    c_0_461,
    [final] ).

cnf(c_0_593,plain,
    ( totalorderP(X1)
    | ~ ssList(X1)
    | ~ leq(skaf55(X1),skaf54(X1)) ),
    c_0_462,
    [final] ).

cnf(c_0_594,plain,
    ( totalorderP(X1)
    | ~ ssList(X1)
    | ~ leq(skaf54(X1),skaf55(X1)) ),
    c_0_463,
    [final] ).

cnf(c_0_595,plain,
    ( leq(X1,X2)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ lt(X1,X2) ),
    c_0_464,
    [final] ).

cnf(c_0_596,plain,
    ( lt(X1,X2)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ gt(X2,X1) ),
    c_0_465,
    [final] ).

cnf(c_0_597,plain,
    ( gt(X1,X2)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ lt(X2,X1) ),
    c_0_466,
    [final] ).

cnf(c_0_598,plain,
    ( leq(X1,X2)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ geq(X2,X1) ),
    c_0_467,
    [final] ).

cnf(c_0_599,plain,
    ( geq(X1,X2)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ leq(X2,X1) ),
    c_0_468,
    [final] ).

cnf(c_0_600,plain,
    ( hd(app(X1,X2)) = hd(X1)
    | nil = X1
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    c_0_469,
    [final] ).

cnf(c_0_601,plain,
    ( strictorderedP(cons(X1,X2))
    | ~ ssItem(X1)
    | ~ ssList(X2)
    | nil != X2 ),
    c_0_470,
    [final] ).

cnf(c_0_602,plain,
    ( totalorderedP(cons(X1,X2))
    | ~ ssItem(X1)
    | ~ ssList(X2)
    | nil != X2 ),
    c_0_471,
    [final] ).

cnf(c_0_603,plain,
    ( nil = X1
    | X1 = X2
    | nil = X2
    | ~ ssList(X2)
    | ~ ssList(X1)
    | hd(X1) != hd(X2)
    | tl(X1) != tl(X2) ),
    c_0_472,
    [final] ).

cnf(c_0_604,plain,
    ( tl(cons(X1,X2)) = X2
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    c_0_473,
    [final] ).

cnf(c_0_605,plain,
    ( hd(cons(X1,X2)) = X1
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    c_0_474,
    [final] ).

cnf(c_0_606,plain,
    ( ssList(app(X1,X2))
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    c_0_475,
    [final] ).

cnf(c_0_607,plain,
    ( ssList(cons(X1,X2))
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    c_0_476,
    [final] ).

cnf(c_0_608,plain,
    ( ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ lt(X1,X2)
    | X1 != X2 ),
    c_0_477,
    [final] ).

cnf(c_0_609,plain,
    ( ~ ssList(X1)
    | ~ ssList(X2)
    | ~ neq(X1,X2)
    | X1 != X2 ),
    c_0_478,
    [final] ).

cnf(c_0_610,plain,
    ( ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ neq(X1,X2)
    | X1 != X2 ),
    c_0_479,
    [final] ).

cnf(c_0_611,plain,
    ( singletonP(X1)
    | ~ ssList(X1)
    | ~ ssItem(X2)
    | cons(X2,nil) != X1 ),
    c_0_480,
    [final] ).

cnf(c_0_612,plain,
    ( nil = X1
    | ~ ssList(X1)
    | ~ ssList(X2)
    | app(X1,X2) != nil ),
    c_0_481,
    [final] ).

cnf(c_0_613,plain,
    ( nil = X1
    | ~ ssList(X2)
    | ~ ssList(X1)
    | app(X2,X1) != nil ),
    c_0_482,
    [final] ).

cnf(c_0_614,plain,
    ( leq(skaf50(X1),skaf49(X1))
    | cyclefreeP(X1)
    | ~ ssList(X1) ),
    c_0_483,
    [final] ).

cnf(c_0_615,plain,
    ( leq(skaf49(X1),skaf50(X1))
    | cyclefreeP(X1)
    | ~ ssList(X1) ),
    c_0_484,
    [final] ).

cnf(c_0_616,plain,
    ( ~ ssList(X1)
    | ~ ssItem(X2)
    | cons(X2,X1) != X1 ),
    c_0_485,
    [final] ).

cnf(c_0_617,plain,
    ( ~ ssList(X1)
    | ~ ssItem(X2)
    | cons(X2,X1) != nil ),
    c_0_486,
    [final] ).

cnf(c_0_618,plain,
    ( nil = X1
    | cons(hd(X1),tl(X1)) = X1
    | ~ ssList(X1) ),
    c_0_487,
    [final] ).

cnf(c_0_619,plain,
    ( nil = X1
    | cons(skaf83(X1),skaf82(X1)) = X1
    | ~ ssList(X1) ),
    c_0_488,
    [final] ).

cnf(c_0_620,plain,
    ( equalelemsP(cons(X1,nil))
    | ~ ssItem(X1) ),
    c_0_489,
    [final] ).

cnf(c_0_621,plain,
    ( duplicatefreeP(cons(X1,nil))
    | ~ ssItem(X1) ),
    c_0_490,
    [final] ).

cnf(c_0_622,plain,
    ( strictorderedP(cons(X1,nil))
    | ~ ssItem(X1) ),
    c_0_491,
    [final] ).

cnf(c_0_623,plain,
    ( totalorderedP(cons(X1,nil))
    | ~ ssItem(X1) ),
    c_0_492,
    [final] ).

cnf(c_0_624,plain,
    ( strictorderP(cons(X1,nil))
    | ~ ssItem(X1) ),
    c_0_493,
    [final] ).

cnf(c_0_625,plain,
    ( totalorderP(cons(X1,nil))
    | ~ ssItem(X1) ),
    c_0_494,
    [final] ).

cnf(c_0_626,plain,
    ( cyclefreeP(cons(X1,nil))
    | ~ ssItem(X1) ),
    c_0_495,
    [final] ).

cnf(c_0_627,plain,
    ( cons(skaf44(X1),nil) = X1
    | ~ ssList(X1)
    | ~ singletonP(X1) ),
    c_0_496,
    [final] ).

cnf(c_0_628,plain,
    ( app(X1,X2) = nil
    | ~ ssList(X1)
    | ~ ssList(X2)
    | nil != X2
    | nil != X1 ),
    c_0_497,
    [final] ).

cnf(c_0_629,plain,
    ( X1 = X2
    | neq(X1,X2)
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    c_0_498,
    [final] ).

cnf(c_0_630,plain,
    ( X1 = X2
    | neq(X1,X2)
    | ~ ssItem(X1)
    | ~ ssItem(X2) ),
    c_0_499,
    [final] ).

cnf(c_0_631,plain,
    ( ~ ssItem(X1)
    | ~ lt(X1,X1) ),
    c_0_500,
    [final] ).

cnf(c_0_632,plain,
    ( nil = X1
    | ~ ssList(X1)
    | ~ segmentP(nil,X1) ),
    c_0_501,
    [final] ).

cnf(c_0_633,plain,
    ( nil = X1
    | ~ ssList(X1)
    | ~ rearsegP(nil,X1) ),
    c_0_502,
    [final] ).

cnf(c_0_634,plain,
    ( nil = X1
    | ~ ssList(X1)
    | ~ frontsegP(nil,X1) ),
    c_0_503,
    [final] ).

cnf(c_0_635,plain,
    ( ~ ssItem(X1)
    | ~ memberP(nil,X1) ),
    c_0_504,
    [final] ).

cnf(c_0_636,plain,
    ( equalelemsP(X1)
    | ~ ssList(X1)
    | skaf79(X1) != skaf78(X1) ),
    c_0_505,
    [final] ).

cnf(c_0_637,plain,
    ( segmentP(nil,X1)
    | ~ ssList(X1)
    | nil != X1 ),
    c_0_506,
    [final] ).

cnf(c_0_638,plain,
    ( rearsegP(nil,X1)
    | ~ ssList(X1)
    | nil != X1 ),
    c_0_507,
    [final] ).

cnf(c_0_639,plain,
    ( frontsegP(nil,X1)
    | ~ ssList(X1)
    | nil != X1 ),
    c_0_508,
    [final] ).

cnf(c_0_640,plain,
    ( geq(X1,X1)
    | ~ ssItem(X1) ),
    c_0_509,
    [final] ).

cnf(c_0_641,plain,
    ( segmentP(X1,X1)
    | ~ ssList(X1) ),
    c_0_510,
    [final] ).

cnf(c_0_642,plain,
    ( rearsegP(X1,X1)
    | ~ ssList(X1) ),
    c_0_511,
    [final] ).

cnf(c_0_643,plain,
    ( frontsegP(X1,X1)
    | ~ ssList(X1) ),
    c_0_512,
    [final] ).

cnf(c_0_644,plain,
    ( leq(X1,X1)
    | ~ ssItem(X1) ),
    c_0_513,
    [final] ).

cnf(c_0_645,plain,
    ( app(X1,nil) = X1
    | ~ ssList(X1) ),
    c_0_514,
    [final] ).

cnf(c_0_646,plain,
    ( app(nil,X1) = X1
    | ~ ssList(X1) ),
    c_0_515,
    [final] ).

cnf(c_0_647,plain,
    ( segmentP(X1,nil)
    | ~ ssList(X1) ),
    c_0_516,
    [final] ).

cnf(c_0_648,plain,
    ( rearsegP(X1,nil)
    | ~ ssList(X1) ),
    c_0_517,
    [final] ).

cnf(c_0_649,plain,
    ( frontsegP(X1,nil)
    | ~ ssList(X1) ),
    c_0_518,
    [final] ).

cnf(c_0_650,plain,
    ( nil = X1
    | ssList(tl(X1))
    | ~ ssList(X1) ),
    c_0_519,
    [final] ).

cnf(c_0_651,plain,
    ( nil = X1
    | ssItem(hd(X1))
    | ~ ssList(X1) ),
    c_0_520,
    [final] ).

cnf(c_0_652,plain,
    ( nil = X1
    | ssList(tl(X1))
    | ~ ssList(X1) ),
    c_0_521,
    [final] ).

cnf(c_0_653,plain,
    ( nil = X1
    | ssItem(hd(X1))
    | ~ ssList(X1) ),
    c_0_522,
    [final] ).

cnf(c_0_654,plain,
    ( ssItem(X1)
    | duplicatefreeP(X2)
    | ~ ssList(X2) ),
    c_0_523,
    [final] ).

% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_524_0,axiom,
    ( ~ ssList(X1)
    | ~ cyclefreeP(X1)
    | ~ ssItem(X2)
    | ~ ssItem(X3)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
    | ~ leq(X3,X2)
    | ~ leq(X2,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_524]) ).

cnf(c_0_524_1,axiom,
    ( ~ cyclefreeP(X1)
    | ~ ssList(X1)
    | ~ ssItem(X2)
    | ~ ssItem(X3)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
    | ~ leq(X3,X2)
    | ~ leq(X2,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_524]) ).

cnf(c_0_524_2,axiom,
    ( ~ ssItem(X2)
    | ~ cyclefreeP(X1)
    | ~ ssList(X1)
    | ~ ssItem(X3)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
    | ~ leq(X3,X2)
    | ~ leq(X2,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_524]) ).

cnf(c_0_524_3,axiom,
    ( ~ ssItem(X3)
    | ~ ssItem(X2)
    | ~ cyclefreeP(X1)
    | ~ ssList(X1)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
    | ~ leq(X3,X2)
    | ~ leq(X2,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_524]) ).

cnf(c_0_524_4,axiom,
    ( ~ ssList(X4)
    | ~ ssItem(X3)
    | ~ ssItem(X2)
    | ~ cyclefreeP(X1)
    | ~ ssList(X1)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
    | ~ leq(X3,X2)
    | ~ leq(X2,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_524]) ).

cnf(c_0_524_5,axiom,
    ( ~ ssList(X5)
    | ~ ssList(X4)
    | ~ ssItem(X3)
    | ~ ssItem(X2)
    | ~ cyclefreeP(X1)
    | ~ ssList(X1)
    | ~ ssList(X6)
    | app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
    | ~ leq(X3,X2)
    | ~ leq(X2,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_524]) ).

cnf(c_0_524_6,axiom,
    ( ~ ssList(X6)
    | ~ ssList(X5)
    | ~ ssList(X4)
    | ~ ssItem(X3)
    | ~ ssItem(X2)
    | ~ cyclefreeP(X1)
    | ~ ssList(X1)
    | app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
    | ~ leq(X3,X2)
    | ~ leq(X2,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_524]) ).

cnf(c_0_524_7,axiom,
    ( app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
    | ~ ssList(X6)
    | ~ ssList(X5)
    | ~ ssList(X4)
    | ~ ssItem(X3)
    | ~ ssItem(X2)
    | ~ cyclefreeP(X1)
    | ~ ssList(X1)
    | ~ leq(X3,X2)
    | ~ leq(X2,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_524]) ).

cnf(c_0_524_8,axiom,
    ( ~ leq(X3,X2)
    | app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
    | ~ ssList(X6)
    | ~ ssList(X5)
    | ~ ssList(X4)
    | ~ ssItem(X3)
    | ~ ssItem(X2)
    | ~ cyclefreeP(X1)
    | ~ ssList(X1)
    | ~ leq(X2,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_524]) ).

cnf(c_0_524_9,axiom,
    ( ~ leq(X2,X3)
    | ~ leq(X3,X2)
    | app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
    | ~ ssList(X6)
    | ~ ssList(X5)
    | ~ ssList(X4)
    | ~ ssItem(X3)
    | ~ ssItem(X2)
    | ~ cyclefreeP(X1)
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_524]) ).

cnf(c_0_525_0,axiom,
    ( lt(X1,X2)
    | lt(X2,X1)
    | ~ ssList(X3)
    | ~ strictorderP(X3)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X2,X5)),cons(X1,X6)) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_525]) ).

cnf(c_0_525_1,axiom,
    ( lt(X2,X1)
    | lt(X1,X2)
    | ~ ssList(X3)
    | ~ strictorderP(X3)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X2,X5)),cons(X1,X6)) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_525]) ).

cnf(c_0_525_2,axiom,
    ( ~ ssList(X3)
    | lt(X2,X1)
    | lt(X1,X2)
    | ~ strictorderP(X3)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X2,X5)),cons(X1,X6)) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_525]) ).

cnf(c_0_525_3,axiom,
    ( ~ strictorderP(X3)
    | ~ ssList(X3)
    | lt(X2,X1)
    | lt(X1,X2)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X2,X5)),cons(X1,X6)) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_525]) ).

cnf(c_0_525_4,axiom,
    ( ~ ssItem(X2)
    | ~ strictorderP(X3)
    | ~ ssList(X3)
    | lt(X2,X1)
    | lt(X1,X2)
    | ~ ssItem(X1)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X2,X5)),cons(X1,X6)) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_525]) ).

cnf(c_0_525_5,axiom,
    ( ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ strictorderP(X3)
    | ~ ssList(X3)
    | lt(X2,X1)
    | lt(X1,X2)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X2,X5)),cons(X1,X6)) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_525]) ).

cnf(c_0_525_6,axiom,
    ( ~ ssList(X4)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ strictorderP(X3)
    | ~ ssList(X3)
    | lt(X2,X1)
    | lt(X1,X2)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X2,X5)),cons(X1,X6)) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_525]) ).

cnf(c_0_525_7,axiom,
    ( ~ ssList(X5)
    | ~ ssList(X4)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ strictorderP(X3)
    | ~ ssList(X3)
    | lt(X2,X1)
    | lt(X1,X2)
    | ~ ssList(X6)
    | app(app(X4,cons(X2,X5)),cons(X1,X6)) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_525]) ).

cnf(c_0_525_8,axiom,
    ( ~ ssList(X6)
    | ~ ssList(X5)
    | ~ ssList(X4)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ strictorderP(X3)
    | ~ ssList(X3)
    | lt(X2,X1)
    | lt(X1,X2)
    | app(app(X4,cons(X2,X5)),cons(X1,X6)) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_525]) ).

cnf(c_0_525_9,axiom,
    ( app(app(X4,cons(X2,X5)),cons(X1,X6)) != X3
    | ~ ssList(X6)
    | ~ ssList(X5)
    | ~ ssList(X4)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ strictorderP(X3)
    | ~ ssList(X3)
    | lt(X2,X1)
    | lt(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_525]) ).

cnf(c_0_526_0,axiom,
    ( leq(X1,X2)
    | leq(X2,X1)
    | ~ ssList(X3)
    | ~ totalorderP(X3)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X2,X5)),cons(X1,X6)) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_526]) ).

cnf(c_0_526_1,axiom,
    ( leq(X2,X1)
    | leq(X1,X2)
    | ~ ssList(X3)
    | ~ totalorderP(X3)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X2,X5)),cons(X1,X6)) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_526]) ).

cnf(c_0_526_2,axiom,
    ( ~ ssList(X3)
    | leq(X2,X1)
    | leq(X1,X2)
    | ~ totalorderP(X3)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X2,X5)),cons(X1,X6)) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_526]) ).

cnf(c_0_526_3,axiom,
    ( ~ totalorderP(X3)
    | ~ ssList(X3)
    | leq(X2,X1)
    | leq(X1,X2)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X2,X5)),cons(X1,X6)) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_526]) ).

cnf(c_0_526_4,axiom,
    ( ~ ssItem(X2)
    | ~ totalorderP(X3)
    | ~ ssList(X3)
    | leq(X2,X1)
    | leq(X1,X2)
    | ~ ssItem(X1)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X2,X5)),cons(X1,X6)) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_526]) ).

cnf(c_0_526_5,axiom,
    ( ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ totalorderP(X3)
    | ~ ssList(X3)
    | leq(X2,X1)
    | leq(X1,X2)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X2,X5)),cons(X1,X6)) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_526]) ).

cnf(c_0_526_6,axiom,
    ( ~ ssList(X4)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ totalorderP(X3)
    | ~ ssList(X3)
    | leq(X2,X1)
    | leq(X1,X2)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X2,X5)),cons(X1,X6)) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_526]) ).

cnf(c_0_526_7,axiom,
    ( ~ ssList(X5)
    | ~ ssList(X4)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ totalorderP(X3)
    | ~ ssList(X3)
    | leq(X2,X1)
    | leq(X1,X2)
    | ~ ssList(X6)
    | app(app(X4,cons(X2,X5)),cons(X1,X6)) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_526]) ).

cnf(c_0_526_8,axiom,
    ( ~ ssList(X6)
    | ~ ssList(X5)
    | ~ ssList(X4)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ totalorderP(X3)
    | ~ ssList(X3)
    | leq(X2,X1)
    | leq(X1,X2)
    | app(app(X4,cons(X2,X5)),cons(X1,X6)) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_526]) ).

cnf(c_0_526_9,axiom,
    ( app(app(X4,cons(X2,X5)),cons(X1,X6)) != X3
    | ~ ssList(X6)
    | ~ ssList(X5)
    | ~ ssList(X4)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ totalorderP(X3)
    | ~ ssList(X3)
    | leq(X2,X1)
    | leq(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_526]) ).

cnf(c_0_527_0,axiom,
    ( lt(X1,X2)
    | ~ ssList(X3)
    | ~ strictorderedP(X3)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X1,X5)),cons(X2,X6)) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_527]) ).

cnf(c_0_527_1,axiom,
    ( ~ ssList(X3)
    | lt(X1,X2)
    | ~ strictorderedP(X3)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X1,X5)),cons(X2,X6)) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_527]) ).

cnf(c_0_527_2,axiom,
    ( ~ strictorderedP(X3)
    | ~ ssList(X3)
    | lt(X1,X2)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X1,X5)),cons(X2,X6)) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_527]) ).

cnf(c_0_527_3,axiom,
    ( ~ ssItem(X1)
    | ~ strictorderedP(X3)
    | ~ ssList(X3)
    | lt(X1,X2)
    | ~ ssItem(X2)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X1,X5)),cons(X2,X6)) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_527]) ).

cnf(c_0_527_4,axiom,
    ( ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ strictorderedP(X3)
    | ~ ssList(X3)
    | lt(X1,X2)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X1,X5)),cons(X2,X6)) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_527]) ).

cnf(c_0_527_5,axiom,
    ( ~ ssList(X4)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ strictorderedP(X3)
    | ~ ssList(X3)
    | lt(X1,X2)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X1,X5)),cons(X2,X6)) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_527]) ).

cnf(c_0_527_6,axiom,
    ( ~ ssList(X5)
    | ~ ssList(X4)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ strictorderedP(X3)
    | ~ ssList(X3)
    | lt(X1,X2)
    | ~ ssList(X6)
    | app(app(X4,cons(X1,X5)),cons(X2,X6)) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_527]) ).

cnf(c_0_527_7,axiom,
    ( ~ ssList(X6)
    | ~ ssList(X5)
    | ~ ssList(X4)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ strictorderedP(X3)
    | ~ ssList(X3)
    | lt(X1,X2)
    | app(app(X4,cons(X1,X5)),cons(X2,X6)) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_527]) ).

cnf(c_0_527_8,axiom,
    ( app(app(X4,cons(X1,X5)),cons(X2,X6)) != X3
    | ~ ssList(X6)
    | ~ ssList(X5)
    | ~ ssList(X4)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ strictorderedP(X3)
    | ~ ssList(X3)
    | lt(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_527]) ).

cnf(c_0_528_0,axiom,
    ( leq(X1,X2)
    | ~ ssList(X3)
    | ~ totalorderedP(X3)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X1,X5)),cons(X2,X6)) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_528]) ).

cnf(c_0_528_1,axiom,
    ( ~ ssList(X3)
    | leq(X1,X2)
    | ~ totalorderedP(X3)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X1,X5)),cons(X2,X6)) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_528]) ).

cnf(c_0_528_2,axiom,
    ( ~ totalorderedP(X3)
    | ~ ssList(X3)
    | leq(X1,X2)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X1,X5)),cons(X2,X6)) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_528]) ).

cnf(c_0_528_3,axiom,
    ( ~ ssItem(X1)
    | ~ totalorderedP(X3)
    | ~ ssList(X3)
    | leq(X1,X2)
    | ~ ssItem(X2)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X1,X5)),cons(X2,X6)) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_528]) ).

cnf(c_0_528_4,axiom,
    ( ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ totalorderedP(X3)
    | ~ ssList(X3)
    | leq(X1,X2)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X1,X5)),cons(X2,X6)) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_528]) ).

cnf(c_0_528_5,axiom,
    ( ~ ssList(X4)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ totalorderedP(X3)
    | ~ ssList(X3)
    | leq(X1,X2)
    | ~ ssList(X5)
    | ~ ssList(X6)
    | app(app(X4,cons(X1,X5)),cons(X2,X6)) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_528]) ).

cnf(c_0_528_6,axiom,
    ( ~ ssList(X5)
    | ~ ssList(X4)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ totalorderedP(X3)
    | ~ ssList(X3)
    | leq(X1,X2)
    | ~ ssList(X6)
    | app(app(X4,cons(X1,X5)),cons(X2,X6)) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_528]) ).

cnf(c_0_528_7,axiom,
    ( ~ ssList(X6)
    | ~ ssList(X5)
    | ~ ssList(X4)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ totalorderedP(X3)
    | ~ ssList(X3)
    | leq(X1,X2)
    | app(app(X4,cons(X1,X5)),cons(X2,X6)) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_528]) ).

cnf(c_0_528_8,axiom,
    ( app(app(X4,cons(X1,X5)),cons(X2,X6)) != X3
    | ~ ssList(X6)
    | ~ ssList(X5)
    | ~ ssList(X4)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ totalorderedP(X3)
    | ~ ssList(X3)
    | leq(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_528]) ).

cnf(c_0_529_0,axiom,
    ( ~ ssList(X1)
    | ~ duplicatefreeP(X1)
    | ~ ssItem(X2)
    | ~ ssList(X3)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | app(app(X3,cons(X2,X4)),cons(X2,X5)) != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_529]) ).

cnf(c_0_529_1,axiom,
    ( ~ duplicatefreeP(X1)
    | ~ ssList(X1)
    | ~ ssItem(X2)
    | ~ ssList(X3)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | app(app(X3,cons(X2,X4)),cons(X2,X5)) != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_529]) ).

cnf(c_0_529_2,axiom,
    ( ~ ssItem(X2)
    | ~ duplicatefreeP(X1)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | app(app(X3,cons(X2,X4)),cons(X2,X5)) != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_529]) ).

cnf(c_0_529_3,axiom,
    ( ~ ssList(X3)
    | ~ ssItem(X2)
    | ~ duplicatefreeP(X1)
    | ~ ssList(X1)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | app(app(X3,cons(X2,X4)),cons(X2,X5)) != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_529]) ).

cnf(c_0_529_4,axiom,
    ( ~ ssList(X4)
    | ~ ssList(X3)
    | ~ ssItem(X2)
    | ~ duplicatefreeP(X1)
    | ~ ssList(X1)
    | ~ ssList(X5)
    | app(app(X3,cons(X2,X4)),cons(X2,X5)) != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_529]) ).

cnf(c_0_529_5,axiom,
    ( ~ ssList(X5)
    | ~ ssList(X4)
    | ~ ssList(X3)
    | ~ ssItem(X2)
    | ~ duplicatefreeP(X1)
    | ~ ssList(X1)
    | app(app(X3,cons(X2,X4)),cons(X2,X5)) != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_529]) ).

cnf(c_0_529_6,axiom,
    ( app(app(X3,cons(X2,X4)),cons(X2,X5)) != X1
    | ~ ssList(X5)
    | ~ ssList(X4)
    | ~ ssList(X3)
    | ~ ssItem(X2)
    | ~ duplicatefreeP(X1)
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_529]) ).

cnf(c_0_530_0,axiom,
    ( app(app(skaf75(X1),cons(skaf74(X1),skaf76(X1))),cons(skaf74(X1),skaf77(X1))) = X1
    | duplicatefreeP(X1)
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_530]) ).

cnf(c_0_530_1,axiom,
    ( duplicatefreeP(X1)
    | app(app(skaf75(X1),cons(skaf74(X1),skaf76(X1))),cons(skaf74(X1),skaf77(X1))) = X1
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_530]) ).

cnf(c_0_530_2,axiom,
    ( ~ ssList(X1)
    | duplicatefreeP(X1)
    | app(app(skaf75(X1),cons(skaf74(X1),skaf76(X1))),cons(skaf74(X1),skaf77(X1))) = X1 ),
    inference(literals_permutation,[status(thm)],[c_0_530]) ).

cnf(c_0_531_0,axiom,
    ( app(app(skaf71(X1),cons(skaf69(X1),skaf72(X1))),cons(skaf70(X1),skaf73(X1))) = X1
    | strictorderedP(X1)
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_531]) ).

cnf(c_0_531_1,axiom,
    ( strictorderedP(X1)
    | app(app(skaf71(X1),cons(skaf69(X1),skaf72(X1))),cons(skaf70(X1),skaf73(X1))) = X1
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_531]) ).

cnf(c_0_531_2,axiom,
    ( ~ ssList(X1)
    | strictorderedP(X1)
    | app(app(skaf71(X1),cons(skaf69(X1),skaf72(X1))),cons(skaf70(X1),skaf73(X1))) = X1 ),
    inference(literals_permutation,[status(thm)],[c_0_531]) ).

cnf(c_0_532_0,axiom,
    ( app(app(skaf66(X1),cons(skaf64(X1),skaf67(X1))),cons(skaf65(X1),skaf68(X1))) = X1
    | totalorderedP(X1)
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_532]) ).

cnf(c_0_532_1,axiom,
    ( totalorderedP(X1)
    | app(app(skaf66(X1),cons(skaf64(X1),skaf67(X1))),cons(skaf65(X1),skaf68(X1))) = X1
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_532]) ).

cnf(c_0_532_2,axiom,
    ( ~ ssList(X1)
    | totalorderedP(X1)
    | app(app(skaf66(X1),cons(skaf64(X1),skaf67(X1))),cons(skaf65(X1),skaf68(X1))) = X1 ),
    inference(literals_permutation,[status(thm)],[c_0_532]) ).

cnf(c_0_533_0,axiom,
    ( app(app(skaf61(X1),cons(skaf59(X1),skaf62(X1))),cons(skaf60(X1),skaf63(X1))) = X1
    | strictorderP(X1)
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_533]) ).

cnf(c_0_533_1,axiom,
    ( strictorderP(X1)
    | app(app(skaf61(X1),cons(skaf59(X1),skaf62(X1))),cons(skaf60(X1),skaf63(X1))) = X1
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_533]) ).

cnf(c_0_533_2,axiom,
    ( ~ ssList(X1)
    | strictorderP(X1)
    | app(app(skaf61(X1),cons(skaf59(X1),skaf62(X1))),cons(skaf60(X1),skaf63(X1))) = X1 ),
    inference(literals_permutation,[status(thm)],[c_0_533]) ).

cnf(c_0_534_0,axiom,
    ( app(app(skaf56(X1),cons(skaf54(X1),skaf57(X1))),cons(skaf55(X1),skaf58(X1))) = X1
    | totalorderP(X1)
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_534]) ).

cnf(c_0_534_1,axiom,
    ( totalorderP(X1)
    | app(app(skaf56(X1),cons(skaf54(X1),skaf57(X1))),cons(skaf55(X1),skaf58(X1))) = X1
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_534]) ).

cnf(c_0_534_2,axiom,
    ( ~ ssList(X1)
    | totalorderP(X1)
    | app(app(skaf56(X1),cons(skaf54(X1),skaf57(X1))),cons(skaf55(X1),skaf58(X1))) = X1 ),
    inference(literals_permutation,[status(thm)],[c_0_534]) ).

cnf(c_0_535_0,axiom,
    ( app(app(skaf51(X1),cons(skaf49(X1),skaf52(X1))),cons(skaf50(X1),skaf53(X1))) = X1
    | cyclefreeP(X1)
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_535]) ).

cnf(c_0_535_1,axiom,
    ( cyclefreeP(X1)
    | app(app(skaf51(X1),cons(skaf49(X1),skaf52(X1))),cons(skaf50(X1),skaf53(X1))) = X1
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_535]) ).

cnf(c_0_535_2,axiom,
    ( ~ ssList(X1)
    | cyclefreeP(X1)
    | app(app(skaf51(X1),cons(skaf49(X1),skaf52(X1))),cons(skaf50(X1),skaf53(X1))) = X1 ),
    inference(literals_permutation,[status(thm)],[c_0_535]) ).

cnf(c_0_536_0,axiom,
    ( X1 = X2
    | ~ ssList(X3)
    | ~ equalelemsP(X3)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | app(X4,cons(X1,cons(X2,X5))) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_536]) ).

cnf(c_0_536_1,axiom,
    ( ~ ssList(X3)
    | X1 = X2
    | ~ equalelemsP(X3)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | app(X4,cons(X1,cons(X2,X5))) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_536]) ).

cnf(c_0_536_2,axiom,
    ( ~ equalelemsP(X3)
    | ~ ssList(X3)
    | X1 = X2
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | app(X4,cons(X1,cons(X2,X5))) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_536]) ).

cnf(c_0_536_3,axiom,
    ( ~ ssItem(X1)
    | ~ equalelemsP(X3)
    | ~ ssList(X3)
    | X1 = X2
    | ~ ssItem(X2)
    | ~ ssList(X4)
    | ~ ssList(X5)
    | app(X4,cons(X1,cons(X2,X5))) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_536]) ).

cnf(c_0_536_4,axiom,
    ( ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ equalelemsP(X3)
    | ~ ssList(X3)
    | X1 = X2
    | ~ ssList(X4)
    | ~ ssList(X5)
    | app(X4,cons(X1,cons(X2,X5))) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_536]) ).

cnf(c_0_536_5,axiom,
    ( ~ ssList(X4)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ equalelemsP(X3)
    | ~ ssList(X3)
    | X1 = X2
    | ~ ssList(X5)
    | app(X4,cons(X1,cons(X2,X5))) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_536]) ).

cnf(c_0_536_6,axiom,
    ( ~ ssList(X5)
    | ~ ssList(X4)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ equalelemsP(X3)
    | ~ ssList(X3)
    | X1 = X2
    | app(X4,cons(X1,cons(X2,X5))) != X3 ),
    inference(literals_permutation,[status(thm)],[c_0_536]) ).

cnf(c_0_536_7,axiom,
    ( app(X4,cons(X1,cons(X2,X5))) != X3
    | ~ ssList(X5)
    | ~ ssList(X4)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ equalelemsP(X3)
    | ~ ssList(X3)
    | X1 = X2 ),
    inference(literals_permutation,[status(thm)],[c_0_536]) ).

cnf(c_0_537_0,axiom,
    ( app(skaf80(X1),cons(skaf78(X1),cons(skaf79(X1),skaf81(X1)))) = X1
    | equalelemsP(X1)
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_537]) ).

cnf(c_0_537_1,axiom,
    ( equalelemsP(X1)
    | app(skaf80(X1),cons(skaf78(X1),cons(skaf79(X1),skaf81(X1)))) = X1
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_537]) ).

cnf(c_0_537_2,axiom,
    ( ~ ssList(X1)
    | equalelemsP(X1)
    | app(skaf80(X1),cons(skaf78(X1),cons(skaf79(X1),skaf81(X1)))) = X1 ),
    inference(literals_permutation,[status(thm)],[c_0_537]) ).

cnf(c_0_538_0,axiom,
    ( app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ segmentP(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_538]) ).

cnf(c_0_538_1,axiom,
    ( ~ ssList(X1)
    | app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1
    | ~ ssList(X2)
    | ~ segmentP(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_538]) ).

cnf(c_0_538_2,axiom,
    ( ~ ssList(X2)
    | ~ ssList(X1)
    | app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1
    | ~ segmentP(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_538]) ).

cnf(c_0_538_3,axiom,
    ( ~ segmentP(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X1)
    | app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1 ),
    inference(literals_permutation,[status(thm)],[c_0_538]) ).

cnf(c_0_539_0,axiom,
    ( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
    | ~ ssList(X1)
    | ~ ssItem(X2)
    | ~ memberP(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_539]) ).

cnf(c_0_539_1,axiom,
    ( ~ ssList(X1)
    | app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
    | ~ ssItem(X2)
    | ~ memberP(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_539]) ).

cnf(c_0_539_2,axiom,
    ( ~ ssItem(X2)
    | ~ ssList(X1)
    | app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
    | ~ memberP(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_539]) ).

cnf(c_0_539_3,axiom,
    ( ~ memberP(X1,X2)
    | ~ ssItem(X2)
    | ~ ssList(X1)
    | app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1 ),
    inference(literals_permutation,[status(thm)],[c_0_539]) ).

cnf(c_0_540_0,axiom,
    ( frontsegP(X1,X2)
    | ~ ssItem(X3)
    | ~ ssItem(X4)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ frontsegP(cons(X3,X1),cons(X4,X2)) ),
    inference(literals_permutation,[status(thm)],[c_0_540]) ).

cnf(c_0_540_1,axiom,
    ( ~ ssItem(X3)
    | frontsegP(X1,X2)
    | ~ ssItem(X4)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ frontsegP(cons(X3,X1),cons(X4,X2)) ),
    inference(literals_permutation,[status(thm)],[c_0_540]) ).

cnf(c_0_540_2,axiom,
    ( ~ ssItem(X4)
    | ~ ssItem(X3)
    | frontsegP(X1,X2)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ frontsegP(cons(X3,X1),cons(X4,X2)) ),
    inference(literals_permutation,[status(thm)],[c_0_540]) ).

cnf(c_0_540_3,axiom,
    ( ~ ssList(X1)
    | ~ ssItem(X4)
    | ~ ssItem(X3)
    | frontsegP(X1,X2)
    | ~ ssList(X2)
    | ~ frontsegP(cons(X3,X1),cons(X4,X2)) ),
    inference(literals_permutation,[status(thm)],[c_0_540]) ).

cnf(c_0_540_4,axiom,
    ( ~ ssList(X2)
    | ~ ssList(X1)
    | ~ ssItem(X4)
    | ~ ssItem(X3)
    | frontsegP(X1,X2)
    | ~ frontsegP(cons(X3,X1),cons(X4,X2)) ),
    inference(literals_permutation,[status(thm)],[c_0_540]) ).

cnf(c_0_540_5,axiom,
    ( ~ frontsegP(cons(X3,X1),cons(X4,X2))
    | ~ ssList(X2)
    | ~ ssList(X1)
    | ~ ssItem(X4)
    | ~ ssItem(X3)
    | frontsegP(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_540]) ).

cnf(c_0_541_0,axiom,
    ( segmentP(app(app(X1,X2),X3),X4)
    | ~ ssList(X2)
    | ~ ssList(X4)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ segmentP(X2,X4) ),
    inference(literals_permutation,[status(thm)],[c_0_541]) ).

cnf(c_0_541_1,axiom,
    ( ~ ssList(X2)
    | segmentP(app(app(X1,X2),X3),X4)
    | ~ ssList(X4)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ segmentP(X2,X4) ),
    inference(literals_permutation,[status(thm)],[c_0_541]) ).

cnf(c_0_541_2,axiom,
    ( ~ ssList(X4)
    | ~ ssList(X2)
    | segmentP(app(app(X1,X2),X3),X4)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ segmentP(X2,X4) ),
    inference(literals_permutation,[status(thm)],[c_0_541]) ).

cnf(c_0_541_3,axiom,
    ( ~ ssList(X1)
    | ~ ssList(X4)
    | ~ ssList(X2)
    | segmentP(app(app(X1,X2),X3),X4)
    | ~ ssList(X3)
    | ~ segmentP(X2,X4) ),
    inference(literals_permutation,[status(thm)],[c_0_541]) ).

cnf(c_0_541_4,axiom,
    ( ~ ssList(X3)
    | ~ ssList(X1)
    | ~ ssList(X4)
    | ~ ssList(X2)
    | segmentP(app(app(X1,X2),X3),X4)
    | ~ segmentP(X2,X4) ),
    inference(literals_permutation,[status(thm)],[c_0_541]) ).

cnf(c_0_541_5,axiom,
    ( ~ segmentP(X2,X4)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | ~ ssList(X4)
    | ~ ssList(X2)
    | segmentP(app(app(X1,X2),X3),X4) ),
    inference(literals_permutation,[status(thm)],[c_0_541]) ).

cnf(c_0_542_0,axiom,
    ( X1 = X2
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ ssList(X3)
    | ~ ssList(X4)
    | ~ frontsegP(cons(X1,X3),cons(X2,X4)) ),
    inference(literals_permutation,[status(thm)],[c_0_542]) ).

cnf(c_0_542_1,axiom,
    ( ~ ssItem(X1)
    | X1 = X2
    | ~ ssItem(X2)
    | ~ ssList(X3)
    | ~ ssList(X4)
    | ~ frontsegP(cons(X1,X3),cons(X2,X4)) ),
    inference(literals_permutation,[status(thm)],[c_0_542]) ).

cnf(c_0_542_2,axiom,
    ( ~ ssItem(X2)
    | ~ ssItem(X1)
    | X1 = X2
    | ~ ssList(X3)
    | ~ ssList(X4)
    | ~ frontsegP(cons(X1,X3),cons(X2,X4)) ),
    inference(literals_permutation,[status(thm)],[c_0_542]) ).

cnf(c_0_542_3,axiom,
    ( ~ ssList(X3)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | X1 = X2
    | ~ ssList(X4)
    | ~ frontsegP(cons(X1,X3),cons(X2,X4)) ),
    inference(literals_permutation,[status(thm)],[c_0_542]) ).

cnf(c_0_542_4,axiom,
    ( ~ ssList(X4)
    | ~ ssList(X3)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | X1 = X2
    | ~ frontsegP(cons(X1,X3),cons(X2,X4)) ),
    inference(literals_permutation,[status(thm)],[c_0_542]) ).

cnf(c_0_542_5,axiom,
    ( ~ frontsegP(cons(X1,X3),cons(X2,X4))
    | ~ ssList(X4)
    | ~ ssList(X3)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | X1 = X2 ),
    inference(literals_permutation,[status(thm)],[c_0_542]) ).

cnf(c_0_543_0,axiom,
    ( frontsegP(cons(X1,X2),cons(X3,X4))
    | ~ ssItem(X1)
    | ~ ssItem(X3)
    | ~ ssList(X2)
    | ~ ssList(X4)
    | X1 != X3
    | ~ frontsegP(X2,X4) ),
    inference(literals_permutation,[status(thm)],[c_0_543]) ).

cnf(c_0_543_1,axiom,
    ( ~ ssItem(X1)
    | frontsegP(cons(X1,X2),cons(X3,X4))
    | ~ ssItem(X3)
    | ~ ssList(X2)
    | ~ ssList(X4)
    | X1 != X3
    | ~ frontsegP(X2,X4) ),
    inference(literals_permutation,[status(thm)],[c_0_543]) ).

cnf(c_0_543_2,axiom,
    ( ~ ssItem(X3)
    | ~ ssItem(X1)
    | frontsegP(cons(X1,X2),cons(X3,X4))
    | ~ ssList(X2)
    | ~ ssList(X4)
    | X1 != X3
    | ~ frontsegP(X2,X4) ),
    inference(literals_permutation,[status(thm)],[c_0_543]) ).

cnf(c_0_543_3,axiom,
    ( ~ ssList(X2)
    | ~ ssItem(X3)
    | ~ ssItem(X1)
    | frontsegP(cons(X1,X2),cons(X3,X4))
    | ~ ssList(X4)
    | X1 != X3
    | ~ frontsegP(X2,X4) ),
    inference(literals_permutation,[status(thm)],[c_0_543]) ).

cnf(c_0_543_4,axiom,
    ( ~ ssList(X4)
    | ~ ssList(X2)
    | ~ ssItem(X3)
    | ~ ssItem(X1)
    | frontsegP(cons(X1,X2),cons(X3,X4))
    | X1 != X3
    | ~ frontsegP(X2,X4) ),
    inference(literals_permutation,[status(thm)],[c_0_543]) ).

cnf(c_0_543_5,axiom,
    ( X1 != X3
    | ~ ssList(X4)
    | ~ ssList(X2)
    | ~ ssItem(X3)
    | ~ ssItem(X1)
    | frontsegP(cons(X1,X2),cons(X3,X4))
    | ~ frontsegP(X2,X4) ),
    inference(literals_permutation,[status(thm)],[c_0_543]) ).

cnf(c_0_543_6,axiom,
    ( ~ frontsegP(X2,X4)
    | X1 != X3
    | ~ ssList(X4)
    | ~ ssList(X2)
    | ~ ssItem(X3)
    | ~ ssItem(X1)
    | frontsegP(cons(X1,X2),cons(X3,X4)) ),
    inference(literals_permutation,[status(thm)],[c_0_543]) ).

cnf(c_0_544_0,axiom,
    ( memberP(X1,X2)
    | memberP(X3,X2)
    | ~ ssItem(X2)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ memberP(app(X1,X3),X2) ),
    inference(literals_permutation,[status(thm)],[c_0_544]) ).

cnf(c_0_544_1,axiom,
    ( memberP(X3,X2)
    | memberP(X1,X2)
    | ~ ssItem(X2)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ memberP(app(X1,X3),X2) ),
    inference(literals_permutation,[status(thm)],[c_0_544]) ).

cnf(c_0_544_2,axiom,
    ( ~ ssItem(X2)
    | memberP(X3,X2)
    | memberP(X1,X2)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ memberP(app(X1,X3),X2) ),
    inference(literals_permutation,[status(thm)],[c_0_544]) ).

cnf(c_0_544_3,axiom,
    ( ~ ssList(X1)
    | ~ ssItem(X2)
    | memberP(X3,X2)
    | memberP(X1,X2)
    | ~ ssList(X3)
    | ~ memberP(app(X1,X3),X2) ),
    inference(literals_permutation,[status(thm)],[c_0_544]) ).

cnf(c_0_544_4,axiom,
    ( ~ ssList(X3)
    | ~ ssList(X1)
    | ~ ssItem(X2)
    | memberP(X3,X2)
    | memberP(X1,X2)
    | ~ memberP(app(X1,X3),X2) ),
    inference(literals_permutation,[status(thm)],[c_0_544]) ).

cnf(c_0_544_5,axiom,
    ( ~ memberP(app(X1,X3),X2)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | ~ ssItem(X2)
    | memberP(X3,X2)
    | memberP(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_544]) ).

cnf(c_0_545_0,axiom,
    ( segmentP(X1,X2)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | ~ ssList(X4)
    | app(app(X3,X2),X4) != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_545]) ).

cnf(c_0_545_1,axiom,
    ( ~ ssList(X1)
    | segmentP(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | ~ ssList(X4)
    | app(app(X3,X2),X4) != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_545]) ).

cnf(c_0_545_2,axiom,
    ( ~ ssList(X2)
    | ~ ssList(X1)
    | segmentP(X1,X2)
    | ~ ssList(X3)
    | ~ ssList(X4)
    | app(app(X3,X2),X4) != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_545]) ).

cnf(c_0_545_3,axiom,
    ( ~ ssList(X3)
    | ~ ssList(X2)
    | ~ ssList(X1)
    | segmentP(X1,X2)
    | ~ ssList(X4)
    | app(app(X3,X2),X4) != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_545]) ).

cnf(c_0_545_4,axiom,
    ( ~ ssList(X4)
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ ssList(X1)
    | segmentP(X1,X2)
    | app(app(X3,X2),X4) != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_545]) ).

cnf(c_0_545_5,axiom,
    ( app(app(X3,X2),X4) != X1
    | ~ ssList(X4)
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ ssList(X1)
    | segmentP(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_545]) ).

cnf(c_0_546_0,axiom,
    ( memberP(X1,X2)
    | ~ ssList(X1)
    | ~ ssItem(X2)
    | ~ ssList(X3)
    | ~ ssList(X4)
    | app(X3,cons(X2,X4)) != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_546]) ).

cnf(c_0_546_1,axiom,
    ( ~ ssList(X1)
    | memberP(X1,X2)
    | ~ ssItem(X2)
    | ~ ssList(X3)
    | ~ ssList(X4)
    | app(X3,cons(X2,X4)) != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_546]) ).

cnf(c_0_546_2,axiom,
    ( ~ ssItem(X2)
    | ~ ssList(X1)
    | memberP(X1,X2)
    | ~ ssList(X3)
    | ~ ssList(X4)
    | app(X3,cons(X2,X4)) != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_546]) ).

cnf(c_0_546_3,axiom,
    ( ~ ssList(X3)
    | ~ ssItem(X2)
    | ~ ssList(X1)
    | memberP(X1,X2)
    | ~ ssList(X4)
    | app(X3,cons(X2,X4)) != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_546]) ).

cnf(c_0_546_4,axiom,
    ( ~ ssList(X4)
    | ~ ssList(X3)
    | ~ ssItem(X2)
    | ~ ssList(X1)
    | memberP(X1,X2)
    | app(X3,cons(X2,X4)) != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_546]) ).

cnf(c_0_546_5,axiom,
    ( app(X3,cons(X2,X4)) != X1
    | ~ ssList(X4)
    | ~ ssList(X3)
    | ~ ssItem(X2)
    | ~ ssList(X1)
    | memberP(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_546]) ).

cnf(c_0_547_0,axiom,
    ( X1 = X2
    | memberP(X3,X1)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ ssList(X3)
    | ~ memberP(cons(X2,X3),X1) ),
    inference(literals_permutation,[status(thm)],[c_0_547]) ).

cnf(c_0_547_1,axiom,
    ( memberP(X3,X1)
    | X1 = X2
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ ssList(X3)
    | ~ memberP(cons(X2,X3),X1) ),
    inference(literals_permutation,[status(thm)],[c_0_547]) ).

cnf(c_0_547_2,axiom,
    ( ~ ssItem(X1)
    | memberP(X3,X1)
    | X1 = X2
    | ~ ssItem(X2)
    | ~ ssList(X3)
    | ~ memberP(cons(X2,X3),X1) ),
    inference(literals_permutation,[status(thm)],[c_0_547]) ).

cnf(c_0_547_3,axiom,
    ( ~ ssItem(X2)
    | ~ ssItem(X1)
    | memberP(X3,X1)
    | X1 = X2
    | ~ ssList(X3)
    | ~ memberP(cons(X2,X3),X1) ),
    inference(literals_permutation,[status(thm)],[c_0_547]) ).

cnf(c_0_547_4,axiom,
    ( ~ ssList(X3)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | memberP(X3,X1)
    | X1 = X2
    | ~ memberP(cons(X2,X3),X1) ),
    inference(literals_permutation,[status(thm)],[c_0_547]) ).

cnf(c_0_547_5,axiom,
    ( ~ memberP(cons(X2,X3),X1)
    | ~ ssList(X3)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | memberP(X3,X1)
    | X1 = X2 ),
    inference(literals_permutation,[status(thm)],[c_0_547]) ).

cnf(c_0_548_0,axiom,
    ( app(app(X1,X2),X3) = app(X1,app(X2,X3))
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X3) ),
    inference(literals_permutation,[status(thm)],[c_0_548]) ).

cnf(c_0_548_1,axiom,
    ( ~ ssList(X1)
    | app(app(X1,X2),X3) = app(X1,app(X2,X3))
    | ~ ssList(X2)
    | ~ ssList(X3) ),
    inference(literals_permutation,[status(thm)],[c_0_548]) ).

cnf(c_0_548_2,axiom,
    ( ~ ssList(X2)
    | ~ ssList(X1)
    | app(app(X1,X2),X3) = app(X1,app(X2,X3))
    | ~ ssList(X3) ),
    inference(literals_permutation,[status(thm)],[c_0_548]) ).

cnf(c_0_548_3,axiom,
    ( ~ ssList(X3)
    | ~ ssList(X2)
    | ~ ssList(X1)
    | app(app(X1,X2),X3) = app(X1,app(X2,X3)) ),
    inference(literals_permutation,[status(thm)],[c_0_548]) ).

cnf(c_0_549_0,axiom,
    ( app(cons(X1,X2),X3) = cons(X1,app(X2,X3))
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_549]) ).

cnf(c_0_549_1,axiom,
    ( ~ ssList(X3)
    | app(cons(X1,X2),X3) = cons(X1,app(X2,X3))
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_549]) ).

cnf(c_0_549_2,axiom,
    ( ~ ssList(X2)
    | ~ ssList(X3)
    | app(cons(X1,X2),X3) = cons(X1,app(X2,X3))
    | ~ ssItem(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_549]) ).

cnf(c_0_549_3,axiom,
    ( ~ ssItem(X1)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | app(cons(X1,X2),X3) = cons(X1,app(X2,X3)) ),
    inference(literals_permutation,[status(thm)],[c_0_549]) ).

cnf(c_0_550_0,axiom,
    ( nil = X1
    | totalorderedP(cons(X2,X1))
    | ~ ssItem(X2)
    | ~ ssList(X1)
    | ~ totalorderedP(X1)
    | ~ leq(X2,hd(X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_550]) ).

cnf(c_0_550_1,axiom,
    ( totalorderedP(cons(X2,X1))
    | nil = X1
    | ~ ssItem(X2)
    | ~ ssList(X1)
    | ~ totalorderedP(X1)
    | ~ leq(X2,hd(X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_550]) ).

cnf(c_0_550_2,axiom,
    ( ~ ssItem(X2)
    | totalorderedP(cons(X2,X1))
    | nil = X1
    | ~ ssList(X1)
    | ~ totalorderedP(X1)
    | ~ leq(X2,hd(X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_550]) ).

cnf(c_0_550_3,axiom,
    ( ~ ssList(X1)
    | ~ ssItem(X2)
    | totalorderedP(cons(X2,X1))
    | nil = X1
    | ~ totalorderedP(X1)
    | ~ leq(X2,hd(X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_550]) ).

cnf(c_0_550_4,axiom,
    ( ~ totalorderedP(X1)
    | ~ ssList(X1)
    | ~ ssItem(X2)
    | totalorderedP(cons(X2,X1))
    | nil = X1
    | ~ leq(X2,hd(X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_550]) ).

cnf(c_0_550_5,axiom,
    ( ~ leq(X2,hd(X1))
    | ~ totalorderedP(X1)
    | ~ ssList(X1)
    | ~ ssItem(X2)
    | totalorderedP(cons(X2,X1))
    | nil = X1 ),
    inference(literals_permutation,[status(thm)],[c_0_550]) ).

cnf(c_0_551_0,axiom,
    ( nil = X1
    | strictorderedP(cons(X2,X1))
    | ~ ssItem(X2)
    | ~ ssList(X1)
    | ~ strictorderedP(X1)
    | ~ lt(X2,hd(X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_551]) ).

cnf(c_0_551_1,axiom,
    ( strictorderedP(cons(X2,X1))
    | nil = X1
    | ~ ssItem(X2)
    | ~ ssList(X1)
    | ~ strictorderedP(X1)
    | ~ lt(X2,hd(X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_551]) ).

cnf(c_0_551_2,axiom,
    ( ~ ssItem(X2)
    | strictorderedP(cons(X2,X1))
    | nil = X1
    | ~ ssList(X1)
    | ~ strictorderedP(X1)
    | ~ lt(X2,hd(X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_551]) ).

cnf(c_0_551_3,axiom,
    ( ~ ssList(X1)
    | ~ ssItem(X2)
    | strictorderedP(cons(X2,X1))
    | nil = X1
    | ~ strictorderedP(X1)
    | ~ lt(X2,hd(X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_551]) ).

cnf(c_0_551_4,axiom,
    ( ~ strictorderedP(X1)
    | ~ ssList(X1)
    | ~ ssItem(X2)
    | strictorderedP(cons(X2,X1))
    | nil = X1
    | ~ lt(X2,hd(X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_551]) ).

cnf(c_0_551_5,axiom,
    ( ~ lt(X2,hd(X1))
    | ~ strictorderedP(X1)
    | ~ ssList(X1)
    | ~ ssItem(X2)
    | strictorderedP(cons(X2,X1))
    | nil = X1 ),
    inference(literals_permutation,[status(thm)],[c_0_551]) ).

cnf(c_0_552_0,axiom,
    ( rearsegP(app(X1,X2),X3)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | ~ rearsegP(X2,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_552]) ).

cnf(c_0_552_1,axiom,
    ( ~ ssList(X2)
    | rearsegP(app(X1,X2),X3)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | ~ rearsegP(X2,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_552]) ).

cnf(c_0_552_2,axiom,
    ( ~ ssList(X3)
    | ~ ssList(X2)
    | rearsegP(app(X1,X2),X3)
    | ~ ssList(X1)
    | ~ rearsegP(X2,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_552]) ).

cnf(c_0_552_3,axiom,
    ( ~ ssList(X1)
    | ~ ssList(X3)
    | ~ ssList(X2)
    | rearsegP(app(X1,X2),X3)
    | ~ rearsegP(X2,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_552]) ).

cnf(c_0_552_4,axiom,
    ( ~ rearsegP(X2,X3)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ ssList(X2)
    | rearsegP(app(X1,X2),X3) ),
    inference(literals_permutation,[status(thm)],[c_0_552]) ).

cnf(c_0_553_0,axiom,
    ( frontsegP(app(X1,X2),X3)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ frontsegP(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_553]) ).

cnf(c_0_553_1,axiom,
    ( ~ ssList(X1)
    | frontsegP(app(X1,X2),X3)
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ frontsegP(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_553]) ).

cnf(c_0_553_2,axiom,
    ( ~ ssList(X3)
    | ~ ssList(X1)
    | frontsegP(app(X1,X2),X3)
    | ~ ssList(X2)
    | ~ frontsegP(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_553]) ).

cnf(c_0_553_3,axiom,
    ( ~ ssList(X2)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | frontsegP(app(X1,X2),X3)
    | ~ frontsegP(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_553]) ).

cnf(c_0_553_4,axiom,
    ( ~ frontsegP(X1,X3)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | frontsegP(app(X1,X2),X3) ),
    inference(literals_permutation,[status(thm)],[c_0_553]) ).

cnf(c_0_554_0,axiom,
    ( memberP(cons(X1,X2),X3)
    | ~ ssItem(X3)
    | ~ ssItem(X1)
    | ~ ssList(X2)
    | ~ memberP(X2,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_554]) ).

cnf(c_0_554_1,axiom,
    ( ~ ssItem(X3)
    | memberP(cons(X1,X2),X3)
    | ~ ssItem(X1)
    | ~ ssList(X2)
    | ~ memberP(X2,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_554]) ).

cnf(c_0_554_2,axiom,
    ( ~ ssItem(X1)
    | ~ ssItem(X3)
    | memberP(cons(X1,X2),X3)
    | ~ ssList(X2)
    | ~ memberP(X2,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_554]) ).

cnf(c_0_554_3,axiom,
    ( ~ ssList(X2)
    | ~ ssItem(X1)
    | ~ ssItem(X3)
    | memberP(cons(X1,X2),X3)
    | ~ memberP(X2,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_554]) ).

cnf(c_0_554_4,axiom,
    ( ~ memberP(X2,X3)
    | ~ ssList(X2)
    | ~ ssItem(X1)
    | ~ ssItem(X3)
    | memberP(cons(X1,X2),X3) ),
    inference(literals_permutation,[status(thm)],[c_0_554]) ).

cnf(c_0_555_0,axiom,
    ( memberP(app(X1,X2),X3)
    | ~ ssItem(X3)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ memberP(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_555]) ).

cnf(c_0_555_1,axiom,
    ( ~ ssItem(X3)
    | memberP(app(X1,X2),X3)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ memberP(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_555]) ).

cnf(c_0_555_2,axiom,
    ( ~ ssList(X1)
    | ~ ssItem(X3)
    | memberP(app(X1,X2),X3)
    | ~ ssList(X2)
    | ~ memberP(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_555]) ).

cnf(c_0_555_3,axiom,
    ( ~ ssList(X2)
    | ~ ssList(X1)
    | ~ ssItem(X3)
    | memberP(app(X1,X2),X3)
    | ~ memberP(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_555]) ).

cnf(c_0_555_4,axiom,
    ( ~ memberP(X1,X3)
    | ~ ssList(X2)
    | ~ ssList(X1)
    | ~ ssItem(X3)
    | memberP(app(X1,X2),X3) ),
    inference(literals_permutation,[status(thm)],[c_0_555]) ).

cnf(c_0_556_0,axiom,
    ( memberP(app(X1,X2),X3)
    | ~ ssItem(X3)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ memberP(X2,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_556]) ).

cnf(c_0_556_1,axiom,
    ( ~ ssItem(X3)
    | memberP(app(X1,X2),X3)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ memberP(X2,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_556]) ).

cnf(c_0_556_2,axiom,
    ( ~ ssList(X1)
    | ~ ssItem(X3)
    | memberP(app(X1,X2),X3)
    | ~ ssList(X2)
    | ~ memberP(X2,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_556]) ).

cnf(c_0_556_3,axiom,
    ( ~ ssList(X2)
    | ~ ssList(X1)
    | ~ ssItem(X3)
    | memberP(app(X1,X2),X3)
    | ~ memberP(X2,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_556]) ).

cnf(c_0_556_4,axiom,
    ( ~ memberP(X2,X3)
    | ~ ssList(X2)
    | ~ ssList(X1)
    | ~ ssItem(X3)
    | memberP(app(X1,X2),X3) ),
    inference(literals_permutation,[status(thm)],[c_0_556]) ).

cnf(c_0_557_0,axiom,
    ( nil = X1
    | lt(X2,hd(X1))
    | ~ ssItem(X2)
    | ~ ssList(X1)
    | ~ strictorderedP(cons(X2,X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_557]) ).

cnf(c_0_557_1,axiom,
    ( lt(X2,hd(X1))
    | nil = X1
    | ~ ssItem(X2)
    | ~ ssList(X1)
    | ~ strictorderedP(cons(X2,X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_557]) ).

cnf(c_0_557_2,axiom,
    ( ~ ssItem(X2)
    | lt(X2,hd(X1))
    | nil = X1
    | ~ ssList(X1)
    | ~ strictorderedP(cons(X2,X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_557]) ).

cnf(c_0_557_3,axiom,
    ( ~ ssList(X1)
    | ~ ssItem(X2)
    | lt(X2,hd(X1))
    | nil = X1
    | ~ strictorderedP(cons(X2,X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_557]) ).

cnf(c_0_557_4,axiom,
    ( ~ strictorderedP(cons(X2,X1))
    | ~ ssList(X1)
    | ~ ssItem(X2)
    | lt(X2,hd(X1))
    | nil = X1 ),
    inference(literals_permutation,[status(thm)],[c_0_557]) ).

cnf(c_0_558_0,axiom,
    ( nil = X1
    | leq(X2,hd(X1))
    | ~ ssItem(X2)
    | ~ ssList(X1)
    | ~ totalorderedP(cons(X2,X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_558]) ).

cnf(c_0_558_1,axiom,
    ( leq(X2,hd(X1))
    | nil = X1
    | ~ ssItem(X2)
    | ~ ssList(X1)
    | ~ totalorderedP(cons(X2,X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_558]) ).

cnf(c_0_558_2,axiom,
    ( ~ ssItem(X2)
    | leq(X2,hd(X1))
    | nil = X1
    | ~ ssList(X1)
    | ~ totalorderedP(cons(X2,X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_558]) ).

cnf(c_0_558_3,axiom,
    ( ~ ssList(X1)
    | ~ ssItem(X2)
    | leq(X2,hd(X1))
    | nil = X1
    | ~ totalorderedP(cons(X2,X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_558]) ).

cnf(c_0_558_4,axiom,
    ( ~ totalorderedP(cons(X2,X1))
    | ~ ssList(X1)
    | ~ ssItem(X2)
    | leq(X2,hd(X1))
    | nil = X1 ),
    inference(literals_permutation,[status(thm)],[c_0_558]) ).

cnf(c_0_559_0,axiom,
    ( gt(X1,X2)
    | ~ ssItem(X1)
    | ~ ssItem(X3)
    | ~ ssItem(X2)
    | ~ gt(X3,X2)
    | ~ gt(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_559]) ).

cnf(c_0_559_1,axiom,
    ( ~ ssItem(X1)
    | gt(X1,X2)
    | ~ ssItem(X3)
    | ~ ssItem(X2)
    | ~ gt(X3,X2)
    | ~ gt(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_559]) ).

cnf(c_0_559_2,axiom,
    ( ~ ssItem(X3)
    | ~ ssItem(X1)
    | gt(X1,X2)
    | ~ ssItem(X2)
    | ~ gt(X3,X2)
    | ~ gt(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_559]) ).

cnf(c_0_559_3,axiom,
    ( ~ ssItem(X2)
    | ~ ssItem(X3)
    | ~ ssItem(X1)
    | gt(X1,X2)
    | ~ gt(X3,X2)
    | ~ gt(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_559]) ).

cnf(c_0_559_4,axiom,
    ( ~ gt(X3,X2)
    | ~ ssItem(X2)
    | ~ ssItem(X3)
    | ~ ssItem(X1)
    | gt(X1,X2)
    | ~ gt(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_559]) ).

cnf(c_0_559_5,axiom,
    ( ~ gt(X1,X3)
    | ~ gt(X3,X2)
    | ~ ssItem(X2)
    | ~ ssItem(X3)
    | ~ ssItem(X1)
    | gt(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_559]) ).

cnf(c_0_560_0,axiom,
    ( lt(X1,X2)
    | ~ ssItem(X1)
    | ~ ssItem(X3)
    | ~ ssItem(X2)
    | ~ lt(X3,X2)
    | ~ leq(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_560]) ).

cnf(c_0_560_1,axiom,
    ( ~ ssItem(X1)
    | lt(X1,X2)
    | ~ ssItem(X3)
    | ~ ssItem(X2)
    | ~ lt(X3,X2)
    | ~ leq(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_560]) ).

cnf(c_0_560_2,axiom,
    ( ~ ssItem(X3)
    | ~ ssItem(X1)
    | lt(X1,X2)
    | ~ ssItem(X2)
    | ~ lt(X3,X2)
    | ~ leq(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_560]) ).

cnf(c_0_560_3,axiom,
    ( ~ ssItem(X2)
    | ~ ssItem(X3)
    | ~ ssItem(X1)
    | lt(X1,X2)
    | ~ lt(X3,X2)
    | ~ leq(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_560]) ).

cnf(c_0_560_4,axiom,
    ( ~ lt(X3,X2)
    | ~ ssItem(X2)
    | ~ ssItem(X3)
    | ~ ssItem(X1)
    | lt(X1,X2)
    | ~ leq(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_560]) ).

cnf(c_0_560_5,axiom,
    ( ~ leq(X1,X3)
    | ~ lt(X3,X2)
    | ~ ssItem(X2)
    | ~ ssItem(X3)
    | ~ ssItem(X1)
    | lt(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_560]) ).

cnf(c_0_561_0,axiom,
    ( geq(X1,X2)
    | ~ ssItem(X1)
    | ~ ssItem(X3)
    | ~ ssItem(X2)
    | ~ geq(X3,X2)
    | ~ geq(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_561]) ).

cnf(c_0_561_1,axiom,
    ( ~ ssItem(X1)
    | geq(X1,X2)
    | ~ ssItem(X3)
    | ~ ssItem(X2)
    | ~ geq(X3,X2)
    | ~ geq(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_561]) ).

cnf(c_0_561_2,axiom,
    ( ~ ssItem(X3)
    | ~ ssItem(X1)
    | geq(X1,X2)
    | ~ ssItem(X2)
    | ~ geq(X3,X2)
    | ~ geq(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_561]) ).

cnf(c_0_561_3,axiom,
    ( ~ ssItem(X2)
    | ~ ssItem(X3)
    | ~ ssItem(X1)
    | geq(X1,X2)
    | ~ geq(X3,X2)
    | ~ geq(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_561]) ).

cnf(c_0_561_4,axiom,
    ( ~ geq(X3,X2)
    | ~ ssItem(X2)
    | ~ ssItem(X3)
    | ~ ssItem(X1)
    | geq(X1,X2)
    | ~ geq(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_561]) ).

cnf(c_0_561_5,axiom,
    ( ~ geq(X1,X3)
    | ~ geq(X3,X2)
    | ~ ssItem(X2)
    | ~ ssItem(X3)
    | ~ ssItem(X1)
    | geq(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_561]) ).

cnf(c_0_562_0,axiom,
    ( segmentP(X1,X2)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ segmentP(X3,X2)
    | ~ segmentP(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_562]) ).

cnf(c_0_562_1,axiom,
    ( ~ ssList(X1)
    | segmentP(X1,X2)
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ segmentP(X3,X2)
    | ~ segmentP(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_562]) ).

cnf(c_0_562_2,axiom,
    ( ~ ssList(X3)
    | ~ ssList(X1)
    | segmentP(X1,X2)
    | ~ ssList(X2)
    | ~ segmentP(X3,X2)
    | ~ segmentP(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_562]) ).

cnf(c_0_562_3,axiom,
    ( ~ ssList(X2)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | segmentP(X1,X2)
    | ~ segmentP(X3,X2)
    | ~ segmentP(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_562]) ).

cnf(c_0_562_4,axiom,
    ( ~ segmentP(X3,X2)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | segmentP(X1,X2)
    | ~ segmentP(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_562]) ).

cnf(c_0_562_5,axiom,
    ( ~ segmentP(X1,X3)
    | ~ segmentP(X3,X2)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | segmentP(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_562]) ).

cnf(c_0_563_0,axiom,
    ( rearsegP(X1,X2)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ rearsegP(X3,X2)
    | ~ rearsegP(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_563]) ).

cnf(c_0_563_1,axiom,
    ( ~ ssList(X1)
    | rearsegP(X1,X2)
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ rearsegP(X3,X2)
    | ~ rearsegP(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_563]) ).

cnf(c_0_563_2,axiom,
    ( ~ ssList(X3)
    | ~ ssList(X1)
    | rearsegP(X1,X2)
    | ~ ssList(X2)
    | ~ rearsegP(X3,X2)
    | ~ rearsegP(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_563]) ).

cnf(c_0_563_3,axiom,
    ( ~ ssList(X2)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | rearsegP(X1,X2)
    | ~ rearsegP(X3,X2)
    | ~ rearsegP(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_563]) ).

cnf(c_0_563_4,axiom,
    ( ~ rearsegP(X3,X2)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | rearsegP(X1,X2)
    | ~ rearsegP(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_563]) ).

cnf(c_0_563_5,axiom,
    ( ~ rearsegP(X1,X3)
    | ~ rearsegP(X3,X2)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | rearsegP(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_563]) ).

cnf(c_0_564_0,axiom,
    ( frontsegP(X1,X2)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ frontsegP(X3,X2)
    | ~ frontsegP(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_564]) ).

cnf(c_0_564_1,axiom,
    ( ~ ssList(X1)
    | frontsegP(X1,X2)
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ frontsegP(X3,X2)
    | ~ frontsegP(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_564]) ).

cnf(c_0_564_2,axiom,
    ( ~ ssList(X3)
    | ~ ssList(X1)
    | frontsegP(X1,X2)
    | ~ ssList(X2)
    | ~ frontsegP(X3,X2)
    | ~ frontsegP(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_564]) ).

cnf(c_0_564_3,axiom,
    ( ~ ssList(X2)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | frontsegP(X1,X2)
    | ~ frontsegP(X3,X2)
    | ~ frontsegP(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_564]) ).

cnf(c_0_564_4,axiom,
    ( ~ frontsegP(X3,X2)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | frontsegP(X1,X2)
    | ~ frontsegP(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_564]) ).

cnf(c_0_564_5,axiom,
    ( ~ frontsegP(X1,X3)
    | ~ frontsegP(X3,X2)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | frontsegP(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_564]) ).

cnf(c_0_565_0,axiom,
    ( lt(X1,X2)
    | ~ ssItem(X1)
    | ~ ssItem(X3)
    | ~ ssItem(X2)
    | ~ lt(X3,X2)
    | ~ lt(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_565]) ).

cnf(c_0_565_1,axiom,
    ( ~ ssItem(X1)
    | lt(X1,X2)
    | ~ ssItem(X3)
    | ~ ssItem(X2)
    | ~ lt(X3,X2)
    | ~ lt(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_565]) ).

cnf(c_0_565_2,axiom,
    ( ~ ssItem(X3)
    | ~ ssItem(X1)
    | lt(X1,X2)
    | ~ ssItem(X2)
    | ~ lt(X3,X2)
    | ~ lt(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_565]) ).

cnf(c_0_565_3,axiom,
    ( ~ ssItem(X2)
    | ~ ssItem(X3)
    | ~ ssItem(X1)
    | lt(X1,X2)
    | ~ lt(X3,X2)
    | ~ lt(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_565]) ).

cnf(c_0_565_4,axiom,
    ( ~ lt(X3,X2)
    | ~ ssItem(X2)
    | ~ ssItem(X3)
    | ~ ssItem(X1)
    | lt(X1,X2)
    | ~ lt(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_565]) ).

cnf(c_0_565_5,axiom,
    ( ~ lt(X1,X3)
    | ~ lt(X3,X2)
    | ~ ssItem(X2)
    | ~ ssItem(X3)
    | ~ ssItem(X1)
    | lt(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_565]) ).

cnf(c_0_566_0,axiom,
    ( leq(X1,X2)
    | ~ ssItem(X1)
    | ~ ssItem(X3)
    | ~ ssItem(X2)
    | ~ leq(X3,X2)
    | ~ leq(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_566]) ).

cnf(c_0_566_1,axiom,
    ( ~ ssItem(X1)
    | leq(X1,X2)
    | ~ ssItem(X3)
    | ~ ssItem(X2)
    | ~ leq(X3,X2)
    | ~ leq(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_566]) ).

cnf(c_0_566_2,axiom,
    ( ~ ssItem(X3)
    | ~ ssItem(X1)
    | leq(X1,X2)
    | ~ ssItem(X2)
    | ~ leq(X3,X2)
    | ~ leq(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_566]) ).

cnf(c_0_566_3,axiom,
    ( ~ ssItem(X2)
    | ~ ssItem(X3)
    | ~ ssItem(X1)
    | leq(X1,X2)
    | ~ leq(X3,X2)
    | ~ leq(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_566]) ).

cnf(c_0_566_4,axiom,
    ( ~ leq(X3,X2)
    | ~ ssItem(X2)
    | ~ ssItem(X3)
    | ~ ssItem(X1)
    | leq(X1,X2)
    | ~ leq(X1,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_566]) ).

cnf(c_0_566_5,axiom,
    ( ~ leq(X1,X3)
    | ~ leq(X3,X2)
    | ~ ssItem(X2)
    | ~ ssItem(X3)
    | ~ ssItem(X1)
    | leq(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_566]) ).

cnf(c_0_567_0,axiom,
    ( app(skaf46(X1,X2),X2) = X1
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ rearsegP(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_567]) ).

cnf(c_0_567_1,axiom,
    ( ~ ssList(X1)
    | app(skaf46(X1,X2),X2) = X1
    | ~ ssList(X2)
    | ~ rearsegP(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_567]) ).

cnf(c_0_567_2,axiom,
    ( ~ ssList(X2)
    | ~ ssList(X1)
    | app(skaf46(X1,X2),X2) = X1
    | ~ rearsegP(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_567]) ).

cnf(c_0_567_3,axiom,
    ( ~ rearsegP(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X1)
    | app(skaf46(X1,X2),X2) = X1 ),
    inference(literals_permutation,[status(thm)],[c_0_567]) ).

cnf(c_0_568_0,axiom,
    ( app(X1,skaf45(X2,X1)) = X2
    | ~ ssList(X2)
    | ~ ssList(X1)
    | ~ frontsegP(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_568]) ).

cnf(c_0_568_1,axiom,
    ( ~ ssList(X2)
    | app(X1,skaf45(X2,X1)) = X2
    | ~ ssList(X1)
    | ~ frontsegP(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_568]) ).

cnf(c_0_568_2,axiom,
    ( ~ ssList(X1)
    | ~ ssList(X2)
    | app(X1,skaf45(X2,X1)) = X2
    | ~ frontsegP(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_568]) ).

cnf(c_0_568_3,axiom,
    ( ~ frontsegP(X2,X1)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | app(X1,skaf45(X2,X1)) = X2 ),
    inference(literals_permutation,[status(thm)],[c_0_568]) ).

cnf(c_0_569_0,axiom,
    ( X1 = X2
    | ~ ssList(X3)
    | ~ ssList(X4)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | cons(X1,X3) != cons(X2,X4) ),
    inference(literals_permutation,[status(thm)],[c_0_569]) ).

cnf(c_0_569_1,axiom,
    ( ~ ssList(X3)
    | X1 = X2
    | ~ ssList(X4)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | cons(X1,X3) != cons(X2,X4) ),
    inference(literals_permutation,[status(thm)],[c_0_569]) ).

cnf(c_0_569_2,axiom,
    ( ~ ssList(X4)
    | ~ ssList(X3)
    | X1 = X2
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | cons(X1,X3) != cons(X2,X4) ),
    inference(literals_permutation,[status(thm)],[c_0_569]) ).

cnf(c_0_569_3,axiom,
    ( ~ ssItem(X1)
    | ~ ssList(X4)
    | ~ ssList(X3)
    | X1 = X2
    | ~ ssItem(X2)
    | cons(X1,X3) != cons(X2,X4) ),
    inference(literals_permutation,[status(thm)],[c_0_569]) ).

cnf(c_0_569_4,axiom,
    ( ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ ssList(X4)
    | ~ ssList(X3)
    | X1 = X2
    | cons(X1,X3) != cons(X2,X4) ),
    inference(literals_permutation,[status(thm)],[c_0_569]) ).

cnf(c_0_569_5,axiom,
    ( cons(X1,X3) != cons(X2,X4)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ ssList(X4)
    | ~ ssList(X3)
    | X1 = X2 ),
    inference(literals_permutation,[status(thm)],[c_0_569]) ).

cnf(c_0_570_0,axiom,
    ( X1 = X2
    | ~ ssList(X2)
    | ~ ssList(X1)
    | ~ ssItem(X3)
    | ~ ssItem(X4)
    | cons(X3,X2) != cons(X4,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_570]) ).

cnf(c_0_570_1,axiom,
    ( ~ ssList(X2)
    | X1 = X2
    | ~ ssList(X1)
    | ~ ssItem(X3)
    | ~ ssItem(X4)
    | cons(X3,X2) != cons(X4,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_570]) ).

cnf(c_0_570_2,axiom,
    ( ~ ssList(X1)
    | ~ ssList(X2)
    | X1 = X2
    | ~ ssItem(X3)
    | ~ ssItem(X4)
    | cons(X3,X2) != cons(X4,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_570]) ).

cnf(c_0_570_3,axiom,
    ( ~ ssItem(X3)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | X1 = X2
    | ~ ssItem(X4)
    | cons(X3,X2) != cons(X4,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_570]) ).

cnf(c_0_570_4,axiom,
    ( ~ ssItem(X4)
    | ~ ssItem(X3)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | X1 = X2
    | cons(X3,X2) != cons(X4,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_570]) ).

cnf(c_0_570_5,axiom,
    ( cons(X3,X2) != cons(X4,X1)
    | ~ ssItem(X4)
    | ~ ssItem(X3)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | X1 = X2 ),
    inference(literals_permutation,[status(thm)],[c_0_570]) ).

cnf(c_0_571_0,axiom,
    ( nil = X1
    | strictorderedP(X1)
    | ~ ssItem(X2)
    | ~ ssList(X1)
    | ~ strictorderedP(cons(X2,X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_571]) ).

cnf(c_0_571_1,axiom,
    ( strictorderedP(X1)
    | nil = X1
    | ~ ssItem(X2)
    | ~ ssList(X1)
    | ~ strictorderedP(cons(X2,X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_571]) ).

cnf(c_0_571_2,axiom,
    ( ~ ssItem(X2)
    | strictorderedP(X1)
    | nil = X1
    | ~ ssList(X1)
    | ~ strictorderedP(cons(X2,X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_571]) ).

cnf(c_0_571_3,axiom,
    ( ~ ssList(X1)
    | ~ ssItem(X2)
    | strictorderedP(X1)
    | nil = X1
    | ~ strictorderedP(cons(X2,X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_571]) ).

cnf(c_0_571_4,axiom,
    ( ~ strictorderedP(cons(X2,X1))
    | ~ ssList(X1)
    | ~ ssItem(X2)
    | strictorderedP(X1)
    | nil = X1 ),
    inference(literals_permutation,[status(thm)],[c_0_571]) ).

cnf(c_0_572_0,axiom,
    ( nil = X1
    | totalorderedP(X1)
    | ~ ssItem(X2)
    | ~ ssList(X1)
    | ~ totalorderedP(cons(X2,X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_572]) ).

cnf(c_0_572_1,axiom,
    ( totalorderedP(X1)
    | nil = X1
    | ~ ssItem(X2)
    | ~ ssList(X1)
    | ~ totalorderedP(cons(X2,X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_572]) ).

cnf(c_0_572_2,axiom,
    ( ~ ssItem(X2)
    | totalorderedP(X1)
    | nil = X1
    | ~ ssList(X1)
    | ~ totalorderedP(cons(X2,X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_572]) ).

cnf(c_0_572_3,axiom,
    ( ~ ssList(X1)
    | ~ ssItem(X2)
    | totalorderedP(X1)
    | nil = X1
    | ~ totalorderedP(cons(X2,X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_572]) ).

cnf(c_0_572_4,axiom,
    ( ~ totalorderedP(cons(X2,X1))
    | ~ ssList(X1)
    | ~ ssItem(X2)
    | totalorderedP(X1)
    | nil = X1 ),
    inference(literals_permutation,[status(thm)],[c_0_572]) ).

cnf(c_0_573_0,axiom,
    ( X1 = X2
    | ~ ssList(X2)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | app(X3,X1) != app(X3,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_573]) ).

cnf(c_0_573_1,axiom,
    ( ~ ssList(X2)
    | X1 = X2
    | ~ ssList(X3)
    | ~ ssList(X1)
    | app(X3,X1) != app(X3,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_573]) ).

cnf(c_0_573_2,axiom,
    ( ~ ssList(X3)
    | ~ ssList(X2)
    | X1 = X2
    | ~ ssList(X1)
    | app(X3,X1) != app(X3,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_573]) ).

cnf(c_0_573_3,axiom,
    ( ~ ssList(X1)
    | ~ ssList(X3)
    | ~ ssList(X2)
    | X1 = X2
    | app(X3,X1) != app(X3,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_573]) ).

cnf(c_0_573_4,axiom,
    ( app(X3,X1) != app(X3,X2)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ ssList(X2)
    | X1 = X2 ),
    inference(literals_permutation,[status(thm)],[c_0_573]) ).

cnf(c_0_574_0,axiom,
    ( X1 = X2
    | ~ ssList(X2)
    | ~ ssList(X3)
    | ~ ssList(X1)
    | app(X1,X3) != app(X2,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_574]) ).

cnf(c_0_574_1,axiom,
    ( ~ ssList(X2)
    | X1 = X2
    | ~ ssList(X3)
    | ~ ssList(X1)
    | app(X1,X3) != app(X2,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_574]) ).

cnf(c_0_574_2,axiom,
    ( ~ ssList(X3)
    | ~ ssList(X2)
    | X1 = X2
    | ~ ssList(X1)
    | app(X1,X3) != app(X2,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_574]) ).

cnf(c_0_574_3,axiom,
    ( ~ ssList(X1)
    | ~ ssList(X3)
    | ~ ssList(X2)
    | X1 = X2
    | app(X1,X3) != app(X2,X3) ),
    inference(literals_permutation,[status(thm)],[c_0_574]) ).

cnf(c_0_574_4,axiom,
    ( app(X1,X3) != app(X2,X3)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ ssList(X2)
    | X1 = X2 ),
    inference(literals_permutation,[status(thm)],[c_0_574]) ).

cnf(c_0_575_0,axiom,
    ( tl(app(X1,X2)) = app(tl(X1),X2)
    | nil = X1
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(literals_permutation,[status(thm)],[c_0_575]) ).

cnf(c_0_575_1,axiom,
    ( nil = X1
    | tl(app(X1,X2)) = app(tl(X1),X2)
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(literals_permutation,[status(thm)],[c_0_575]) ).

cnf(c_0_575_2,axiom,
    ( ~ ssList(X1)
    | nil = X1
    | tl(app(X1,X2)) = app(tl(X1),X2)
    | ~ ssList(X2) ),
    inference(literals_permutation,[status(thm)],[c_0_575]) ).

cnf(c_0_575_3,axiom,
    ( ~ ssList(X2)
    | ~ ssList(X1)
    | nil = X1
    | tl(app(X1,X2)) = app(tl(X1),X2) ),
    inference(literals_permutation,[status(thm)],[c_0_575]) ).

cnf(c_0_576_0,axiom,
    ( memberP(cons(X1,X2),X3)
    | ~ ssItem(X3)
    | ~ ssItem(X1)
    | ~ ssList(X2)
    | X3 != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_576]) ).

cnf(c_0_576_1,axiom,
    ( ~ ssItem(X3)
    | memberP(cons(X1,X2),X3)
    | ~ ssItem(X1)
    | ~ ssList(X2)
    | X3 != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_576]) ).

cnf(c_0_576_2,axiom,
    ( ~ ssItem(X1)
    | ~ ssItem(X3)
    | memberP(cons(X1,X2),X3)
    | ~ ssList(X2)
    | X3 != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_576]) ).

cnf(c_0_576_3,axiom,
    ( ~ ssList(X2)
    | ~ ssItem(X1)
    | ~ ssItem(X3)
    | memberP(cons(X1,X2),X3)
    | X3 != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_576]) ).

cnf(c_0_576_4,axiom,
    ( X3 != X1
    | ~ ssList(X2)
    | ~ ssItem(X1)
    | ~ ssItem(X3)
    | memberP(cons(X1,X2),X3) ),
    inference(literals_permutation,[status(thm)],[c_0_576]) ).

cnf(c_0_577_0,axiom,
    ( app(cons(X1,nil),X2) = cons(X1,X2)
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_577]) ).

cnf(c_0_577_1,axiom,
    ( ~ ssList(X2)
    | app(cons(X1,nil),X2) = cons(X1,X2)
    | ~ ssItem(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_577]) ).

cnf(c_0_577_2,axiom,
    ( ~ ssItem(X1)
    | ~ ssList(X2)
    | app(cons(X1,nil),X2) = cons(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_577]) ).

cnf(c_0_578_0,axiom,
    ( X1 = X2
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ geq(X1,X2)
    | ~ geq(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_578]) ).

cnf(c_0_578_1,axiom,
    ( ~ ssItem(X1)
    | X1 = X2
    | ~ ssItem(X2)
    | ~ geq(X1,X2)
    | ~ geq(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_578]) ).

cnf(c_0_578_2,axiom,
    ( ~ ssItem(X2)
    | ~ ssItem(X1)
    | X1 = X2
    | ~ geq(X1,X2)
    | ~ geq(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_578]) ).

cnf(c_0_578_3,axiom,
    ( ~ geq(X1,X2)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | X1 = X2
    | ~ geq(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_578]) ).

cnf(c_0_578_4,axiom,
    ( ~ geq(X2,X1)
    | ~ geq(X1,X2)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | X1 = X2 ),
    inference(literals_permutation,[status(thm)],[c_0_578]) ).

cnf(c_0_579_0,axiom,
    ( X1 = X2
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ segmentP(X1,X2)
    | ~ segmentP(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_579]) ).

cnf(c_0_579_1,axiom,
    ( ~ ssList(X1)
    | X1 = X2
    | ~ ssList(X2)
    | ~ segmentP(X1,X2)
    | ~ segmentP(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_579]) ).

cnf(c_0_579_2,axiom,
    ( ~ ssList(X2)
    | ~ ssList(X1)
    | X1 = X2
    | ~ segmentP(X1,X2)
    | ~ segmentP(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_579]) ).

cnf(c_0_579_3,axiom,
    ( ~ segmentP(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X1)
    | X1 = X2
    | ~ segmentP(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_579]) ).

cnf(c_0_579_4,axiom,
    ( ~ segmentP(X2,X1)
    | ~ segmentP(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X1)
    | X1 = X2 ),
    inference(literals_permutation,[status(thm)],[c_0_579]) ).

cnf(c_0_580_0,axiom,
    ( X1 = X2
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ rearsegP(X1,X2)
    | ~ rearsegP(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_580]) ).

cnf(c_0_580_1,axiom,
    ( ~ ssList(X1)
    | X1 = X2
    | ~ ssList(X2)
    | ~ rearsegP(X1,X2)
    | ~ rearsegP(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_580]) ).

cnf(c_0_580_2,axiom,
    ( ~ ssList(X2)
    | ~ ssList(X1)
    | X1 = X2
    | ~ rearsegP(X1,X2)
    | ~ rearsegP(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_580]) ).

cnf(c_0_580_3,axiom,
    ( ~ rearsegP(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X1)
    | X1 = X2
    | ~ rearsegP(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_580]) ).

cnf(c_0_580_4,axiom,
    ( ~ rearsegP(X2,X1)
    | ~ rearsegP(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X1)
    | X1 = X2 ),
    inference(literals_permutation,[status(thm)],[c_0_580]) ).

cnf(c_0_581_0,axiom,
    ( X1 = X2
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ frontsegP(X1,X2)
    | ~ frontsegP(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_581]) ).

cnf(c_0_581_1,axiom,
    ( ~ ssList(X1)
    | X1 = X2
    | ~ ssList(X2)
    | ~ frontsegP(X1,X2)
    | ~ frontsegP(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_581]) ).

cnf(c_0_581_2,axiom,
    ( ~ ssList(X2)
    | ~ ssList(X1)
    | X1 = X2
    | ~ frontsegP(X1,X2)
    | ~ frontsegP(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_581]) ).

cnf(c_0_581_3,axiom,
    ( ~ frontsegP(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X1)
    | X1 = X2
    | ~ frontsegP(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_581]) ).

cnf(c_0_581_4,axiom,
    ( ~ frontsegP(X2,X1)
    | ~ frontsegP(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X1)
    | X1 = X2 ),
    inference(literals_permutation,[status(thm)],[c_0_581]) ).

cnf(c_0_582_0,axiom,
    ( X1 = X2
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ leq(X1,X2)
    | ~ leq(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_582]) ).

cnf(c_0_582_1,axiom,
    ( ~ ssItem(X1)
    | X1 = X2
    | ~ ssItem(X2)
    | ~ leq(X1,X2)
    | ~ leq(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_582]) ).

cnf(c_0_582_2,axiom,
    ( ~ ssItem(X2)
    | ~ ssItem(X1)
    | X1 = X2
    | ~ leq(X1,X2)
    | ~ leq(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_582]) ).

cnf(c_0_582_3,axiom,
    ( ~ leq(X1,X2)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | X1 = X2
    | ~ leq(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_582]) ).

cnf(c_0_582_4,axiom,
    ( ~ leq(X2,X1)
    | ~ leq(X1,X2)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | X1 = X2 ),
    inference(literals_permutation,[status(thm)],[c_0_582]) ).

cnf(c_0_583_0,axiom,
    ( rearsegP(X1,X2)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | app(X3,X2) != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_583]) ).

cnf(c_0_583_1,axiom,
    ( ~ ssList(X1)
    | rearsegP(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | app(X3,X2) != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_583]) ).

cnf(c_0_583_2,axiom,
    ( ~ ssList(X2)
    | ~ ssList(X1)
    | rearsegP(X1,X2)
    | ~ ssList(X3)
    | app(X3,X2) != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_583]) ).

cnf(c_0_583_3,axiom,
    ( ~ ssList(X3)
    | ~ ssList(X2)
    | ~ ssList(X1)
    | rearsegP(X1,X2)
    | app(X3,X2) != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_583]) ).

cnf(c_0_583_4,axiom,
    ( app(X3,X2) != X1
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ ssList(X1)
    | rearsegP(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_583]) ).

cnf(c_0_584_0,axiom,
    ( frontsegP(X1,X2)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | app(X2,X3) != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_584]) ).

cnf(c_0_584_1,axiom,
    ( ~ ssList(X1)
    | frontsegP(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | app(X2,X3) != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_584]) ).

cnf(c_0_584_2,axiom,
    ( ~ ssList(X2)
    | ~ ssList(X1)
    | frontsegP(X1,X2)
    | ~ ssList(X3)
    | app(X2,X3) != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_584]) ).

cnf(c_0_584_3,axiom,
    ( ~ ssList(X3)
    | ~ ssList(X2)
    | ~ ssList(X1)
    | frontsegP(X1,X2)
    | app(X2,X3) != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_584]) ).

cnf(c_0_584_4,axiom,
    ( app(X2,X3) != X1
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ ssList(X1)
    | frontsegP(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_584]) ).

cnf(c_0_585_0,axiom,
    ( ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ gt(X1,X2)
    | ~ gt(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_585]) ).

cnf(c_0_585_1,axiom,
    ( ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ gt(X1,X2)
    | ~ gt(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_585]) ).

cnf(c_0_585_2,axiom,
    ( ~ gt(X1,X2)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ gt(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_585]) ).

cnf(c_0_585_3,axiom,
    ( ~ gt(X2,X1)
    | ~ gt(X1,X2)
    | ~ ssItem(X2)
    | ~ ssItem(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_585]) ).

cnf(c_0_586_0,axiom,
    ( ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ lt(X1,X2)
    | ~ lt(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_586]) ).

cnf(c_0_586_1,axiom,
    ( ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ lt(X1,X2)
    | ~ lt(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_586]) ).

cnf(c_0_586_2,axiom,
    ( ~ lt(X1,X2)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ lt(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_586]) ).

cnf(c_0_586_3,axiom,
    ( ~ lt(X2,X1)
    | ~ lt(X1,X2)
    | ~ ssItem(X2)
    | ~ ssItem(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_586]) ).

cnf(c_0_587_0,axiom,
    ( X1 = X2
    | lt(X1,X2)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ leq(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_587]) ).

cnf(c_0_587_1,axiom,
    ( lt(X1,X2)
    | X1 = X2
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ leq(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_587]) ).

cnf(c_0_587_2,axiom,
    ( ~ ssItem(X1)
    | lt(X1,X2)
    | X1 = X2
    | ~ ssItem(X2)
    | ~ leq(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_587]) ).

cnf(c_0_587_3,axiom,
    ( ~ ssItem(X2)
    | ~ ssItem(X1)
    | lt(X1,X2)
    | X1 = X2
    | ~ leq(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_587]) ).

cnf(c_0_587_4,axiom,
    ( ~ leq(X1,X2)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | lt(X1,X2)
    | X1 = X2 ),
    inference(literals_permutation,[status(thm)],[c_0_587]) ).

cnf(c_0_588_0,axiom,
    ( X1 = X2
    | lt(X1,X2)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ leq(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_588]) ).

cnf(c_0_588_1,axiom,
    ( lt(X1,X2)
    | X1 = X2
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ leq(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_588]) ).

cnf(c_0_588_2,axiom,
    ( ~ ssItem(X1)
    | lt(X1,X2)
    | X1 = X2
    | ~ ssItem(X2)
    | ~ leq(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_588]) ).

cnf(c_0_588_3,axiom,
    ( ~ ssItem(X2)
    | ~ ssItem(X1)
    | lt(X1,X2)
    | X1 = X2
    | ~ leq(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_588]) ).

cnf(c_0_588_4,axiom,
    ( ~ leq(X1,X2)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | lt(X1,X2)
    | X1 = X2 ),
    inference(literals_permutation,[status(thm)],[c_0_588]) ).

cnf(c_0_589_0,axiom,
    ( strictorderedP(X1)
    | ~ ssList(X1)
    | ~ lt(skaf69(X1),skaf70(X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_589]) ).

cnf(c_0_589_1,axiom,
    ( ~ ssList(X1)
    | strictorderedP(X1)
    | ~ lt(skaf69(X1),skaf70(X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_589]) ).

cnf(c_0_589_2,axiom,
    ( ~ lt(skaf69(X1),skaf70(X1))
    | ~ ssList(X1)
    | strictorderedP(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_589]) ).

cnf(c_0_590_0,axiom,
    ( totalorderedP(X1)
    | ~ ssList(X1)
    | ~ leq(skaf64(X1),skaf65(X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_590]) ).

cnf(c_0_590_1,axiom,
    ( ~ ssList(X1)
    | totalorderedP(X1)
    | ~ leq(skaf64(X1),skaf65(X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_590]) ).

cnf(c_0_590_2,axiom,
    ( ~ leq(skaf64(X1),skaf65(X1))
    | ~ ssList(X1)
    | totalorderedP(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_590]) ).

cnf(c_0_591_0,axiom,
    ( strictorderP(X1)
    | ~ ssList(X1)
    | ~ lt(skaf60(X1),skaf59(X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_591]) ).

cnf(c_0_591_1,axiom,
    ( ~ ssList(X1)
    | strictorderP(X1)
    | ~ lt(skaf60(X1),skaf59(X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_591]) ).

cnf(c_0_591_2,axiom,
    ( ~ lt(skaf60(X1),skaf59(X1))
    | ~ ssList(X1)
    | strictorderP(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_591]) ).

cnf(c_0_592_0,axiom,
    ( strictorderP(X1)
    | ~ ssList(X1)
    | ~ lt(skaf59(X1),skaf60(X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_592]) ).

cnf(c_0_592_1,axiom,
    ( ~ ssList(X1)
    | strictorderP(X1)
    | ~ lt(skaf59(X1),skaf60(X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_592]) ).

cnf(c_0_592_2,axiom,
    ( ~ lt(skaf59(X1),skaf60(X1))
    | ~ ssList(X1)
    | strictorderP(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_592]) ).

cnf(c_0_593_0,axiom,
    ( totalorderP(X1)
    | ~ ssList(X1)
    | ~ leq(skaf55(X1),skaf54(X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_593]) ).

cnf(c_0_593_1,axiom,
    ( ~ ssList(X1)
    | totalorderP(X1)
    | ~ leq(skaf55(X1),skaf54(X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_593]) ).

cnf(c_0_593_2,axiom,
    ( ~ leq(skaf55(X1),skaf54(X1))
    | ~ ssList(X1)
    | totalorderP(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_593]) ).

cnf(c_0_594_0,axiom,
    ( totalorderP(X1)
    | ~ ssList(X1)
    | ~ leq(skaf54(X1),skaf55(X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_594]) ).

cnf(c_0_594_1,axiom,
    ( ~ ssList(X1)
    | totalorderP(X1)
    | ~ leq(skaf54(X1),skaf55(X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_594]) ).

cnf(c_0_594_2,axiom,
    ( ~ leq(skaf54(X1),skaf55(X1))
    | ~ ssList(X1)
    | totalorderP(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_594]) ).

cnf(c_0_595_0,axiom,
    ( leq(X1,X2)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ lt(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_595]) ).

cnf(c_0_595_1,axiom,
    ( ~ ssItem(X1)
    | leq(X1,X2)
    | ~ ssItem(X2)
    | ~ lt(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_595]) ).

cnf(c_0_595_2,axiom,
    ( ~ ssItem(X2)
    | ~ ssItem(X1)
    | leq(X1,X2)
    | ~ lt(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_595]) ).

cnf(c_0_595_3,axiom,
    ( ~ lt(X1,X2)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | leq(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_595]) ).

cnf(c_0_596_0,axiom,
    ( lt(X1,X2)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ gt(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_596]) ).

cnf(c_0_596_1,axiom,
    ( ~ ssItem(X2)
    | lt(X1,X2)
    | ~ ssItem(X1)
    | ~ gt(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_596]) ).

cnf(c_0_596_2,axiom,
    ( ~ ssItem(X1)
    | ~ ssItem(X2)
    | lt(X1,X2)
    | ~ gt(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_596]) ).

cnf(c_0_596_3,axiom,
    ( ~ gt(X2,X1)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | lt(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_596]) ).

cnf(c_0_597_0,axiom,
    ( gt(X1,X2)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ lt(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_597]) ).

cnf(c_0_597_1,axiom,
    ( ~ ssItem(X1)
    | gt(X1,X2)
    | ~ ssItem(X2)
    | ~ lt(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_597]) ).

cnf(c_0_597_2,axiom,
    ( ~ ssItem(X2)
    | ~ ssItem(X1)
    | gt(X1,X2)
    | ~ lt(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_597]) ).

cnf(c_0_597_3,axiom,
    ( ~ lt(X2,X1)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | gt(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_597]) ).

cnf(c_0_598_0,axiom,
    ( leq(X1,X2)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ geq(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_598]) ).

cnf(c_0_598_1,axiom,
    ( ~ ssItem(X2)
    | leq(X1,X2)
    | ~ ssItem(X1)
    | ~ geq(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_598]) ).

cnf(c_0_598_2,axiom,
    ( ~ ssItem(X1)
    | ~ ssItem(X2)
    | leq(X1,X2)
    | ~ geq(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_598]) ).

cnf(c_0_598_3,axiom,
    ( ~ geq(X2,X1)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | leq(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_598]) ).

cnf(c_0_599_0,axiom,
    ( geq(X1,X2)
    | ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ leq(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_599]) ).

cnf(c_0_599_1,axiom,
    ( ~ ssItem(X1)
    | geq(X1,X2)
    | ~ ssItem(X2)
    | ~ leq(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_599]) ).

cnf(c_0_599_2,axiom,
    ( ~ ssItem(X2)
    | ~ ssItem(X1)
    | geq(X1,X2)
    | ~ leq(X2,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_599]) ).

cnf(c_0_599_3,axiom,
    ( ~ leq(X2,X1)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | geq(X1,X2) ),
    inference(literals_permutation,[status(thm)],[c_0_599]) ).

cnf(c_0_600_0,axiom,
    ( hd(app(X1,X2)) = hd(X1)
    | nil = X1
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(literals_permutation,[status(thm)],[c_0_600]) ).

cnf(c_0_600_1,axiom,
    ( nil = X1
    | hd(app(X1,X2)) = hd(X1)
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(literals_permutation,[status(thm)],[c_0_600]) ).

cnf(c_0_600_2,axiom,
    ( ~ ssList(X1)
    | nil = X1
    | hd(app(X1,X2)) = hd(X1)
    | ~ ssList(X2) ),
    inference(literals_permutation,[status(thm)],[c_0_600]) ).

cnf(c_0_600_3,axiom,
    ( ~ ssList(X2)
    | ~ ssList(X1)
    | nil = X1
    | hd(app(X1,X2)) = hd(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_600]) ).

cnf(c_0_601_0,axiom,
    ( strictorderedP(cons(X1,X2))
    | ~ ssItem(X1)
    | ~ ssList(X2)
    | nil != X2 ),
    inference(literals_permutation,[status(thm)],[c_0_601]) ).

cnf(c_0_601_1,axiom,
    ( ~ ssItem(X1)
    | strictorderedP(cons(X1,X2))
    | ~ ssList(X2)
    | nil != X2 ),
    inference(literals_permutation,[status(thm)],[c_0_601]) ).

cnf(c_0_601_2,axiom,
    ( ~ ssList(X2)
    | ~ ssItem(X1)
    | strictorderedP(cons(X1,X2))
    | nil != X2 ),
    inference(literals_permutation,[status(thm)],[c_0_601]) ).

cnf(c_0_601_3,axiom,
    ( nil != X2
    | ~ ssList(X2)
    | ~ ssItem(X1)
    | strictorderedP(cons(X1,X2)) ),
    inference(literals_permutation,[status(thm)],[c_0_601]) ).

cnf(c_0_602_0,axiom,
    ( totalorderedP(cons(X1,X2))
    | ~ ssItem(X1)
    | ~ ssList(X2)
    | nil != X2 ),
    inference(literals_permutation,[status(thm)],[c_0_602]) ).

cnf(c_0_602_1,axiom,
    ( ~ ssItem(X1)
    | totalorderedP(cons(X1,X2))
    | ~ ssList(X2)
    | nil != X2 ),
    inference(literals_permutation,[status(thm)],[c_0_602]) ).

cnf(c_0_602_2,axiom,
    ( ~ ssList(X2)
    | ~ ssItem(X1)
    | totalorderedP(cons(X1,X2))
    | nil != X2 ),
    inference(literals_permutation,[status(thm)],[c_0_602]) ).

cnf(c_0_602_3,axiom,
    ( nil != X2
    | ~ ssList(X2)
    | ~ ssItem(X1)
    | totalorderedP(cons(X1,X2)) ),
    inference(literals_permutation,[status(thm)],[c_0_602]) ).

cnf(c_0_603_0,axiom,
    ( nil = X1
    | X1 = X2
    | nil = X2
    | ~ ssList(X2)
    | ~ ssList(X1)
    | hd(X1) != hd(X2)
    | tl(X1) != tl(X2) ),
    inference(literals_permutation,[status(thm)],[c_0_603]) ).

cnf(c_0_603_1,axiom,
    ( X1 = X2
    | nil = X1
    | nil = X2
    | ~ ssList(X2)
    | ~ ssList(X1)
    | hd(X1) != hd(X2)
    | tl(X1) != tl(X2) ),
    inference(literals_permutation,[status(thm)],[c_0_603]) ).

cnf(c_0_603_2,axiom,
    ( nil = X2
    | X1 = X2
    | nil = X1
    | ~ ssList(X2)
    | ~ ssList(X1)
    | hd(X1) != hd(X2)
    | tl(X1) != tl(X2) ),
    inference(literals_permutation,[status(thm)],[c_0_603]) ).

cnf(c_0_603_3,axiom,
    ( ~ ssList(X2)
    | nil = X2
    | X1 = X2
    | nil = X1
    | ~ ssList(X1)
    | hd(X1) != hd(X2)
    | tl(X1) != tl(X2) ),
    inference(literals_permutation,[status(thm)],[c_0_603]) ).

cnf(c_0_603_4,axiom,
    ( ~ ssList(X1)
    | ~ ssList(X2)
    | nil = X2
    | X1 = X2
    | nil = X1
    | hd(X1) != hd(X2)
    | tl(X1) != tl(X2) ),
    inference(literals_permutation,[status(thm)],[c_0_603]) ).

cnf(c_0_603_5,axiom,
    ( hd(X1) != hd(X2)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | nil = X2
    | X1 = X2
    | nil = X1
    | tl(X1) != tl(X2) ),
    inference(literals_permutation,[status(thm)],[c_0_603]) ).

cnf(c_0_603_6,axiom,
    ( tl(X1) != tl(X2)
    | hd(X1) != hd(X2)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | nil = X2
    | X1 = X2
    | nil = X1 ),
    inference(literals_permutation,[status(thm)],[c_0_603]) ).

cnf(c_0_604_0,axiom,
    ( tl(cons(X1,X2)) = X2
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_604]) ).

cnf(c_0_604_1,axiom,
    ( ~ ssList(X2)
    | tl(cons(X1,X2)) = X2
    | ~ ssItem(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_604]) ).

cnf(c_0_604_2,axiom,
    ( ~ ssItem(X1)
    | ~ ssList(X2)
    | tl(cons(X1,X2)) = X2 ),
    inference(literals_permutation,[status(thm)],[c_0_604]) ).

cnf(c_0_605_0,axiom,
    ( hd(cons(X1,X2)) = X1
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_605]) ).

cnf(c_0_605_1,axiom,
    ( ~ ssList(X2)
    | hd(cons(X1,X2)) = X1
    | ~ ssItem(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_605]) ).

cnf(c_0_605_2,axiom,
    ( ~ ssItem(X1)
    | ~ ssList(X2)
    | hd(cons(X1,X2)) = X1 ),
    inference(literals_permutation,[status(thm)],[c_0_605]) ).

cnf(c_0_606_0,axiom,
    ( ssList(app(X1,X2))
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(literals_permutation,[status(thm)],[c_0_606]) ).

cnf(c_0_606_1,axiom,
    ( ~ ssList(X1)
    | ssList(app(X1,X2))
    | ~ ssList(X2) ),
    inference(literals_permutation,[status(thm)],[c_0_606]) ).

cnf(c_0_606_2,axiom,
    ( ~ ssList(X2)
    | ~ ssList(X1)
    | ssList(app(X1,X2)) ),
    inference(literals_permutation,[status(thm)],[c_0_606]) ).

cnf(c_0_607_0,axiom,
    ( ssList(cons(X1,X2))
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_607]) ).

cnf(c_0_607_1,axiom,
    ( ~ ssList(X2)
    | ssList(cons(X1,X2))
    | ~ ssItem(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_607]) ).

cnf(c_0_607_2,axiom,
    ( ~ ssItem(X1)
    | ~ ssList(X2)
    | ssList(cons(X1,X2)) ),
    inference(literals_permutation,[status(thm)],[c_0_607]) ).

cnf(c_0_608_0,axiom,
    ( ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ lt(X1,X2)
    | X1 != X2 ),
    inference(literals_permutation,[status(thm)],[c_0_608]) ).

cnf(c_0_608_1,axiom,
    ( ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ lt(X1,X2)
    | X1 != X2 ),
    inference(literals_permutation,[status(thm)],[c_0_608]) ).

cnf(c_0_608_2,axiom,
    ( ~ lt(X1,X2)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | X1 != X2 ),
    inference(literals_permutation,[status(thm)],[c_0_608]) ).

cnf(c_0_608_3,axiom,
    ( X1 != X2
    | ~ lt(X1,X2)
    | ~ ssItem(X2)
    | ~ ssItem(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_608]) ).

cnf(c_0_609_0,axiom,
    ( ~ ssList(X1)
    | ~ ssList(X2)
    | ~ neq(X1,X2)
    | X1 != X2 ),
    inference(literals_permutation,[status(thm)],[c_0_609]) ).

cnf(c_0_609_1,axiom,
    ( ~ ssList(X2)
    | ~ ssList(X1)
    | ~ neq(X1,X2)
    | X1 != X2 ),
    inference(literals_permutation,[status(thm)],[c_0_609]) ).

cnf(c_0_609_2,axiom,
    ( ~ neq(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X1)
    | X1 != X2 ),
    inference(literals_permutation,[status(thm)],[c_0_609]) ).

cnf(c_0_609_3,axiom,
    ( X1 != X2
    | ~ neq(X1,X2)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_609]) ).

cnf(c_0_610_0,axiom,
    ( ~ ssItem(X1)
    | ~ ssItem(X2)
    | ~ neq(X1,X2)
    | X1 != X2 ),
    inference(literals_permutation,[status(thm)],[c_0_610]) ).

cnf(c_0_610_1,axiom,
    ( ~ ssItem(X2)
    | ~ ssItem(X1)
    | ~ neq(X1,X2)
    | X1 != X2 ),
    inference(literals_permutation,[status(thm)],[c_0_610]) ).

cnf(c_0_610_2,axiom,
    ( ~ neq(X1,X2)
    | ~ ssItem(X2)
    | ~ ssItem(X1)
    | X1 != X2 ),
    inference(literals_permutation,[status(thm)],[c_0_610]) ).

cnf(c_0_610_3,axiom,
    ( X1 != X2
    | ~ neq(X1,X2)
    | ~ ssItem(X2)
    | ~ ssItem(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_610]) ).

cnf(c_0_611_0,axiom,
    ( singletonP(X1)
    | ~ ssList(X1)
    | ~ ssItem(X2)
    | cons(X2,nil) != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_611]) ).

cnf(c_0_611_1,axiom,
    ( ~ ssList(X1)
    | singletonP(X1)
    | ~ ssItem(X2)
    | cons(X2,nil) != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_611]) ).

cnf(c_0_611_2,axiom,
    ( ~ ssItem(X2)
    | ~ ssList(X1)
    | singletonP(X1)
    | cons(X2,nil) != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_611]) ).

cnf(c_0_611_3,axiom,
    ( cons(X2,nil) != X1
    | ~ ssItem(X2)
    | ~ ssList(X1)
    | singletonP(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_611]) ).

cnf(c_0_612_0,axiom,
    ( nil = X1
    | ~ ssList(X1)
    | ~ ssList(X2)
    | app(X1,X2) != nil ),
    inference(literals_permutation,[status(thm)],[c_0_612]) ).

cnf(c_0_612_1,axiom,
    ( ~ ssList(X1)
    | nil = X1
    | ~ ssList(X2)
    | app(X1,X2) != nil ),
    inference(literals_permutation,[status(thm)],[c_0_612]) ).

cnf(c_0_612_2,axiom,
    ( ~ ssList(X2)
    | ~ ssList(X1)
    | nil = X1
    | app(X1,X2) != nil ),
    inference(literals_permutation,[status(thm)],[c_0_612]) ).

cnf(c_0_612_3,axiom,
    ( app(X1,X2) != nil
    | ~ ssList(X2)
    | ~ ssList(X1)
    | nil = X1 ),
    inference(literals_permutation,[status(thm)],[c_0_612]) ).

cnf(c_0_613_0,axiom,
    ( nil = X1
    | ~ ssList(X2)
    | ~ ssList(X1)
    | app(X2,X1) != nil ),
    inference(literals_permutation,[status(thm)],[c_0_613]) ).

cnf(c_0_613_1,axiom,
    ( ~ ssList(X2)
    | nil = X1
    | ~ ssList(X1)
    | app(X2,X1) != nil ),
    inference(literals_permutation,[status(thm)],[c_0_613]) ).

cnf(c_0_613_2,axiom,
    ( ~ ssList(X1)
    | ~ ssList(X2)
    | nil = X1
    | app(X2,X1) != nil ),
    inference(literals_permutation,[status(thm)],[c_0_613]) ).

cnf(c_0_613_3,axiom,
    ( app(X2,X1) != nil
    | ~ ssList(X1)
    | ~ ssList(X2)
    | nil = X1 ),
    inference(literals_permutation,[status(thm)],[c_0_613]) ).

cnf(c_0_614_0,axiom,
    ( leq(skaf50(X1),skaf49(X1))
    | cyclefreeP(X1)
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_614]) ).

cnf(c_0_614_1,axiom,
    ( cyclefreeP(X1)
    | leq(skaf50(X1),skaf49(X1))
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_614]) ).

cnf(c_0_614_2,axiom,
    ( ~ ssList(X1)
    | cyclefreeP(X1)
    | leq(skaf50(X1),skaf49(X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_614]) ).

cnf(c_0_615_0,axiom,
    ( leq(skaf49(X1),skaf50(X1))
    | cyclefreeP(X1)
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_615]) ).

cnf(c_0_615_1,axiom,
    ( cyclefreeP(X1)
    | leq(skaf49(X1),skaf50(X1))
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_615]) ).

cnf(c_0_615_2,axiom,
    ( ~ ssList(X1)
    | cyclefreeP(X1)
    | leq(skaf49(X1),skaf50(X1)) ),
    inference(literals_permutation,[status(thm)],[c_0_615]) ).

cnf(c_0_616_0,axiom,
    ( ~ ssList(X1)
    | ~ ssItem(X2)
    | cons(X2,X1) != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_616]) ).

cnf(c_0_616_1,axiom,
    ( ~ ssItem(X2)
    | ~ ssList(X1)
    | cons(X2,X1) != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_616]) ).

cnf(c_0_616_2,axiom,
    ( cons(X2,X1) != X1
    | ~ ssItem(X2)
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_616]) ).

cnf(c_0_617_0,axiom,
    ( ~ ssList(X1)
    | ~ ssItem(X2)
    | cons(X2,X1) != nil ),
    inference(literals_permutation,[status(thm)],[c_0_617]) ).

cnf(c_0_617_1,axiom,
    ( ~ ssItem(X2)
    | ~ ssList(X1)
    | cons(X2,X1) != nil ),
    inference(literals_permutation,[status(thm)],[c_0_617]) ).

cnf(c_0_617_2,axiom,
    ( cons(X2,X1) != nil
    | ~ ssItem(X2)
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_617]) ).

cnf(c_0_618_0,axiom,
    ( nil = X1
    | cons(hd(X1),tl(X1)) = X1
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_618]) ).

cnf(c_0_618_1,axiom,
    ( cons(hd(X1),tl(X1)) = X1
    | nil = X1
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_618]) ).

cnf(c_0_618_2,axiom,
    ( ~ ssList(X1)
    | cons(hd(X1),tl(X1)) = X1
    | nil = X1 ),
    inference(literals_permutation,[status(thm)],[c_0_618]) ).

cnf(c_0_619_0,axiom,
    ( nil = X1
    | cons(skaf83(X1),skaf82(X1)) = X1
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_619]) ).

cnf(c_0_619_1,axiom,
    ( cons(skaf83(X1),skaf82(X1)) = X1
    | nil = X1
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_619]) ).

cnf(c_0_619_2,axiom,
    ( ~ ssList(X1)
    | cons(skaf83(X1),skaf82(X1)) = X1
    | nil = X1 ),
    inference(literals_permutation,[status(thm)],[c_0_619]) ).

cnf(c_0_620_0,axiom,
    ( equalelemsP(cons(X1,nil))
    | ~ ssItem(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_620]) ).

cnf(c_0_620_1,axiom,
    ( ~ ssItem(X1)
    | equalelemsP(cons(X1,nil)) ),
    inference(literals_permutation,[status(thm)],[c_0_620]) ).

cnf(c_0_621_0,axiom,
    ( duplicatefreeP(cons(X1,nil))
    | ~ ssItem(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_621]) ).

cnf(c_0_621_1,axiom,
    ( ~ ssItem(X1)
    | duplicatefreeP(cons(X1,nil)) ),
    inference(literals_permutation,[status(thm)],[c_0_621]) ).

cnf(c_0_622_0,axiom,
    ( strictorderedP(cons(X1,nil))
    | ~ ssItem(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_622]) ).

cnf(c_0_622_1,axiom,
    ( ~ ssItem(X1)
    | strictorderedP(cons(X1,nil)) ),
    inference(literals_permutation,[status(thm)],[c_0_622]) ).

cnf(c_0_623_0,axiom,
    ( totalorderedP(cons(X1,nil))
    | ~ ssItem(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_623]) ).

cnf(c_0_623_1,axiom,
    ( ~ ssItem(X1)
    | totalorderedP(cons(X1,nil)) ),
    inference(literals_permutation,[status(thm)],[c_0_623]) ).

cnf(c_0_624_0,axiom,
    ( strictorderP(cons(X1,nil))
    | ~ ssItem(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_624]) ).

cnf(c_0_624_1,axiom,
    ( ~ ssItem(X1)
    | strictorderP(cons(X1,nil)) ),
    inference(literals_permutation,[status(thm)],[c_0_624]) ).

cnf(c_0_625_0,axiom,
    ( totalorderP(cons(X1,nil))
    | ~ ssItem(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_625]) ).

cnf(c_0_625_1,axiom,
    ( ~ ssItem(X1)
    | totalorderP(cons(X1,nil)) ),
    inference(literals_permutation,[status(thm)],[c_0_625]) ).

cnf(c_0_626_0,axiom,
    ( cyclefreeP(cons(X1,nil))
    | ~ ssItem(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_626]) ).

cnf(c_0_626_1,axiom,
    ( ~ ssItem(X1)
    | cyclefreeP(cons(X1,nil)) ),
    inference(literals_permutation,[status(thm)],[c_0_626]) ).

cnf(c_0_627_0,axiom,
    ( cons(skaf44(X1),nil) = X1
    | ~ ssList(X1)
    | ~ singletonP(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_627]) ).

cnf(c_0_627_1,axiom,
    ( ~ ssList(X1)
    | cons(skaf44(X1),nil) = X1
    | ~ singletonP(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_627]) ).

cnf(c_0_627_2,axiom,
    ( ~ singletonP(X1)
    | ~ ssList(X1)
    | cons(skaf44(X1),nil) = X1 ),
    inference(literals_permutation,[status(thm)],[c_0_627]) ).

cnf(c_0_628_0,axiom,
    ( app(X1,X2) = nil
    | ~ ssList(X1)
    | ~ ssList(X2)
    | nil != X2
    | nil != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_628]) ).

cnf(c_0_628_1,axiom,
    ( ~ ssList(X1)
    | app(X1,X2) = nil
    | ~ ssList(X2)
    | nil != X2
    | nil != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_628]) ).

cnf(c_0_628_2,axiom,
    ( ~ ssList(X2)
    | ~ ssList(X1)
    | app(X1,X2) = nil
    | nil != X2
    | nil != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_628]) ).

cnf(c_0_628_3,axiom,
    ( nil != X2
    | ~ ssList(X2)
    | ~ ssList(X1)
    | app(X1,X2) = nil
    | nil != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_628]) ).

cnf(c_0_628_4,axiom,
    ( nil != X1
    | nil != X2
    | ~ ssList(X2)
    | ~ ssList(X1)
    | app(X1,X2) = nil ),
    inference(literals_permutation,[status(thm)],[c_0_628]) ).

cnf(c_0_629_0,axiom,
    ( X1 = X2
    | neq(X1,X2)
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(literals_permutation,[status(thm)],[c_0_629]) ).

cnf(c_0_629_1,axiom,
    ( neq(X1,X2)
    | X1 = X2
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(literals_permutation,[status(thm)],[c_0_629]) ).

cnf(c_0_629_2,axiom,
    ( ~ ssList(X1)
    | neq(X1,X2)
    | X1 = X2
    | ~ ssList(X2) ),
    inference(literals_permutation,[status(thm)],[c_0_629]) ).

cnf(c_0_629_3,axiom,
    ( ~ ssList(X2)
    | ~ ssList(X1)
    | neq(X1,X2)
    | X1 = X2 ),
    inference(literals_permutation,[status(thm)],[c_0_629]) ).

cnf(c_0_630_0,axiom,
    ( X1 = X2
    | neq(X1,X2)
    | ~ ssItem(X1)
    | ~ ssItem(X2) ),
    inference(literals_permutation,[status(thm)],[c_0_630]) ).

cnf(c_0_630_1,axiom,
    ( neq(X1,X2)
    | X1 = X2
    | ~ ssItem(X1)
    | ~ ssItem(X2) ),
    inference(literals_permutation,[status(thm)],[c_0_630]) ).

cnf(c_0_630_2,axiom,
    ( ~ ssItem(X1)
    | neq(X1,X2)
    | X1 = X2
    | ~ ssItem(X2) ),
    inference(literals_permutation,[status(thm)],[c_0_630]) ).

cnf(c_0_630_3,axiom,
    ( ~ ssItem(X2)
    | ~ ssItem(X1)
    | neq(X1,X2)
    | X1 = X2 ),
    inference(literals_permutation,[status(thm)],[c_0_630]) ).

cnf(c_0_631_0,axiom,
    ( ~ ssItem(X1)
    | ~ lt(X1,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_631]) ).

cnf(c_0_631_1,axiom,
    ( ~ lt(X1,X1)
    | ~ ssItem(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_631]) ).

cnf(c_0_632_0,axiom,
    ( nil = X1
    | ~ ssList(X1)
    | ~ segmentP(nil,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_632]) ).

cnf(c_0_632_1,axiom,
    ( ~ ssList(X1)
    | nil = X1
    | ~ segmentP(nil,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_632]) ).

cnf(c_0_632_2,axiom,
    ( ~ segmentP(nil,X1)
    | ~ ssList(X1)
    | nil = X1 ),
    inference(literals_permutation,[status(thm)],[c_0_632]) ).

cnf(c_0_633_0,axiom,
    ( nil = X1
    | ~ ssList(X1)
    | ~ rearsegP(nil,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_633]) ).

cnf(c_0_633_1,axiom,
    ( ~ ssList(X1)
    | nil = X1
    | ~ rearsegP(nil,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_633]) ).

cnf(c_0_633_2,axiom,
    ( ~ rearsegP(nil,X1)
    | ~ ssList(X1)
    | nil = X1 ),
    inference(literals_permutation,[status(thm)],[c_0_633]) ).

cnf(c_0_634_0,axiom,
    ( nil = X1
    | ~ ssList(X1)
    | ~ frontsegP(nil,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_634]) ).

cnf(c_0_634_1,axiom,
    ( ~ ssList(X1)
    | nil = X1
    | ~ frontsegP(nil,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_634]) ).

cnf(c_0_634_2,axiom,
    ( ~ frontsegP(nil,X1)
    | ~ ssList(X1)
    | nil = X1 ),
    inference(literals_permutation,[status(thm)],[c_0_634]) ).

cnf(c_0_635_0,axiom,
    ( ~ ssItem(X1)
    | ~ memberP(nil,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_635]) ).

cnf(c_0_635_1,axiom,
    ( ~ memberP(nil,X1)
    | ~ ssItem(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_635]) ).

cnf(c_0_636_0,axiom,
    ( equalelemsP(X1)
    | ~ ssList(X1)
    | skaf79(X1) != skaf78(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_636]) ).

cnf(c_0_636_1,axiom,
    ( ~ ssList(X1)
    | equalelemsP(X1)
    | skaf79(X1) != skaf78(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_636]) ).

cnf(c_0_636_2,axiom,
    ( skaf79(X1) != skaf78(X1)
    | ~ ssList(X1)
    | equalelemsP(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_636]) ).

cnf(c_0_637_0,axiom,
    ( segmentP(nil,X1)
    | ~ ssList(X1)
    | nil != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_637]) ).

cnf(c_0_637_1,axiom,
    ( ~ ssList(X1)
    | segmentP(nil,X1)
    | nil != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_637]) ).

cnf(c_0_637_2,axiom,
    ( nil != X1
    | ~ ssList(X1)
    | segmentP(nil,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_637]) ).

cnf(c_0_638_0,axiom,
    ( rearsegP(nil,X1)
    | ~ ssList(X1)
    | nil != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_638]) ).

cnf(c_0_638_1,axiom,
    ( ~ ssList(X1)
    | rearsegP(nil,X1)
    | nil != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_638]) ).

cnf(c_0_638_2,axiom,
    ( nil != X1
    | ~ ssList(X1)
    | rearsegP(nil,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_638]) ).

cnf(c_0_639_0,axiom,
    ( frontsegP(nil,X1)
    | ~ ssList(X1)
    | nil != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_639]) ).

cnf(c_0_639_1,axiom,
    ( ~ ssList(X1)
    | frontsegP(nil,X1)
    | nil != X1 ),
    inference(literals_permutation,[status(thm)],[c_0_639]) ).

cnf(c_0_639_2,axiom,
    ( nil != X1
    | ~ ssList(X1)
    | frontsegP(nil,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_639]) ).

cnf(c_0_640_0,axiom,
    ( geq(X1,X1)
    | ~ ssItem(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_640]) ).

cnf(c_0_640_1,axiom,
    ( ~ ssItem(X1)
    | geq(X1,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_640]) ).

cnf(c_0_641_0,axiom,
    ( segmentP(X1,X1)
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_641]) ).

cnf(c_0_641_1,axiom,
    ( ~ ssList(X1)
    | segmentP(X1,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_641]) ).

cnf(c_0_642_0,axiom,
    ( rearsegP(X1,X1)
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_642]) ).

cnf(c_0_642_1,axiom,
    ( ~ ssList(X1)
    | rearsegP(X1,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_642]) ).

cnf(c_0_643_0,axiom,
    ( frontsegP(X1,X1)
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_643]) ).

cnf(c_0_643_1,axiom,
    ( ~ ssList(X1)
    | frontsegP(X1,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_643]) ).

cnf(c_0_644_0,axiom,
    ( leq(X1,X1)
    | ~ ssItem(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_644]) ).

cnf(c_0_644_1,axiom,
    ( ~ ssItem(X1)
    | leq(X1,X1) ),
    inference(literals_permutation,[status(thm)],[c_0_644]) ).

cnf(c_0_645_0,axiom,
    ( app(X1,nil) = X1
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_645]) ).

cnf(c_0_645_1,axiom,
    ( ~ ssList(X1)
    | app(X1,nil) = X1 ),
    inference(literals_permutation,[status(thm)],[c_0_645]) ).

cnf(c_0_646_0,axiom,
    ( app(nil,X1) = X1
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_646]) ).

cnf(c_0_646_1,axiom,
    ( ~ ssList(X1)
    | app(nil,X1) = X1 ),
    inference(literals_permutation,[status(thm)],[c_0_646]) ).

cnf(c_0_647_0,axiom,
    ( segmentP(X1,nil)
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_647]) ).

cnf(c_0_647_1,axiom,
    ( ~ ssList(X1)
    | segmentP(X1,nil) ),
    inference(literals_permutation,[status(thm)],[c_0_647]) ).

cnf(c_0_648_0,axiom,
    ( rearsegP(X1,nil)
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_648]) ).

cnf(c_0_648_1,axiom,
    ( ~ ssList(X1)
    | rearsegP(X1,nil) ),
    inference(literals_permutation,[status(thm)],[c_0_648]) ).

cnf(c_0_649_0,axiom,
    ( frontsegP(X1,nil)
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_649]) ).

cnf(c_0_649_1,axiom,
    ( ~ ssList(X1)
    | frontsegP(X1,nil) ),
    inference(literals_permutation,[status(thm)],[c_0_649]) ).

cnf(c_0_650_0,axiom,
    ( nil = X1
    | ssList(tl(X1))
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_650]) ).

cnf(c_0_650_1,axiom,
    ( ssList(tl(X1))
    | nil = X1
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_650]) ).

cnf(c_0_650_2,axiom,
    ( ~ ssList(X1)
    | ssList(tl(X1))
    | nil = X1 ),
    inference(literals_permutation,[status(thm)],[c_0_650]) ).

cnf(c_0_651_0,axiom,
    ( nil = X1
    | ssItem(hd(X1))
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_651]) ).

cnf(c_0_651_1,axiom,
    ( ssItem(hd(X1))
    | nil = X1
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_651]) ).

cnf(c_0_651_2,axiom,
    ( ~ ssList(X1)
    | ssItem(hd(X1))
    | nil = X1 ),
    inference(literals_permutation,[status(thm)],[c_0_651]) ).

cnf(c_0_652_0,axiom,
    ( nil = X1
    | ssList(tl(X1))
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_652]) ).

cnf(c_0_652_1,axiom,
    ( ssList(tl(X1))
    | nil = X1
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_652]) ).

cnf(c_0_652_2,axiom,
    ( ~ ssList(X1)
    | ssList(tl(X1))
    | nil = X1 ),
    inference(literals_permutation,[status(thm)],[c_0_652]) ).

cnf(c_0_653_0,axiom,
    ( nil = X1
    | ssItem(hd(X1))
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_653]) ).

cnf(c_0_653_1,axiom,
    ( ssItem(hd(X1))
    | nil = X1
    | ~ ssList(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_653]) ).

cnf(c_0_653_2,axiom,
    ( ~ ssList(X1)
    | ssItem(hd(X1))
    | nil = X1 ),
    inference(literals_permutation,[status(thm)],[c_0_653]) ).

cnf(c_0_654_0,axiom,
    ( ssItem(X1)
    | duplicatefreeP(X2)
    | ~ ssList(X2) ),
    inference(literals_permutation,[status(thm)],[c_0_654]) ).

cnf(c_0_654_1,axiom,
    ( duplicatefreeP(X2)
    | ssItem(X1)
    | ~ ssList(X2) ),
    inference(literals_permutation,[status(thm)],[c_0_654]) ).

cnf(c_0_654_2,axiom,
    ( ~ ssList(X2)
    | duplicatefreeP(X2)
    | ssItem(X1) ),
    inference(literals_permutation,[status(thm)],[c_0_654]) ).

% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_271,negated_conjecture,
    ~ $true,
    file('<stdin>',co1_1) ).

fof(c_0_1_272,negated_conjecture,
    ~ $true,
    c_0_0 ).

fof(c_0_2_273,negated_conjecture,
    ~ $true,
    c_0_1 ).

cnf(c_0_3_274,negated_conjecture,
    $false,
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4_275,negated_conjecture,
    $false,
    c_0_3,
    [final] ).

% End CNF derivation

%-------------------------------------------------------------
% Proof by iprover

cnf(c_604,negated_conjecture,
    $false,
    file('/export/starexec/sandbox/tmp/iprover_modulo_7d34f1.p',c_0_4) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : SWC128-1 : TPTP v8.1.0. Bugfixed v3.0.0.
% 0.04/0.14  % Command  : iprover_modulo %s %d
% 0.14/0.35  % Computer : n026.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Sun Jun 12 23:03:35 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.14/0.36  % Running in mono-core mode
% 0.22/0.45  % Orienting using strategy Equiv(ClausalAll)
% 0.22/0.45  % Orientation found
% 0.22/0.45  % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format  " --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_5b32fd.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_7d34f1.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_d65616 | grep -v "SZS"
% 0.22/0.48  
% 0.22/0.48  %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.22/0.48  
% 0.22/0.48  % 
% 0.22/0.48  % ------  iProver source info 
% 0.22/0.48  
% 0.22/0.48  % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.22/0.48  % git: non_committed_changes: true
% 0.22/0.48  % git: last_make_outside_of_git: true
% 0.22/0.48  
% 0.22/0.48  % 
% 0.22/0.48  % ------ Input Options
% 0.22/0.48  
% 0.22/0.48  % --out_options                         all
% 0.22/0.48  % --tptp_safe_out                       true
% 0.22/0.48  % --problem_path                        ""
% 0.22/0.48  % --include_path                        ""
% 0.22/0.48  % --clausifier                          .//eprover
% 0.22/0.48  % --clausifier_options                  --tstp-format  
% 0.22/0.48  % --stdin                               false
% 0.22/0.48  % --dbg_backtrace                       false
% 0.22/0.48  % --dbg_dump_prop_clauses               false
% 0.22/0.48  % --dbg_dump_prop_clauses_file          -
% 0.22/0.48  % --dbg_out_stat                        false
% 0.22/0.48  
% 0.22/0.48  % ------ General Options
% 0.22/0.48  
% 0.22/0.48  % --fof                                 false
% 0.22/0.48  % --time_out_real                       150.
% 0.22/0.48  % --time_out_prep_mult                  0.2
% 0.22/0.48  % --time_out_virtual                    -1.
% 0.22/0.48  % --schedule                            none
% 0.22/0.48  % --ground_splitting                    input
% 0.22/0.48  % --splitting_nvd                       16
% 0.22/0.48  % --non_eq_to_eq                        false
% 0.22/0.48  % --prep_gs_sim                         true
% 0.22/0.48  % --prep_unflatten                      false
% 0.22/0.48  % --prep_res_sim                        true
% 0.22/0.48  % --prep_upred                          true
% 0.22/0.48  % --res_sim_input                       true
% 0.22/0.48  % --clause_weak_htbl                    true
% 0.22/0.48  % --gc_record_bc_elim                   false
% 0.22/0.48  % --symbol_type_check                   false
% 0.22/0.48  % --clausify_out                        false
% 0.22/0.48  % --large_theory_mode                   false
% 0.22/0.48  % --prep_sem_filter                     none
% 0.22/0.48  % --prep_sem_filter_out                 false
% 0.22/0.48  % --preprocessed_out                    false
% 0.22/0.48  % --sub_typing                          false
% 0.22/0.48  % --brand_transform                     false
% 0.22/0.48  % --pure_diseq_elim                     true
% 0.22/0.48  % --min_unsat_core                      false
% 0.22/0.48  % --pred_elim                           true
% 0.22/0.48  % --add_important_lit                   false
% 0.22/0.48  % --soft_assumptions                    false
% 0.22/0.48  % --reset_solvers                       false
% 0.22/0.48  % --bc_imp_inh                          []
% 0.22/0.48  % --conj_cone_tolerance                 1.5
% 0.22/0.48  % --prolific_symb_bound                 500
% 0.22/0.48  % --lt_threshold                        2000
% 0.22/0.48  
% 0.22/0.48  % ------ SAT Options
% 0.22/0.48  
% 0.22/0.48  % --sat_mode                            false
% 0.22/0.48  % --sat_fm_restart_options              ""
% 0.22/0.48  % --sat_gr_def                          false
% 0.22/0.48  % --sat_epr_types                       true
% 0.22/0.48  % --sat_non_cyclic_types                false
% 0.22/0.48  % --sat_finite_models                   false
% 0.22/0.48  % --sat_fm_lemmas                       false
% 0.22/0.48  % --sat_fm_prep                         false
% 0.22/0.48  % --sat_fm_uc_incr                      true
% 0.22/0.48  % --sat_out_model                       small
% 0.22/0.48  % --sat_out_clauses                     false
% 0.22/0.48  
% 0.22/0.48  % ------ QBF Options
% 0.22/0.48  
% 0.22/0.48  % --qbf_mode                            false
% 0.22/0.48  % --qbf_elim_univ                       true
% 0.22/0.48  % --qbf_sk_in                           true
% 0.22/0.48  % --qbf_pred_elim                       true
% 0.22/0.48  % --qbf_split                           32
% 0.22/0.48  
% 0.22/0.48  % ------ BMC1 Options
% 0.22/0.48  
% 0.22/0.48  % --bmc1_incremental                    false
% 0.22/0.48  % --bmc1_axioms                         reachable_all
% 0.22/0.48  % --bmc1_min_bound                      0
% 0.22/0.48  % --bmc1_max_bound                      -1
% 0.22/0.48  % --bmc1_max_bound_default              -1
% 0.22/0.48  % --bmc1_symbol_reachability            true
% 0.22/0.48  % --bmc1_property_lemmas                false
% 0.22/0.48  % --bmc1_k_induction                    false
% 0.22/0.48  % --bmc1_non_equiv_states               false
% 0.22/0.48  % --bmc1_deadlock                       false
% 0.22/0.48  % --bmc1_ucm                            false
% 0.22/0.48  % --bmc1_add_unsat_core                 none
% 0.22/0.48  % --bmc1_unsat_core_children            false
% 0.22/0.48  % --bmc1_unsat_core_extrapolate_axioms  false
% 0.22/0.48  % --bmc1_out_stat                       full
% 0.22/0.48  % --bmc1_ground_init                    false
% 0.22/0.48  % --bmc1_pre_inst_next_state            false
% 0.22/0.48  % --bmc1_pre_inst_state                 false
% 0.22/0.48  % --bmc1_pre_inst_reach_state           false
% 0.22/0.48  % --bmc1_out_unsat_core                 false
% 0.22/0.48  % --bmc1_aig_witness_out                false
% 0.22/0.48  % --bmc1_verbose                        false
% 0.22/0.48  % --bmc1_dump_clauses_tptp              false
% 0.22/0.50  % --bmc1_dump_unsat_core_tptp           false
% 0.22/0.50  % --bmc1_dump_file                      -
% 0.22/0.50  % --bmc1_ucm_expand_uc_limit            128
% 0.22/0.50  % --bmc1_ucm_n_expand_iterations        6
% 0.22/0.50  % --bmc1_ucm_extend_mode                1
% 0.22/0.50  % --bmc1_ucm_init_mode                  2
% 0.22/0.50  % --bmc1_ucm_cone_mode                  none
% 0.22/0.50  % --bmc1_ucm_reduced_relation_type      0
% 0.22/0.50  % --bmc1_ucm_relax_model                4
% 0.22/0.50  % --bmc1_ucm_full_tr_after_sat          true
% 0.22/0.50  % --bmc1_ucm_expand_neg_assumptions     false
% 0.22/0.50  % --bmc1_ucm_layered_model              none
% 0.22/0.50  % --bmc1_ucm_max_lemma_size             10
% 0.22/0.50  
% 0.22/0.50  % ------ AIG Options
% 0.22/0.50  
% 0.22/0.50  % --aig_mode                            false
% 0.22/0.50  
% 0.22/0.50  % ------ Instantiation Options
% 0.22/0.50  
% 0.22/0.50  % --instantiation_flag                  true
% 0.22/0.50  % --inst_lit_sel                        [+prop;+sign;+ground;-num_var;-num_symb]
% 0.22/0.50  % --inst_solver_per_active              750
% 0.22/0.50  % --inst_solver_calls_frac              0.5
% 0.22/0.50  % --inst_passive_queue_type             priority_queues
% 0.22/0.50  % --inst_passive_queues                 [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.22/0.50  % --inst_passive_queues_freq            [25;2]
% 0.22/0.50  % --inst_dismatching                    true
% 0.22/0.50  % --inst_eager_unprocessed_to_passive   true
% 0.22/0.50  % --inst_prop_sim_given                 true
% 0.22/0.50  % --inst_prop_sim_new                   false
% 0.22/0.50  % --inst_orphan_elimination             true
% 0.22/0.50  % --inst_learning_loop_flag             true
% 0.22/0.50  % --inst_learning_start                 3000
% 0.22/0.50  % --inst_learning_factor                2
% 0.22/0.50  % --inst_start_prop_sim_after_learn     3
% 0.22/0.50  % --inst_sel_renew                      solver
% 0.22/0.50  % --inst_lit_activity_flag              true
% 0.22/0.50  % --inst_out_proof                      true
% 0.22/0.50  
% 0.22/0.50  % ------ Resolution Options
% 0.22/0.50  
% 0.22/0.50  % --resolution_flag                     true
% 0.22/0.50  % --res_lit_sel                         kbo_max
% 0.22/0.50  % --res_to_prop_solver                  none
% 0.22/0.50  % --res_prop_simpl_new                  false
% 0.22/0.50  % --res_prop_simpl_given                false
% 0.22/0.50  % --res_passive_queue_type              priority_queues
% 0.22/0.50  % --res_passive_queues                  [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.22/0.51  % --res_passive_queues_freq             [15;5]
% 0.22/0.51  % --res_forward_subs                    full
% 0.22/0.51  % --res_backward_subs                   full
% 0.22/0.51  % --res_forward_subs_resolution         true
% 0.22/0.51  % --res_backward_subs_resolution        true
% 0.22/0.51  % --res_orphan_elimination              false
% 0.22/0.51  % --res_time_limit                      1000.
% 0.22/0.51  % --res_out_proof                       true
% 0.22/0.51  % --proof_out_file                      /export/starexec/sandbox/tmp/iprover_proof_5b32fd.s
% 0.22/0.51  % --modulo                              true
% 0.22/0.51  
% 0.22/0.51  % ------ Combination Options
% 0.22/0.51  
% 0.22/0.51  % --comb_res_mult                       1000
% 0.22/0.51  % --comb_inst_mult                      300
% 0.22/0.51  % ------ 
% 0.22/0.51  
% 0.22/0.51  % ------ Parsing...% 
% 0.22/0.51  
% 0.22/0.51  
% 0.22/0.51  %  Resolution empty clause
% 0.22/0.51  
% 0.22/0.51  % ------                             Statistics
% 0.22/0.51  
% 0.22/0.51  % ------ General
% 0.22/0.51  
% 0.22/0.51  % num_of_input_clauses:                 605
% 0.22/0.51  % num_of_input_neg_conjectures:         1
% 0.22/0.51  % num_of_splits:                        0
% 0.22/0.51  % num_of_split_atoms:                   0
% 0.22/0.51  % num_of_sem_filtered_clauses:          0
% 0.22/0.51  % num_of_subtypes:                      0
% 0.22/0.51  % monotx_restored_types:                0
% 0.22/0.51  % sat_num_of_epr_types:                 0
% 0.22/0.51  % sat_num_of_non_cyclic_types:          0
% 0.22/0.51  % sat_guarded_non_collapsed_types:      0
% 0.22/0.51  % is_epr:                               0
% 0.22/0.51  % is_horn:                              0
% 0.22/0.51  % has_eq:                               0
% 0.22/0.51  % num_pure_diseq_elim:                  0
% 0.22/0.51  % simp_replaced_by:                     0
% 0.22/0.51  % res_preprocessed:                     0
% 0.22/0.51  % prep_upred:                           0
% 0.22/0.51  % prep_unflattend:                      0
% 0.22/0.51  % pred_elim_cands:                      0
% 0.22/0.51  % pred_elim:                            0
% 0.22/0.51  % pred_elim_cl:                         0
% 0.22/0.51  % pred_elim_cycles:                     0
% 0.22/0.51  % forced_gc_time:                       0
% 0.22/0.51  % gc_basic_clause_elim:                 0
% 0.22/0.51  % parsing_time:                         0.
% 0.22/0.51  % sem_filter_time:                      0.
% 0.22/0.51  % pred_elim_time:                       0.
% 0.22/0.51  % out_proof_time:                       0.
% 0.22/0.51  % monotx_time:                          0.
% 0.22/0.51  % subtype_inf_time:                     0.
% 0.22/0.51  % unif_index_cands_time:                0.
% 0.22/0.51  % unif_index_add_time:                  0.
% 0.22/0.51  % total_time:                           0.045
% 0.22/0.51  % num_of_symbols:                       93
% 0.22/0.51  % num_of_terms:                         575
% 0.22/0.51  
% 0.22/0.51  % ------ Propositional Solver
% 0.22/0.51  
% 0.22/0.51  % prop_solver_calls:                    0
% 0.22/0.51  % prop_fast_solver_calls:               0
% 0.22/0.51  % prop_num_of_clauses:                  0
% 0.22/0.51  % prop_preprocess_simplified:           0
% 0.22/0.51  % prop_fo_subsumed:                     0
% 0.22/0.51  % prop_solver_time:                     0.
% 0.22/0.51  % prop_fast_solver_time:                0.
% 0.22/0.51  % prop_unsat_core_time:                 0.
% 0.22/0.51  
% 0.22/0.51  % ------ QBF 
% 0.22/0.51  
% 0.22/0.51  % qbf_q_res:                            0
% 0.22/0.51  % qbf_num_tautologies:                  0
% 0.22/0.51  % qbf_prep_cycles:                      0
% 0.22/0.51  
% 0.22/0.51  % ------ BMC1
% 0.22/0.51  
% 0.22/0.51  % bmc1_current_bound:                   -1
% 0.22/0.51  % bmc1_last_solved_bound:               -1
% 0.22/0.51  % bmc1_unsat_core_size:                 -1
% 0.22/0.51  % bmc1_unsat_core_parents_size:         -1
% 0.22/0.51  % bmc1_merge_next_fun:                  0
% 0.22/0.51  % bmc1_unsat_core_clauses_time:         0.
% 0.22/0.51  
% 0.22/0.51  % ------ Instantiation
% 0.22/0.51  
% 0.22/0.51  % inst_num_of_clauses:                  undef
% 0.22/0.51  % inst_num_in_passive:                  undef
% 0.22/0.51  % inst_num_in_active:                   0
% 0.22/0.51  % inst_num_in_unprocessed:              0
% 0.22/0.51  % inst_num_of_loops:                    0
% 0.22/0.51  % inst_num_of_learning_restarts:        0
% 0.22/0.51  % inst_num_moves_active_passive:        0
% 0.22/0.51  % inst_lit_activity:                    0
% 0.22/0.51  % inst_lit_activity_moves:              0
% 0.22/0.51  % inst_num_tautologies:                 0
% 0.22/0.51  % inst_num_prop_implied:                0
% 0.22/0.51  % inst_num_existing_simplified:         0
% 0.22/0.51  % inst_num_eq_res_simplified:           0
% 0.22/0.51  % inst_num_child_elim:                  0
% 0.22/0.51  % inst_num_of_dismatching_blockings:    0
% 0.22/0.51  % inst_num_of_non_proper_insts:         0
% 0.22/0.51  % inst_num_of_duplicates:               0
% 0.22/0.51  % inst_inst_num_from_inst_to_res:       0
% 0.22/0.51  % inst_dismatching_checking_time:       0.
% 0.22/0.51  
% 0.22/0.51  % ------ Resolution
% 0.22/0.51  
% 0.22/0.51  % res_num_of_clauses:                   undef
% 0.22/0.51  % res_num_in_passive:                   undef
% 0.22/0.51  % res_num_in_active:                    0
% 0.22/0.51  % res_num_of_loops:                     0
% 0.22/0.51  % res_forward_subset_subsumed:          0
% 0.22/0.51  % res_backward_subset_subsumed:         0
% 0.22/0.51  % res_forward_subsumed:                 0
% 0.22/0.51  % res_backward_subsumed:                0
% 0.22/0.51  % res_forward_subsumption_resolution:   0
% 0.22/0.51  % res_backward_subsumption_resolution:  0
% 0.22/0.51  % res_clause_to_clause_subsumption:     0
% 0.22/0.51  % res_orphan_elimination:               0
% 0.22/0.51  % res_tautology_del:                    0
% 0.22/0.51  % res_num_eq_res_simplified:            0
% 0.22/0.51  % res_num_sel_changes:                  0
% 0.22/0.51  % res_moves_from_active_to_pass:        0
% 0.22/0.51  
% 0.22/0.51  % Status Unsatisfiable
% 0.22/0.51  % SZS status Unsatisfiable
% 0.22/0.51  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------