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

View Problem - Process Solution

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

% Computer : n004.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:56 EDT 2024

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

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

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

thf(decl_24,type,
    esk1_2: $i > $i > $o ).

thf(cTHM573_pme,conjecture,
    ( ! [X1: $i > $o,X2: $i > $o] :
        ( ( ( h @ X1 )
          = ( h @ X2 ) )
       => ( X1 = X2 ) )
   => ? [X3: $i > $i > $o] :
      ! [X4: $i > $o] :
      ? [X5: $i] :
        ( ( X3 @ X5 )
        = X4 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM573_pme) ).

thf(c_0_1,negated_conjecture,
    ~ ( ! [X1: $i > $o,X2: $i > $o] :
          ( ( ( h @ X1 )
            = ( h @ X2 ) )
         => ( X1 = X2 ) )
     => ? [X3: $i > $i > $o] :
        ! [X4: $i > $o] :
        ? [X5: $i] :
          ( ( X3 @ X5 )
          = X4 ) ),
    inference(assume_negation,[status(cth)],[cTHM573_pme]) ).

thf(c_0_2,negated_conjecture,
    ! [X11: $i > $o,X12: $i > $o,X13: $i > $i > $o,X15: $i] :
      ( ( ( ( h @ X11 )
         != ( h @ X12 ) )
        | ( X11 = X12 ) )
      & ( ( X13 @ X15 )
       != ( epred1_1 @ X13 ) ) ),
    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: $i > $o,X2: $i > $o] :
      ( ( X1 = X2 )
      | ( ( h @ X1 )
       != ( h @ X2 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    ! [X5: $i,X3: $i > $i > $o] :
      ( ( X3 @ X5 )
     != ( epred1_1 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_5,negated_conjecture,
    ! [X1: $i > $o] :
      ( ( esk1_2 @ ( h @ X1 ) )
      = X1 ),
    inference(recognize_injectivity,[status(thm)],[c_0_3]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : SEU950^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n004.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.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sun May 19 18:05:08 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.20/0.49  Running higher-order theorem proving
% 0.20/0.49  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.20/0.50  # Version: 3.1.0-ho
% 0.20/0.50  # Preprocessing class: HSSSSMSSSSSCSSA.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.50  # Starting new_bool_9 with 300s (1) cores
% 0.20/0.50  # Starting full_lambda_8 with 300s (1) cores
% 0.20/0.50  # Starting post_as_ho10 with 300s (1) cores
% 0.20/0.50  # new_bool_9 with pid 25330 completed with status 0
% 0.20/0.50  # Result found by new_bool_9
% 0.20/0.50  # Preprocessing class: HSSSSMSSSSSCSSA.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.50  # Starting new_bool_9 with 300s (1) cores
% 0.20/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.20/0.50  # Search class: HUUPF-FFSF11-SSSFFMBN
% 0.20/0.50  # partial match(1): HUUPF-FFSF11-SSSFFMNN
% 0.20/0.50  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50  # Starting post_as_ho12 with 163s (1) cores
% 0.20/0.50  # post_as_ho12 with pid 25333 completed with status 0
% 0.20/0.50  # Result found by post_as_ho12
% 0.20/0.50  # Preprocessing class: HSSSSMSSSSSCSSA.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.50  # Starting new_bool_9 with 300s (1) cores
% 0.20/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.20/0.50  # Search class: HUUPF-FFSF11-SSSFFMBN
% 0.20/0.50  # partial match(1): HUUPF-FFSF11-SSSFFMNN
% 0.20/0.50  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50  # Starting post_as_ho12 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                        : 2
% 0.20/0.50  # Removed by relevancy pruning/SinE    : 1
% 0.20/0.50  # Initial clauses                      : 2
% 0.20/0.50  # Removed in clause preprocessing      : 0
% 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   : 1
% 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                    : 4
% 0.20/0.50  # ...of the previous two non-redundant : 2
% 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                              : 1
% 0.20/0.50  # Equation resolutions                 : 1
% 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: 1
% 0.20/0.50  # ...number of literals in the above   : 1
% 0.20/0.50  # Current number of archived formulas  : 0
% 0.20/0.50  # Current number of archived clauses   : 3
% 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                : 0
% 0.20/0.50  # Condensation successes               : 0
% 0.20/0.50  # Termbank termtop insertions          : 259
% 0.20/0.50  # Search garbage collected termcells   : 79
% 0.20/0.50  
% 0.20/0.50  # -------------------------------------------------
% 0.20/0.50  # User time                : 0.000 s
% 0.20/0.50  # System time              : 0.004 s
% 0.20/0.50  # Total time               : 0.004 s
% 0.20/0.50  # Maximum resident set size: 1812 pages
% 0.20/0.50  
% 0.20/0.50  # -------------------------------------------------
% 0.20/0.50  # User time                : 0.001 s
% 0.20/0.50  # System time              : 0.006 s
% 0.20/0.50  # Total time               : 0.007 s
% 0.20/0.50  # Maximum resident set size: 1728 pages
% 0.20/0.50  % E---3.1 exiting
% 0.20/0.50  % E exiting
%------------------------------------------------------------------------------