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

View Problem - Process Solution

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

% Computer : n009.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 04:08:07 EDT 2024

% Result   : Theorem 0.16s 0.44s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   14 (   5 unt;   5 typ;   0 def)
%            Number of atoms       :   19 (   6 equ;   0 cnn)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  104 (  14   ~;  12   |;  10   &;  58   @)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   8 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   12 (  12   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   26 (   1   ^  21   !;   4   ?;  26   :)

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

thf(decl_22,type,
    cR: a > a > $o ).

thf(decl_23,type,
    esk1_1: ( a > $o ) > a ).

thf(decl_24,type,
    esk2_2: ( a > $o ) > a > a ).

thf(decl_25,type,
    esk3_0: a ).

thf(cTHM542_pme,conjecture,
    ( ! [X1: a > $o] :
        ( ? [X2: a] : ( X1 @ X2 )
       => ? [X2: a] :
            ( ( X1 @ X2 )
            & ! [X3: a] :
                ( ( X1 @ X3 )
               => ( cR @ X2 @ X3 ) )
            & ! [X4: a] :
                ( ( ( X1 @ X4 )
                  & ! [X3: a] :
                      ( ( X1 @ X3 )
                     => ( cR @ X4 @ X3 ) ) )
               => ( X4 = X2 ) ) ) )
   => ! [X3: a] : ( cR @ X3 @ X3 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM542_pme) ).

thf(c_0_1,negated_conjecture,
    ~ ( ! [X1: a > $o] :
          ( ? [X2: a] : ( X1 @ X2 )
         => ? [X2: a] :
              ( ( X1 @ X2 )
              & ! [X3: a] :
                  ( ( X1 @ X3 )
                 => ( cR @ X2 @ X3 ) )
              & ! [X4: a] :
                  ( ( ( X1 @ X4 )
                    & ! [X3: a] :
                        ( ( X1 @ X3 )
                       => ( cR @ X4 @ X3 ) ) )
                 => ( X4 = X2 ) ) ) )
     => ! [X3: a] : ( cR @ X3 @ X3 ) ),
    inference(assume_negation,[status(cth)],[cTHM542_pme]) ).

thf(c_0_2,negated_conjecture,
    ! [X12: a > $o,X13: a,X15: a,X16: a] :
      ( ( ( X12 @ ( esk1_1 @ X12 ) )
        | ~ ( X12 @ X13 ) )
      & ( ~ ( X12 @ X15 )
        | ( cR @ ( esk1_1 @ X12 ) @ X15 )
        | ~ ( X12 @ X13 ) )
      & ( ( X12 @ ( esk2_2 @ X12 @ X16 ) )
        | ~ ( X12 @ X16 )
        | ( X16
          = ( esk1_1 @ X12 ) )
        | ~ ( X12 @ X13 ) )
      & ( ~ ( cR @ X16 @ ( esk2_2 @ X12 @ X16 ) )
        | ~ ( X12 @ X16 )
        | ( X16
          = ( esk1_1 @ X12 ) )
        | ~ ( X12 @ X13 ) )
      & ~ ( cR @ esk3_0 @ esk3_0 ) ),
    inference(distribute,[status(thm)],[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,
    ! [X1: a > $o,X2: a] :
      ( ( X1 @ ( esk1_1 @ X1 ) )
      | ~ ( X1 @ X2 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    ! [X1: a > $o,X2: a,X3: a] :
      ( ( cR @ ( esk1_1 @ X1 ) @ X2 )
      | ~ ( X1 @ X2 )
      | ~ ( X1 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_5,negated_conjecture,
    ! [X2: a] :
      ( ( esk1_1
        @ ^ [Z0: a] : ( Z0 = X2 ) )
      = X2 ),
    inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_3]) ).

thf(c_0_6,negated_conjecture,
    ~ ( cR @ esk3_0 @ esk3_0 ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_7,negated_conjecture,
    ! [X2: a] : ( cR @ X2 @ X2 ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5])])])]) ).

