TSTP Solution File: SWV167+1 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SWV167+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n027.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 : Wed Jul 20 18:15:26 EDT 2022

% Result   : Theorem 0.26s 1.44s
% Output   : CNFRefutation 0.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   35
%            Number of leaves      :   26
% Syntax   : Number of formulae    :  171 (  67 unt;   0 def)
%            Number of atoms       :  630 ( 361 equ)
%            Maximal formula atoms :   45 (   3 avg)
%            Number of connectives :  570 ( 111   ~; 323   |;  84   &)
%                                         (   2 <=>;  50  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   26 (   4 avg)
%            Maximal term depth    :    6 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   2 prp; 0-2 aty)
%            Number of functors    :   24 (  24 usr;  19 con; 0-3 aty)
%            Number of variables   :  134 (   2 sgn  88   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(cl5_nebula_init_0011,conjecture,
    ( ( a_select2(mu_init,pv40) = init
      & a_select2(sigma_init,pv40) = init
      & leq(n0,pv40)
      & leq(pv40,n4)
      & ! [X14] :
          ( ( leq(n0,X14)
            & leq(X14,n135299) )
         => ! [X18] :
              ( ( leq(n0,X18)
                & leq(X18,n4) )
             => a_select3(q_init,X14,X18) = init ) )
      & ! [X4] :
          ( ( leq(n0,X4)
            & leq(X4,n4) )
         => a_select2(rho_init,X4) = init )
      & ! [X20] :
          ( ( leq(n0,X20)
            & leq(X20,pred(pv40)) )
         => a_select2(mu_init,X20) = init )
      & ! [X21] :
          ( ( leq(n0,X21)
            & leq(X21,pred(pv40)) )
         => a_select2(sigma_init,X21) = init )
      & ! [X22] :
          ( ( leq(n0,X22)
            & leq(X22,n4) )
         => a_select3(center_init,X22,n0) = init )
      & ( gt(loopcounter,n1)
       => ! [X28] :
            ( ( leq(n0,X28)
              & leq(X28,n4) )
           => a_select2(muold_init,X28) = init ) )
      & ( gt(loopcounter,n1)
       => ! [X29] :
            ( ( leq(n0,X29)
              & leq(X29,n4) )
           => a_select2(rhoold_init,X29) = init ) )
      & ( gt(loopcounter,n1)
       => ! [X5] :
            ( ( leq(n0,X5)
              & leq(X5,n4) )
           => a_select2(sigmaold_init,X5) = init ) ) )
   => ! [X11] :
        ( ( leq(n0,X11)
          & leq(X11,pv40) )
       => a_select2(mu_init,X11) = init ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',cl5_nebula_init_0011) ).

fof(leq_succ_gt,axiom,
    ! [X1,X2] :
      ( leq(succ(X1),X2)
     => gt(X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_succ_gt) ).

fof(succ_plus_1_r,axiom,
    ! [X1] : plus(X1,n1) = succ(X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',succ_plus_1_r) ).

fof(finite_domain_4,axiom,
    ! [X1] :
      ( ( leq(n0,X1)
        & leq(X1,n4) )
     => ( X1 = n0
        | X1 = n1
        | X1 = n2
        | X1 = n3
        | X1 = n4 ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',finite_domain_4) ).

fof(irreflexivity_gt,axiom,
    ! [X1] : ~ gt(X1,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).

fof(finite_domain_1,axiom,
    ! [X1] :
      ( ( leq(n0,X1)
        & leq(X1,n1) )
     => ( X1 = n0
        | X1 = n1 ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',finite_domain_1) ).

fof(successor_1,axiom,
    succ(n0) = n1,
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',successor_1) ).

fof(transitivity_leq,axiom,
    ! [X1,X2,X3] :
      ( ( leq(X1,X2)
        & leq(X2,X3) )
     => leq(X1,X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',transitivity_leq) ).

fof(leq_gt1,axiom,
    ! [X1,X2] :
      ( gt(X2,X1)
     => leq(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_gt1) ).

fof(totality,axiom,
    ! [X1,X2] :
      ( gt(X1,X2)
      | gt(X2,X1)
      | X1 = X2 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',totality) ).

fof(successor_2,axiom,
    succ(succ(n0)) = n2,
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',successor_2) ).

fof(pred_succ,axiom,
    ! [X1] : pred(succ(X1)) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',pred_succ) ).

fof(successor_3,axiom,
    succ(succ(succ(n0))) = n3,
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',successor_3) ).

fof(leq_gt_pred,axiom,
    ! [X1,X2] :
      ( leq(X1,pred(X2))
    <=> gt(X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_gt_pred) ).

fof(reflexivity_leq,axiom,
    ! [X1] : leq(X1,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',reflexivity_leq) ).

fof(successor_4,axiom,
    succ(succ(succ(succ(n0)))) = n4,
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',successor_4) ).

fof(successor_5,axiom,
    succ(succ(succ(succ(succ(n0))))) = n5,
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',successor_5) ).

fof(transitivity_gt,axiom,
    ! [X1,X2,X3] :
      ( ( gt(X1,X2)
        & gt(X2,X3) )
     => gt(X1,X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',transitivity_gt) ).

fof(gt_2_0,axiom,
    gt(n2,n0),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',gt_2_0) ).

fof(gt_1_0,axiom,
    gt(n1,n0),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',gt_1_0) ).

fof(finite_domain_5,axiom,
    ! [X1] :
      ( ( leq(n0,X1)
        & leq(X1,n5) )
     => ( X1 = n0
        | X1 = n1
        | X1 = n2
        | X1 = n3
        | X1 = n4
        | X1 = n5 ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',finite_domain_5) ).

fof(gt_3_2,axiom,
    gt(n3,n2),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',gt_3_2) ).

fof(leq_gt2,axiom,
    ! [X1,X2] :
      ( ( leq(X1,X2)
        & X1 != X2 )
     => gt(X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_gt2) ).

fof(finite_domain_3,axiom,
    ! [X1] :
      ( ( leq(n0,X1)
        & leq(X1,n3) )
     => ( X1 = n0
        | X1 = n1
        | X1 = n2
        | X1 = n3 ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',finite_domain_3) ).

fof(gt_3_0,axiom,
    gt(n3,n0),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',gt_3_0) ).

fof(c_0_25,plain,
    ( epred1_0
  <=> ( a_select2(mu_init,pv40) = init
      & a_select2(sigma_init,pv40) = init
      & leq(n0,pv40)
      & leq(pv40,n4)
      & ! [X14] :
          ( ( leq(n0,X14)
            & leq(X14,n135299) )
         => ! [X18] :
              ( ( leq(n0,X18)
                & leq(X18,n4) )
             => a_select3(q_init,X14,X18) = init ) )
      & ! [X4] :
          ( ( leq(n0,X4)
            & leq(X4,n4) )
         => a_select2(rho_init,X4) = init )
      & ! [X20] :
          ( ( leq(n0,X20)
            & leq(X20,pred(pv40)) )
         => a_select2(mu_init,X20) = init )
      & ! [X21] :
          ( ( leq(n0,X21)
            & leq(X21,pred(pv40)) )
         => a_select2(sigma_init,X21) = init )
      & ! [X22] :
          ( ( leq(n0,X22)
            & leq(X22,n4) )
         => a_select3(center_init,X22,n0) = init )
      & ( gt(loopcounter,n1)
       => ! [X28] :
            ( ( leq(n0,X28)
              & leq(X28,n4) )
           => a_select2(muold_init,X28) = init ) )
      & ( gt(loopcounter,n1)
       => ! [X29] :
            ( ( leq(n0,X29)
              & leq(X29,n4) )
           => a_select2(rhoold_init,X29) = init ) )
      & ( gt(loopcounter,n1)
       => ! [X5] :
            ( ( leq(n0,X5)
              & leq(X5,n4) )
           => a_select2(sigmaold_init,X5) = init ) ) ) ),
    introduced(definition) ).

fof(c_0_26,plain,
    ( epred1_0
   => ( a_select2(mu_init,pv40) = init
      & a_select2(sigma_init,pv40) = init
      & leq(n0,pv40)
      & leq(pv40,n4)
      & ! [X14] :
          ( ( leq(n0,X14)
            & leq(X14,n135299) )
         => ! [X18] :
              ( ( leq(n0,X18)
                & leq(X18,n4) )
             => a_select3(q_init,X14,X18) = init ) )
      & ! [X4] :
          ( ( leq(n0,X4)
            & leq(X4,n4) )
         => a_select2(rho_init,X4) = init )
      & ! [X20] :
          ( ( leq(n0,X20)
            & leq(X20,pred(pv40)) )
         => a_select2(mu_init,X20) = init )
      & ! [X21] :
          ( ( leq(n0,X21)
            & leq(X21,pred(pv40)) )
         => a_select2(sigma_init,X21) = init )
      & ! [X22] :
          ( ( leq(n0,X22)
            & leq(X22,n4) )
         => a_select3(center_init,X22,n0) = init )
      & ( gt(loopcounter,n1)
       => ! [X28] :
            ( ( leq(n0,X28)
              & leq(X28,n4) )
           => a_select2(muold_init,X28) = init ) )
      & ( gt(loopcounter,n1)
       => ! [X29] :
            ( ( leq(n0,X29)
              & leq(X29,n4) )
           => a_select2(rhoold_init,X29) = init ) )
      & ( gt(loopcounter,n1)
       => ! [X5] :
            ( ( leq(n0,X5)
              & leq(X5,n4) )
           => a_select2(sigmaold_init,X5) = init ) ) ) ),
    inference(split_equiv,[status(thm)],[c_0_25]) ).

fof(c_0_27,negated_conjecture,
    ~ ( epred1_0
     => ! [X11] :
          ( ( leq(n0,X11)
            & leq(X11,pv40) )
         => a_select2(mu_init,X11) = init ) ),
    inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cl5_nebula_init_0011]),c_0_25]) ).

fof(c_0_28,plain,
    ! [X30,X31,X32,X33,X34,X35,X36,X37,X38] :
      ( ( a_select2(mu_init,pv40) = init
        | ~ epred1_0 )
      & ( a_select2(sigma_init,pv40) = init
        | ~ epred1_0 )
      & ( leq(n0,pv40)
        | ~ epred1_0 )
      & ( leq(pv40,n4)
        | ~ epred1_0 )
      & ( ~ leq(n0,X30)
        | ~ leq(X30,n135299)
        | ~ leq(n0,X31)
        | ~ leq(X31,n4)
        | a_select3(q_init,X30,X31) = init
        | ~ epred1_0 )
      & ( ~ leq(n0,X32)
        | ~ leq(X32,n4)
        | a_select2(rho_init,X32) = init
        | ~ epred1_0 )
      & ( ~ leq(n0,X33)
        | ~ leq(X33,pred(pv40))
        | a_select2(mu_init,X33) = init
        | ~ epred1_0 )
      & ( ~ leq(n0,X34)
        | ~ leq(X34,pred(pv40))
        | a_select2(sigma_init,X34) = init
        | ~ epred1_0 )
      & ( ~ leq(n0,X35)
        | ~ leq(X35,n4)
        | a_select3(center_init,X35,n0) = init
        | ~ epred1_0 )
      & ( ~ gt(loopcounter,n1)
        | ~ leq(n0,X36)
        | ~ leq(X36,n4)
        | a_select2(muold_init,X36) = init
        | ~ epred1_0 )
      & ( ~ gt(loopcounter,n1)
        | ~ leq(n0,X37)
        | ~ leq(X37,n4)
        | a_select2(rhoold_init,X37) = init
        | ~ epred1_0 )
      & ( ~ gt(loopcounter,n1)
        | ~ leq(n0,X38)
        | ~ leq(X38,n4)
        | a_select2(sigmaold_init,X38) = init
        | ~ epred1_0 ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])])])])])]) ).

fof(c_0_29,negated_conjecture,
    ( epred1_0
    & leq(n0,esk1_0)
    & leq(esk1_0,pv40)
    & a_select2(mu_init,esk1_0) != init ),
    inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_27])])])])]) ).

fof(c_0_30,plain,
    ! [X3,X4] :
      ( ~ leq(succ(X3),X4)
      | gt(X4,X3) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_succ_gt])]) ).

fof(c_0_31,plain,
    ! [X2] : plus(X2,n1) = succ(X2),
    inference(variable_rename,[status(thm)],[succ_plus_1_r]) ).

fof(c_0_32,plain,
    ! [X2] :
      ( ~ leq(n0,X2)
      | ~ leq(X2,n4)
      | X2 = n0
      | X2 = n1
      | X2 = n2
      | X2 = n3
      | X2 = n4 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[finite_domain_4])]) ).

cnf(c_0_33,plain,
    ( leq(pv40,n4)
    | ~ epred1_0 ),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_34,negated_conjecture,
    epred1_0,
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

cnf(c_0_35,plain,
    ( leq(n0,pv40)
    | ~ epred1_0 ),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

fof(c_0_36,plain,
    ! [X2] : ~ gt(X2,X2),
    inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[irreflexivity_gt])]) ).

cnf(c_0_37,plain,
    ( gt(X1,X2)
    | ~ leq(succ(X2),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

cnf(c_0_38,plain,
    plus(X1,n1) = succ(X1),
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

fof(c_0_39,plain,
    ! [X2] :
      ( ~ leq(n0,X2)
      | ~ leq(X2,n1)
      | X2 = n0
      | X2 = n1 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[finite_domain_1])]) ).

cnf(c_0_40,plain,
    ( X1 = n4
    | X1 = n3
    | X1 = n2
    | X1 = n1
    | X1 = n0
    | ~ leq(X1,n4)
    | ~ leq(n0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_32]) ).

cnf(c_0_41,plain,
    leq(pv40,n4),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).

cnf(c_0_42,plain,
    leq(n0,pv40),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_34])]) ).

cnf(c_0_43,plain,
    ~ gt(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_36]) ).

cnf(c_0_44,plain,
    ( gt(X1,X2)
    | ~ leq(plus(X2,n1),X1) ),
    inference(rw,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_45,plain,
    succ(n0) = n1,
    inference(split_conjunct,[status(thm)],[successor_1]) ).

cnf(c_0_46,plain,
    ( X1 = n1
    | X1 = n0
    | ~ leq(X1,n1)
    | ~ leq(n0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_39]) ).

cnf(c_0_47,plain,
    ( n0 = pv40
    | n1 = pv40
    | n2 = pv40
    | n3 = pv40
    | n4 = pv40 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]) ).

cnf(c_0_48,plain,
    ~ leq(plus(X1,n1),X1),
    inference(spm,[status(thm)],[c_0_43,c_0_44]) ).

cnf(c_0_49,plain,
    plus(n0,n1) = n1,
    inference(rw,[status(thm)],[c_0_45,c_0_38]) ).

cnf(c_0_50,plain,
    ( n4 = pv40
    | n3 = pv40
    | n2 = pv40
    | n0 = pv40
    | X1 = n0
    | X1 = pv40
    | ~ leq(X1,pv40)
    | ~ leq(n0,X1) ),
    inference(spm,[status(thm)],[c_0_46,c_0_47]) ).

cnf(c_0_51,negated_conjecture,
    leq(esk1_0,pv40),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

cnf(c_0_52,negated_conjecture,
    leq(n0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

fof(c_0_53,plain,
    ! [X4,X5,X6] :
      ( ~ leq(X4,X5)
      | ~ leq(X5,X6)
      | leq(X4,X6) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity_leq])]) ).

fof(c_0_54,plain,
    ! [X3,X4] :
      ( ~ gt(X4,X3)
      | leq(X3,X4) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt1])]) ).

fof(c_0_55,plain,
    ! [X3,X4] :
      ( gt(X3,X4)
      | gt(X4,X3)
      | X3 = X4 ),
    inference(variable_rename,[status(thm)],[totality]) ).

cnf(c_0_56,plain,
    succ(succ(n0)) = n2,
    inference(split_conjunct,[status(thm)],[successor_2]) ).

fof(c_0_57,plain,
    ! [X2] : pred(succ(X2)) = X2,
    inference(variable_rename,[status(thm)],[pred_succ]) ).

cnf(c_0_58,plain,
    ~ leq(n1,n0),
    inference(spm,[status(thm)],[c_0_48,c_0_49]) ).

cnf(c_0_59,negated_conjecture,
    ( pv40 = esk1_0
    | n0 = esk1_0
    | n0 = pv40
    | n2 = pv40
    | n3 = pv40
    | n4 = pv40 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52])]) ).

cnf(c_0_60,plain,
    ( leq(X1,X2)
    | ~ leq(X3,X2)
    | ~ leq(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_53]) ).

cnf(c_0_61,plain,
    ( leq(X1,X2)
    | ~ gt(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_54]) ).

cnf(c_0_62,plain,
    ( X1 = X2
    | gt(X2,X1)
    | gt(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_55]) ).

cnf(c_0_63,plain,
    succ(succ(succ(n0))) = n3,
    inference(split_conjunct,[status(thm)],[successor_3]) ).

cnf(c_0_64,plain,
    plus(plus(n0,n1),n1) = n2,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_38]),c_0_38]) ).

