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

View Problem - Process Solution

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

% Computer : n010.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:30:46 EDT 2024

% Result   : Theorem 0.22s 0.47s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   25 (   4 unt;  10 typ;   0 def)
%            Number of atoms       :   50 (  29 equ;   0 cnn)
%            Maximal formula atoms :   17 (   3 avg)
%            Number of connectives :  108 (  13   ~;  21   |;  12   &;  60   @)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Number of types       :    4 (   3 usr)
%            Number of type conns  :    3 (   3   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   15 (   0   ^   9   !;   6   ?;  15   :)

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

thf(decl_sort2,type,
    b: $tType ).

thf(decl_sort3,type,
    a: $tType ).

thf(decl_22,type,
    cG: c > b ).

thf(decl_23,type,
    cF: b > a ).

thf(decl_24,type,
    cS: c > $o ).

thf(decl_25,type,
    esk1_0: a ).

thf(decl_26,type,
    esk2_0: b ).

thf(decl_27,type,
    esk3_0: c ).

thf(decl_28,type,
    esk4_0: c ).

thf(cTHM29_pme,conjecture,
    ! [X1: a] :
      ( ? [X2: b] :
          ( ? [X3: c] :
              ( ( cS @ X3 )
              & ( X2
                = ( cG @ X3 ) ) )
          & ( X1
            = ( cF @ X2 ) ) )
    <=> ? [X4: c] :
          ( ( cS @ X4 )
          & ( X1
            = ( cF @ ( cG @ X4 ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM29_pme) ).

thf(c_0_1,negated_conjecture,
    ~ ! [X1: a] :
        ( ? [X2: b] :
            ( ? [X3: c] :
                ( ( cS @ X3 )
                & ( X2
                  = ( cG @ X3 ) ) )
            & ( X1
              = ( cF @ X2 ) ) )
      <=> ? [X4: c] :
            ( ( cS @ X4 )
            & ( X1
              = ( cF @ ( cG @ X4 ) ) ) ) ),
    inference(assume_negation,[status(cth)],[cTHM29_pme]) ).

thf(c_0_2,negated_conjecture,
    ! [X10: b,X11: c,X12: c] :
      ( ( ~ ( cS @ X11 )
        | ( X10
         != ( cG @ X11 ) )
        | ( esk1_0
         != ( cF @ X10 ) )
        | ~ ( cS @ X12 )
        | ( esk1_0
         != ( cF @ ( cG @ X12 ) ) ) )
      & ( ( cS @ esk4_0 )
        | ( cS @ esk3_0 ) )
      & ( ( esk1_0
          = ( cF @ ( cG @ esk4_0 ) ) )
        | ( cS @ esk3_0 ) )
      & ( ( cS @ esk4_0 )
        | ( esk2_0
          = ( cG @ esk3_0 ) ) )
      & ( ( esk1_0
          = ( cF @ ( cG @ esk4_0 ) ) )
        | ( esk2_0
          = ( cG @ esk3_0 ) ) )
      & ( ( cS @ esk4_0 )
        | ( esk1_0
          = ( cF @ esk2_0 ) ) )
      & ( ( esk1_0
          = ( cF @ ( cG @ esk4_0 ) ) )
        | ( esk1_0
          = ( cF @ esk2_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,
    ! [X2: b,X3: c,X4: c] :
      ( ~ ( cS @ X3 )
      | ( X2
       != ( cG @ X3 ) )
      | ( esk1_0
       != ( cF @ X2 ) )
      | ~ ( cS @ X4 )
      | ( esk1_0
       != ( cF @ ( cG @ X4 ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    ! [X3: c] :
      ( ( ( cF @ ( cG @ X3 ) )
       != esk1_0 )
      | ~ ( cS @ X3 ) ),
    inference(condense,[status(thm)],[inference(er,[status(thm)],[c_0_3])]) ).

thf(c_0_5,negated_conjecture,
    ( ( esk1_0
      = ( cF @ ( cG @ esk4_0 ) ) )
    | ( esk2_0
      = ( cG @ esk3_0 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_6,negated_conjecture,
    ( ( cS @ esk4_0 )
    | ( esk2_0
      = ( cG @ esk3_0 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_7,negated_conjecture,
    ( ( esk1_0
      = ( cF @ ( cG @ esk4_0 ) ) )
    | ( esk1_0
      = ( cF @ esk2_0 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_8,negated_conjecture,
    ( ( cS @ esk4_0 )
    | ( esk1_0
      = ( cF @ esk2_0 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_9,negated_conjecture,
    ( ( esk1_0
      = ( cF @ ( cG @ esk4_0 ) ) )
    | ( cS @ esk3_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_10,negated_conjecture,
    ( ( cS @ esk4_0 )
    | ( cS @ esk3_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_11,negated_conjecture,
    ( ( cG @ esk3_0 )
    = esk2_0 ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6]) ).

thf(c_0_12,negated_conjecture,
    ( ( cF @ esk2_0 )
    = esk1_0 ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_7]),c_0_8]) ).

thf(c_0_13,negated_conjecture,
    cS @ esk3_0,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_9]),c_0_10]) ).

thf(c_0_14,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_11]),c_0_12])]),c_0_13])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13  % Problem    : SEU890^5 : TPTP v8.2.0. Released v4.0.0.
% 0.10/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n010.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.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Sun May 19 15:22:53 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.22/0.46  Running higher-order theorem proving
% 0.22/0.46  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.22/0.47  # Version: 3.1.0-ho
% 0.22/0.47  # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.22/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.47  # Starting new_ho_10 with 1500s (5) cores
% 0.22/0.47  # Starting ho_unfolding_6 with 300s (1) cores
% 0.22/0.47  # Starting sh4l with 300s (1) cores
% 0.22/0.47  # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.22/0.47  # ho_unfolding_6 with pid 7399 completed with status 0
% 0.22/0.47  # Result found by ho_unfolding_6
% 0.22/0.47  # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.22/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.47  # Starting new_ho_10 with 1500s (5) cores
% 0.22/0.47  # Starting ho_unfolding_6 with 300s (1) cores
% 0.22/0.47  # No SInE strategy applied
% 0.22/0.47  # Search class: HGHSF-FFSM11-SFFFFFNN
% 0.22/0.47  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.47  # Starting new_ho_10 with 163s (1) cores
% 0.22/0.47  # new_ho_10 with pid 7403 completed with status 0
% 0.22/0.47  # Result found by new_ho_10
% 0.22/0.47  # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.22/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.47  # Starting new_ho_10 with 1500s (5) cores
% 0.22/0.47  # Starting ho_unfolding_6 with 300s (1) cores
% 0.22/0.47  # No SInE strategy applied
% 0.22/0.47  # Search class: HGHSF-FFSM11-SFFFFFNN
% 0.22/0.47  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.47  # Starting new_ho_10 with 163s (1) cores
% 0.22/0.47  # Preprocessing time       : 0.001 s
% 0.22/0.47  # Presaturation interreduction done
% 0.22/0.47  
% 0.22/0.47  # Proof found!
% 0.22/0.47  # SZS status Theorem
% 0.22/0.47  # SZS output start CNFRefutation
% See solution above
% 0.22/0.47  # Parsed axioms                        : 7
% 0.22/0.47  # Removed by relevancy pruning/SinE    : 0
% 0.22/0.47  # Initial clauses                      : 13
% 0.22/0.47  # Removed in clause preprocessing      : 6
% 0.22/0.47  # Initial clauses in saturation        : 7
% 0.22/0.47  # Processed clauses                    : 19
% 0.22/0.47  # ...of these trivial                  : 0
% 0.22/0.47  # ...subsumed                          : 0
% 0.22/0.47  # ...remaining for further processing  : 18
% 0.22/0.47  # Other redundant clauses eliminated   : 1
% 0.22/0.47  # Clauses deleted for lack of memory   : 0
% 0.22/0.47  # Backward-subsumed                    : 2
% 0.22/0.47  # Backward-rewritten                   : 4
% 0.22/0.47  # Generated clauses                    : 6
% 0.22/0.47  # ...of the previous two non-redundant : 6
% 0.22/0.47  # ...aggressively subsumed             : 0
% 0.22/0.47  # Contextual simplify-reflections      : 3
% 0.22/0.47  # Paramodulations                      : 5
% 0.22/0.47  # Factorizations                       : 0
% 0.22/0.47  # NegExts                              : 0
% 0.22/0.47  # Equation resolutions                 : 1
% 0.22/0.47  # Disequality decompositions           : 0
% 0.22/0.47  # Total rewrite steps                  : 6
% 0.22/0.47  # ...of those cached                   : 3
% 0.22/0.47  # Propositional unsat checks           : 0
% 0.22/0.47  #    Propositional check models        : 0
% 0.22/0.47  #    Propositional check unsatisfiable : 0
% 0.22/0.47  #    Propositional clauses             : 0
% 0.22/0.47  #    Propositional clauses after purity: 0
% 0.22/0.47  #    Propositional unsat core size     : 0
% 0.22/0.47  #    Propositional preprocessing time  : 0.000
% 0.22/0.47  #    Propositional encoding time       : 0.000
% 0.22/0.47  #    Propositional solver time         : 0.000
% 0.22/0.47  #    Success case prop preproc time    : 0.000
% 0.22/0.47  #    Success case prop encoding time   : 0.000
% 0.22/0.47  #    Success case prop solver time     : 0.000
% 0.22/0.47  # Current number of processed clauses  : 4
% 0.22/0.47  #    Positive orientable unit clauses  : 3
% 0.22/0.47  #    Positive unorientable unit clauses: 0
% 0.22/0.47  #    Negative unit clauses             : 0
% 0.22/0.47  #    Non-unit-clauses                  : 1
% 0.22/0.47  # Current number of unprocessed clauses: 0
% 0.22/0.47  # ...number of literals in the above   : 0
% 0.22/0.47  # Current number of archived formulas  : 0
% 0.22/0.47  # Current number of archived clauses   : 13
% 0.22/0.47  # Clause-clause subsumption calls (NU) : 6
% 0.22/0.47  # Rec. Clause-clause subsumption calls : 5
% 0.22/0.47  # Non-unit clause-clause subsumptions  : 4
% 0.22/0.47  # Unit Clause-clause subsumption calls : 2
% 0.22/0.47  # Rewrite failures with RHS unbound    : 0
% 0.22/0.47  # BW rewrite match attempts            : 3
% 0.22/0.47  # BW rewrite match successes           : 3
% 0.22/0.47  # Condensation attempts                : 19
% 0.22/0.47  # Condensation successes               : 1
% 0.22/0.47  # Termbank termtop insertions          : 617
% 0.22/0.47  # Search garbage collected termcells   : 150
% 0.22/0.47  
% 0.22/0.47  # -------------------------------------------------
% 0.22/0.47  # User time                : 0.004 s
% 0.22/0.47  # System time              : 0.000 s
% 0.22/0.47  # Total time               : 0.004 s
% 0.22/0.47  # Maximum resident set size: 1776 pages
% 0.22/0.47  
% 0.22/0.47  # -------------------------------------------------
% 0.22/0.47  # User time                : 0.004 s
% 0.22/0.47  # System time              : 0.003 s
% 0.22/0.47  # Total time               : 0.007 s
% 0.22/0.47  # Maximum resident set size: 1712 pages
% 0.22/0.47  % E---3.1 exiting
% 0.22/0.48  % E exiting
%------------------------------------------------------------------------------