TSTP Solution File: SEU998^5 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : SEU998^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n003.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue May 21 03:31:02 EDT 2024

% Result   : Theorem 0.23s 0.53s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   22 (  11 unt;   8 typ;   0 def)
%            Number of atoms       :  128 ( 127 equ;   0 cnn)
%            Maximal formula atoms :   39 (   9 avg)
%            Number of connectives :  442 (  34   ~;   0   |; 110   &; 294   @)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   58 (  11 avg)
%            Number of types       :    1 (   1 usr)
%            Number of type conns  :   12 (  12   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :   80 (   0   ^  70   !;  10   ?;  80   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_sort1,type,
    a: $tType ).

thf(decl_22,type,
    esk1_0: a > a > a ).

thf(decl_23,type,
    esk2_0: a > a > a ).

thf(decl_24,type,
    esk3_0: a ).

thf(decl_25,type,
    esk4_0: a ).

thf(decl_26,type,
    esk5_0: a ).

thf(decl_27,type,
    esk6_0: a ).

thf(decl_28,type,
    esk7_0: a ).

thf(c3_DIAMOND_THM_pme,conjecture,
    ! [X1: a > a > a,X2: a > a > a] :
      ( ( ! [X3: a] :
            ( ( X1 @ X3 @ X3 )
            = X3 )
        & ! [X3: a] :
            ( ( X2 @ X3 @ X3 )
            = X3 )
        & ! [X3: a,X4: a,X5: a] :
            ( ( X1 @ ( X1 @ X3 @ X4 ) @ X5 )
            = ( X1 @ X3 @ ( X1 @ X4 @ X5 ) ) )
        & ! [X3: a,X4: a,X5: a] :
            ( ( X2 @ ( X2 @ X3 @ X4 ) @ X5 )
            = ( X2 @ X3 @ ( X2 @ X4 @ X5 ) ) )
        & ! [X3: a,X4: a] :
            ( ( X1 @ X3 @ X4 )
            = ( X1 @ X4 @ X3 ) )
        & ! [X3: a,X4: a] :
            ( ( X2 @ X3 @ X4 )
            = ( X2 @ X4 @ X3 ) )
        & ! [X3: a,X4: a] :
            ( ( X1 @ ( X2 @ X3 @ X4 ) @ X4 )
            = X4 )
        & ! [X3: a,X4: a] :
            ( ( X2 @ ( X1 @ X3 @ X4 ) @ X4 )
            = X4 ) )
     => ( ? [X3: a,X4: a,X6: a,X7: a,X8: a] :
            ( ( X6 != X7 )
            & ( X6 != X8 )
            & ( X6 != X3 )
            & ( X6 != X4 )
            & ( X7 != X8 )
            & ( X7 != X3 )
            & ( X7 != X4 )
            & ( X8 != X3 )
            & ( X8 != X4 )
            & ( X3 != X4 )
            & ( ( X2 @ X3 @ X4 )
              = X4 )
            & ( ( X1 @ X3 @ X4 )
              = X3 )
            & ( ( X2 @ X3 @ X6 )
              = X6 )
            & ( ( X1 @ X3 @ X6 )
              = X3 )
            & ( ( X2 @ X3 @ X7 )
              = X7 )
            & ( ( X1 @ X3 @ X7 )
              = X3 )
            & ( ( X2 @ X3 @ X8 )
              = X8 )
            & ( ( X1 @ X3 @ X8 )
              = X3 )
            & ( ( X2 @ X6 @ X7 )
              = X4 )
            & ( ( X1 @ X6 @ X7 )
              = X3 )
            & ( ( X2 @ X6 @ X8 )
              = X4 )
            & ( ( X1 @ X6 @ X8 )
              = X3 )
            & ( ( X2 @ X6 @ X4 )
              = X4 )
            & ( ( X1 @ X6 @ X4 )
              = X6 )
            & ( ( X2 @ X7 @ X8 )
              = X4 )
            & ( ( X1 @ X7 @ X8 )
              = X3 )
            & ( ( X2 @ X7 @ X4 )
              = X4 )
            & ( ( X1 @ X7 @ X4 )
              = X7 )
            & ( ( X2 @ X8 @ X4 )
              = X4 )
            & ( ( X1 @ X8 @ X4 )
              = X8 ) )
       => ~ ! [X3: a,X4: a,X5: a] :
              ( ( X2 @ X3 @ ( X1 @ X4 @ X5 ) )
              = ( X1 @ ( X2 @ X3 @ X4 ) @ ( X2 @ X3 @ X5 ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c3_DIAMOND_THM_pme) ).

thf(c_0_1,negated_conjecture,
    ~ ! [X1: a > a > a,X2: a > a > a] :
        ( ( ! [X3: a] :
              ( ( X1 @ X3 @ X3 )
              = X3 )
          & ! [X3: a] :
              ( ( X2 @ X3 @ X3 )
              = X3 )
          & ! [X3: a,X4: a,X5: a] :
              ( ( X1 @ ( X1 @ X3 @ X4 ) @ X5 )
              = ( X1 @ X3 @ ( X1 @ X4 @ X5 ) ) )
          & ! [X3: a,X4: a,X5: a] :
              ( ( X2 @ ( X2 @ X3 @ X4 ) @ X5 )
              = ( X2 @ X3 @ ( X2 @ X4 @ X5 ) ) )
          & ! [X3: a,X4: a] :
              ( ( X1 @ X3 @ X4 )
              = ( X1 @ X4 @ X3 ) )
          & ! [X3: a,X4: a] :
              ( ( X2 @ X3 @ X4 )
              = ( X2 @ X4 @ X3 ) )
          & ! [X3: a,X4: a] :
              ( ( X1 @ ( X2 @ X3 @ X4 ) @ X4 )
              = X4 )
          & ! [X3: a,X4: a] :
              ( ( X2 @ ( X1 @ X3 @ X4 ) @ X4 )
              = X4 ) )
       => ( ? [X3: a,X4: a,X6: a,X7: a,X8: a] :
              ( ( X6 != X7 )
              & ( X6 != X8 )
              & ( X6 != X3 )
              & ( X6 != X4 )
              & ( X7 != X8 )
              & ( X7 != X3 )
              & ( X7 != X4 )
              & ( X8 != X3 )
              & ( X8 != X4 )
              & ( X3 != X4 )
              & ( ( X2 @ X3 @ X4 )
                = X4 )
              & ( ( X1 @ X3 @ X4 )
                = X3 )
              & ( ( X2 @ X3 @ X6 )
                = X6 )
              & ( ( X1 @ X3 @ X6 )
                = X3 )
              & ( ( X2 @ X3 @ X7 )
                = X7 )
              & ( ( X1 @ X3 @ X7 )
                = X3 )
              & ( ( X2 @ X3 @ X8 )
                = X8 )
              & ( ( X1 @ X3 @ X8 )
                = X3 )
              & ( ( X2 @ X6 @ X7 )
                = X4 )
              & ( ( X1 @ X6 @ X7 )
                = X3 )
              & ( ( X2 @ X6 @ X8 )
                = X4 )
              & ( ( X1 @ X6 @ X8 )
                = X3 )
              & ( ( X2 @ X6 @ X4 )
                = X4 )
              & ( ( X1 @ X6 @ X4 )
                = X6 )
              & ( ( X2 @ X7 @ X8 )
                = X4 )
              & ( ( X1 @ X7 @ X8 )
                = X3 )
              & ( ( X2 @ X7 @ X4 )
                = X4 )
              & ( ( X1 @ X7 @ X4 )
                = X7 )
              & ( ( X2 @ X8 @ X4 )
                = X4 )
              & ( ( X1 @ X8 @ X4 )
                = X8 ) )
         => ~ ! [X3: a,X4: a,X5: a] :
                ( ( X2 @ X3 @ ( X1 @ X4 @ X5 ) )
                = ( X1 @ ( X2 @ X3 @ X4 ) @ ( X2 @ X3 @ X5 ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[c3_DIAMOND_THM_pme])]) ).

thf(c_0_2,negated_conjecture,
    ! [X37: a,X38: a,X39: a,X40: a,X41: a,X42: a,X43: a,X44: a,X45: a,X46: a,X47: a,X48: a,X49: a,X50: a,X51: a,X52: a,X58: a,X59: a,X60: a] :
      ( ( ( esk1_0 @ X37 @ X37 )
        = X37 )
      & ( ( esk2_0 @ X38 @ X38 )
        = X38 )
      & ( ( esk1_0 @ ( esk1_0 @ X39 @ X40 ) @ X41 )
        = ( esk1_0 @ X39 @ ( esk1_0 @ X40 @ X41 ) ) )
      & ( ( esk2_0 @ ( esk2_0 @ X42 @ X43 ) @ X44 )
        = ( esk2_0 @ X42 @ ( esk2_0 @ X43 @ X44 ) ) )
      & ( ( esk1_0 @ X45 @ X46 )
        = ( esk1_0 @ X46 @ X45 ) )
      & ( ( esk2_0 @ X47 @ X48 )
        = ( esk2_0 @ X48 @ X47 ) )
      & ( ( esk1_0 @ ( esk2_0 @ X49 @ X50 ) @ X50 )
        = X50 )
      & ( ( esk2_0 @ ( esk1_0 @ X51 @ X52 ) @ X52 )
        = X52 )
      & ( esk5_0 != esk6_0 )
      & ( esk5_0 != esk7_0 )
      & ( esk5_0 != esk3_0 )
      & ( esk5_0 != esk4_0 )
      & ( esk6_0 != esk7_0 )
      & ( esk6_0 != esk3_0 )
      & ( esk6_0 != esk4_0 )
      & ( esk7_0 != esk3_0 )
      & ( esk7_0 != esk4_0 )
      & ( esk3_0 != esk4_0 )
      & ( ( esk2_0 @ esk3_0 @ esk4_0 )
        = esk4_0 )
      & ( ( esk1_0 @ esk3_0 @ esk4_0 )
        = esk3_0 )
      & ( ( esk2_0 @ esk3_0 @ esk5_0 )
        = esk5_0 )
      & ( ( esk1_0 @ esk3_0 @ esk5_0 )
        = esk3_0 )
      & ( ( esk2_0 @ esk3_0 @ esk6_0 )
        = esk6_0 )
      & ( ( esk1_0 @ esk3_0 @ esk6_0 )
        = esk3_0 )
      & ( ( esk2_0 @ esk3_0 @ esk7_0 )
        = esk7_0 )
      & ( ( esk1_0 @ esk3_0 @ esk7_0 )
        = esk3_0 )
      & ( ( esk2_0 @ esk5_0 @ esk6_0 )
        = esk4_0 )
      & ( ( esk1_0 @ esk5_0 @ esk6_0 )
        = esk3_0 )
      & ( ( esk2_0 @ esk5_0 @ esk7_0 )
        = esk4_0 )
      & ( ( esk1_0 @ esk5_0 @ esk7_0 )
        = esk3_0 )
      & ( ( esk2_0 @ esk5_0 @ esk4_0 )
        = esk4_0 )
      & ( ( esk1_0 @ esk5_0 @ esk4_0 )
        = esk5_0 )
      & ( ( esk2_0 @ esk6_0 @ esk7_0 )
        = esk4_0 )
      & ( ( esk1_0 @ esk6_0 @ esk7_0 )
        = esk3_0 )
      & ( ( esk2_0 @ esk6_0 @ esk4_0 )
        = esk4_0 )
      & ( ( esk1_0 @ esk6_0 @ esk4_0 )
        = esk6_0 )
      & ( ( esk2_0 @ esk7_0 @ esk4_0 )
        = esk4_0 )
      & ( ( esk1_0 @ esk7_0 @ esk4_0 )
        = esk7_0 )
      & ( ( esk2_0 @ X58 @ ( esk1_0 @ X59 @ X60 ) )
        = ( esk1_0 @ ( esk2_0 @ X58 @ X59 ) @ ( esk2_0 @ X58 @ X60 ) ) ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).

thf(c_0_3,negated_conjecture,
    ! [X3: a,X4: a,X5: a] :
      ( ( esk2_0 @ X3 @ ( esk1_0 @ X4 @ X5 ) )
      = ( esk1_0 @ ( esk2_0 @ X3 @ X4 ) @ ( esk2_0 @ X3 @ X5 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    ( ( esk2_0 @ esk5_0 @ esk7_0 )
    = esk4_0 ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_5,negated_conjecture,
    ! [X4: a,X3: a] :
      ( ( esk1_0 @ X3 @ X4 )
      = ( esk1_0 @ X4 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_6,negated_conjecture,
    ! [X3: a] :
      ( ( esk1_0 @ esk4_0 @ ( esk2_0 @ esk5_0 @ X3 ) )
      = ( esk2_0 @ esk5_0 @ ( esk1_0 @ X3 @ esk7_0 ) ) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5]) ).

thf(c_0_7,negated_conjecture,
    ( ( esk2_0 @ esk5_0 @ esk6_0 )
    = esk4_0 ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_8,negated_conjecture,
    ! [X3: a] :
      ( ( esk1_0 @ X3 @ X3 )
      = X3 ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_9,negated_conjecture,
    ( ( esk1_0 @ esk6_0 @ esk7_0 )
    = esk3_0 ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_10,negated_conjecture,
    ! [X4: a,X3: a] :
      ( ( esk2_0 @ X3 @ X4 )
      = ( esk2_0 @ X4 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_11,negated_conjecture,
    ( ( esk2_0 @ esk3_0 @ esk5_0 )
    = esk5_0 ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_12,negated_conjecture,
    esk5_0 != esk4_0,
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_13,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),c_0_9]),c_0_10]),c_0_11]),c_0_12]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem    : SEU998^5 : TPTP v8.2.0. Released v4.0.0.
% 0.08/0.14  % Command    : run_E %s %d THM
% 0.13/0.38  % Computer : n003.cluster.edu
% 0.13/0.38  % Model    : x86_64 x86_64
% 0.13/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38  % Memory   : 8042.1875MB
% 0.13/0.38  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.38  % CPULimit   : 300
% 0.13/0.38  % WCLimit    : 300
% 0.13/0.38  % DateTime   : Sun May 19 17:10:38 EDT 2024
% 0.13/0.38  % CPUTime    : 
% 0.23/0.50  Running higher-order theorem proving
% 0.23/0.50  Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.23/0.53  # Version: 3.1.0-ho
% 0.23/0.53  # Preprocessing class: HSMSSMSSSSSNSSA.
% 0.23/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53  # Starting post_as_ho1 with 1500s (5) cores
% 0.23/0.53  # Starting post_as_ho12 with 300s (1) cores
% 0.23/0.53  # Starting new_ho_3 with 300s (1) cores
% 0.23/0.53  # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.23/0.53  # post_as_ho12 with pid 27542 completed with status 0
% 0.23/0.53  # Result found by post_as_ho12
% 0.23/0.53  # Preprocessing class: HSMSSMSSSSSNSSA.
% 0.23/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53  # Starting post_as_ho1 with 1500s (5) cores
% 0.23/0.53  # Starting post_as_ho12 with 300s (1) cores
% 0.23/0.53  # No SInE strategy applied
% 0.23/0.53  # Search class: HUUPM-FFMM00-SSSFFFNN
% 0.23/0.53  # partial match(3): HUUPF-FFSF00-SSSFFFNN
% 0.23/0.53  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.53  # Starting new_ho_10 with 163s (1) cores
% 0.23/0.53  # new_ho_10 with pid 27547 completed with status 0
% 0.23/0.53  # Result found by new_ho_10
% 0.23/0.53  # Preprocessing class: HSMSSMSSSSSNSSA.
% 0.23/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53  # Starting post_as_ho1 with 1500s (5) cores
% 0.23/0.53  # Starting post_as_ho12 with 300s (1) cores
% 0.23/0.53  # No SInE strategy applied
% 0.23/0.53  # Search class: HUUPM-FFMM00-SSSFFFNN
% 0.23/0.53  # partial match(3): HUUPF-FFSF00-SSSFFFNN
% 0.23/0.53  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.53  # Starting new_ho_10 with 163s (1) cores
% 0.23/0.53  # Preprocessing time       : 0.001 s
% 0.23/0.53  # Presaturation interreduction done
% 0.23/0.53  
% 0.23/0.53  # Proof found!
% 0.23/0.53  # SZS status Theorem
% 0.23/0.53  # SZS output start CNFRefutation
% See solution above
% 0.23/0.53  # Parsed axioms                        : 2
% 0.23/0.53  # Removed by relevancy pruning/SinE    : 0
% 0.23/0.53  # Initial clauses                      : 40
% 0.23/0.53  # Removed in clause preprocessing      : 1
% 0.23/0.53  # Initial clauses in saturation        : 39
% 0.23/0.53  # Processed clauses                    : 137
% 0.23/0.53  # ...of these trivial                  : 19
% 0.23/0.53  # ...subsumed                          : 0
% 0.23/0.53  # ...remaining for further processing  : 118
% 0.23/0.53  # Other redundant clauses eliminated   : 0
% 0.23/0.53  # Clauses deleted for lack of memory   : 0
% 0.23/0.53  # Backward-subsumed                    : 0
% 0.23/0.53  # Backward-rewritten                   : 9
% 0.23/0.53  # Generated clauses                    : 601
% 0.23/0.53  # ...of the previous two non-redundant : 333
% 0.23/0.53  # ...aggressively subsumed             : 0
% 0.23/0.53  # Contextual simplify-reflections      : 0
% 0.23/0.53  # Paramodulations                      : 601
% 0.23/0.53  # Factorizations                       : 0
% 0.23/0.53  # NegExts                              : 0
% 0.23/0.53  # Equation resolutions                 : 0
% 0.23/0.53  # Disequality decompositions           : 0
% 0.23/0.53  # Total rewrite steps                  : 610
% 0.23/0.53  # ...of those cached                   : 375
% 0.23/0.53  # Propositional unsat checks           : 0
% 0.23/0.53  #    Propositional check models        : 0
% 0.23/0.53  #    Propositional check unsatisfiable : 0
% 0.23/0.53  #    Propositional clauses             : 0
% 0.23/0.53  #    Propositional clauses after purity: 0
% 0.23/0.53  #    Propositional unsat core size     : 0
% 0.23/0.53  #    Propositional preprocessing time  : 0.000
% 0.23/0.53  #    Propositional encoding time       : 0.000
% 0.23/0.53  #    Propositional solver time         : 0.000
% 0.23/0.53  #    Success case prop preproc time    : 0.000
% 0.23/0.53  #    Success case prop encoding time   : 0.000
% 0.23/0.53  #    Success case prop solver time     : 0.000
% 0.23/0.53  # Current number of processed clauses  : 70
% 0.23/0.53  #    Positive orientable unit clauses  : 58
% 0.23/0.53  #    Positive unorientable unit clauses: 2
% 0.23/0.53  #    Negative unit clauses             : 10
% 0.23/0.53  #    Non-unit-clauses                  : 0
% 0.23/0.53  # Current number of unprocessed clauses: 263
% 0.23/0.53  # ...number of literals in the above   : 263
% 0.23/0.53  # Current number of archived formulas  : 0
% 0.23/0.53  # Current number of archived clauses   : 48
% 0.23/0.53  # Clause-clause subsumption calls (NU) : 0
% 0.23/0.53  # Rec. Clause-clause subsumption calls : 0
% 0.23/0.53  # Non-unit clause-clause subsumptions  : 0
% 0.23/0.53  # Unit Clause-clause subsumption calls : 1
% 0.23/0.53  # Rewrite failures with RHS unbound    : 0
% 0.23/0.53  # BW rewrite match attempts            : 123
% 0.23/0.53  # BW rewrite match successes           : 112
% 0.23/0.53  # Condensation attempts                : 137
% 0.23/0.53  # Condensation successes               : 0
% 0.23/0.53  # Termbank termtop insertions          : 6664
% 0.23/0.53  # Search garbage collected termcells   : 948
% 0.23/0.53  
% 0.23/0.53  # -------------------------------------------------
% 0.23/0.53  # User time                : 0.012 s
% 0.23/0.53  # System time              : 0.003 s
% 0.23/0.53  # Total time               : 0.015 s
% 0.23/0.53  # Maximum resident set size: 1916 pages
% 0.23/0.53  
% 0.23/0.53  # -------------------------------------------------
% 0.23/0.53  # User time                : 0.014 s
% 0.23/0.53  # System time              : 0.004 s
% 0.23/0.53  # Total time               : 0.018 s
% 0.23/0.53  # Maximum resident set size: 1732 pages
% 0.23/0.53  % E---3.1 exiting
% 0.23/0.53  % E exiting
%------------------------------------------------------------------------------