fof(c_0_65,plain,
    ! [X3,X4,X3,X4] :
      ( ( ~ leq(X3,pred(X4))
        | gt(X4,X3) )
      & ( ~ gt(X4,X3)
        | leq(X3,pred(X4)) ) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt_pred])])])]) ).

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

cnf(c_0_67,plain,
    pred(succ(X1)) = X1,
    inference(split_conjunct,[status(thm)],[c_0_57]) ).

cnf(c_0_68,negated_conjecture,
    ( n4 = pv40
    | n3 = pv40
    | n2 = pv40
    | n0 = esk1_0
    | pv40 = esk1_0
    | ~ leq(n1,pv40) ),
    inference(spm,[status(thm)],[c_0_58,c_0_59]) ).

cnf(c_0_69,negated_conjecture,
    ( leq(X1,pv40)
    | ~ leq(X1,esk1_0) ),
    inference(spm,[status(thm)],[c_0_60,c_0_51]) ).

cnf(c_0_70,plain,
    ( X1 = X2
    | leq(X1,X2)
    | gt(X1,X2) ),
    inference(spm,[status(thm)],[c_0_61,c_0_62]) ).

cnf(c_0_71,plain,
    succ(succ(succ(succ(n0)))) = n4,
    inference(split_conjunct,[status(thm)],[successor_4]) ).

