TSTP Solution File: SEV228^5 by E---3.2.0

View Problem - Process Solution

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

% Computer : n025.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 : Mon Jun 24 15:54:02 EDT 2024

% Result   : Theorem 0.16s 0.41s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    8 (   3 unt;   0 typ;   0 def)
%            Number of atoms       :   11 (   0 equ;   0 cnn)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   43 (   7   ~;   4   |;   4   &;  24   @)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    5 (   5   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    4 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :    9 (   0   ^   7   !;   2   ?;   9   :)

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

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

thf(decl_23,type,
    esk1_0: a ).

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

thf(cTHM91A_pme,conjecture,
    ! [X1: a] :
      ( ( cS @ X1 )
     => ? [X2: a > $o] :
          ( ! [X3: a] :
              ( ( X2 @ X3 )
             => ( cS @ X3 ) )
          & ( X2 @ X1 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.KiCnRGeeKS/E---3.1_31782.p',cTHM91A_pme) ).

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

thf(c_0_2,negated_conjecture,
    ! [X8: a > $o] :
      ( ( cS @ esk1_0 )
      & ( ( X8 @ ( esk2_1 @ X8 ) )
        | ~ ( X8 @ esk1_0 ) )
      & ( ~ ( cS @ ( esk2_1 @ X8 ) )
        | ~ ( X8 @ esk1_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: a > $o] :
      ( ( X2 @ ( esk2_1 @ X2 ) )
      | ~ ( X2 @ esk1_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    cS @ esk1_0,
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_5,negated_conjecture,
    ! [X2: a > $o] :
      ( ~ ( cS @ ( esk2_1 @ X2 ) )
      | ~ ( X2 @ esk1_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_6,negated_conjecture,
    cS @ ( esk2_1 @ cS ),
    inference(spm,[status(thm)],[c_0_3,c_0_4]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.09  % Problem    : SEV228^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.09  % Command    : run_E %s %d THM
% 0.08/0.28  % Computer : n025.cluster.edu
% 0.08/0.28  % Model    : x86_64 x86_64
% 0.08/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28  % Memory   : 8042.1875MB
% 0.08/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28  % CPULimit   : 300
% 0.08/0.28  % WCLimit    : 300
% 0.08/0.28  % DateTime   : Fri Jun 21 19:39:39 EDT 2024
% 0.08/0.29  % CPUTime    : 
% 0.16/0.40  Running higher-order theorem proving
% 0.16/0.40  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/tmp/tmp.KiCnRGeeKS/E---3.1_31782.p
% 0.16/0.41  # Version: 3.2.0-ho
% 0.16/0.41  # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.16/0.41  # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.41  # Starting post_as_ho12 with 300s (1) cores
% 0.16/0.41  # Starting new_bool_9 with 300s (1) cores
% 0.16/0.41  # Starting post_as_ho1 with 300s (1) cores
% 0.16/0.41  # Starting post_as_ho4 with 300s (1) cores
% 0.16/0.41  # Starting post_as_ho2 with 300s (1) cores
% 0.16/0.41  # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.16/0.41  # Starting full_lambda_10 with 300s (1) cores
% 0.16/0.41  # Starting new_ho_8 with 300s (1) cores
% 0.16/0.41  # new_bool_9 with pid 31909 completed with status 0
% 0.16/0.41  # Result found by new_bool_9
% 0.16/0.41  # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.16/0.41  # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.41  # Starting post_as_ho12 with 300s (1) cores
% 0.16/0.41  # Starting new_bool_9 with 300s (1) cores
% 0.16/0.41  # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.16/0.41  # Search class: HHHNF-FFSF11-SSSFFMBN
% 0.16/0.41  # partial match(1): HGHNF-FFSF11-SSSFFMBN
% 0.16/0.41  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.41  # Starting post_as_ho2 with 181s (1) cores
% 0.16/0.41  # post_as_ho2 with pid 31918 completed with status 0
% 0.16/0.41  # Result found by post_as_ho2
% 0.16/0.41  # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.16/0.41  # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.41  # Starting post_as_ho12 with 300s (1) cores
% 0.16/0.41  # Starting new_bool_9 with 300s (1) cores
% 0.16/0.41  # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.16/0.41  # Search class: HHHNF-FFSF11-SSSFFMBN
% 0.16/0.41  # partial match(1): HGHNF-FFSF11-SSSFFMBN
% 0.16/0.41  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.41  # Starting post_as_ho2 with 181s (1) cores
% 0.16/0.41  # Preprocessing time       : 0.001 s
% 0.16/0.41  # Presaturation interreduction done
% 0.16/0.41  
% 0.16/0.41  # Proof found!
% 0.16/0.41  # SZS status Theorem
% 0.16/0.41  # SZS output start CNFRefutation
% See solution above
% 0.16/0.41  # Parsed axioms                        : 3
% 0.16/0.41  # Removed by relevancy pruning/SinE    : 2
% 0.16/0.41  # Initial clauses                      : 3
% 0.16/0.41  # Removed in clause preprocessing      : 0
% 0.16/0.41  # Initial clauses in saturation        : 3
% 0.16/0.41  # Processed clauses                    : 7
% 0.16/0.41  # ...of these trivial                  : 0
% 0.16/0.41  # ...subsumed                          : 0
% 0.16/0.41  # ...remaining for further processing  : 7
% 0.16/0.41  # Other redundant clauses eliminated   : 0
% 0.16/0.41  # Clauses deleted for lack of memory   : 0
% 0.16/0.41  # Backward-subsumed                    : 0
% 0.16/0.41  # Backward-rewritten                   : 0
% 0.16/0.41  # Generated clauses                    : 4
% 0.16/0.41  # ...of the previous two non-redundant : 1
% 0.16/0.41  # ...aggressively subsumed             : 0
% 0.16/0.41  # Contextual simplify-reflections      : 0
% 0.16/0.41  # Paramodulations                      : 3
% 0.16/0.41  # Factorizations                       : 0
% 0.16/0.41  # NegExts                              : 0
% 0.16/0.41  # Equation resolutions                 : 1
% 0.16/0.41  # Disequality decompositions           : 0
% 0.16/0.41  # Total rewrite steps                  : 2
% 0.16/0.41  # ...of those cached                   : 1
% 0.16/0.41  # Propositional unsat checks           : 0
% 0.16/0.41  #    Propositional check models        : 0
% 0.16/0.41  #    Propositional check unsatisfiable : 0
% 0.16/0.41  #    Propositional clauses             : 0
% 0.16/0.41  #    Propositional clauses after purity: 0
% 0.16/0.41  #    Propositional unsat core size     : 0
% 0.16/0.41  #    Propositional preprocessing time  : 0.000
% 0.16/0.41  #    Propositional encoding time       : 0.000
% 0.16/0.41  #    Propositional solver time         : 0.000
% 0.16/0.41  #    Success case prop preproc time    : 0.000
% 0.16/0.41  #    Success case prop encoding time   : 0.000
% 0.16/0.41  #    Success case prop solver time     : 0.000
% 0.16/0.41  # Current number of processed clauses  : 4
% 0.16/0.41  #    Positive orientable unit clauses  : 2
% 0.16/0.41  #    Positive unorientable unit clauses: 0
% 0.16/0.41  #    Negative unit clauses             : 0
% 0.16/0.41  #    Non-unit-clauses                  : 2
% 0.16/0.41  # Current number of unprocessed clauses: 0
% 0.16/0.41  # ...number of literals in the above   : 0
% 0.16/0.41  # Current number of archived formulas  : 0
% 0.16/0.41  # Current number of archived clauses   : 3
% 0.16/0.41  # Clause-clause subsumption calls (NU) : 0
% 0.16/0.41  # Rec. Clause-clause subsumption calls : 0
% 0.16/0.41  # Non-unit clause-clause subsumptions  : 0
% 0.16/0.41  # Unit Clause-clause subsumption calls : 0
% 0.16/0.41  # Rewrite failures with RHS unbound    : 0
% 0.16/0.41  # BW rewrite match attempts            : 0
% 0.16/0.41  # BW rewrite match successes           : 0
% 0.16/0.41  # Condensation attempts                : 0
% 0.16/0.41  # Condensation successes               : 0
% 0.16/0.41  # Termbank termtop insertions          : 333
% 0.16/0.41  # Search garbage collected termcells   : 85
% 0.16/0.41  
% 0.16/0.41  # -------------------------------------------------
% 0.16/0.41  # User time                : 0.000 s
% 0.16/0.41  # System time              : 0.003 s
% 0.16/0.41  # Total time               : 0.003 s
% 0.16/0.41  # Maximum resident set size: 1812 pages
% 0.16/0.41  
% 0.16/0.41  # -------------------------------------------------
% 0.16/0.41  # User time                : 0.001 s
% 0.16/0.41  # System time              : 0.005 s
% 0.16/0.41  # Total time               : 0.006 s
% 0.16/0.41  # Maximum resident set size: 1712 pages
% 0.16/0.41  % E---3.1 exiting
% 0.16/0.42  % E exiting
%------------------------------------------------------------------------------