TSTP Solution File: SEV429^1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : SEV429^1 : TPTP v8.2.0. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n011.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 04:08:23 EDT 2024

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

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

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

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

thf(invexists,conjecture,
    ? [X3: $i > $i] :
    ! [X1: $i] :
      ( ( X3 @ ( f @ X1 ) )
      = X1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',invexists) ).

thf(finj,axiom,
    ! [X1: $i,X2: $i] :
      ( ( ( f @ X1 )
        = ( f @ X2 ) )
     => ( X1 = X2 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',finj) ).

thf(c_0_2,negated_conjecture,
    ~ ? [X3: $i > $i] :
      ! [X1: $i] :
        ( ( X3 @ ( f @ X1 ) )
        = X1 ),
    inference(assume_negation,[status(cth)],[invexists]) ).

thf(c_0_3,plain,
    ! [X8: $i,X9: $i] :
      ( ( ( f @ X8 )
       != ( f @ X9 ) )
      | ( X8 = X9 ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[finj])])]) ).

thf(c_0_4,negated_conjecture,
    ! [X10: $i > $i] :
      ( ( X10 @ ( f @ ( esk1_1 @ X10 ) ) )
     != ( esk1_1 @ X10 ) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).

thf(c_0_5,plain,
    ! [X1: $i,X2: $i] :
      ( ( X1 = X2 )
      | ( ( f @ X1 )
       != ( f @ X2 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_6,negated_conjecture,
    ! [X3: $i > $i] :
      ( ( X3 @ ( f @ ( esk1_1 @ X3 ) ) )
     != ( esk1_1 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

thf(c_0_7,plain,
    ! [X1: $i] :
      ( ( esk2_1 @ ( f @ X1 ) )
      = X1 ),
    inference(recognize_injectivity,[status(thm)],[c_0_5]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09  % Problem    : SEV429^1 : TPTP v8.2.0. Released v5.2.0.
% 0.04/0.09  % Command    : run_E %s %d THM
% 0.09/0.29  % Computer : n011.cluster.edu
% 0.09/0.29  % Model    : x86_64 x86_64
% 0.09/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29  % Memory   : 8042.1875MB
% 0.09/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29  % CPULimit   : 300
% 0.09/0.29  % WCLimit    : 300
% 0.09/0.29  % DateTime   : Sun May 19 18:51:38 EDT 2024
% 0.09/0.29  % CPUTime    : 
% 0.14/0.39  Running higher-order theorem proving
% 0.14/0.39  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.14/0.40  # Version: 3.1.0-ho
% 0.14/0.40  # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.14/0.40  # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40  # Starting post_as_ho12 with 300s (1) cores
% 0.14/0.40  # Starting new_bool_9 with 300s (1) cores
% 0.14/0.40  # Starting post_as_ho1 with 300s (1) cores
% 0.14/0.40  # Starting post_as_ho4 with 300s (1) cores
% 0.14/0.40  # Starting post_as_ho2 with 300s (1) cores
% 0.14/0.40  # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.14/0.40  # Starting full_lambda_10 with 300s (1) cores
% 0.14/0.40  # Starting new_ho_8 with 300s (1) cores
% 0.14/0.40  # post_as_ho12 with pid 22920 completed with status 0
% 0.14/0.40  # Result found by post_as_ho12
% 0.14/0.40  # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.14/0.40  # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40  # Starting post_as_ho12 with 300s (1) cores
% 0.14/0.40  # No SInE strategy applied
% 0.14/0.40  # Search class: HHUPF-FFSF11-MSSFFMNN
% 0.14/0.40  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.40  # Starting ho_unfolding_3 with 163s (1) cores
% 0.14/0.40  # ho_unfolding_3 with pid 22929 completed with status 0
% 0.14/0.40  # Result found by ho_unfolding_3
% 0.14/0.40  # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.14/0.40  # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40  # Starting post_as_ho12 with 300s (1) cores
% 0.14/0.40  # No SInE strategy applied
% 0.14/0.40  # Search class: HHUPF-FFSF11-MSSFFMNN
% 0.14/0.40  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.40  # Starting ho_unfolding_3 with 163s (1) cores
% 0.14/0.40  # Preprocessing time       : 0.001 s
% 0.14/0.40  # Presaturation interreduction done
% 0.14/0.40  
% 0.14/0.40  # Proof found!
% 0.14/0.40  # SZS status Theorem
% 0.14/0.40  # SZS output start CNFRefutation
% See solution above
% 0.14/0.40  # Parsed axioms                        : 3
% 0.14/0.40  # Removed by relevancy pruning/SinE    : 0
% 0.14/0.40  # Initial clauses                      : 3
% 0.14/0.40  # Removed in clause preprocessing      : 1
% 0.14/0.40  # Initial clauses in saturation        : 2
% 0.14/0.40  # Processed clauses                    : 5
% 0.14/0.40  # ...of these trivial                  : 0
% 0.14/0.40  # ...subsumed                          : 0
% 0.14/0.40  # ...remaining for further processing  : 5
% 0.14/0.40  # Other redundant clauses eliminated   : 0
% 0.14/0.40  # Clauses deleted for lack of memory   : 0
% 0.14/0.40  # Backward-subsumed                    : 0
% 0.14/0.40  # Backward-rewritten                   : 0
% 0.14/0.40  # Generated clauses                    : 3
% 0.14/0.40  # ...of the previous two non-redundant : 1
% 0.14/0.40  # ...aggressively subsumed             : 0
% 0.14/0.40  # Contextual simplify-reflections      : 0
% 0.14/0.40  # Paramodulations                      : 1
% 0.14/0.40  # Factorizations                       : 0
% 0.14/0.40  # NegExts                              : 0
% 0.14/0.40  # Equation resolutions                 : 1
% 0.14/0.40  # Disequality decompositions           : 0
% 0.14/0.40  # Total rewrite steps                  : 0
% 0.14/0.40  # ...of those cached                   : 0
% 0.14/0.40  # Propositional unsat checks           : 0
% 0.14/0.40  #    Propositional check models        : 0
% 0.14/0.40  #    Propositional check unsatisfiable : 0
% 0.14/0.40  #    Propositional clauses             : 0
% 0.14/0.40  #    Propositional clauses after purity: 0
% 0.14/0.40  #    Propositional unsat core size     : 0
% 0.14/0.40  #    Propositional preprocessing time  : 0.000
% 0.14/0.40  #    Propositional encoding time       : 0.000
% 0.14/0.40  #    Propositional solver time         : 0.000
% 0.14/0.40  #    Success case prop preproc time    : 0.000
% 0.14/0.40  #    Success case prop encoding time   : 0.000
% 0.14/0.40  #    Success case prop solver time     : 0.000
% 0.14/0.40  # Current number of processed clauses  : 3
% 0.14/0.40  #    Positive orientable unit clauses  : 1
% 0.14/0.40  #    Positive unorientable unit clauses: 0
% 0.14/0.40  #    Negative unit clauses             : 1
% 0.14/0.40  #    Non-unit-clauses                  : 1
% 0.14/0.40  # Current number of unprocessed clauses: 0
% 0.14/0.40  # ...number of literals in the above   : 0
% 0.14/0.40  # Current number of archived formulas  : 0
% 0.14/0.40  # Current number of archived clauses   : 2
% 0.14/0.40  # Clause-clause subsumption calls (NU) : 0
% 0.14/0.40  # Rec. Clause-clause subsumption calls : 0
% 0.14/0.40  # Non-unit clause-clause subsumptions  : 0
% 0.14/0.40  # Unit Clause-clause subsumption calls : 0
% 0.14/0.40  # Rewrite failures with RHS unbound    : 0
% 0.14/0.40  # BW rewrite match attempts            : 0
% 0.14/0.40  # BW rewrite match successes           : 0
% 0.14/0.40  # Condensation attempts                : 5
% 0.14/0.40  # Condensation successes               : 0
% 0.14/0.40  # Termbank termtop insertions          : 169
% 0.14/0.40  # Search garbage collected termcells   : 41
% 0.14/0.40  
% 0.14/0.40  # -------------------------------------------------
% 0.14/0.40  # User time                : 0.002 s
% 0.14/0.40  # System time              : 0.001 s
% 0.14/0.40  # Total time               : 0.003 s
% 0.14/0.40  # Maximum resident set size: 1584 pages
% 0.14/0.40  
% 0.14/0.40  # -------------------------------------------------
% 0.14/0.40  # User time                : 0.002 s
% 0.14/0.40  # System time              : 0.004 s
% 0.14/0.40  # Total time               : 0.006 s
% 0.14/0.40  # Maximum resident set size: 1712 pages
% 0.14/0.40  % E---3.1 exiting
% 0.14/0.40  % E exiting
%------------------------------------------------------------------------------