cnf(c_0_72,plain,
    plus(plus(plus(n0,n1),n1),n1) = n3,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_38]),c_0_38]),c_0_38]) ).

cnf(c_0_73,plain,
    plus(n1,n1) = n2,
    inference(rw,[status(thm)],[c_0_64,c_0_49]) ).

cnf(c_0_74,plain,
    ( gt(X1,X2)
    | ~ leq(X2,pred(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_65]) ).

cnf(c_0_75,plain,
    leq(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_66]) ).

cnf(c_0_76,plain,
    ( a_select2(mu_init,X1) = init
    | ~ epred1_0
    | ~ leq(X1,pred(pv40))
    | ~ leq(n0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_77,plain,
    pred(plus(X1,n1)) = X1,
    inference(rw,[status(thm)],[c_0_67,c_0_38]) ).

cnf(c_0_78,negated_conjecture,
    ( pv40 = esk1_0
    | n0 = esk1_0
    | n2 = pv40
    | n3 = pv40
    | n4 = pv40
    | ~ leq(n1,esk1_0) ),
    inference(spm,[status(thm)],[c_0_68,c_0_69]) ).

cnf(c_0_79,plain,
    ( X1 = X2
    | leq(X1,X2)
    | leq(X2,X1) ),
    inference(spm,[status(thm)],[c_0_61,c_0_70]) ).

cnf(c_0_80,plain,
    succ(succ(succ(succ(succ(n0))))) = n5,
    inference(split_conjunct,[status(thm)],[successor_5]) ).

cnf(c_0_81,plain,
    plus(plus(plus(plus(n0,n1),n1),n1),n1) = n4,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_38]),c_0_38]),c_0_38]),c_0_38]) ).

