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

View Problem - Process Solution

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

% Computer : n001.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:24 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
thf(decl_22,type,
    cS: $i > $o ).

thf(decl_23,type,
    cR: $i > $o ).

thf(decl_24,type,
    esk1_0: $i ).

thf(cTHM39_pme,conjecture,
    ( ( ( ^ [X1: $i] :
            ( ( cR @ X1 )
            | ( cS @ X1 ) ) )
      = ( ^ [X2: $i] :
            ( ( cR @ X2 )
            & ( cS @ X2 ) ) ) )
   => ! [X2: $i] :
        ( ( cR @ X2 )
       => ( cS @ X2 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.SDuQGW1geo/E---3.1_1557.p',cTHM39_pme) ).

thf(c_0_1,negated_conjecture,
    ~ ( ! [X4: $i] :
          ( ( ( cR @ X4 )
            | ( cS @ X4 ) )
        <=> ( ( cR @ X4 )
            & ( cS @ X4 ) ) )
     => ! [X2: $i] :
          ( ( cR @ X2 )
         => ( cS @ X2 ) ) ),
    inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM39_pme])])]) ).

thf(c_0_2,negated_conjecture,
    ! [X5: $i] :
      ( ( ( cR @ X5 )
        | ~ ( cR @ X5 ) )
      & ( ( cS @ X5 )
        | ~ ( cR @ X5 ) )
      & ( ( cR @ X5 )
        | ~ ( cS @ X5 ) )
      & ( ( cS @ X5 )
        | ~ ( cS @ X5 ) )
      & ( ~ ( cR @ X5 )
        | ~ ( cS @ X5 )
        | ( cR @ X5 )
        | ( cS @ X5 ) )
      & ( cR @ esk1_0 )
      & ~ ( cS @ 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,
    ~ ( cS @ esk1_0 ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    ! [X1: $i] :
      ( ( cS @ X1 )
      | ~ ( cR @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_5,negated_conjecture,
    cR @ esk1_0,
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : SEV393^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.13  % Command    : run_E %s %d THM
% 0.13/0.35  % Computer : n001.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Fri Jun 21 19:42:54 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.21/0.51  Running higher-order theorem proving
% 0.21/0.51  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.SDuQGW1geo/E---3.1_1557.p
% 0.21/0.52  # Version: 3.2.0-ho
% 0.21/0.52  # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.21/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52  # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.21/0.52  # Starting post_as_ho10 with 300s (1) cores
% 0.21/0.52  # Starting new_bool_9 with 300s (1) cores
% 0.21/0.52  # Starting sh5l with 300s (1) cores
% 0.21/0.52  # post_as_ho10 with pid 1636 completed with status 0
% 0.21/0.52  # Result found by post_as_ho10
% 0.21/0.52  # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.21/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52  # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.21/0.52  # Starting post_as_ho10 with 300s (1) cores
% 0.21/0.52  # No SInE strategy applied
% 0.21/0.52  # Search class: HHUNF-FFSF00-SSSFFFNN
% 0.21/0.52  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52  # Starting sh3 with 163s (1) cores
% 0.21/0.52  # sh3 with pid 1639 completed with status 0
% 0.21/0.52  # Result found by sh3
% 0.21/0.52  # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.21/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52  # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.21/0.52  # Starting post_as_ho10 with 300s (1) cores
% 0.21/0.52  # No SInE strategy applied
% 0.21/0.52  # Search class: HHUNF-FFSF00-SSSFFFNN
% 0.21/0.52  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52  # Starting sh3 with 163s (1) cores
% 0.21/0.52  # Preprocessing time       : 0.001 s
% 0.21/0.52  # Presaturation interreduction done
% 0.21/0.52  
% 0.21/0.52  # Proof found!
% 0.21/0.52  # SZS status Theorem
% 0.21/0.52  # SZS output start CNFRefutation
% See solution above
% 0.21/0.52  # Parsed axioms                        : 3
% 0.21/0.52  # Removed by relevancy pruning/SinE    : 0
% 0.21/0.52  # Initial clauses                      : 9
% 0.21/0.52  # Removed in clause preprocessing      : 5
% 0.21/0.52  # Initial clauses in saturation        : 4
% 0.21/0.52  # Processed clauses                    : 8
% 0.21/0.52  # ...of these trivial                  : 0
% 0.21/0.52  # ...subsumed                          : 0
% 0.21/0.52  # ...remaining for further processing  : 8
% 0.21/0.52  # Other redundant clauses eliminated   : 0
% 0.21/0.52  # Clauses deleted for lack of memory   : 0
% 0.21/0.52  # Backward-subsumed                    : 0
% 0.21/0.52  # Backward-rewritten                   : 0
% 0.21/0.52  # Generated clauses                    : 2
% 0.21/0.52  # ...of the previous two non-redundant : 0
% 0.21/0.52  # ...aggressively subsumed             : 0
% 0.21/0.52  # Contextual simplify-reflections      : 0
% 0.21/0.52  # Paramodulations                      : 2
% 0.21/0.52  # Factorizations                       : 0
% 0.21/0.52  # NegExts                              : 0
% 0.21/0.52  # Equation resolutions                 : 0
% 0.21/0.52  # Disequality decompositions           : 0
% 0.21/0.52  # Total rewrite steps                  : 1
% 0.21/0.52  # ...of those cached                   : 0
% 0.21/0.52  # Propositional unsat checks           : 0
% 0.21/0.52  #    Propositional check models        : 0
% 0.21/0.52  #    Propositional check unsatisfiable : 0
% 0.21/0.52  #    Propositional clauses             : 0
% 0.21/0.52  #    Propositional clauses after purity: 0
% 0.21/0.52  #    Propositional unsat core size     : 0
% 0.21/0.52  #    Propositional preprocessing time  : 0.000
% 0.21/0.52  #    Propositional encoding time       : 0.000
% 0.21/0.52  #    Propositional solver time         : 0.000
% 0.21/0.52  #    Success case prop preproc time    : 0.000
% 0.21/0.52  #    Success case prop encoding time   : 0.000
% 0.21/0.52  #    Success case prop solver time     : 0.000
% 0.21/0.52  # Current number of processed clauses  : 4
% 0.21/0.52  #    Positive orientable unit clauses  : 1
% 0.21/0.52  #    Positive unorientable unit clauses: 0
% 0.21/0.52  #    Negative unit clauses             : 1
% 0.21/0.52  #    Non-unit-clauses                  : 2
% 0.21/0.52  # Current number of unprocessed clauses: 0
% 0.21/0.52  # ...number of literals in the above   : 0
% 0.21/0.52  # Current number of archived formulas  : 0
% 0.21/0.52  # Current number of archived clauses   : 4
% 0.21/0.52  # Clause-clause subsumption calls (NU) : 0
% 0.21/0.52  # Rec. Clause-clause subsumption calls : 0
% 0.21/0.52  # Non-unit clause-clause subsumptions  : 0
% 0.21/0.52  # Unit Clause-clause subsumption calls : 0
% 0.21/0.52  # Rewrite failures with RHS unbound    : 0
% 0.21/0.52  # BW rewrite match attempts            : 0
% 0.21/0.52  # BW rewrite match successes           : 0
% 0.21/0.52  # Condensation attempts                : 0
% 0.21/0.52  # Condensation successes               : 0
% 0.21/0.52  # Termbank termtop insertions          : 447
% 0.21/0.52  # Search garbage collected termcells   : 119
% 0.21/0.52  
% 0.21/0.52  # -------------------------------------------------
% 0.21/0.52  # User time                : 0.001 s
% 0.21/0.52  # System time              : 0.002 s
% 0.21/0.52  # Total time               : 0.003 s
% 0.21/0.52  # Maximum resident set size: 1612 pages
% 0.21/0.52  
% 0.21/0.52  # -------------------------------------------------
% 0.21/0.52  # User time                : 0.002 s
% 0.21/0.52  # System time              : 0.004 s
% 0.21/0.52  # Total time               : 0.006 s
% 0.21/0.52  # Maximum resident set size: 1704 pages
% 0.21/0.52  % E---3.1 exiting
% 0.21/0.52  % E exiting
%------------------------------------------------------------------------------