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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.2.0
% Problem  : SEV391^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:23 EDT 2024

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

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

thf(decl_23,type,
    k: $i > $i ).

thf(decl_24,type,
    h: $i > $i ).

thf(decl_25,type,
    a: $i ).

thf(decl_26,type,
    esk1_1: $i > $i ).

thf(cTHM87_pme,conjecture,
    ? [X1: $i] :
    ! [X2: $i] :
    ? [X3: $i] :
      ( ( ( cP @ a @ ( h @ X2 ) @ X2 )
        | ( cP @ X1 @ ( k @ X2 ) @ X2 ) )
     => ( cP @ X1 @ X3 @ X2 ) ),
    file('/export/starexec/sandbox/tmp/tmp.FaNsWPZZ8N/E---3.1_22635.p',cTHM87_pme) ).

thf(c_0_1,negated_conjecture,
    ~ ? [X1: $i] :
      ! [X2: $i] :
      ? [X3: $i] :
        ( ( ( cP @ a @ ( h @ X2 ) @ X2 )
          | ( cP @ X1 @ ( k @ X2 ) @ X2 ) )
       => ( cP @ X1 @ X3 @ X2 ) ),
    inference(assume_negation,[status(cth)],[cTHM87_pme]) ).

thf(c_0_2,negated_conjecture,
    ! [X7: $i,X9: $i] :
      ( ( ( cP @ a @ ( h @ ( esk1_1 @ X7 ) ) @ ( esk1_1 @ X7 ) )
        | ( cP @ X7 @ ( k @ ( esk1_1 @ X7 ) ) @ ( esk1_1 @ X7 ) ) )
      & ~ ( cP @ X7 @ X9 @ ( esk1_1 @ X7 ) ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])]) ).

thf(c_0_3,negated_conjecture,
    ! [X1: $i] :
      ( ( cP @ a @ ( h @ ( esk1_1 @ X1 ) ) @ ( esk1_1 @ X1 ) )
      | ( cP @ X1 @ ( k @ ( esk1_1 @ X1 ) ) @ ( esk1_1 @ X1 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    ! [X2: $i,X1: $i] :
      ~ ( cP @ X1 @ X2 @ ( esk1_1 @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_5,negated_conjecture,
    ! [X1: $i] : ( cP @ a @ ( h @ ( esk1_1 @ X1 ) ) @ ( esk1_1 @ X1 ) ),
    inference(sr,[status(thm)],[c_0_3,c_0_4]) ).

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

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