cnf(c_0_82,plain,
    plus(n2,n1) = n3,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_49]),c_0_73]) ).

fof(c_0_83,plain,
    ! [X4,X5,X6] :
      ( ~ gt(X4,X5)
      | ~ gt(X5,X6)
      | gt(X4,X6) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity_gt])]) ).

cnf(c_0_84,plain,
    gt(X1,pred(X1)),
    inference(spm,[status(thm)],[c_0_74,c_0_75]) ).

cnf(c_0_85,plain,
    ( a_select2(mu_init,X1) = init
    | ~ leq(X1,pred(pv40))
    | ~ leq(n0,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_34])]) ).

cnf(c_0_86,plain,
    pred(n1) = n0,
    inference(spm,[status(thm)],[c_0_77,c_0_49]) ).

cnf(c_0_87,negated_conjecture,
    ( n1 = esk1_0
    | n4 = pv40
    | n3 = pv40
    | n2 = pv40
    | n0 = esk1_0
    | pv40 = esk1_0
    | leq(esk1_0,n1) ),
    inference(spm,[status(thm)],[c_0_78,c_0_79]) ).

cnf(c_0_88,plain,
    plus(plus(plus(plus(plus(n0,n1),n1),n1),n1),n1) = n5,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_38]),c_0_38]),c_0_38]),c_0_38]),c_0_38]) ).

