↑ Up

E-SAT---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : SYO374^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 : 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:44:17 AM UTC 2026

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

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

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

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

thf(decl_27,type,
    esk3_0: $i ).

thf(cEXT_A_LEIB2,conjecture,
    ( ! [X1: $i,X2: $i > $o] :
        ( ( X2 @ ( cM @ X1 ) )
      <=> ( X2 @ ( cN @ X1 ) ) )
   => ! [X3: ( $i > $i ) > $o] :
        ( ( X3 @ cM )
      <=> ( X3 @ cN ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.8r0Hw0RdBU/E---3.1_3412905.p',cEXT_A_LEIB2) ).

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

thf(c_0_2,negated_conjecture,
    ! [X7: $i,X8: $i > $o] :
      ( ( ~ ( X8 @ ( cM @ X7 ) )
        | ( X8 @ ( cN @ X7 ) ) )
      & ( ~ ( X8 @ ( cN @ X7 ) )
        | ( X8 @ ( cM @ X7 ) ) )
      & ( ~ ( epred1_0 @ cM )
        | ~ ( epred1_0 @ cN ) )
      & ( ( epred1_0 @ cM )
        | ( epred1_0 @ cN ) ) ),
    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 @ cM )
    | ( epred1_0 @ cN ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    ( ~ ( epred1_0 @ cM )
    | ~ ( epred1_0 @ cN ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_5,plain,
    ( ( epred1_0 @ cM )
    | ( cN != cM ) ),
    inference(ext_eqfact,[status(thm)],[c_0_3]) ).

thf(c_0_6,plain,
    cN != cM,
    inference(csr,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_4,c_0_5]),c_0_5]) ).

thf(c_0_7,negated_conjecture,
    ! [X2: $i > $o,X1: $i] :
      ( ( X2 @ ( cN @ X1 ) )
      | ~ ( X2 @ ( cM @ X1 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_8,plain,
    ( ( cN @ esk3_0 )
   != ( cM @ esk3_0 ) ),
    inference(neg_ext,[status(thm)],[c_0_6]) ).

thf(c_0_9,negated_conjecture,
    ! [X1: $i] :
      ( ( cN @ X1 )
      = ( cM @ X1 ) ),
    inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_7]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYO374^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.17  % Computer : n008.cluster.edu
% 0.08/0.17  % Model    : x86_64 x86_64
% 0.08/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17  % Memory   : 8046.5625MB
% 0.08/0.17  % OS       : Linux 6.8.0-71-generic
% 0.08/0.17  % CPULimit : 300
% 0.08/0.17  % WCLimit  : 300
% 0.08/0.17  % DateTime : Tue Sep 29 16:50:09 UTC 2026
% 0.08/0.17  % CPUTime  : 
% 0.08/0.17  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22  Running higher-order theorem proving
% 0.08/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.8r0Hw0RdBU/E---3.1_3412905.p
% 0.08/0.25  % Version: 3.5.1-ho
% 0.08/0.25  % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.08/0.25  % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.25  % Starting sh2lt with 1200s (4) cores
% 0.08/0.25  % Starting new_ho_10_unif with 300s (1) cores
% 0.08/0.25  % Starting full_lambda_6 with 300s (1) cores
% 0.08/0.25  % Starting post_as_ho1 with 300s (1) cores
% 0.08/0.25  % Starting ehoh_best3_rw with 300s (1) cores
% 0.08/0.25  % post_as_ho1 with pid 3412921 completed with status 0
% 0.08/0.25  % Result found by post_as_ho1
% 0.08/0.25  % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.08/0.25  % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.25  % Starting sh2lt with 1200s (4) cores
% 0.08/0.25  % Starting new_ho_10_unif with 300s (1) cores
% 0.08/0.25  % Starting full_lambda_6 with 300s (1) cores
% 0.08/0.25  % Starting post_as_ho1 with 300s (1) cores
% 0.08/0.25  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.25  % No SInE strategy applied
% 0.08/0.25  % Search class: HGHNF-FFSF11-SHHFFMBN
% 0.08/0.25  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.25  % Starting SubtermCWHack with 31s (1) cores
% 0.08/0.25  % SubtermCWHack with pid 3412930 completed with status 10
% 0.08/0.25  % Starting ehoh_best_nonlift with 181s (1) cores
% 0.08/0.25  % ehoh_best_nonlift with pid 3412934 completed with status 0
% 0.08/0.25  % Result found by ehoh_best_nonlift
% 0.08/0.25  % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.08/0.25  % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.25  % Starting sh2lt with 1200s (4) cores
% 0.08/0.25  % Starting new_ho_10_unif with 300s (1) cores
% 0.08/0.25  % Starting full_lambda_6 with 300s (1) cores
% 0.08/0.25  % Starting post_as_ho1 with 300s (1) cores
% 0.08/0.25  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.25  % No SInE strategy applied
% 0.08/0.25  % Search class: HGHNF-FFSF11-SHHFFMBN
% 0.08/0.25  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.25  % Starting SubtermCWHack with 31s (1) cores
% 0.08/0.25  % SubtermCWHack with pid 3412930 completed with status 10
% 0.08/0.25  % Starting ehoh_best_nonlift with 181s (1) cores
% 0.08/0.25  % Preprocessing time       : 0.001 s
% 0.08/0.25  % Presaturation interreduction done
% 0.08/0.25  
% 0.08/0.25  % Proof found!
% 0.08/0.25  % SZS status Theorem
% 0.08/0.25  % SZS output start CNFRefutation
% See solution above
% 0.08/0.25  % Parsed axioms                        : 3
% 0.08/0.25  % Removed by relevancy pruning/SinE    : 0
% 0.08/0.25  % Initial clauses                      : 6
% 0.08/0.25  % Removed in clause preprocessing      : 2
% 0.08/0.25  % Initial clauses in saturation        : 4
% 0.08/0.25  % Processed clauses                    : 15
% 0.08/0.25  % ...of these trivial                  : 2
% 0.08/0.25  % ...subsumed                          : 1
% 0.08/0.25  % ...remaining for further processing  : 12
% 0.08/0.25  % Other redundant clauses eliminated   : 0
% 0.08/0.25  % Clauses deleted for lack of memory   : 0
% 0.08/0.25  % Backward-subsumed                    : 1
% 0.08/0.25  % Backward-rewritten                   : 3
% 0.08/0.25  % Generated clauses                    : 13
% 0.08/0.25  % ...of the previous two non-redundant : 10
% 0.08/0.25  % ...aggressively subsumed             : 0
% 0.08/0.25  % Contextual simplify-reflections      : 1
% 0.08/0.25  % Paramodulations                      : 1
% 0.08/0.25  % Factorizations                       : 0
% 0.08/0.25  % NegExts                              : 2
% 0.08/0.25  % Equation resolutions                 : 0
% 0.08/0.25  % Disequality decompositions           : 0
% 0.08/0.25  % Total rewrite steps                  : 3
% 0.08/0.25  % ...of those cached                   : 0
% 0.08/0.25  % Propositional unsat checks           : 0
% 0.08/0.25  %    Propositional check models        : 0
% 0.08/0.25  %    Propositional check unsatisfiable : 0
% 0.08/0.25  %    Propositional clauses             : 0
% 0.08/0.25  %    Propositional clauses after purity: 0
% 0.08/0.25  %    Propositional unsat core size     : 0
% 0.08/0.25  %    Propositional preprocessing time  : 0.000
% 0.08/0.25  %    Propositional encoding time       : 0.000
% 0.08/0.25  %    Propositional solver time         : 0.000
% 0.08/0.25  %    Success case prop preproc time    : 0.000
% 0.08/0.25  %    Success case prop encoding time   : 0.000
% 0.08/0.25  %    Success case prop solver time     : 0.000
% 0.08/0.25  % Current number of processed clauses  : 4
% 0.08/0.25  %    Positive orientable unit clauses  : 1
% 0.08/0.25  %    Positive unorientable unit clauses: 0
% 0.08/0.25  %    Negative unit clauses             : 1
% 0.08/0.25  %    Non-unit-clauses                  : 2
% 0.08/0.25  % Current number of unprocessed clauses: 2
% 0.08/0.25  % ...number of literals in the above   : 3
% 0.08/0.25  % Current number of archived formulas  : 0
% 0.08/0.25  % Current number of archived clauses   : 8
% 0.08/0.25  % Clause-clause subsumption calls (NU) : 1
% 0.08/0.25  % Rec. Clause-clause subsumption calls : 1
% 0.08/0.25  % Non-unit clause-clause subsumptions  : 1
% 0.08/0.25  % Unit Clause-clause subsumption calls : 5
% 0.08/0.25  % Rewrite failures with RHS unbound    : 0
% 0.08/0.25  % BW rewrite match attempts            : 4
% 0.08/0.25  % BW rewrite match successes           : 3
% 0.08/0.25  % Condensation attempts                : 0
% 0.08/0.25  % Condensation successes               : 0
% 0.08/0.25  % Termbank termtop insertions          : 533
% 0.08/0.25  % Search garbage collected termcells   : 122
% 0.08/0.25  
% 0.08/0.25  % -------------------------------------------------
% 0.08/0.25  % User time                : 0.004 s
% 0.08/0.25  % System time              : 0.002 s
% 0.08/0.25  % Total time               : 0.007 s
% 0.08/0.25  % Maximum resident set size: 3632 pages
% 0.08/0.25  
% 0.08/0.25  % -------------------------------------------------
% 0.08/0.25  % User time                : 0.004 s
% 0.08/0.25  % System time              : 0.009 s
% 0.08/0.25  % Total time               : 0.013 s
% 0.08/0.25  % Maximum resident set size: 4608 pages
% 0.08/0.25  % E exiting
%------------------------------------------------------------------------------