↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n008.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:34:48 AM UTC 2026

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

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

thf(decl_sort2,type,
    a: $tType ).

thf(decl_23,type,
    esk1_0: b ).

thf(decl_24,type,
    esk2_0: a ).

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

thf(decl_26,type,
    epred2_0: b > a > $o ).

thf(decl_27,type,
    esk3_0: b ).

thf(decl_28,type,
    esk4_0: a ).

thf(cTHM173_pme,conjecture,
    ! [X1: b,X2: a,X3: b > a > $o,X4: b > a > $o] :
      ( ( ! [X5: b,X6: a] :
            ( ( X4 @ X5 @ X6 )
           => ( ( X3 @ X5 @ X6 )
              | ( ( X5 = X1 )
                & ( X6 = X2 ) ) ) )
        & ~ ( X4 @ X1 @ X2 ) )
     => ! [X7: b,X8: a] :
          ( ( X4 @ X7 @ X8 )
         => ( X3 @ X7 @ X8 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.s7yQ1KRgWR/E---3.1_3278281.p',cTHM173_pme) ).

thf(c_0_1,negated_conjecture,
    ~ ! [X1: b,X2: a,X3: b > a > $o,X4: b > a > $o] :
        ( ( ! [X5: b,X6: a] :
              ( ( X4 @ X5 @ X6 )
             => ( ( X3 @ X5 @ X6 )
                | ( ( X5 = X1 )
                  & ( X6 = X2 ) ) ) )
          & ~ ( X4 @ X1 @ X2 ) )
       => ! [X7: b,X8: a] :
            ( ( X4 @ X7 @ X8 )
           => ( X3 @ X7 @ X8 ) ) ),
    inference(assume_negation,[status(cth)],[cTHM173_pme]) ).

thf(c_0_2,negated_conjecture,
    ! [X21: b,X22: a] :
      ( ( ( X21 = esk1_0 )
        | ( epred1_0 @ X21 @ X22 )
        | ~ ( epred2_0 @ X21 @ X22 ) )
      & ( ( X22 = esk2_0 )
        | ( epred1_0 @ X21 @ X22 )
        | ~ ( epred2_0 @ X21 @ X22 ) )
      & ~ ( epred2_0 @ esk1_0 @ esk2_0 )
      & ( epred2_0 @ esk3_0 @ esk4_0 )
      & ~ ( epred1_0 @ esk3_0 @ esk4_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,
    ~ ( epred1_0 @ esk3_0 @ esk4_0 ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    ! [X1: b,X2: a] :
      ( ( X1 = esk1_0 )
      | ( epred1_0 @ X1 @ X2 )
      | ~ ( epred2_0 @ X1 @ X2 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_5,negated_conjecture,
    epred2_0 @ esk3_0 @ esk4_0,
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_6,negated_conjecture,
    esk3_0 = esk1_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5])]) ).

thf(c_0_7,negated_conjecture,
    ~ ( epred1_0 @ esk1_0 @ esk4_0 ),
    inference(rw,[status(thm)],[c_0_3,c_0_6]) ).

thf(c_0_8,negated_conjecture,
    ! [X1: b,X2: a] :
      ( ( X2 = esk2_0 )
      | ( epred1_0 @ X1 @ X2 )
      | ~ ( epred2_0 @ X1 @ X2 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_9,negated_conjecture,
    epred2_0 @ esk1_0 @ esk4_0,
    inference(rw,[status(thm)],[c_0_5,c_0_6]) ).

thf(c_0_10,negated_conjecture,
    ~ ( epred2_0 @ esk1_0 @ esk2_0 ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_11,negated_conjecture,
    esk2_0 = esk4_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).

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

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