cnf(c_0_89,plain,
    plus(n3,n1) = n4,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_81,c_0_49]),c_0_73]),c_0_82]) ).

cnf(c_0_90,plain,
    ( gt(X1,X2)
    | ~ gt(X3,X2)
    | ~ gt(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_83]) ).

cnf(c_0_91,plain,
    gt(n2,n0),
    inference(split_conjunct,[status(thm)],[gt_2_0]) ).

cnf(c_0_92,plain,
    leq(pred(X1),X1),
    inference(spm,[status(thm)],[c_0_61,c_0_84]) ).

cnf(c_0_93,plain,
    ( a_select2(mu_init,pred(pv40)) = init
    | ~ leq(n0,pred(pv40)) ),
    inference(spm,[status(thm)],[c_0_85,c_0_75]) ).

cnf(c_0_94,plain,
    ( pred(pv40) = n0
    | n4 = pv40
    | n3 = pv40
    | n2 = pv40
    | n0 = pv40 ),
    inference(spm,[status(thm)],[c_0_86,c_0_47]) ).

cnf(c_0_95,negated_conjecture,
    ( pv40 = esk1_0
    | n2 = pv40
    | n3 = pv40
    | n4 = pv40
    | n0 = esk1_0
    | n1 = esk1_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_87]),c_0_52])]) ).

cnf(c_0_96,plain,
    ( leq(X1,n4)
    | ~ leq(X1,pv40) ),
    inference(spm,[status(thm)],[c_0_60,c_0_41]) ).

cnf(c_0_97,plain,
    plus(n4,n1) = n5,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_88,c_0_49]),c_0_73]),c_0_82]),c_0_89]) ).

cnf(c_0_98,plain,
    ( gt(X1,n0)
    | ~ gt(X1,n2) ),
    inference(spm,[status(thm)],[c_0_90,c_0_91]) ).

cnf(c_0_99,plain,
    gt(X1,pred(pred(X1))),
    inference(spm,[status(thm)],[c_0_74,c_0_92]) ).

cnf(c_0_100,plain,
    ( a_select2(mu_init,n0) = init
    | n0 = pv40
    | n2 = pv40
    | n3 = pv40
    | n4 = pv40 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_75])]) ).

cnf(c_0_101,negated_conjecture,
    ( pv40 = esk1_0
    | n0 = esk1_0
    | n2 = pv40
    | n3 = pv40
    | n4 = pv40 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_95]),c_0_51])]) ).

cnf(c_0_102,negated_conjecture,
    a_select2(mu_init,esk1_0) != init,
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

cnf(c_0_103,plain,
    ~ leq(n5,pv40),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_96]),c_0_97]) ).

cnf(c_0_104,plain,
    ( leq(n0,X1)
    | ~ gt(X1,n2) ),
    inference(spm,[status(thm)],[c_0_61,c_0_98]) ).

cnf(c_0_105,plain,
    leq(pred(pred(X1)),X1),
    inference(spm,[status(thm)],[c_0_61,c_0_99]) ).

cnf(c_0_106,plain,
    pred(n4) = n3,
    inference(spm,[status(thm)],[c_0_77,c_0_89]) ).

cnf(c_0_107,plain,
    ( n4 = pv40
    | n3 = pv40
    | n2 = pv40
    | pv40 = esk1_0 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_102]) ).

cnf(c_0_108,plain,
    gt(n1,n0),
    inference(split_conjunct,[status(thm)],[gt_1_0]) ).

fof(c_0_109,plain,
    ! [X2] :
      ( ~ leq(n0,X2)
      | ~ leq(X2,n5)
      | X2 = n0
      | X2 = n1
      | X2 = n2
      | X2 = n3
      | X2 = n4
      | X2 = n5 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[finite_domain_5])]) ).

cnf(c_0_110,negated_conjecture,
    ~ leq(n5,esk1_0),
    inference(spm,[status(thm)],[c_0_103,c_0_69]) ).

cnf(c_0_111,plain,
    ( leq(n0,X1)
    | ~ leq(n3,X1) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_44]),c_0_82]) ).

cnf(c_0_112,plain,
    ( a_select2(mu_init,pred(pred(pred(pv40)))) = init
    | ~ leq(n0,pred(pred(pred(pv40)))) ),
    inference(spm,[status(thm)],[c_0_85,c_0_105]) ).

cnf(c_0_113,plain,
    ( pred(pv40) = n3
    | pv40 = esk1_0
    | n2 = pv40
    | n3 = pv40 ),
    inference(spm,[status(thm)],[c_0_106,c_0_107]) ).

cnf(c_0_114,plain,
    pred(n3) = n2,
    inference(spm,[status(thm)],[c_0_77,c_0_82]) ).

cnf(c_0_115,plain,
    pred(n2) = n1,
    inference(spm,[status(thm)],[c_0_77,c_0_73]) ).

