↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SEV175^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 : 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:35:09 AM UTC 2026

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

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

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

thf(cTHM144A_pme,conjecture,
    ! [X1: ( $i > $o ) > $i] :
    ? [X2: $i > $o] :
      ( ~ ( X2 @ ( X1 @ X2 ) )
      & ( ( X1
          @ ^ [X3: $i] :
            ? [X4: $i > $o] :
              ( ~ ( X4 @ ( X1 @ X4 ) )
              & ( X3
                = ( X1 @ X4 ) ) ) )
        = ( X1 @ X2 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.kkP07WnxrG/E---3.1_2792726.p',cTHM144A_pme) ).

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

thf(c_0_2,negated_conjecture,
    ~ ! [X1: ( $i > $o ) > $i] :
      ? [X2: $i > $o] :
        ( ~ ( X2 @ ( X1 @ X2 ) )
        & ( ( X1
            @ ^ [Z0: $i] :
              ? [X4: $i > $o] :
                ( ~ ( X4 @ ( X1 @ X4 ) )
                & ( Z0
                  = ( X1 @ X4 ) ) ) )
          = ( X1 @ X2 ) ) ),
    inference(fof_simplification,[status(thm)],[c_0_1]) ).

thf(c_0_3,negated_conjecture,
    ! [X8: $i > $o] :
      ( ( X8 @ ( esk1_0 @ X8 ) )
      | ( ( esk1_0
          @ ^ [Z0: $i] :
            ? [X4: $i > $o] :
              ( ~ ( X4 @ ( esk1_0 @ X4 ) )
              & ( Z0
                = ( esk1_0 @ X4 ) ) ) )
       != ( esk1_0 @ X8 ) ) ),
    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_4,negated_conjecture,
    ! [X2: $i > $o] :
      ( ( X2 @ ( esk1_0 @ X2 ) )
      | ( ( esk1_0
          @ ^ [Z0: $i] :
            ? [X12: $i > $o] :
              ( ~ ( X12 @ ( esk1_0 @ X12 ) )
              & ( Z0
                = ( esk1_0 @ X12 ) ) ) )
       != ( esk1_0 @ X2 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_5,negated_conjecture,
    ? [X13: $i > $o] :
      ( ~ ( X13 @ ( esk1_0 @ X13 ) )
      & ( ( esk1_0
          @ ^ [Z0: $i] :
            ? [X14: $i > $o] :
              ( ~ ( X14 @ ( esk1_0 @ X14 ) )
              & ( Z0
                = ( esk1_0 @ X14 ) ) ) )
        = ( esk1_0 @ X13 ) ) ),
    inference(er,[status(thm)],[c_0_4]) ).

thf(c_0_6,negated_conjecture,
    ( ( esk1_0
      @ ^ [Z0: $i] :
        ? [X15: $i > $o] :
          ( ~ ( X15 @ ( esk1_0 @ X15 ) )
          & ( Z0
            = ( esk1_0 @ X15 ) ) ) )
    = ( esk1_0 @ epred1_0 ) ),
    inference(dynamic_cnf,[status(thm)],[c_0_5]) ).

thf(c_0_7,negated_conjecture,
    ~ ( epred1_0 @ ( esk1_0 @ epred1_0 ) ),
    inference(dynamic_cnf,[status(thm)],[c_0_5]) ).

thf(c_0_8,negated_conjecture,
    ! [X2: $i > $o] :
      ( ( X2 @ ( esk1_0 @ X2 ) )
      | ( ( esk1_0 @ epred1_0 )
       != ( esk1_0 @ X2 ) ) ),
    inference(rw,[status(thm)],[c_0_4,c_0_6]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEV175^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.08/0.18  % Computer : n014.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:18:14 UTC 2026
% 0.08/0.18  % CPUTime  : 
% 0.08/0.18  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.23  Running higher-order theorem proving
% 0.08/0.24  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.kkP07WnxrG/E---3.1_2792726.p
% 0.08/0.26  % Version: 3.5.1-ho
% 0.08/0.26  % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.08/0.26  % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.26  % Starting sh2lt with 1200s (4) cores
% 0.08/0.26  % Starting new_ho_10_unif with 300s (1) cores
% 0.08/0.26  % Starting full_lambda_6 with 300s (1) cores
% 0.08/0.26  % Starting post_as_ho1 with 300s (1) cores
% 0.08/0.26  % Starting ehoh_best3_rw with 300s (1) cores
% 0.08/0.26  % new_ho_10_unif with pid 2792756 completed with status 0
% 0.08/0.26  % Result found by new_ho_10_unif
% 0.08/0.26  % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.08/0.26  % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.26  % Starting sh2lt with 1200s (4) cores
% 0.08/0.26  % Starting new_ho_10_unif with 300s (1) cores
% 0.08/0.26  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.26  % No SInE strategy applied
% 0.08/0.26  % Search class: HHUSF-FFSF00-DHHFFMBN
% 0.08/0.26  % partial match(3): HGUNF-FFSF00-SHHFFMBN
% 0.08/0.26  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.26  % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.26  % SubtermCWHack with pid 2792760 completed with status 0
% 0.08/0.26  % Result found by SubtermCWHack
% 0.08/0.26  % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.08/0.26  % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.26  % Starting sh2lt with 1200s (4) cores
% 0.08/0.26  % Starting new_ho_10_unif with 300s (1) cores
% 0.08/0.26  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.26  % No SInE strategy applied
% 0.08/0.26  % Search class: HHUSF-FFSF00-DHHFFMBN
% 0.08/0.26  % partial match(3): HGUNF-FFSF00-SHHFFMBN
% 0.08/0.26  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.26  % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.26  % Preprocessing time       : 0.001 s
% 0.08/0.26  
% 0.08/0.26  % Proof found!
% 0.08/0.26  % SZS status Theorem
% 0.08/0.26  % SZS output start CNFRefutation
% See solution above
% 0.08/0.26  % Parsed axioms                        : 1
% 0.08/0.26  % Removed by relevancy pruning/SinE    : 0
% 0.08/0.26  % Initial clauses                      : 1
% 0.08/0.26  % Removed in clause preprocessing      : 0
% 0.08/0.26  % Initial clauses in saturation        : 1
% 0.08/0.26  % Processed clauses                    : 5
% 0.08/0.26  % ...of these trivial                  : 0
% 0.08/0.26  % ...subsumed                          : 0
% 0.08/0.26  % ...remaining for further processing  : 5
% 0.08/0.26  % Other redundant clauses eliminated   : 0
% 0.08/0.26  % Clauses deleted for lack of memory   : 0
% 0.08/0.26  % Backward-subsumed                    : 0
% 0.08/0.26  % Backward-rewritten                   : 1
% 0.08/0.26  % Generated clauses                    : 5
% 0.08/0.26  % ...of the previous two non-redundant : 4
% 0.08/0.26  % ...aggressively subsumed             : 0
% 0.08/0.26  % Contextual simplify-reflections      : 0
% 0.08/0.26  % Paramodulations                      : 2
% 0.08/0.26  % Factorizations                       : 0
% 0.08/0.26  % NegExts                              : 0
% 0.08/0.26  % Equation resolutions                 : 1
% 0.08/0.26  % Disequality decompositions           : 0
% 0.08/0.26  % Total rewrite steps                  : 1
% 0.08/0.26  % ...of those cached                   : 0
% 0.08/0.26  % Propositional unsat checks           : 0
% 0.08/0.26  %    Propositional check models        : 0
% 0.08/0.26  %    Propositional check unsatisfiable : 0
% 0.08/0.26  %    Propositional clauses             : 0
% 0.08/0.26  %    Propositional clauses after purity: 0
% 0.08/0.26  %    Propositional unsat core size     : 0
% 0.08/0.26  %    Propositional preprocessing time  : 0.000
% 0.08/0.26  %    Propositional encoding time       : 0.000
% 0.08/0.26  %    Propositional solver time         : 0.000
% 0.08/0.26  %    Success case prop preproc time    : 0.000
% 0.08/0.26  %    Success case prop encoding time   : 0.000
% 0.08/0.26  %    Success case prop solver time     : 0.000
% 0.08/0.26  % Current number of processed clauses  : 3
% 0.08/0.26  %    Positive orientable unit clauses  : 1
% 0.08/0.26  %    Positive unorientable unit clauses: 0
% 0.08/0.26  %    Negative unit clauses             : 1
% 0.08/0.26  %    Non-unit-clauses                  : 1
% 0.08/0.26  % Current number of unprocessed clauses: 0
% 0.08/0.26  % ...number of literals in the above   : 0
% 0.08/0.26  % Current number of archived formulas  : 0
% 0.08/0.26  % Current number of archived clauses   : 2
% 0.08/0.26  % Clause-clause subsumption calls (NU) : 0
% 0.08/0.26  % Rec. Clause-clause subsumption calls : 0
% 0.08/0.26  % Non-unit clause-clause subsumptions  : 0
% 0.08/0.26  % Unit Clause-clause subsumption calls : 0
% 0.08/0.26  % Rewrite failures with RHS unbound    : 0
% 0.08/0.26  % BW rewrite match attempts            : 1
% 0.08/0.26  % BW rewrite match successes           : 1
% 0.08/0.26  % Condensation attempts                : 0
% 0.08/0.26  % Condensation successes               : 0
% 0.08/0.26  % Termbank termtop insertions          : 862
% 0.08/0.26  % Search garbage collected termcells   : 63
% 0.08/0.26  
% 0.08/0.26  % -------------------------------------------------
% 0.08/0.26  % User time                : 0.002 s
% 0.08/0.26  % System time              : 0.002 s
% 0.08/0.26  % Total time               : 0.004 s
% 0.08/0.26  % Maximum resident set size: 3632 pages
% 0.08/0.26  
% 0.08/0.26  % -------------------------------------------------
% 0.08/0.26  % User time                : 0.004 s
% 0.08/0.26  % System time              : 0.006 s
% 0.08/0.26  % Total time               : 0.010 s
% 0.08/0.26  % Maximum resident set size: 4864 pages
% 0.08/0.26  % E exiting
%------------------------------------------------------------------------------