TSTP Solution File: SEU718^2 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : SEU718^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n024.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue May 21 03:29:28 EDT 2024

% Result   : Theorem 0.21s 0.49s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   22 (   4 unt;   9 typ;   0 def)
%            Number of atoms       :   51 (   0 equ;   0 cnn)
%            Maximal formula atoms :   11 (   3 avg)
%            Number of connectives :  157 (  12   ~;   9   |;   7   &; 107   @)
%                                         (   2 <=>;  20  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   8 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    5 (   5   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   9 usr;   7 con; 0-2 aty)
%            Number of variables   :   32 (   0   ^  32   !;   0   ?;  32   :)

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

thf(decl_23,type,
    powerset: $i > $i ).

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

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

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

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

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

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

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

thf(powersetTE1,conjecture,
    ( subsetE
   => ( powersetE1
     => ! [X1: $i,X4: $i] :
          ( ( in @ X4 @ ( powerset @ X1 ) )
         => ! [X5: $i] :
              ( ( in @ X5 @ ( powerset @ X1 ) )
             => ! [X3: $i] :
                  ( ( in @ X3 @ X1 )
                 => ( ( in @ X4 @ ( powerset @ X5 ) )
                   => ( ( in @ X3 @ X4 )
                     => ( in @ X3 @ X5 ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',powersetTE1) ).

thf(powersetE1,axiom,
    ( powersetE1
  <=> ! [X1: $i,X2: $i] :
        ( ( in @ X2 @ ( powerset @ X1 ) )
       => ( subset @ X2 @ X1 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',powersetE1) ).

thf(subsetE,axiom,
    ( subsetE
  <=> ! [X1: $i,X2: $i,X3: $i] :
        ( ( subset @ X1 @ X2 )
       => ( ( in @ X3 @ X1 )
         => ( in @ X3 @ X2 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',subsetE) ).

thf(c_0_3,negated_conjecture,
    ~ ( ! [X15: $i,X16: $i,X17: $i] :
          ( ( subset @ X15 @ X16 )
         => ( ( in @ X17 @ X15 )
           => ( in @ X17 @ X16 ) ) )
     => ( ! [X18: $i,X19: $i] :
            ( ( in @ X19 @ ( powerset @ X18 ) )
           => ( subset @ X19 @ X18 ) )
       => ! [X1: $i,X4: $i] :
            ( ( in @ X4 @ ( powerset @ X1 ) )
           => ! [X5: $i] :
                ( ( in @ X5 @ ( powerset @ X1 ) )
               => ! [X3: $i] :
                    ( ( in @ X3 @ X1 )
                   => ( ( in @ X4 @ ( powerset @ X5 ) )
                     => ( ( in @ X3 @ X4 )
                       => ( in @ X3 @ X5 ) ) ) ) ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[powersetTE1]),powersetE1]),subsetE]) ).

thf(c_0_4,negated_conjecture,
    ! [X20: $i,X21: $i,X22: $i,X23: $i,X24: $i] :
      ( ( ~ ( subset @ X20 @ X21 )
        | ~ ( in @ X22 @ X20 )
        | ( in @ X22 @ X21 ) )
      & ( ~ ( in @ X24 @ ( powerset @ X23 ) )
        | ( subset @ X24 @ X23 ) )
      & ( in @ esk2_0 @ ( powerset @ esk1_0 ) )
      & ( in @ esk3_0 @ ( powerset @ esk1_0 ) )
      & ( in @ esk4_0 @ esk1_0 )
      & ( in @ esk2_0 @ ( powerset @ esk3_0 ) )
      & ( in @ esk4_0 @ esk2_0 )
      & ~ ( in @ esk4_0 @ esk3_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_3])])])])]) ).

thf(c_0_5,negated_conjecture,
    ! [X3: $i,X2: $i,X1: $i] :
      ( ( in @ X3 @ X2 )
      | ~ ( subset @ X1 @ X2 )
      | ~ ( in @ X3 @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

thf(c_0_6,negated_conjecture,
    ! [X1: $i,X2: $i] :
      ( ( subset @ X1 @ X2 )
      | ~ ( in @ X1 @ ( powerset @ X2 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

thf(c_0_7,negated_conjecture,
    ! [X1: $i,X2: $i,X3: $i] :
      ( ( in @ X1 @ X2 )
      | ~ ( in @ X3 @ ( powerset @ X2 ) )
      | ~ ( in @ X1 @ X3 ) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

thf(c_0_8,negated_conjecture,
    in @ esk2_0 @ ( powerset @ esk3_0 ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

thf(c_0_9,negated_conjecture,
    ~ ( in @ esk4_0 @ esk3_0 ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

thf(c_0_10,negated_conjecture,
    ! [X1: $i] :
      ( ( in @ X1 @ esk3_0 )
      | ~ ( in @ X1 @ esk2_0 ) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

thf(c_0_11,negated_conjecture,
    in @ esk4_0 @ esk2_0,
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SEU718^2 : TPTP v8.2.0. Released v3.7.0.
% 0.11/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n024.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sun May 19 15:52:53 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.21/0.48  Running higher-order theorem proving
% 0.21/0.48  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/benchmark/theBenchmark.p
% 0.21/0.49  # Version: 3.1.0-ho
% 0.21/0.49  # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.21/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49  # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.21/0.49  # Starting post_as_ho8 with 300s (1) cores
% 0.21/0.49  # Starting post_as_ho3 with 300s (1) cores
% 0.21/0.49  # Starting post_as_ho2 with 300s (1) cores
% 0.21/0.49  # post_as_ho8 with pid 24175 completed with status 0
% 0.21/0.49  # Result found by post_as_ho8
% 0.21/0.49  # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.21/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49  # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.21/0.49  # Starting post_as_ho8 with 300s (1) cores
% 0.21/0.49  # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.21/0.49  # Search class: HHUNF-FFSS11-SFFFMFNN
% 0.21/0.49  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49  # Starting new_ho_10 with 163s (1) cores
% 0.21/0.49  # new_ho_10 with pid 24178 completed with status 0
% 0.21/0.49  # Result found by new_ho_10
% 0.21/0.49  # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.21/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49  # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.21/0.49  # Starting post_as_ho8 with 300s (1) cores
% 0.21/0.49  # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.21/0.49  # Search class: HHUNF-FFSS11-SFFFMFNN
% 0.21/0.49  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49  # Starting new_ho_10 with 163s (1) cores
% 0.21/0.49  # Preprocessing time       : 0.001 s
% 0.21/0.49  # Presaturation interreduction done
% 0.21/0.49  
% 0.21/0.49  # Proof found!
% 0.21/0.49  # SZS status Theorem
% 0.21/0.49  # SZS output start CNFRefutation
% See solution above
% 0.21/0.49  # Parsed axioms                        : 8
% 0.21/0.49  # Removed by relevancy pruning/SinE    : 5
% 0.21/0.49  # Initial clauses                      : 8
% 0.21/0.49  # Removed in clause preprocessing      : 0
% 0.21/0.49  # Initial clauses in saturation        : 8
% 0.21/0.49  # Processed clauses                    : 20
% 0.21/0.49  # ...of these trivial                  : 0
% 0.21/0.49  # ...subsumed                          : 0
% 0.21/0.49  # ...remaining for further processing  : 20
% 0.21/0.49  # Other redundant clauses eliminated   : 0
% 0.21/0.49  # Clauses deleted for lack of memory   : 0
% 0.21/0.49  # Backward-subsumed                    : 0
% 0.21/0.49  # Backward-rewritten                   : 0
% 0.21/0.49  # Generated clauses                    : 7
% 0.21/0.49  # ...of the previous two non-redundant : 4
% 0.21/0.49  # ...aggressively subsumed             : 0
% 0.21/0.49  # Contextual simplify-reflections      : 0
% 0.21/0.49  # Paramodulations                      : 7
% 0.21/0.49  # Factorizations                       : 0
% 0.21/0.49  # NegExts                              : 0
% 0.21/0.49  # Equation resolutions                 : 0
% 0.21/0.49  # Disequality decompositions           : 0
% 0.21/0.49  # Total rewrite steps                  : 2
% 0.21/0.49  # ...of those cached                   : 0
% 0.21/0.49  # Propositional unsat checks           : 0
% 0.21/0.49  #    Propositional check models        : 0
% 0.21/0.49  #    Propositional check unsatisfiable : 0
% 0.21/0.49  #    Propositional clauses             : 0
% 0.21/0.49  #    Propositional clauses after purity: 0
% 0.21/0.49  #    Propositional unsat core size     : 0
% 0.21/0.49  #    Propositional preprocessing time  : 0.000
% 0.21/0.49  #    Propositional encoding time       : 0.000
% 0.21/0.49  #    Propositional solver time         : 0.000
% 0.21/0.49  #    Success case prop preproc time    : 0.000
% 0.21/0.49  #    Success case prop encoding time   : 0.000
% 0.21/0.49  #    Success case prop solver time     : 0.000
% 0.21/0.49  # Current number of processed clauses  : 12
% 0.21/0.49  #    Positive orientable unit clauses  : 5
% 0.21/0.49  #    Positive unorientable unit clauses: 0
% 0.21/0.49  #    Negative unit clauses             : 1
% 0.21/0.49  #    Non-unit-clauses                  : 6
% 0.21/0.49  # Current number of unprocessed clauses: 0
% 0.21/0.49  # ...number of literals in the above   : 0
% 0.21/0.49  # Current number of archived formulas  : 0
% 0.21/0.49  # Current number of archived clauses   : 8
% 0.21/0.49  # Clause-clause subsumption calls (NU) : 2
% 0.21/0.49  # Rec. Clause-clause subsumption calls : 2
% 0.21/0.49  # Non-unit clause-clause subsumptions  : 0
% 0.21/0.49  # Unit Clause-clause subsumption calls : 0
% 0.21/0.49  # Rewrite failures with RHS unbound    : 0
% 0.21/0.49  # BW rewrite match attempts            : 0
% 0.21/0.49  # BW rewrite match successes           : 0
% 0.21/0.49  # Condensation attempts                : 20
% 0.21/0.49  # Condensation successes               : 0
% 0.21/0.49  # Termbank termtop insertions          : 759
% 0.21/0.49  # Search garbage collected termcells   : 248
% 0.21/0.49  
% 0.21/0.49  # -------------------------------------------------
% 0.21/0.49  # User time                : 0.003 s
% 0.21/0.49  # System time              : 0.002 s
% 0.21/0.49  # Total time               : 0.005 s
% 0.21/0.49  # Maximum resident set size: 1800 pages
% 0.21/0.49  
% 0.21/0.49  # -------------------------------------------------
% 0.21/0.49  # User time                : 0.005 s
% 0.21/0.49  # System time              : 0.003 s
% 0.21/0.49  # Total time               : 0.009 s
% 0.21/0.49  # Maximum resident set size: 1696 pages
% 0.21/0.49  % E---3.1 exiting
% 0.21/0.49  % E exiting
%------------------------------------------------------------------------------