cnf(c_0_116,plain,
    leq(n0,n1),
    inference(spm,[status(thm)],[c_0_61,c_0_108]) ).

cnf(c_0_117,plain,
    ( X1 = n5
    | X1 = n4
    | X1 = n3
    | X1 = n2
    | X1 = n1
    | X1 = n0
    | ~ leq(X1,n5)
    | ~ leq(n0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_109]) ).

cnf(c_0_118,negated_conjecture,
    ( n5 = esk1_0
    | leq(esk1_0,n5) ),
    inference(spm,[status(thm)],[c_0_110,c_0_79]) ).

cnf(c_0_119,plain,
    gt(n3,n2),
    inference(split_conjunct,[status(thm)],[gt_3_2]) ).

cnf(c_0_120,plain,
    ( a_select2(mu_init,n0) = init
    | ~ leq(n3,pred(pv40)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_111]),c_0_75])]) ).

cnf(c_0_121,plain,
    ( a_select2(mu_init,n1) = init
    | n3 = pv40
    | n2 = pv40
    | pv40 = esk1_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_113]),c_0_114]),c_0_115]),c_0_114]),c_0_115]),c_0_116])]) ).

cnf(c_0_122,negated_conjecture,
    ( n0 = esk1_0
    | n1 = esk1_0
    | n2 = esk1_0
    | n3 = esk1_0
    | n4 = esk1_0
    | n5 = esk1_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_52])]) ).

cnf(c_0_123,plain,
    ( gt(X1,n2)
    | ~ gt(X1,n3) ),
    inference(spm,[status(thm)],[c_0_90,c_0_119]) ).

fof(c_0_124,plain,
    ! [X3,X4] :
      ( ~ leq(X3,X4)
      | X3 = X4
      | gt(X4,X3) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt2])]) ).

cnf(c_0_125,plain,
    ( a_select2(mu_init,n0) = init
    | n3 = pv40
    | n2 = pv40
    | pv40 = esk1_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_113]),c_0_75])]) ).

cnf(c_0_126,negated_conjecture,
    ( n5 = esk1_0
    | n4 = esk1_0
    | n3 = esk1_0
    | n2 = esk1_0
    | n0 = esk1_0
    | pv40 = esk1_0
    | n2 = pv40
    | n3 = pv40 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_122]),c_0_102]) ).

cnf(c_0_127,plain,
    ~ gt(n2,n3),
    inference(spm,[status(thm)],[c_0_43,c_0_123]) ).

cnf(c_0_128,plain,
    ( gt(X1,X2)
    | X2 = X1
    | ~ leq(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_124]) ).

cnf(c_0_129,plain,
    ( n2 = esk1_0
    | n3 = esk1_0
    | n4 = esk1_0
    | n5 = esk1_0
    | pv40 = esk1_0
    | n2 = pv40
    | n3 = pv40 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_126]),c_0_102]) ).

cnf(c_0_130,plain,
    ( n2 = n3
    | ~ leq(n3,n2) ),
    inference(spm,[status(thm)],[c_0_127,c_0_128]) ).

cnf(c_0_131,plain,
    ( n5 = esk1_0
    | n3 = esk1_0
    | n2 = esk1_0
    | n2 = pv40
    | n3 = pv40
    | pv40 = esk1_0 ),
    inference(spm,[status(thm)],[c_0_107,c_0_129]) ).

cnf(c_0_132,plain,
    ( pv40 = esk1_0
    | n2 = esk1_0
    | n3 = esk1_0
    | n5 = esk1_0
    | n3 = pv40
    | ~ leq(n3,pv40) ),
    inference(spm,[status(thm)],[c_0_130,c_0_131]) ).

fof(c_0_133,plain,
    ! [X2] :
      ( ~ leq(n0,X2)
      | ~ leq(X2,n3)
      | X2 = n0
      | X2 = n1
      | X2 = n2
      | X2 = n3 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[finite_domain_3])]) ).

cnf(c_0_134,negated_conjecture,
    ( n3 = pv40
    | n5 = esk1_0
    | n3 = esk1_0
    | n2 = esk1_0
    | pv40 = esk1_0
    | ~ leq(n3,esk1_0) ),
    inference(spm,[status(thm)],[c_0_132,c_0_69]) ).

cnf(c_0_135,plain,
    ( pred(pv40) = n1
    | pv40 = esk1_0
    | n3 = pv40
    | n2 = esk1_0
    | n3 = esk1_0
    | n5 = esk1_0 ),
    inference(spm,[status(thm)],[c_0_115,c_0_131]) ).

cnf(c_0_136,plain,
    ( X1 = n3
    | X1 = n2
    | X1 = n1
    | X1 = n0
    | ~ leq(X1,n3)
    | ~ leq(n0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_133]) ).

cnf(c_0_137,negated_conjecture,
    ( pv40 = esk1_0
    | n2 = esk1_0
    | n3 = esk1_0
    | n5 = esk1_0
    | n3 = pv40
    | leq(esk1_0,n3) ),
    inference(spm,[status(thm)],[c_0_134,c_0_79]) ).

cnf(c_0_138,plain,
    ( a_select2(mu_init,pred(pred(pv40))) = init
    | ~ leq(n0,pred(pred(pv40))) ),
    inference(spm,[status(thm)],[c_0_85,c_0_92]) ).

