↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SYO361^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n011.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:42:49 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
thf(decl_23,type,
    esk1_0: $i ).

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

thf(decl_25,type,
    epred1_0: $i > $i > $o ).

thf(decl_26,type,
    esk3_1: ( $i > $i > $o ) > $i ).

thf(cTHM47,conjecture,
    ! [X1: $i,X2: $i] :
      ( ( X1 = X2 )
    <=> ! [X3: $i > $i > $o] :
          ( ! [X4: $i] : ( X3 @ X4 @ X4 )
         => ( X3 @ X1 @ X2 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.mVV5GtH6VT/E---3.1_333848.p',cTHM47) ).

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

thf(c_0_2,negated_conjecture,
    ! [X12: $i,X13: $i > $i > $o] :
      ( ( ( epred1_0 @ X12 @ X12 )
        | ( esk1_0 != esk2_0 ) )
      & ( ~ ( epred1_0 @ esk1_0 @ esk2_0 )
        | ( esk1_0 != esk2_0 ) )
      & ( ( esk1_0 = esk2_0 )
        | ~ ( X13 @ ( esk3_1 @ X13 ) @ ( esk3_1 @ X13 ) )
        | ( X13 @ esk1_0 @ esk2_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,
    ! [X3: $i > $i > $o] :
      ( ( esk1_0 = esk2_0 )
      | ( X3 @ esk1_0 @ esk2_0 )
      | ~ ( X3 @ ( esk3_1 @ X3 ) @ ( esk3_1 @ X3 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    ! [X15: $i > $i > $i,X16: $i > $i > $i] :
      ( ( ( X15 @ esk1_0 @ esk2_0 )
        = ( X16 @ esk1_0 @ esk2_0 ) )
      | ( esk1_0 = esk2_0 )
      | ( ( X15
          @ ( esk3_1
            @ ^ [Z0: $i,Z1: $i] :
                ( ( X15 @ Z0 @ Z1 )
                = ( X16 @ Z0 @ Z1 ) ) )
          @ ( esk3_1
            @ ^ [Z0: $i,Z1: $i] :
                ( ( X15 @ Z0 @ Z1 )
                = ( X16 @ Z0 @ Z1 ) ) ) )
       != ( X16
          @ ( esk3_1
            @ ^ [Z0: $i,Z1: $i] :
                ( ( X15 @ Z0 @ Z1 )
                = ( X16 @ Z0 @ Z1 ) ) )
          @ ( esk3_1
            @ ^ [Z0: $i,Z1: $i] :
                ( ( X15 @ Z0 @ Z1 )
                = ( X16 @ Z0 @ Z1 ) ) ) ) ) ),
    inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]),c_0_3]) ).

thf(c_0_5,negated_conjecture,
    ( ~ ( epred1_0 @ esk1_0 @ esk2_0 )
    | ( esk1_0 != esk2_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_6,negated_conjecture,
    esk1_0 = esk2_0,
    inference(er,[status(thm)],[c_0_4]) ).

thf(c_0_7,negated_conjecture,
    ! [X1: $i] :
      ( ( epred1_0 @ X1 @ X1 )
      | ( esk1_0 != esk2_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_8,negated_conjecture,
    ~ ( epred1_0 @ esk2_0 @ esk2_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6]),c_0_6])]) ).

thf(c_0_9,negated_conjecture,
    ! [X1: $i] : ( epred1_0 @ X1 @ X1 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_6])]) ).

thf(c_0_10,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYO361^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.17  % Computer : n011.cluster.edu
% 0.11/0.17  % Model    : x86_64 x86_64
% 0.11/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.17  % Memory   : 8046.5625MB
% 0.11/0.17  % OS       : Linux 6.8.0-71-generic
% 0.11/0.17  % CPULimit : 300
% 0.11/0.17  % WCLimit  : 300
% 0.11/0.17  % DateTime : Tue Sep 29 16:49:01 UTC 2026
% 0.11/0.17  % CPUTime  : 
% 0.11/0.17  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.21  Running higher-order theorem proving
% 0.11/0.23  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.mVV5GtH6VT/E---3.1_333848.p
% 0.11/0.25  % Version: 3.5.1-ho
% 0.11/0.25  % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.11/0.25  % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.25  % Starting post_as_ho12 with 300s (1) cores
% 0.11/0.25  % Starting new_bool_9 with 300s (1) cores
% 0.11/0.25  % Starting post_as_ho1 with 300s (1) cores
% 0.11/0.25  % Starting post_as_ho4 with 300s (1) cores
% 0.11/0.25  % Starting post_as_ho2 with 300s (1) cores
% 0.11/0.25  % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.11/0.25  % Starting full_lambda_10 with 300s (1) cores
% 0.11/0.25  % Starting new_ho_8 with 300s (1) cores
% 0.11/0.25  % post_as_ho12 with pid 333861 completed with status 0
% 0.11/0.25  % Result found by post_as_ho12
% 0.11/0.25  % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.11/0.25  % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.25  % Starting post_as_ho12 with 300s (1) cores
% 0.11/0.25  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.25  % No SInE strategy applied
% 0.11/0.25  % Search class: HGHSF-FFSF11-SSSFFSBN
% 0.11/0.25  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.25  % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.25  % SubtermCWHack with pid 333870 completed with status 10
% 0.11/0.25  % Starting post_as_ho12 with 31s (1) cores
% 0.11/0.25  % post_as_ho12 with pid 333877 completed with status 0
% 0.11/0.25  % Result found by post_as_ho12
% 0.11/0.25  % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.11/0.25  % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.25  % Starting post_as_ho12 with 300s (1) cores
% 0.11/0.25  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.25  % No SInE strategy applied
% 0.11/0.25  % Search class: HGHSF-FFSF11-SSSFFSBN
% 0.11/0.25  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.25  % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.25  % SubtermCWHack with pid 333870 completed with status 10
% 0.11/0.25  % Starting post_as_ho12 with 31s (1) cores
% 0.11/0.25  % Preprocessing time       : 0.001 s
% 0.11/0.25  % Presaturation interreduction done
% 0.11/0.25  
% 0.11/0.25  % Proof found!
% 0.11/0.25  % SZS status Theorem
% 0.11/0.25  % SZS output start CNFRefutation
% See solution above
% 0.11/0.25  % Parsed axioms                        : 1
% 0.11/0.25  % Removed by relevancy pruning/SinE    : 0
% 0.11/0.25  % Initial clauses                      : 3
% 0.11/0.25  % Removed in clause preprocessing      : 0
% 0.11/0.25  % Initial clauses in saturation        : 3
% 0.11/0.25  % Processed clauses                    : 10
% 0.11/0.25  % ...of these trivial                  : 0
% 0.11/0.25  % ...subsumed                          : 0
% 0.11/0.25  % ...remaining for further processing  : 10
% 0.11/0.25  % Other redundant clauses eliminated   : 0
% 0.11/0.25  % Clauses deleted for lack of memory   : 0
% 0.11/0.25  % Backward-subsumed                    : 0
% 0.11/0.25  % Backward-rewritten                   : 5
% 0.11/0.25  % Generated clauses                    : 12
% 0.11/0.25  % ...of the previous two non-redundant : 5
% 0.11/0.25  % ...aggressively subsumed             : 0
% 0.11/0.25  % Contextual simplify-reflections      : 0
% 0.11/0.25  % Paramodulations                      : 4
% 0.11/0.25  % Factorizations                       : 0
% 0.11/0.25  % NegExts                              : 0
% 0.11/0.25  % Equation resolutions                 : 5
% 0.11/0.25  % Disequality decompositions           : 0
% 0.11/0.25  % Total rewrite steps                  : 9
% 0.11/0.25  % ...of those cached                   : 7
% 0.11/0.25  % Propositional unsat checks           : 0
% 0.11/0.25  %    Propositional check models        : 0
% 0.11/0.25  %    Propositional check unsatisfiable : 0
% 0.11/0.25  %    Propositional clauses             : 0
% 0.11/0.25  %    Propositional clauses after purity: 0
% 0.11/0.25  %    Propositional unsat core size     : 0
% 0.11/0.25  %    Propositional preprocessing time  : 0.000
% 0.11/0.25  %    Propositional encoding time       : 0.000
% 0.11/0.25  %    Propositional solver time         : 0.000
% 0.11/0.25  %    Success case prop preproc time    : 0.000
% 0.11/0.25  %    Success case prop encoding time   : 0.000
% 0.11/0.25  %    Success case prop solver time     : 0.000
% 0.11/0.25  % Current number of processed clauses  : 2
% 0.11/0.25  %    Positive orientable unit clauses  : 2
% 0.11/0.25  %    Positive unorientable unit clauses: 0
% 0.11/0.25  %    Negative unit clauses             : 0
% 0.11/0.25  %    Non-unit-clauses                  : 0
% 0.11/0.25  % Current number of unprocessed clauses: 0
% 0.11/0.25  % ...number of literals in the above   : 0
% 0.11/0.25  % Current number of archived formulas  : 0
% 0.11/0.25  % Current number of archived clauses   : 8
% 0.11/0.25  % Clause-clause subsumption calls (NU) : 0
% 0.11/0.25  % Rec. Clause-clause subsumption calls : 0
% 0.11/0.25  % Non-unit clause-clause subsumptions  : 0
% 0.11/0.25  % Unit Clause-clause subsumption calls : 0
% 0.11/0.25  % Rewrite failures with RHS unbound    : 0
% 0.11/0.25  % BW rewrite match attempts            : 2
% 0.11/0.25  % BW rewrite match successes           : 2
% 0.11/0.25  % Condensation attempts                : 0
% 0.11/0.25  % Condensation successes               : 0
% 0.11/0.25  % Termbank termtop insertions          : 880
% 0.11/0.25  % Search garbage collected termcells   : 117
% 0.11/0.25  
% 0.11/0.25  % -------------------------------------------------
% 0.11/0.25  % User time                : 0.006 s
% 0.11/0.25  % System time              : 0.002 s
% 0.11/0.25  % Total time               : 0.008 s
% 0.11/0.25  % Maximum resident set size: 3628 pages
% 0.11/0.25  
% 0.11/0.25  % -------------------------------------------------
% 0.11/0.25  % User time                : 0.008 s
% 0.11/0.25  % System time              : 0.006 s
% 0.11/0.25  % Total time               : 0.014 s
% 0.11/0.25  % Maximum resident set size: 4864 pages
% 0.11/0.25  % E exiting
%------------------------------------------------------------------------------