↑ 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  : SEU494^1 : TPTP v9.3.1. Released v3.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n013.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:26:18 AM UTC 2026

% Result   : Theorem 0.08s 0.28s
% Output   : CNFRefutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   28 (  14 unt;   0 typ;   0 def)
%            Number of atoms       :   70 (   9 equ;   0 cnn)
%            Maximal formula atoms :   17 (   2 avg)
%            Number of connectives :  235 (  23   ~;  21   |;  18   &; 158   @)
%                                         (   0 <=>;  15  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   18 (   4 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   24 (  24   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   12 (  10 usr;   6 con; 0-3 aty)
%            Number of variables   :   58 (  13   ^;  45   !;   0   ?;  58   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_24,type,
    inv: ( $i > $i > $o ) > $i > $i > $o ).

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

thf(decl_35,type,
    trans: ( $i > $i > $o ) > $o ).

thf(decl_40,type,
    so: ( $i > $i > $o ) > $o ).

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

thf(decl_53,type,
    esk1_0: $i ).

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

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

thf(decl_56,type,
    esk4_0: $i ).

thf(decl_57,type,
    esk5_0: $i ).

thf(strict_order,axiom,
    ( so
    = ( ^ [X1: $i > $i > $o] :
          ( ( asymm @ X1 )
          & ( trans @ X1 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.hsCH8iA3vy/E---3.1_2134893.p',strict_order) ).

thf(asymmetric,axiom,
    ( asymm
    = ( ^ [X1: $i > $i > $o] :
        ! [X3: $i,X4: $i] :
          ( ( X1 @ X3 @ X4 )
         => ~ ( X1 @ X4 @ X3 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.hsCH8iA3vy/E---3.1_2134893.p',asymmetric) ).

thf(transitive,axiom,
    ( trans
    = ( ^ [X1: $i > $i > $o] :
        ! [X3: $i,X4: $i,X6: $i] :
          ( ( ( X1 @ X3 @ X4 )
            & ( X1 @ X4 @ X6 ) )
         => ( X1 @ X3 @ X6 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.hsCH8iA3vy/E---3.1_2134893.p',transitive) ).

thf(inverse_of_strict_order_is_strict_order,conjecture,
    ! [X1: $i > $i > $o] :
      ( ( so @ X1 )
     => ( so @ ( inv @ X1 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.hsCH8iA3vy/E---3.1_2134893.p',inverse_of_strict_order_is_strict_order) ).

thf(inverse,axiom,
    ( inv
    = ( ^ [X1: $i > $i > $o,X3: $i,X4: $i] : ( X1 @ X4 @ X3 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.hsCH8iA3vy/E---3.1_2134893.p',inverse) ).

thf(c_0_5,plain,
    ( so
    = ( ^ [Z0: $i > $i > $o] :
          ( ! [X39: $i,X40: $i] :
              ( ( Z0 @ X39 @ X40 )
             => ~ ( Z0 @ X40 @ X39 ) )
          & ! [X41: $i,X42: $i,X43: $i] :
              ( ( ( Z0 @ X41 @ X42 )
                & ( Z0 @ X42 @ X43 ) )
             => ( Z0 @ X41 @ X43 ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[strict_order]) ).

thf(c_0_6,plain,
    ( asymm
    = ( ^ [Z0: $i > $i > $o] :
        ! [X3: $i,X4: $i] :
          ( ( Z0 @ X3 @ X4 )
         => ~ ( Z0 @ X4 @ X3 ) ) ) ),
    inference(fof_simplification,[status(thm)],[asymmetric]) ).

thf(c_0_7,plain,
    ( trans
    = ( ^ [Z0: $i > $i > $o] :
        ! [X3: $i,X4: $i,X6: $i] :
          ( ( ( Z0 @ X3 @ X4 )
            & ( Z0 @ X4 @ X6 ) )
         => ( Z0 @ X3 @ X6 ) ) ) ),
    inference(fof_simplification,[status(thm)],[transitive]) ).

thf(c_0_8,negated_conjecture,
    ~ ! [X1: $i > $i > $o] :
        ( ( so @ X1 )
       => ( so @ ( inv @ X1 ) ) ),
    inference(assume_negation,[status(cth)],[inverse_of_strict_order_is_strict_order]) ).

thf(c_0_9,plain,
    ( inv
    = ( ^ [Z0: $i > $i > $o,Z1: $i,Z2: $i] : ( Z0 @ Z2 @ Z1 ) ) ),
    inference(fof_simplification,[status(thm)],[inverse]) ).

thf(c_0_10,plain,
    ( so
    = ( ^ [Z0: $i > $i > $o] :
          ( ! [X39: $i,X40: $i] :
              ( ( Z0 @ X39 @ X40 )
             => ~ ( Z0 @ X40 @ X39 ) )
          & ! [X41: $i,X42: $i,X43: $i] :
              ( ( ( Z0 @ X41 @ X42 )
                & ( Z0 @ X42 @ X43 ) )
             => ( Z0 @ X41 @ X43 ) ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_5,c_0_6]),c_0_7]) ).

thf(c_0_11,negated_conjecture,
    ~ ! [X1: $i > $i > $o] :
        ( ( ! [X158: $i,X159: $i] :
              ( ( X1 @ X158 @ X159 )
             => ~ ( X1 @ X159 @ X158 ) )
          & ! [X160: $i,X161: $i,X162: $i] :
              ( ( ( X1 @ X160 @ X161 )
                & ( X1 @ X161 @ X162 ) )
             => ( X1 @ X160 @ X162 ) ) )
       => ( ! [X163: $i,X164: $i] :
              ( ( X1 @ X164 @ X163 )
             => ~ ( X1 @ X163 @ X164 ) )
          & ! [X165: $i,X166: $i,X167: $i] :
              ( ( ( X1 @ X166 @ X165 )
                & ( X1 @ X167 @ X166 ) )
             => ( X1 @ X167 @ X165 ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).

thf(c_0_12,negated_conjecture,
    ! [X169: $i,X170: $i,X171: $i,X172: $i,X173: $i] :
      ( ( ~ ( epred1_0 @ X169 @ X170 )
        | ~ ( epred1_0 @ X170 @ X169 ) )
      & ( ~ ( epred1_0 @ X171 @ X172 )
        | ~ ( epred1_0 @ X172 @ X173 )
        | ( epred1_0 @ X171 @ X173 ) )
      & ( ( epred1_0 @ esk4_0 @ esk3_0 )
        | ( epred1_0 @ esk2_0 @ esk1_0 ) )
      & ( ( epred1_0 @ esk5_0 @ esk4_0 )
        | ( epred1_0 @ esk2_0 @ esk1_0 ) )
      & ( ~ ( epred1_0 @ esk5_0 @ esk3_0 )
        | ( epred1_0 @ esk2_0 @ esk1_0 ) )
      & ( ( epred1_0 @ esk4_0 @ esk3_0 )
        | ( epred1_0 @ esk1_0 @ esk2_0 ) )
      & ( ( epred1_0 @ esk5_0 @ esk4_0 )
        | ( epred1_0 @ esk1_0 @ esk2_0 ) )
      & ( ~ ( epred1_0 @ esk5_0 @ esk3_0 )
        | ( epred1_0 @ 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_11])])])])])]) ).

thf(c_0_13,negated_conjecture,
    ! [X3: $i,X4: $i,X6: $i] :
      ( ( epred1_0 @ X3 @ X6 )
      | ~ ( epred1_0 @ X3 @ X4 )
      | ~ ( epred1_0 @ X4 @ X6 ) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

thf(c_0_14,negated_conjecture,
    ( ( epred1_0 @ esk4_0 @ esk3_0 )
    | ( epred1_0 @ esk1_0 @ esk2_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

thf(c_0_15,negated_conjecture,
    ! [X3: $i] :
      ( ( epred1_0 @ esk1_0 @ esk2_0 )
      | ( epred1_0 @ X3 @ esk3_0 )
      | ~ ( epred1_0 @ X3 @ esk4_0 ) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

thf(c_0_16,negated_conjecture,
    ( ( epred1_0 @ esk5_0 @ esk4_0 )
    | ( epred1_0 @ esk1_0 @ esk2_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

thf(c_0_17,negated_conjecture,
    ( ( epred1_0 @ esk1_0 @ esk2_0 )
    | ~ ( epred1_0 @ esk5_0 @ esk3_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

thf(c_0_18,negated_conjecture,
    ! [X4: $i,X3: $i] :
      ( ~ ( epred1_0 @ X3 @ X4 )
      | ~ ( epred1_0 @ X4 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

thf(c_0_19,negated_conjecture,
    epred1_0 @ esk1_0 @ esk2_0,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).

thf(c_0_20,negated_conjecture,
    ( ( epred1_0 @ esk4_0 @ esk3_0 )
    | ( epred1_0 @ esk2_0 @ esk1_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

thf(c_0_21,negated_conjecture,
    ~ ( epred1_0 @ esk2_0 @ esk1_0 ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

thf(c_0_22,negated_conjecture,
    epred1_0 @ esk4_0 @ esk3_0,
    inference(sr,[status(thm)],[c_0_20,c_0_21]) ).

thf(c_0_23,negated_conjecture,
    ( ( epred1_0 @ esk5_0 @ esk4_0 )
    | ( epred1_0 @ esk2_0 @ esk1_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

thf(c_0_24,negated_conjecture,
    ( ( epred1_0 @ esk2_0 @ esk1_0 )
    | ~ ( epred1_0 @ esk5_0 @ esk3_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

thf(c_0_25,negated_conjecture,
    ! [X3: $i] :
      ( ( epred1_0 @ X3 @ esk3_0 )
      | ~ ( epred1_0 @ X3 @ esk4_0 ) ),
    inference(spm,[status(thm)],[c_0_13,c_0_22]) ).

thf(c_0_26,negated_conjecture,
    epred1_0 @ esk5_0 @ esk4_0,
    inference(sr,[status(thm)],[c_0_23,c_0_21]) ).

thf(c_0_27,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),c_0_21]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU494^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.19  % Computer : n013.cluster.edu
% 0.08/0.19  % Model    : x86_64 x86_64
% 0.08/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19  % Memory   : 8046.5625MB
% 0.08/0.19  % OS       : Linux 6.8.0-71-generic
% 0.08/0.19  % CPULimit : 300
% 0.08/0.19  % WCLimit  : 300
% 0.08/0.19  % DateTime : Tue Sep 29 13:45:21 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.24  Running higher-order theorem proving
% 0.08/0.25  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.hsCH8iA3vy/E---3.1_2134893.p
% 0.08/0.28  % Version: 3.5.1-ho
% 0.08/0.28  % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.08/0.28  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.28  % Starting new_ho_9 with 1500s (5) cores
% 0.08/0.28  % Starting post_as_ho1 with 300s (1) cores
% 0.08/0.28  % Starting sh1l with 300s (1) cores
% 0.08/0.28  % Starting post_as_ho10 with 300s (1) cores
% 0.08/0.28  % post_as_ho1 with pid 2134907 completed with status 0
% 0.08/0.28  % Result found by post_as_ho1
% 0.08/0.28  % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.08/0.28  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.28  % Starting new_ho_9 with 1500s (5) cores
% 0.08/0.28  % Starting post_as_ho1 with 300s (1) cores
% 0.08/0.28  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.28  % No SInE strategy applied
% 0.08/0.28  % Search class: HGHNF-FFSS00-SHSSMFNN
% 0.08/0.28  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.28  % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.28  % SubtermCWHack with pid 2134911 completed with status 0
% 0.08/0.28  % Result found by SubtermCWHack
% 0.08/0.28  % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.08/0.28  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.28  % Starting new_ho_9 with 1500s (5) cores
% 0.08/0.28  % Starting post_as_ho1 with 300s (1) cores
% 0.08/0.28  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.28  % No SInE strategy applied
% 0.08/0.28  % Search class: HGHNF-FFSS00-SHSSMFNN
% 0.08/0.28  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.28  % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.28  % Preprocessing time       : 0.001 s
% 0.08/0.28  
% 0.08/0.28  % Proof found!
% 0.08/0.28  % SZS status Theorem
% 0.08/0.28  % SZS output start CNFRefutation
% See solution above
% 0.08/0.28  % Parsed axioms                        : 59
% 0.08/0.28  % Removed by relevancy pruning/SinE    : 0
% 0.08/0.28  % Initial clauses                      : 37
% 0.08/0.28  % Removed in clause preprocessing      : 29
% 0.08/0.28  % Initial clauses in saturation        : 8
% 0.08/0.28  % Processed clauses                    : 23
% 0.08/0.28  % ...of these trivial                  : 0
% 0.08/0.28  % ...subsumed                          : 0
% 0.08/0.28  % ...remaining for further processing  : 23
% 0.08/0.28  % Other redundant clauses eliminated   : 0
% 0.08/0.28  % Clauses deleted for lack of memory   : 0
% 0.08/0.28  % Backward-subsumed                    : 2
% 0.08/0.28  % Backward-rewritten                   : 7
% 0.08/0.28  % Generated clauses                    : 21
% 0.08/0.28  % ...of the previous two non-redundant : 18
% 0.08/0.28  % ...aggressively subsumed             : 0
% 0.08/0.28  % Contextual simplify-reflections      : 1
% 0.08/0.28  % Paramodulations                      : 19
% 0.08/0.28  % Factorizations                       : 0
% 0.08/0.28  % NegExts                              : 0
% 0.08/0.28  % Equation resolutions                 : 0
% 0.08/0.28  % Disequality decompositions           : 0
% 0.08/0.28  % Total rewrite steps                  : 8
% 0.08/0.28  % ...of those cached                   : 6
% 0.08/0.28  % Propositional unsat checks           : 0
% 0.08/0.28  %    Propositional check models        : 0
% 0.08/0.28  %    Propositional check unsatisfiable : 0
% 0.08/0.28  %    Propositional clauses             : 0
% 0.08/0.28  %    Propositional clauses after purity: 0
% 0.08/0.28  %    Propositional unsat core size     : 0
% 0.08/0.28  %    Propositional preprocessing time  : 0.000
% 0.08/0.28  %    Propositional encoding time       : 0.000
% 0.08/0.28  %    Propositional solver time         : 0.000
% 0.08/0.28  %    Success case prop preproc time    : 0.000
% 0.08/0.28  %    Success case prop encoding time   : 0.000
% 0.08/0.28  %    Success case prop solver time     : 0.000
% 0.08/0.28  % Current number of processed clauses  : 12
% 0.08/0.28  %    Positive orientable unit clauses  : 3
% 0.08/0.28  %    Positive unorientable unit clauses: 0
% 0.08/0.28  %    Negative unit clauses             : 3
% 0.08/0.28  %    Non-unit-clauses                  : 6
% 0.08/0.28  % Current number of unprocessed clauses: 1
% 0.08/0.28  % ...number of literals in the above   : 2
% 0.08/0.28  % Current number of archived formulas  : 0
% 0.08/0.28  % Current number of archived clauses   : 11
% 0.08/0.28  % Clause-clause subsumption calls (NU) : 72
% 0.08/0.28  % Rec. Clause-clause subsumption calls : 66
% 0.08/0.28  % Non-unit clause-clause subsumptions  : 1
% 0.08/0.28  % Unit Clause-clause subsumption calls : 17
% 0.08/0.28  % Rewrite failures with RHS unbound    : 0
% 0.08/0.28  % BW rewrite match attempts            : 1
% 0.08/0.28  % BW rewrite match successes           : 1
% 0.08/0.28  % Condensation attempts                : 0
% 0.08/0.28  % Condensation successes               : 0
% 0.08/0.28  % Termbank termtop insertions          : 3598
% 0.08/0.28  % Search garbage collected termcells   : 912
% 0.08/0.28  
% 0.08/0.28  % -------------------------------------------------
% 0.08/0.28  % User time                : 0.007 s
% 0.08/0.28  % System time              : 0.002 s
% 0.08/0.28  % Total time               : 0.009 s
% 0.08/0.28  % Maximum resident set size: 3944 pages
% 0.08/0.28  
% 0.08/0.28  % -------------------------------------------------
% 0.08/0.28  % User time                : 0.009 s
% 0.08/0.28  % System time              : 0.007 s
% 0.08/0.28  % Total time               : 0.016 s
% 0.08/0.28  % Maximum resident set size: 4864 pages
% 0.08/0.28  % E exiting
%------------------------------------------------------------------------------