cnf(c_0_139,plain,
    ( a_select2(mu_init,n1) = init
    | n5 = esk1_0
    | n3 = esk1_0
    | n2 = esk1_0
    | n3 = pv40
    | pv40 = esk1_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_135]),c_0_116])]) ).

cnf(c_0_140,negated_conjecture,
    ( n3 = pv40
    | n5 = esk1_0
    | pv40 = esk1_0
    | n0 = esk1_0
    | n1 = esk1_0
    | n2 = esk1_0
    | n3 = esk1_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_136,c_0_137]),c_0_52])]) ).

cnf(c_0_141,plain,
    leq(n0,n2),
    inference(spm,[status(thm)],[c_0_61,c_0_91]) ).

cnf(c_0_142,plain,
    ( a_select2(mu_init,n0) = init
    | n5 = esk1_0
    | n3 = esk1_0
    | n2 = esk1_0
    | n3 = pv40
    | pv40 = esk1_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_135]),c_0_86]),c_0_86]),c_0_75])]) ).

cnf(c_0_143,negated_conjecture,
    ( n0 = esk1_0
    | pv40 = esk1_0
    | n3 = pv40
    | n2 = esk1_0
    | n3 = esk1_0
    | n5 = esk1_0 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_139,c_0_140]),c_0_102]) ).

cnf(c_0_144,plain,
    ( a_select2(mu_init,n2) = init
    | n3 = pv40
    | n2 = pv40
    | pv40 = esk1_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_113]),c_0_114]),c_0_114]),c_0_141])]) ).

cnf(c_0_145,plain,
    ( pv40 = esk1_0
    | n3 = pv40
    | n2 = esk1_0
    | n3 = esk1_0
    | n5 = esk1_0 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_142,c_0_143]),c_0_102]) ).

cnf(c_0_146,plain,
    ( n5 = esk1_0
    | n3 = esk1_0
    | pv40 = esk1_0
    | n3 = pv40 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_144,c_0_145]),c_0_102]) ).

cnf(c_0_147,plain,
    ( pred(pv40) = n2
    | pv40 = esk1_0
    | n3 = esk1_0
    | n5 = esk1_0 ),
    inference(spm,[status(thm)],[c_0_114,c_0_146]) ).

cnf(c_0_148,plain,
    ( X1 = n0
    | X1 = n1
    | X1 = n2
    | X1 = n3
    | X1 = n4
    | ~ leq(n0,X1)
    | ~ leq(X1,pv40) ),
    inference(spm,[status(thm)],[c_0_40,c_0_96]) ).

cnf(c_0_149,plain,
    ~ leq(n4,n3),
    inference(spm,[status(thm)],[c_0_48,c_0_89]) ).

cnf(c_0_150,plain,
    ( a_select2(mu_init,n1) = init
    | n5 = esk1_0
    | n3 = esk1_0
    | pv40 = esk1_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_147]),c_0_115]),c_0_115]),c_0_116])]) ).

cnf(c_0_151,negated_conjecture,
    ( n4 = esk1_0
    | n3 = esk1_0
    | n2 = esk1_0
    | n1 = esk1_0
    | n0 = esk1_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_148,c_0_52]),c_0_51])]) ).

cnf(c_0_152,plain,
    ( pv40 = esk1_0
    | n3 = esk1_0
    | n5 = esk1_0
    | ~ leq(n4,pv40) ),
    inference(spm,[status(thm)],[c_0_149,c_0_146]) ).

cnf(c_0_153,plain,
    ( a_select2(mu_init,n0) = init
    | n5 = esk1_0
    | n3 = esk1_0
    | pv40 = esk1_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_147]),c_0_115]),c_0_86]),c_0_115]),c_0_86]),c_0_75])]) ).

cnf(c_0_154,negated_conjecture,
    ( n0 = esk1_0
    | n2 = esk1_0
    | n4 = esk1_0
    | pv40 = esk1_0
    | n3 = esk1_0
    | n5 = esk1_0 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_150,c_0_151]),c_0_102]) ).

cnf(c_0_155,negated_conjecture,
    ( n5 = esk1_0
    | n3 = esk1_0
    | pv40 = esk1_0
    | ~ leq(n4,esk1_0) ),
    inference(spm,[status(thm)],[c_0_152,c_0_69]) ).

cnf(c_0_156,plain,
    ( n4 = esk1_0
    | n2 = esk1_0
    | pv40 = esk1_0
    | n3 = esk1_0
    | n5 = esk1_0 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_153,c_0_154]),c_0_102]) ).

cnf(c_0_157,plain,
    gt(n3,n0),
    inference(split_conjunct,[status(thm)],[gt_3_0]) ).

cnf(c_0_158,plain,
    ( a_select2(mu_init,n2) = init
    | n5 = esk1_0
    | n3 = esk1_0
    | pv40 = esk1_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_147]),c_0_141])]) ).

cnf(c_0_159,negated_conjecture,
    ( n2 = esk1_0
    | pv40 = esk1_0
    | n3 = esk1_0
    | n5 = esk1_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_155,c_0_156]),c_0_75])]) ).

cnf(c_0_160,plain,
    leq(n0,n3),
    inference(spm,[status(thm)],[c_0_61,c_0_157]) ).

cnf(c_0_161,plain,
    ~ leq(n3,n2),
    inference(spm,[status(thm)],[c_0_48,c_0_82]) ).

