TSTP Solution File: SWV403+1 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SWV403+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n017.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 17:47:07 EDT 2022

% Result   : Theorem 8.61s 2.52s
% Output   : CNFRefutation 8.61s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   41 (   7 unt;   0 def)
%            Number of atoms       :  111 (  25 equ)
%            Maximal formula atoms :   11 (   2 avg)
%            Number of connectives :  110 (  40   ~;  46   |;  14   &)
%                                         (   2 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-2 aty)
%            Number of variables   :   97 (   6 sgn  55   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(l39_co,conjecture,
    ! [X1] :
      ( ! [X2,X3,X4] :
          ( ( pair_in_list(X1,X2,X3)
            & strictly_less_than(X3,X4) )
         => pair_in_list(update_slb(X1,X4),X2,X4) )
     => ! [X5,X6,X7,X8,X9] :
          ( ( pair_in_list(insert_slb(X1,pair(X8,X9)),X5,X6)
            & strictly_less_than(X6,X7) )
         => pair_in_list(update_slb(insert_slb(X1,pair(X8,X9)),X7),X5,X7) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l39_co) ).

fof(ax29,axiom,
    ! [X1,X2,X3,X4] :
      ( strictly_less_than(X4,X3)
     => update_slb(insert_slb(X1,pair(X2,X4)),X3) = insert_slb(update_slb(X1,X3),pair(X2,X3)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax29) ).

fof(ax23,axiom,
    ! [X1,X2,X3,X4,X5] :
      ( pair_in_list(insert_slb(X1,pair(X2,X4)),X3,X5)
    <=> ( pair_in_list(X1,X3,X5)
        | ( X2 = X3
          & X4 = X5 ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax23) ).

fof(ax30,axiom,
    ! [X1,X2,X3,X4] :
      ( less_than(X3,X4)
     => update_slb(insert_slb(X1,pair(X2,X4)),X3) = insert_slb(update_slb(X1,X3),pair(X2,X4)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax30) ).

fof(stricly_smaller_definition,axiom,
    ! [X1,X2] :
      ( strictly_less_than(X1,X2)
    <=> ( less_than(X1,X2)
        & ~ less_than(X2,X1) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).

fof(totality,axiom,
    ! [X1,X2] :
      ( less_than(X1,X2)
      | less_than(X2,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',totality) ).

fof(c_0_6,negated_conjecture,
    ~ ! [X1] :
        ( ! [X2,X3,X4] :
            ( ( pair_in_list(X1,X2,X3)
              & strictly_less_than(X3,X4) )
           => pair_in_list(update_slb(X1,X4),X2,X4) )
       => ! [X5,X6,X7,X8,X9] :
            ( ( pair_in_list(insert_slb(X1,pair(X8,X9)),X5,X6)
              & strictly_less_than(X6,X7) )
           => pair_in_list(update_slb(insert_slb(X1,pair(X8,X9)),X7),X5,X7) ) ),
    inference(assume_negation,[status(cth)],[l39_co]) ).

fof(c_0_7,negated_conjecture,
    ! [X58,X59,X60] :
      ( ( ~ pair_in_list(esk1_0,X58,X59)
        | ~ strictly_less_than(X59,X60)
        | pair_in_list(update_slb(esk1_0,X60),X58,X60) )
      & pair_in_list(insert_slb(esk1_0,pair(esk5_0,esk6_0)),esk2_0,esk3_0)
      & strictly_less_than(esk3_0,esk4_0)
      & ~ pair_in_list(update_slb(insert_slb(esk1_0,pair(esk5_0,esk6_0)),esk4_0),esk2_0,esk4_0) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).

fof(c_0_8,plain,
    ! [X49,X50,X51,X52] :
      ( ~ strictly_less_than(X52,X51)
      | update_slb(insert_slb(X49,pair(X50,X52)),X51) = insert_slb(update_slb(X49,X51),pair(X50,X51)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax29])]) ).

fof(c_0_9,plain,
    ! [X29,X30,X31,X32,X33] :
      ( ( X30 = X31
        | pair_in_list(X29,X31,X33)
        | ~ pair_in_list(insert_slb(X29,pair(X30,X32)),X31,X33) )
      & ( X32 = X33
        | pair_in_list(X29,X31,X33)
        | ~ pair_in_list(insert_slb(X29,pair(X30,X32)),X31,X33) )
      & ( ~ pair_in_list(X29,X31,X33)
        | pair_in_list(insert_slb(X29,pair(X30,X32)),X31,X33) )
      & ( X30 != X31
        | X32 != X33
        | pair_in_list(insert_slb(X29,pair(X30,X32)),X31,X33) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax23])])]) ).

fof(c_0_10,plain,
    ! [X53,X54,X55,X56] :
      ( ~ less_than(X55,X56)
      | update_slb(insert_slb(X53,pair(X54,X56)),X55) = insert_slb(update_slb(X53,X55),pair(X54,X56)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax30])]) ).

cnf(c_0_11,negated_conjecture,
    ~ pair_in_list(update_slb(insert_slb(esk1_0,pair(esk5_0,esk6_0)),esk4_0),esk2_0,esk4_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,plain,
    ( update_slb(insert_slb(X3,pair(X4,X1)),X2) = insert_slb(update_slb(X3,X2),pair(X4,X2))
    | ~ strictly_less_than(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,plain,
    ( X1 = X2
    | pair_in_list(X3,X4,X2)
    | ~ pair_in_list(insert_slb(X3,pair(X5,X1)),X4,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_14,negated_conjecture,
    pair_in_list(insert_slb(esk1_0,pair(esk5_0,esk6_0)),esk2_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_15,plain,
    ( update_slb(insert_slb(X3,pair(X4,X2)),X1) = insert_slb(update_slb(X3,X1),pair(X4,X2))
    | ~ less_than(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_16,plain,
    ( X1 = X2
    | pair_in_list(X3,X2,X4)
    | ~ pair_in_list(insert_slb(X3,pair(X1,X5)),X2,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_17,negated_conjecture,
    ( ~ pair_in_list(insert_slb(update_slb(esk1_0,esk4_0),pair(esk5_0,esk4_0)),esk2_0,esk4_0)
    | ~ strictly_less_than(esk6_0,esk4_0) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_18,plain,
    ( pair_in_list(insert_slb(X1,pair(X4,X5)),X2,X3)
    | ~ pair_in_list(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_19,negated_conjecture,
    ( pair_in_list(update_slb(esk1_0,X3),X1,X3)
    | ~ pair_in_list(esk1_0,X1,X2)
    | ~ strictly_less_than(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_20,negated_conjecture,
    ( esk6_0 = esk3_0
    | pair_in_list(esk1_0,esk2_0,esk3_0) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

fof(c_0_21,plain,
    ! [X16,X17] :
      ( ( less_than(X16,X17)
        | ~ strictly_less_than(X16,X17) )
      & ( ~ less_than(X17,X16)
        | ~ strictly_less_than(X16,X17) )
      & ( ~ less_than(X16,X17)
        | less_than(X17,X16)
        | strictly_less_than(X16,X17) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[stricly_smaller_definition])])])]) ).

fof(c_0_22,plain,
    ! [X13,X14] :
      ( less_than(X13,X14)
      | less_than(X14,X13) ),
    inference(variable_rename,[status(thm)],[totality]) ).

cnf(c_0_23,negated_conjecture,
    ( ~ pair_in_list(insert_slb(update_slb(esk1_0,esk4_0),pair(esk5_0,esk6_0)),esk2_0,esk4_0)
    | ~ less_than(esk4_0,esk6_0) ),
    inference(spm,[status(thm)],[c_0_11,c_0_15]) ).

cnf(c_0_24,negated_conjecture,
    ( esk2_0 = esk5_0
    | pair_in_list(esk1_0,esk2_0,esk3_0) ),
    inference(spm,[status(thm)],[c_0_16,c_0_14]) ).

cnf(c_0_25,negated_conjecture,
    ( ~ pair_in_list(update_slb(esk1_0,esk4_0),esk2_0,esk4_0)
    | ~ strictly_less_than(esk6_0,esk4_0) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_26,negated_conjecture,
    ( esk6_0 = esk3_0
    | pair_in_list(update_slb(esk1_0,X1),esk2_0,X1)
    | ~ strictly_less_than(esk3_0,X1) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_27,negated_conjecture,
    strictly_less_than(esk3_0,esk4_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_28,plain,
    ( less_than(X2,X1)
    | strictly_less_than(X1,X2)
    | ~ less_than(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_29,plain,
    ( less_than(X1,X2)
    | less_than(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

cnf(c_0_30,negated_conjecture,
    ( ~ pair_in_list(update_slb(esk1_0,esk4_0),esk2_0,esk4_0)
    | ~ less_than(esk4_0,esk6_0) ),
    inference(spm,[status(thm)],[c_0_23,c_0_18]) ).

cnf(c_0_31,negated_conjecture,
    ( esk2_0 = esk5_0
    | pair_in_list(update_slb(esk1_0,X1),esk2_0,X1)
    | ~ strictly_less_than(esk3_0,X1) ),
    inference(spm,[status(thm)],[c_0_19,c_0_24]) ).

cnf(c_0_32,negated_conjecture,
    ( esk6_0 = esk3_0
    | ~ strictly_less_than(esk6_0,esk4_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).

cnf(c_0_33,plain,
    ( strictly_less_than(X1,X2)
    | less_than(X2,X1) ),
    inference(csr,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_34,negated_conjecture,
    ( esk6_0 = esk3_0
    | ~ less_than(esk4_0,esk6_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_26]),c_0_27])]) ).

cnf(c_0_35,negated_conjecture,
    ( esk2_0 = esk5_0
    | ~ strictly_less_than(esk6_0,esk4_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_31]),c_0_27])]) ).

cnf(c_0_36,negated_conjecture,
    esk6_0 = esk3_0,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).

cnf(c_0_37,plain,
    ( pair_in_list(insert_slb(X5,pair(X1,X3)),X2,X4)
    | X1 != X2
    | X3 != X4 ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_38,negated_conjecture,
    esk2_0 = esk5_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36]),c_0_27])]) ).

cnf(c_0_39,plain,
    pair_in_list(insert_slb(X1,pair(X2,X3)),X2,X3),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_37])]) ).

cnf(c_0_40,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_36]),c_0_27])]),c_0_38]),c_0_39])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWV403+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n017.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Tue Jun 14 20:06:11 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.21/0.45  # ENIGMATIC: Selected SinE mode:
% 0.21/0.46  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.46  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.21/0.46  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.21/0.46  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 8.61/2.52  # ENIGMATIC: Solved by autoschedule:
% 8.61/2.52  # No SInE strategy applied
% 8.61/2.52  # Trying AutoSched0 for 150 seconds
% 8.61/2.52  # AutoSched0-Mode selected heuristic G_E___012_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 8.61/2.52  # and selection function SelectMaxLComplexAvoidPosPred.
% 8.61/2.52  #
% 8.61/2.52  # Preprocessing time       : 0.014 s
% 8.61/2.52  # Presaturation interreduction done
% 8.61/2.52  
% 8.61/2.52  # Proof found!
% 8.61/2.52  # SZS status Theorem
% 8.61/2.52  # SZS output start CNFRefutation
% See solution above
% 8.61/2.52  # Training examples: 0 positive, 0 negative
% 8.61/2.52  
% 8.61/2.52  # -------------------------------------------------
% 8.61/2.52  # User time                : 0.015 s
% 8.61/2.52  # System time              : 0.007 s
% 8.61/2.52  # Total time               : 0.022 s
% 8.61/2.52  # Maximum resident set size: 7124 pages
% 8.61/2.52  
%------------------------------------------------------------------------------