↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SET055^12 : TPTP v9.3.1. Released v8.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n014.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Sep 30 08:21:53 AM UTC 2026

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

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

thf(decl_24,type,
    mactual: mworld ).

thf(decl_25,type,
    mlocal: ( mworld > $o ) > $o ).

thf(decl_33,type,
    eiw_di: $i > mworld > $o ).

thf(decl_34,type,
    mforall_di: ( $i > mworld > $o ) > mworld > $o ).

thf(decl_41,type,
    qmltpeq: $i > $i > mworld > $o ).

thf(decl_75,type,
    esk8_0: $i ).

thf(reflexivity_0,conjecture,
    ( mlocal
    @ ( mforall_di
      @ ^ [X6: $i] : ( qmltpeq @ X6 @ X6 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.ZnXpRJdvfJ/E---3.1_2659792.p',reflexivity_0) ).

thf(mlocal_def,axiom,
    ( mlocal
    = ( ^ [X1: mworld > $o] : ( X1 @ mactual ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.ZnXpRJdvfJ/E---3.1_2659792.p',mlocal_def) ).

thf(mforall_di_def,axiom,
    ( mforall_di
    = ( ^ [X7: $i > mworld > $o,X3: mworld] :
        ! [X6: $i] :
          ( ( eiw_di @ X6 @ X3 )
         => ( X7 @ X6 @ X3 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.ZnXpRJdvfJ/E---3.1_2659792.p',mforall_di_def) ).

thf(reflexivity,axiom,
    ( mlocal
    @ ( mforall_di
      @ ^ [X6: $i] : ( qmltpeq @ X6 @ X6 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.ZnXpRJdvfJ/E---3.1_2659792.p',reflexivity) ).

thf(c_0_4,negated_conjecture,
    ~ ( mlocal
      @ ( mforall_di
        @ ^ [X6: $i] : ( qmltpeq @ X6 @ X6 ) ) ),
    inference(assume_negation,[status(cth)],[reflexivity_0]) ).

thf(c_0_5,plain,
    ( mlocal
    = ( ^ [Z0: mworld > $o] : ( Z0 @ mactual ) ) ),
    inference(fof_simplification,[status(thm)],[mlocal_def]) ).

thf(c_0_6,plain,
    ( mforall_di
    = ( ^ [Z0: $i > mworld > $o,Z1: mworld] :
        ! [X6: $i] :
          ( ( eiw_di @ X6 @ Z1 )
         => ( Z0 @ X6 @ Z1 ) ) ) ),
    inference(fof_simplification,[status(thm)],[mforall_di_def]) ).

thf(c_0_7,negated_conjecture,
    ~ ! [X299: $i] :
        ( ( eiw_di @ X299 @ mactual )
       => ( qmltpeq @ X299 @ X299 @ mactual ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_4]),c_0_5]),c_0_6]) ).

thf(c_0_8,plain,
    ! [X105: $i] :
      ( ( eiw_di @ X105 @ mactual )
     => ( qmltpeq @ X105 @ X105 @ mactual ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity]),c_0_5]),c_0_6]) ).

thf(c_0_9,negated_conjecture,
    ( ( eiw_di @ esk8_0 @ mactual )
    & ~ ( qmltpeq @ esk8_0 @ esk8_0 @ mactual ) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).

thf(c_0_10,plain,
    ! [X304: $i] :
      ( ~ ( eiw_di @ X304 @ mactual )
      | ( qmltpeq @ X304 @ X304 @ mactual ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).

thf(c_0_11,negated_conjecture,
    ~ ( qmltpeq @ esk8_0 @ esk8_0 @ mactual ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

thf(c_0_12,plain,
    ! [X6: $i] :
      ( ( qmltpeq @ X6 @ X6 @ mactual )
      | ~ ( eiw_di @ X6 @ mactual ) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

thf(c_0_13,negated_conjecture,
    eiw_di @ esk8_0 @ mactual,
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

thf(c_0_14,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET055^12 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.19  % Computer : n014.cluster.edu
% 0.09/0.19  % Model    : x86_64 x86_64
% 0.09/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19  % Memory   : 8046.5625MB
% 0.09/0.19  % OS       : Linux 6.8.0-71-generic
% 0.09/0.19  % CPULimit : 300
% 0.09/0.19  % WCLimit  : 300
% 0.09/0.19  % DateTime : Tue Sep 29 13:36:30 UTC 2026
% 0.09/0.19  % CPUTime  : 
% 0.09/0.19  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.24  Running higher-order theorem proving
% 0.24/0.26  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.ZnXpRJdvfJ/E---3.1_2659792.p
% 0.24/0.32  % Version: 3.5.1-ho
% 0.24/0.32  % Preprocessing class: HSLSSMSSMLLNHSN.
% 0.24/0.32  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.32  % Starting almost_fo_3 with 1500s (5) cores
% 0.24/0.32  % Starting sh10 with 300s (1) cores
% 0.24/0.32  % Starting new_ho_16 with 300s (1) cores
% 0.24/0.32  % Starting post_as_ho11 with 300s (1) cores
% 0.24/0.32  % sh10 with pid 2659827 completed with status 0
% 0.24/0.32  % Result found by sh10
% 0.24/0.32  % Preprocessing class: HSLSSMSSMLLNHSN.
% 0.24/0.32  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.32  % Starting almost_fo_3 with 1500s (5) cores
% 0.24/0.32  % Starting sh10 with 300s (1) cores
% 0.24/0.32  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.32  % No SInE strategy applied
% 0.24/0.32  % Search class: HGHNS-FSLM31-MHSSMFNN
% 0.24/0.32  % partial match(2): HGHNS-FSLM11-SHSSMFNN
% 0.24/0.32  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.32  % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.32  % SubtermCWHack with pid 2659848 completed with status 0
% 0.24/0.32  % Result found by SubtermCWHack
% 0.24/0.32  % Preprocessing class: HSLSSMSSMLLNHSN.
% 0.24/0.32  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.32  % Starting almost_fo_3 with 1500s (5) cores
% 0.24/0.32  % Starting sh10 with 300s (1) cores
% 0.24/0.32  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.32  % No SInE strategy applied
% 0.24/0.32  % Search class: HGHNS-FSLM31-MHSSMFNN
% 0.24/0.32  % partial match(2): HGHNS-FSLM11-SHSSMFNN
% 0.24/0.32  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.32  % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.32  % Preprocessing time       : 0.006 s
% 0.24/0.32  
% 0.24/0.32  % Proof found!
% 0.24/0.32  % SZS status Theorem
% 0.24/0.32  % SZS output start CNFRefutation
% See solution above
% 0.24/0.32  % Parsed axioms                        : 142
% 0.24/0.32  % Removed by relevancy pruning/SinE    : 0
% 0.24/0.32  % Initial clauses                      : 182
% 0.24/0.32  % Removed in clause preprocessing      : 46
% 0.24/0.32  % Initial clauses in saturation        : 136
% 0.24/0.32  % Processed clauses                    : 13
% 0.24/0.32  % ...of these trivial                  : 0
% 0.24/0.32  % ...subsumed                          : 0
% 0.24/0.32  % ...remaining for further processing  : 13
% 0.24/0.32  % Other redundant clauses eliminated   : 0
% 0.24/0.32  % Clauses deleted for lack of memory   : 0
% 0.24/0.32  % Backward-subsumed                    : 0
% 0.24/0.32  % Backward-rewritten                   : 0
% 0.24/0.32  % Generated clauses                    : 1
% 0.24/0.32  % ...of the previous two non-redundant : 0
% 0.24/0.32  % ...aggressively subsumed             : 0
% 0.24/0.32  % Contextual simplify-reflections      : 0
% 0.24/0.32  % Paramodulations                      : 1
% 0.24/0.32  % Factorizations                       : 0
% 0.24/0.32  % NegExts                              : 0
% 0.24/0.32  % Equation resolutions                 : 0
% 0.24/0.32  % Disequality decompositions           : 0
% 0.24/0.32  % Total rewrite steps                  : 1
% 0.24/0.32  % ...of those cached                   : 0
% 0.24/0.32  % Propositional unsat checks           : 0
% 0.24/0.32  %    Propositional check models        : 0
% 0.24/0.32  %    Propositional check unsatisfiable : 0
% 0.24/0.32  %    Propositional clauses             : 0
% 0.24/0.32  %    Propositional clauses after purity: 0
% 0.24/0.32  %    Propositional unsat core size     : 0
% 0.24/0.32  %    Propositional preprocessing time  : 0.000
% 0.24/0.32  %    Propositional encoding time       : 0.000
% 0.24/0.32  %    Propositional solver time         : 0.000
% 0.24/0.32  %    Success case prop preproc time    : 0.000
% 0.24/0.32  %    Success case prop encoding time   : 0.000
% 0.24/0.32  %    Success case prop solver time     : 0.000
% 0.24/0.32  % Current number of processed clauses  : 13
% 0.24/0.32  %    Positive orientable unit clauses  : 10
% 0.24/0.32  %    Positive unorientable unit clauses: 0
% 0.24/0.32  %    Negative unit clauses             : 1
% 0.24/0.32  %    Non-unit-clauses                  : 2
% 0.24/0.32  % Current number of unprocessed clauses: 123
% 0.24/0.32  % ...number of literals in the above   : 558
% 0.24/0.32  % Current number of archived formulas  : 0
% 0.24/0.32  % Current number of archived clauses   : 0
% 0.24/0.32  % Clause-clause subsumption calls (NU) : 0
% 0.24/0.32  % Rec. Clause-clause subsumption calls : 0
% 0.24/0.32  % Non-unit clause-clause subsumptions  : 0
% 0.24/0.32  % Unit Clause-clause subsumption calls : 0
% 0.24/0.32  % Rewrite failures with RHS unbound    : 0
% 0.24/0.32  % BW rewrite match attempts            : 0
% 0.24/0.32  % BW rewrite match successes           : 0
% 0.24/0.32  % Condensation attempts                : 0
% 0.24/0.32  % Condensation successes               : 0
% 0.24/0.32  % Termbank termtop insertions          : 30723
% 0.24/0.32  % Search garbage collected termcells   : 12931
% 0.24/0.32  
% 0.24/0.32  % -------------------------------------------------
% 0.24/0.32  % User time                : 0.026 s
% 0.24/0.32  % System time              : 0.009 s
% 0.24/0.32  % Total time               : 0.035 s
% 0.24/0.32  % Maximum resident set size: 5852 pages
% 0.24/0.32  
% 0.24/0.32  % -------------------------------------------------
% 0.24/0.32  % User time                : 0.032 s
% 0.24/0.32  % System time              : 0.014 s
% 0.24/0.32  % Total time               : 0.046 s
% 0.24/0.32  % Maximum resident set size: 5120 pages
% 0.24/0.32  % E exiting
%------------------------------------------------------------------------------