cnf(c_0_162,plain,
    ( pv40 = esk1_0
    | n3 = esk1_0
    | n5 = esk1_0 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_158,c_0_159]),c_0_102]) ).

cnf(c_0_163,plain,
    ( a_select2(mu_init,n3) = init
    | n3 = pv40
    | n2 = pv40
    | pv40 = esk1_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_113]),c_0_160])]) ).

cnf(c_0_164,plain,
    ( n5 = esk1_0
    | pv40 = esk1_0
    | ~ leq(esk1_0,n2) ),
    inference(spm,[status(thm)],[c_0_161,c_0_162]) ).

cnf(c_0_165,plain,
    ( n5 = esk1_0
    | n2 = pv40
    | pv40 = esk1_0 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_163,c_0_162]),c_0_102]) ).

cnf(c_0_166,plain,
    ( a_select2(mu_init,pv40) = init
    | ~ epred1_0 ),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_167,plain,
    ( pv40 = esk1_0
    | n5 = esk1_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_164,c_0_165]),c_0_51])]) ).

cnf(c_0_168,plain,
    a_select2(mu_init,pv40) = init,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_166,c_0_34])]) ).

cnf(c_0_169,plain,
    pv40 = esk1_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_167]),c_0_51])]) ).

cnf(c_0_170,plain,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_168,c_0_169]),c_0_102]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWV167+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.07/0.13  % Command  : run_ET %s %d
% 0.14/0.35  % Computer : n027.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 : Wed Jun 15 13:45:04 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.26/1.44  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.26/1.44  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.26/1.44  # Preprocessing time       : 0.019 s
% 0.26/1.44  
% 0.26/1.44  # Proof found!
% 0.26/1.44  # SZS status Theorem
% 0.26/1.44  # SZS output start CNFRefutation
% See solution above
% 0.26/1.44  # Proof object total steps             : 171
% 0.26/1.44  # Proof object clause steps            : 126
% 0.26/1.44  # Proof object formula steps           : 45
% 0.26/1.44  # Proof object conjectures             : 26
% 0.26/1.44  # Proof object clause conjectures      : 23
% 0.26/1.44  # Proof object formula conjectures     : 3
% 0.26/1.44  # Proof object initial clauses used    : 32
% 0.26/1.44  # Proof object initial formulas used   : 25
% 0.26/1.44  # Proof object generating inferences   : 78
% 0.26/1.44  # Proof object simplifying inferences  : 105
% 0.26/1.44  # Training examples: 0 positive, 0 negative
% 0.26/1.44  # Parsed axioms                        : 92
% 0.26/1.44  # Removed by relevancy pruning/SinE    : 26
% 0.26/1.44  # Initial clauses                      : 84
% 0.26/1.44  # Removed in clause preprocessing      : 1
% 0.26/1.44  # Initial clauses in saturation        : 83
% 0.26/1.44  # Processed clauses                    : 3788
% 0.26/1.44  # ...of these trivial                  : 126
% 0.26/1.44  # ...subsumed                          : 2484
% 0.26/1.44  # ...remaining for further processing  : 1178
% 0.26/1.44  # Other redundant clauses eliminated   : 0
% 0.26/1.44  # Clauses deleted for lack of memory   : 0
% 0.26/1.44  # Backward-subsumed                    : 155
% 0.26/1.44  # Backward-rewritten                   : 333
% 0.26/1.44  # Generated clauses                    : 19829
% 0.26/1.44  # ...of the previous two non-trivial   : 15296
% 0.26/1.44  # Contextual simplify-reflections      : 1014
% 0.26/1.44  # Paramodulations                      : 19818
% 0.26/1.44  # Factorizations                       : 11
% 0.26/1.44  # Equation resolutions                 : 0
% 0.26/1.44  # Current number of processed clauses  : 690
% 0.26/1.44  #    Positive orientable unit clauses  : 187
% 0.26/1.44  #    Positive unorientable unit clauses: 7
% 0.26/1.44  #    Negative unit clauses             : 79
% 0.26/1.44  #    Non-unit-clauses                  : 417
% 0.26/1.44  # Current number of unprocessed clauses: 5070
% 0.26/1.44  # ...number of literals in the above   : 13692
% 0.26/1.44  # Current number of archived formulas  : 0
% 0.26/1.44  # Current number of archived clauses   : 489
% 0.26/1.44  # Clause-clause subsumption calls (NU) : 63588
% 0.26/1.44  # Rec. Clause-clause subsumption calls : 20364
% 0.26/1.44  # Non-unit clause-clause subsumptions  : 2447
% 0.26/1.44  # Unit Clause-clause subsumption calls : 8525
% 0.26/1.44  # Rewrite failures with RHS unbound    : 0
% 0.26/1.44  # BW rewrite match attempts            : 54
% 0.26/1.44  # BW rewrite match successes           : 40
% 0.26/1.44  # Condensation attempts                : 0
% 0.26/1.44  # Condensation successes               : 0
% 0.26/1.44  # Termbank termtop insertions          : 177642
% 0.26/1.44  
% 0.26/1.44  # -------------------------------------------------
% 0.26/1.44  # User time                : 0.328 s
% 0.26/1.44  # System time              : 0.006 s
% 0.26/1.44  # Total time               : 0.334 s
% 0.26/1.44  # Maximum resident set size: 10888 pages
%------------------------------------------------------------------------------