thf(c_0_8,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10  % Problem    : SEV273^5 : TPTP v8.2.0. Released v4.0.0.
% 0.09/0.11  % Command    : run_E %s %d THM
% 0.11/0.31  % Computer : n009.cluster.edu
% 0.11/0.31  % Model    : x86_64 x86_64
% 0.11/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31  % Memory   : 8042.1875MB
% 0.11/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31  % CPULimit   : 300
% 0.11/0.31  % WCLimit    : 300
% 0.11/0.31  % DateTime   : Sun May 19 19:22:38 EDT 2024
% 0.11/0.31  % CPUTime    : 
% 0.16/0.43  Running higher-order theorem proving
% 0.16/0.43  Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.16/0.44  # Version: 3.1.0-ho
% 0.16/0.44  # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.16/0.44  # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44  # Starting post_as_ho12 with 300s (1) cores
% 0.16/0.44  # Starting new_bool_9 with 300s (1) cores
% 0.16/0.44  # Starting post_as_ho1 with 300s (1) cores
% 0.16/0.44  # Starting post_as_ho4 with 300s (1) cores
% 0.16/0.44  # Starting post_as_ho2 with 300s (1) cores
% 0.16/0.44  # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.16/0.44  # Starting full_lambda_10 with 300s (1) cores
% 0.16/0.44  # Starting new_ho_8 with 300s (1) cores
% 0.16/0.44  # new_ho_8 with pid 32417 completed with status 0
% 0.16/0.44  # Result found by new_ho_8
% 0.16/0.44  # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.16/0.44  # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44  # Starting post_as_ho12 with 300s (1) cores
% 0.16/0.44  # Starting new_bool_9 with 300s (1) cores
% 0.16/0.44  # Starting post_as_ho1 with 300s (1) cores
% 0.16/0.44  # Starting post_as_ho4 with 300s (1) cores
% 0.16/0.44  # Starting post_as_ho2 with 300s (1) cores
% 0.16/0.44  # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.16/0.44  # Starting full_lambda_10 with 300s (1) cores
% 0.16/0.44  # Starting new_ho_8 with 300s (1) cores
% 0.16/0.44  # SinE strategy is GSinE(CountTerms,hypos,10,,2,20000,1.0,true)
% 0.16/0.44  # Search class: HGUSF-FFSF21-SSSFFMBC
% 0.16/0.44  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44  # Starting ho_unfolding_6 with 68s (1) cores
% 0.16/0.44  # ho_unfolding_6 with pid 32418 completed with status 0
% 0.16/0.44  # Result found by ho_unfolding_6
% 0.16/0.44  # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.16/0.44  # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44  # Starting post_as_ho12 with 300s (1) cores
% 0.16/0.44  # Starting new_bool_9 with 300s (1) cores
% 0.16/0.44  # Starting post_as_ho1 with 300s (1) cores
% 0.16/0.44  # Starting post_as_ho4 with 300s (1) cores
% 0.16/0.44  # Starting post_as_ho2 with 300s (1) cores
% 0.16/0.44  # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.16/0.44  # Starting full_lambda_10 with 300s (1) cores
% 0.16/0.44  # Starting new_ho_8 with 300s (1) cores
% 0.16/0.44  # SinE strategy is GSinE(CountTerms,hypos,10,,2,20000,1.0,true)
% 0.16/0.44  # Search class: HGUSF-FFSF21-SSSFFMBC
% 0.16/0.44  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44  # Starting ho_unfolding_6 with 68s (1) cores
% 0.16/0.44  # Preprocessing time       : 0.001 s
% 0.16/0.44  
% 0.16/0.44  # Proof found!
% 0.16/0.44  # SZS status Theorem
% 0.16/0.44  # SZS output start CNFRefutation
% See solution above
% 0.16/0.44  # Parsed axioms                        : 3
% 0.16/0.44  # Removed by relevancy pruning/SinE    : 2
% 0.16/0.44  # Initial clauses                      : 5
% 0.16/0.44  # Removed in clause preprocessing      : 0
% 0.16/0.44  # Initial clauses in saturation        : 5
% 0.16/0.44  # Processed clauses                    : 8
% 0.16/0.44  # ...of these trivial                  : 0
% 0.16/0.44  # ...subsumed                          : 1
% 0.16/0.44  # ...remaining for further processing  : 7
% 0.16/0.44  # Other redundant clauses eliminated   : 4
% 0.16/0.44  # Clauses deleted for lack of memory   : 0
% 0.16/0.44  # Backward-subsumed                    : 0
% 0.16/0.44  # Backward-rewritten                   : 1
% 0.16/0.44  # Generated clauses                    : 20
% 0.16/0.44  # ...of the previous two non-redundant : 11
% 0.16/0.44  # ...aggressively subsumed             : 0
% 0.16/0.44  # Contextual simplify-reflections      : 0
% 0.16/0.44  # Paramodulations                      : 13
% 0.16/0.44  # Factorizations                       : 0
% 0.16/0.44  # NegExts                              : 0
% 0.16/0.44  # Equation resolutions                 : 4
% 0.16/0.44  # Disequality decompositions           : 0
% 0.16/0.44  # Total rewrite steps                  : 1
% 0.16/0.44  # ...of those cached                   : 0
% 0.16/0.44  # Propositional unsat checks           : 0
% 0.16/0.44  #    Propositional check models        : 0
% 0.16/0.44  #    Propositional check unsatisfiable : 0
% 0.16/0.44  #    Propositional clauses             : 0
% 0.16/0.44  #    Propositional clauses after purity: 0
% 0.16/0.44  #    Propositional unsat core size     : 0
% 0.16/0.44  #    Propositional preprocessing time  : 0.000
% 0.16/0.44  #    Propositional encoding time       : 0.000
% 0.16/0.44  #    Propositional solver time         : 0.000
% 0.16/0.44  #    Success case prop preproc time    : 0.000
% 0.16/0.44  #    Success case prop encoding time   : 0.000
% 0.16/0.44  #    Success case prop solver time     : 0.000
% 0.16/0.44  # Current number of processed clauses  : 6
% 0.16/0.44  #    Positive orientable unit clauses  : 1
% 0.16/0.44  #    Positive unorientable unit clauses: 1
% 0.16/0.44  #    Negative unit clauses             : 0
% 0.16/0.44  #    Non-unit-clauses                  : 4
% 0.16/0.44  # Current number of unprocessed clauses: 8
% 0.16/0.44  # ...number of literals in the above   : 24
% 0.16/0.44  # Current number of archived formulas  : 0
% 0.16/0.44  # Current number of archived clauses   : 1
% 0.16/0.44  # Clause-clause subsumption calls (NU) : 11
% 0.16/0.44  # Rec. Clause-clause subsumption calls : 8
% 0.16/0.44  # Non-unit clause-clause subsumptions  : 0
% 0.16/0.44  # Unit Clause-clause subsumption calls : 1
% 0.16/0.44  # Rewrite failures with RHS unbound    : 0
% 0.16/0.44  # BW rewrite match attempts            : 14
% 0.16/0.44  # BW rewrite match successes           : 4
% 0.16/0.44  # Condensation attempts                : 8
% 0.16/0.44  # Condensation successes               : 0
% 0.16/0.44  # Termbank termtop insertions          : 1126
% 0.16/0.44  # Search garbage collected termcells   : 236
% 0.16/0.44  
% 0.16/0.44  # -------------------------------------------------
% 0.16/0.44  # User time                : 0.003 s
% 0.16/0.44  # System time              : 0.001 s
% 0.16/0.44  # Total time               : 0.004 s
% 0.16/0.44  # Maximum resident set size: 1740 pages
% 0.16/0.44  
% 0.16/0.44  # -------------------------------------------------
% 0.16/0.44  # User time                : 0.003 s
% 0.16/0.44  # System time              : 0.005 s
% 0.16/0.44  # Total time               : 0.008 s
% 0.16/0.44  # Maximum resident set size: 1712 pages
% 0.16/0.44  % E---3.1 exiting
% 0.16/0.45  % E exiting
%------------------------------------------------------------------------------