TSTP Solution File: SET096^1 by E---3.1.00

View Problem - Process Solution

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

% Computer : n011.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 02:53:09 EDT 2024

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

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

thf(decl_26,type,
    singleton: $i > $i > $o ).

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

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

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

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

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

thf(emptyset,axiom,
    ( emptyset
    = ( ^ [X1: $i] : ~ $true ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET008^0.ax',emptyset) ).

thf(singleton,axiom,
    ( singleton
    = ( ^ [X1: $i,X4: $i] : ( X4 = X1 ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET008^0.ax',singleton) ).

thf(subset,axiom,
    ( subset
    = ( ^ [X16: $i > $o,X17: $i > $o] :
        ! [X4: $i] :
          ( ( X16 @ X4 )
         => ( X17 @ X4 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET008^0.ax',subset) ).

thf(thm,conjecture,
    ! [X22: $i > $o,X3: $i] :
      ( ( subset @ X22 @ ( singleton @ X3 ) )
     => ( ( X22 = emptyset )
        | ( X22
          = ( singleton @ X3 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).

thf(c_0_4,plain,
    ( emptyset
    = ( ^ [Z0: $i] : ~ $true ) ),
    inference(fof_simplification,[status(thm)],[emptyset]) ).

thf(c_0_5,plain,
    ( singleton
    = ( ^ [Z0: $i,Z1: $i] : Z1 ) ),
    inference(fof_simplification,[status(thm)],[singleton]) ).

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

thf(c_0_7,negated_conjecture,
    ~ ! [X22: $i > $o,X3: $i] :
        ( ! [X25: $i] :
            ( ( X22 @ X25 )
           => ( X25 = X3 ) )
       => ( ! [X26: $i] :
              ( ( X22 @ X26 )
            <=> ~ $true )
          | ! [X27: $i] :
              ( ( X22 @ X27 )
            <=> ( X27 = X3 ) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[thm]),c_0_4]),c_0_5]),c_0_6])]) ).

thf(c_0_8,negated_conjecture,
    ! [X30: $i] :
      ( ( ~ ( epred1_0 @ X30 )
        | ( X30 = esk1_0 ) )
      & ( ~ ( epred1_0 @ esk2_0 )
        | $true )
      & ( ( epred1_0 @ esk2_0 )
        | ~ $true )
      & ( ~ ( epred1_0 @ esk3_0 )
        | ( esk3_0 != esk1_0 ) )
      & ( ( epred1_0 @ esk3_0 )
        | ( esk3_0 = esk1_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_7])])])])]) ).

thf(c_0_9,negated_conjecture,
    ! [X1: $i] :
      ( ( X1 = esk1_0 )
      | ~ ( epred1_0 @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

thf(c_0_10,negated_conjecture,
    ( ( epred1_0 @ esk3_0 )
    | ( esk3_0 = esk1_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

thf(c_0_11,negated_conjecture,
    esk1_0 = esk3_0,
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

thf(c_0_12,negated_conjecture,
    ( ( epred1_0 @ esk2_0 )
    | ~ $true ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

thf(c_0_13,negated_conjecture,
    ! [X1: $i] :
      ( ( X1 = esk3_0 )
      | ~ ( epred1_0 @ X1 ) ),
    inference(rw,[status(thm)],[c_0_9,c_0_11]) ).

thf(c_0_14,negated_conjecture,
    epred1_0 @ esk2_0,
    inference(cn,[status(thm)],[c_0_12]) ).

thf(c_0_15,negated_conjecture,
    ( ~ ( epred1_0 @ esk3_0 )
    | ( esk3_0 != esk1_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

thf(c_0_16,negated_conjecture,
    esk2_0 = esk3_0,
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

thf(c_0_17,negated_conjecture,
    ~ ( epred1_0 @ esk3_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_11])]) ).

thf(c_0_18,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_16]),c_0_17]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem    : SET096^1 : TPTP v8.2.0. Released v3.6.0.
% 0.10/0.12  % Command    : run_E %s %d THM
% 0.11/0.32  % Computer : n011.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 300
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Mon May 20 13:03:38 EDT 2024
% 0.11/0.32  % CPUTime    : 
% 0.17/0.44  Running higher-order theorem proving
% 0.17/0.44  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.17/0.45  # Version: 3.1.0-ho
% 0.17/0.45  # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.17/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45  # Starting new_ho_9 with 1500s (5) cores
% 0.17/0.45  # Starting post_as_ho1 with 300s (1) cores
% 0.17/0.45  # Starting sh1l with 300s (1) cores
% 0.17/0.45  # Starting post_as_ho10 with 300s (1) cores
% 0.17/0.45  # sh1l with pid 22180 completed with status 0
% 0.17/0.45  # Result found by sh1l
% 0.17/0.45  # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.17/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45  # Starting new_ho_9 with 1500s (5) cores
% 0.17/0.45  # Starting post_as_ho1 with 300s (1) cores
% 0.17/0.45  # Starting sh1l with 300s (1) cores
% 0.17/0.45  # No SInE strategy applied
% 0.17/0.45  # Search class: HGHSF-FFSF00-SHSSMFNN
% 0.17/0.45  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.45  # Starting new_ho_10 with 163s (1) cores
% 0.17/0.45  # new_ho_10 with pid 22182 completed with status 0
% 0.17/0.45  # Result found by new_ho_10
% 0.17/0.45  # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.17/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45  # Starting new_ho_9 with 1500s (5) cores
% 0.17/0.45  # Starting post_as_ho1 with 300s (1) cores
% 0.17/0.45  # Starting sh1l with 300s (1) cores
% 0.17/0.45  # No SInE strategy applied
% 0.17/0.45  # Search class: HGHSF-FFSF00-SHSSMFNN
% 0.17/0.45  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.45  # Starting new_ho_10 with 163s (1) cores
% 0.17/0.45  # Preprocessing time       : 0.001 s
% 0.17/0.45  # Presaturation interreduction done
% 0.17/0.45  
% 0.17/0.45  # Proof found!
% 0.17/0.45  # SZS status Theorem
% 0.17/0.45  # SZS output start CNFRefutation
% See solution above
% 0.17/0.45  # Parsed axioms                        : 29
% 0.17/0.45  # Removed by relevancy pruning/SinE    : 0
% 0.17/0.45  # Initial clauses                      : 19
% 0.17/0.45  # Removed in clause preprocessing      : 15
% 0.17/0.45  # Initial clauses in saturation        : 4
% 0.17/0.45  # Processed clauses                    : 12
% 0.17/0.45  # ...of these trivial                  : 0
% 0.17/0.45  # ...subsumed                          : 0
% 0.17/0.45  # ...remaining for further processing  : 12
% 0.17/0.45  # Other redundant clauses eliminated   : 0
% 0.17/0.45  # Clauses deleted for lack of memory   : 0
% 0.17/0.45  # Backward-subsumed                    : 0
% 0.17/0.45  # Backward-rewritten                   : 4
% 0.17/0.45  # Generated clauses                    : 4
% 0.17/0.45  # ...of the previous two non-redundant : 5
% 0.17/0.45  # ...aggressively subsumed             : 0
% 0.17/0.45  # Contextual simplify-reflections      : 0
% 0.17/0.45  # Paramodulations                      : 4
% 0.17/0.45  # Factorizations                       : 0
% 0.17/0.45  # NegExts                              : 0
% 0.17/0.45  # Equation resolutions                 : 0
% 0.17/0.45  # Disequality decompositions           : 0
% 0.17/0.45  # Total rewrite steps                  : 4
% 0.17/0.45  # ...of those cached                   : 2
% 0.17/0.45  # Propositional unsat checks           : 0
% 0.17/0.45  #    Propositional check models        : 0
% 0.17/0.45  #    Propositional check unsatisfiable : 0
% 0.17/0.45  #    Propositional clauses             : 0
% 0.17/0.45  #    Propositional clauses after purity: 0
% 0.17/0.45  #    Propositional unsat core size     : 0
% 0.17/0.45  #    Propositional preprocessing time  : 0.000
% 0.17/0.45  #    Propositional encoding time       : 0.000
% 0.17/0.45  #    Propositional solver time         : 0.000
% 0.17/0.45  #    Success case prop preproc time    : 0.000
% 0.17/0.45  #    Success case prop encoding time   : 0.000
% 0.17/0.45  #    Success case prop solver time     : 0.000
% 0.17/0.45  # Current number of processed clauses  : 4
% 0.17/0.45  #    Positive orientable unit clauses  : 2
% 0.17/0.45  #    Positive unorientable unit clauses: 0
% 0.17/0.45  #    Negative unit clauses             : 1
% 0.17/0.45  #    Non-unit-clauses                  : 1
% 0.17/0.45  # Current number of unprocessed clauses: 0
% 0.17/0.45  # ...number of literals in the above   : 0
% 0.17/0.45  # Current number of archived formulas  : 0
% 0.17/0.45  # Current number of archived clauses   : 8
% 0.17/0.45  # Clause-clause subsumption calls (NU) : 0
% 0.17/0.45  # Rec. Clause-clause subsumption calls : 0
% 0.17/0.45  # Non-unit clause-clause subsumptions  : 0
% 0.17/0.45  # Unit Clause-clause subsumption calls : 0
% 0.17/0.45  # Rewrite failures with RHS unbound    : 0
% 0.17/0.45  # BW rewrite match attempts            : 2
% 0.17/0.45  # BW rewrite match successes           : 2
% 0.17/0.45  # Condensation attempts                : 12
% 0.17/0.45  # Condensation successes               : 0
% 0.17/0.45  # Termbank termtop insertions          : 1003
% 0.17/0.45  # Search garbage collected termcells   : 200
% 0.17/0.45  
% 0.17/0.45  # -------------------------------------------------
% 0.17/0.45  # User time                : 0.003 s
% 0.17/0.45  # System time              : 0.002 s
% 0.17/0.45  # Total time               : 0.005 s
% 0.17/0.45  # Maximum resident set size: 1692 pages
% 0.17/0.45  
% 0.17/0.45  # -------------------------------------------------
% 0.17/0.45  # User time                : 0.004 s
% 0.17/0.45  # System time              : 0.004 s
% 0.17/0.45  # Total time               : 0.008 s
% 0.17/0.45  # Maximum resident set size: 1752 pages
% 0.17/0.45  % E---3.1 exiting
% 0.17/0.46  % E exiting
%------------------------------------------------------------------------------