↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n019.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:24:32 AM UTC 2026

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

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

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

thf(decl_25,type,
    notsubsetI: $o ).

thf(decl_26,type,
    notequalI1: $o ).

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

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

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

thf(notequalI2,conjecture,
    ( notsubsetI
   => ( notequalI1
     => ! [X1: $i,X2: $i,X3: $i] :
          ( ( in @ X3 @ X1 )
         => ( ~ ( in @ X3 @ X2 )
           => ( X1 != X2 ) ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.aswCeia4rI/E---3.1_801034.p',notequalI2) ).

thf(notequalI1,axiom,
    ( notequalI1
  <=> ! [X1: $i,X2: $i] :
        ( ~ ( subset @ X1 @ X2 )
       => ( X1 != X2 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.aswCeia4rI/E---3.1_801034.p',notequalI1) ).

thf(notsubsetI,axiom,
    ( notsubsetI
  <=> ! [X1: $i,X2: $i,X3: $i] :
        ( ( in @ X3 @ X1 )
       => ( ~ ( in @ X3 @ X2 )
         => ~ ( subset @ X1 @ X2 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.aswCeia4rI/E---3.1_801034.p',notsubsetI) ).

thf(c_0_3,negated_conjecture,
    ~ ( notsubsetI
     => ( notequalI1
       => ! [X1: $i,X2: $i,X3: $i] :
            ( ( in @ X3 @ X1 )
           => ( ~ ( in @ X3 @ X2 )
             => ( X1 != X2 ) ) ) ) ),
    inference(assume_negation,[status(cth)],[notequalI2]) ).

thf(c_0_4,negated_conjecture,
    ~ ( ! [X12: $i,X13: $i,X14: $i] :
          ( ( in @ X14 @ X12 )
         => ( ~ ( in @ X14 @ X13 )
           => ~ ( subset @ X12 @ X13 ) ) )
     => ( ! [X15: $i,X16: $i] :
            ( ~ ( subset @ X15 @ X16 )
           => ( X15 != X16 ) )
       => ! [X1: $i,X2: $i,X3: $i] :
            ( ( in @ X3 @ X1 )
           => ( ~ ( in @ X3 @ X2 )
             => ( X1 != X2 ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_3,notequalI1]),notsubsetI])]) ).

thf(c_0_5,negated_conjecture,
    ! [X17: $i,X18: $i,X19: $i,X20: $i,X21: $i] :
      ( ( ~ ( in @ X19 @ X17 )
        | ( in @ X19 @ X18 )
        | ~ ( subset @ X17 @ X18 ) )
      & ( ( subset @ X20 @ X21 )
        | ( X20 != X21 ) )
      & ( in @ esk3_0 @ esk1_0 )
      & ~ ( in @ esk3_0 @ esk2_0 )
      & ( esk1_0 = esk2_0 ) ),
    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_4])])])])]) ).

thf(c_0_6,negated_conjecture,
    ~ ( in @ esk3_0 @ esk2_0 ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_7,negated_conjecture,
    esk1_0 = esk2_0,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_8,negated_conjecture,
    in @ esk3_0 @ esk1_0,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU568^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.17  % Computer : n019.cluster.edu
% 0.10/0.17  % Model    : x86_64 x86_64
% 0.10/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.17  % Memory   : 8046.5625MB
% 0.10/0.17  % OS       : Linux 6.8.0-71-generic
% 0.10/0.17  % CPULimit : 300
% 0.10/0.17  % WCLimit  : 300
% 0.10/0.17  % DateTime : Tue Sep 29 13:51:03 UTC 2026
% 0.10/0.18  % CPUTime  : 
% 0.10/0.18  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.22  Running higher-order theorem proving
% 0.10/0.23  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.aswCeia4rI/E---3.1_801034.p
% 0.10/0.25  % Version: 3.5.1-ho
% 0.10/0.25  % Preprocessing class: HSSSSLSSSLSNFFN.
% 0.10/0.25  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.25  % Starting lpo6_lambda_fix with 1500s (5) cores
% 0.10/0.25  % Starting post_as_ho8 with 300s (1) cores
% 0.10/0.25  % Starting post_as_ho3 with 300s (1) cores
% 0.10/0.25  % Starting post_as_ho2 with 300s (1) cores
% 0.10/0.25  % post_as_ho8 with pid 801068 completed with status 0
% 0.10/0.25  % Result found by post_as_ho8
% 0.10/0.25  % Preprocessing class: HSSSSLSSSLSNFFN.
% 0.10/0.25  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.25  % Starting lpo6_lambda_fix with 1500s (5) cores
% 0.10/0.25  % Starting post_as_ho8 with 300s (1) cores
% 0.10/0.25  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true))
% 0.10/0.25  % SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.10/0.25  % Search class: HHUSF-FFSF00-SFFFMFNN
% 0.10/0.25  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.25  % Starting SubtermCWHack with 28s (1) cores
% 0.10/0.25  % SubtermCWHack with pid 801071 completed with status 0
% 0.10/0.25  % Result found by SubtermCWHack
% 0.10/0.25  % Preprocessing class: HSSSSLSSSLSNFFN.
% 0.10/0.25  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.25  % Starting lpo6_lambda_fix with 1500s (5) cores
% 0.10/0.25  % Starting post_as_ho8 with 300s (1) cores
% 0.10/0.25  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true))
% 0.10/0.25  % SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.10/0.25  % Search class: HHUSF-FFSF00-SFFFMFNN
% 0.10/0.25  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.25  % Starting SubtermCWHack with 28s (1) cores
% 0.10/0.25  % Preprocessing time       : 0.001 s
% 0.10/0.25  
% 0.10/0.25  % Proof found!
% 0.10/0.25  % SZS status Theorem
% 0.10/0.25  % SZS output start CNFRefutation
% See solution above
% 0.10/0.25  % Parsed axioms                        : 7
% 0.10/0.25  % Removed by relevancy pruning/SinE    : 4
% 0.10/0.25  % Initial clauses                      : 5
% 0.10/0.25  % Removed in clause preprocessing      : 0
% 0.10/0.25  % Initial clauses in saturation        : 5
% 0.10/0.25  % Processed clauses                    : 3
% 0.10/0.25  % ...of these trivial                  : 0
% 0.10/0.25  % ...subsumed                          : 0
% 0.10/0.25  % ...remaining for further processing  : 2
% 0.10/0.25  % Other redundant clauses eliminated   : 0
% 0.10/0.25  % Clauses deleted for lack of memory   : 0
% 0.10/0.25  % Backward-subsumed                    : 0
% 0.10/0.25  % Backward-rewritten                   : 0
% 0.10/0.25  % Generated clauses                    : 0
% 0.10/0.25  % ...of the previous two non-redundant : 0
% 0.10/0.25  % ...aggressively subsumed             : 0
% 0.10/0.25  % Contextual simplify-reflections      : 0
% 0.10/0.25  % Paramodulations                      : 0
% 0.10/0.25  % Factorizations                       : 0
% 0.10/0.25  % NegExts                              : 0
% 0.10/0.25  % Equation resolutions                 : 0
% 0.10/0.25  % Disequality decompositions           : 0
% 0.10/0.25  % Total rewrite steps                  : 2
% 0.10/0.25  % ...of those cached                   : 0
% 0.10/0.25  % Propositional unsat checks           : 0
% 0.10/0.25  %    Propositional check models        : 0
% 0.10/0.25  %    Propositional check unsatisfiable : 0
% 0.10/0.25  %    Propositional clauses             : 0
% 0.10/0.25  %    Propositional clauses after purity: 0
% 0.10/0.25  %    Propositional unsat core size     : 0
% 0.10/0.25  %    Propositional preprocessing time  : 0.000
% 0.10/0.25  %    Propositional encoding time       : 0.000
% 0.10/0.25  %    Propositional solver time         : 0.000
% 0.10/0.25  %    Success case prop preproc time    : 0.000
% 0.10/0.25  %    Success case prop encoding time   : 0.000
% 0.10/0.25  %    Success case prop solver time     : 0.000
% 0.10/0.25  % Current number of processed clauses  : 2
% 0.10/0.25  %    Positive orientable unit clauses  : 2
% 0.10/0.25  %    Positive unorientable unit clauses: 0
% 0.10/0.25  %    Negative unit clauses             : 0
% 0.10/0.25  %    Non-unit-clauses                  : 0
% 0.10/0.25  % Current number of unprocessed clauses: 2
% 0.10/0.25  % ...number of literals in the above   : 5
% 0.10/0.25  % Current number of archived formulas  : 0
% 0.10/0.25  % Current number of archived clauses   : 0
% 0.10/0.25  % Clause-clause subsumption calls (NU) : 0
% 0.10/0.25  % Rec. Clause-clause subsumption calls : 0
% 0.10/0.25  % Non-unit clause-clause subsumptions  : 0
% 0.10/0.25  % Unit Clause-clause subsumption calls : 0
% 0.10/0.25  % Rewrite failures with RHS unbound    : 0
% 0.10/0.25  % BW rewrite match attempts            : 0
% 0.10/0.25  % BW rewrite match successes           : 0
% 0.10/0.25  % Condensation attempts                : 0
% 0.10/0.25  % Condensation successes               : 0
% 0.10/0.25  % Termbank termtop insertions          : 506
% 0.10/0.25  % Search garbage collected termcells   : 221
% 0.10/0.25  
% 0.10/0.25  % -------------------------------------------------
% 0.10/0.25  % User time                : 0.004 s
% 0.10/0.25  % System time              : 0.000 s
% 0.10/0.25  % Total time               : 0.004 s
% 0.10/0.25  % Maximum resident set size: 3576 pages
% 0.10/0.25  
% 0.10/0.25  % -------------------------------------------------
% 0.10/0.25  % User time                : 0.004 s
% 0.10/0.25  % System time              : 0.006 s
% 0.10/0.25  % Total time               : 0.009 s
% 0.10/0.25  % Maximum resident set size: 4864 pages
% 0.10/0.25  % E exiting
%------------------------------------------------------------------------------