TSTP Solution File: SET987+1 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SET987+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n003.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  : 600s
% DateTime : Tue Jul 19 00:55:54 EDT 2022

% Result   : Theorem 0.24s 1.41s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   13 (   7 unt;   0 def)
%            Number of atoms       :   21 (  12 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   19 (  11   ~;   3   |;   2   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   18 (   2 sgn  14   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t141_zfmisc_1,conjecture,
    ! [X1,X2] :
      ( ~ in(X1,X2)
     => set_difference(set_union2(X2,singleton(X1)),singleton(X1)) = X2 ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t141_zfmisc_1) ).

fof(t40_xboole_1,axiom,
    ! [X1,X2] : set_difference(set_union2(X1,X2),X2) = set_difference(X1,X2),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t40_xboole_1) ).

fof(t65_zfmisc_1,axiom,
    ! [X1,X2] :
      ( set_difference(X1,singleton(X2)) = X1
    <=> ~ in(X2,X1) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t65_zfmisc_1) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X1,X2] :
        ( ~ in(X1,X2)
       => set_difference(set_union2(X2,singleton(X1)),singleton(X1)) = X2 ),
    inference(assume_negation,[status(cth)],[t141_zfmisc_1]) ).

fof(c_0_4,negated_conjecture,
    ( ~ in(esk1_0,esk2_0)
    & set_difference(set_union2(esk2_0,singleton(esk1_0)),singleton(esk1_0)) != esk2_0 ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_3])])])]) ).

fof(c_0_5,plain,
    ! [X3,X4] : set_difference(set_union2(X3,X4),X4) = set_difference(X3,X4),
    inference(variable_rename,[status(thm)],[t40_xboole_1]) ).

cnf(c_0_6,negated_conjecture,
    set_difference(set_union2(esk2_0,singleton(esk1_0)),singleton(esk1_0)) != esk2_0,
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,plain,
    set_difference(set_union2(X1,X2),X2) = set_difference(X1,X2),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

fof(c_0_8,plain,
    ! [X3,X4,X3,X4] :
      ( ( set_difference(X3,singleton(X4)) != X3
        | ~ in(X4,X3) )
      & ( in(X4,X3)
        | set_difference(X3,singleton(X4)) = X3 ) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[t65_zfmisc_1])])])])]) ).

cnf(c_0_9,negated_conjecture,
    set_difference(esk2_0,singleton(esk1_0)) != esk2_0,
    inference(rw,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_10,plain,
    ( set_difference(X1,singleton(X2)) = X1
    | in(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_11,negated_conjecture,
    ~ in(esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_12,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET987+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13  % Command  : run_ET %s %d
% 0.14/0.34  % Computer : n003.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Sun Jul 10 11:54:59 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.24/1.41  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.41  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.41  # Preprocessing time       : 0.014 s
% 0.24/1.41  
% 0.24/1.41  # Proof found!
% 0.24/1.41  # SZS status Theorem
% 0.24/1.41  # SZS output start CNFRefutation
% See solution above
% 0.24/1.41  # Proof object total steps             : 13
% 0.24/1.41  # Proof object clause steps            : 6
% 0.24/1.41  # Proof object formula steps           : 7
% 0.24/1.41  # Proof object conjectures             : 7
% 0.24/1.41  # Proof object clause conjectures      : 4
% 0.24/1.41  # Proof object formula conjectures     : 3
% 0.24/1.41  # Proof object initial clauses used    : 4
% 0.24/1.41  # Proof object initial formulas used   : 3
% 0.24/1.41  # Proof object generating inferences   : 1
% 0.24/1.41  # Proof object simplifying inferences  : 2
% 0.24/1.41  # Training examples: 0 positive, 0 negative
% 0.24/1.41  # Parsed axioms                        : 10
% 0.24/1.41  # Removed by relevancy pruning/SinE    : 4
% 0.24/1.41  # Initial clauses                      : 8
% 0.24/1.41  # Removed in clause preprocessing      : 0
% 0.24/1.41  # Initial clauses in saturation        : 8
% 0.24/1.41  # Processed clauses                    : 11
% 0.24/1.41  # ...of these trivial                  : 1
% 0.24/1.41  # ...subsumed                          : 0
% 0.24/1.41  # ...remaining for further processing  : 10
% 0.24/1.41  # Other redundant clauses eliminated   : 0
% 0.24/1.41  # Clauses deleted for lack of memory   : 0
% 0.24/1.41  # Backward-subsumed                    : 0
% 0.24/1.41  # Backward-rewritten                   : 1
% 0.24/1.41  # Generated clauses                    : 11
% 0.24/1.41  # ...of the previous two non-trivial   : 6
% 0.24/1.41  # Contextual simplify-reflections      : 0
% 0.24/1.41  # Paramodulations                      : 11
% 0.24/1.41  # Factorizations                       : 0
% 0.24/1.41  # Equation resolutions                 : 0
% 0.24/1.41  # Current number of processed clauses  : 9
% 0.24/1.41  #    Positive orientable unit clauses  : 3
% 0.24/1.41  #    Positive unorientable unit clauses: 1
% 0.24/1.41  #    Negative unit clauses             : 2
% 0.24/1.41  #    Non-unit-clauses                  : 3
% 0.24/1.41  # Current number of unprocessed clauses: 3
% 0.24/1.41  # ...number of literals in the above   : 6
% 0.24/1.41  # Current number of archived formulas  : 0
% 0.24/1.41  # Current number of archived clauses   : 1
% 0.24/1.41  # Clause-clause subsumption calls (NU) : 0
% 0.24/1.41  # Rec. Clause-clause subsumption calls : 0
% 0.24/1.41  # Non-unit clause-clause subsumptions  : 0
% 0.24/1.41  # Unit Clause-clause subsumption calls : 0
% 0.24/1.41  # Rewrite failures with RHS unbound    : 0
% 0.24/1.41  # BW rewrite match attempts            : 6
% 0.24/1.41  # BW rewrite match successes           : 5
% 0.24/1.41  # Condensation attempts                : 0
% 0.24/1.41  # Condensation successes               : 0
% 0.24/1.41  # Termbank termtop insertions          : 451
% 0.24/1.41  
% 0.24/1.41  # -------------------------------------------------
% 0.24/1.41  # User time                : 0.013 s
% 0.24/1.41  # System time              : 0.002 s
% 0.24/1.41  # Total time               : 0.015 s
% 0.24/1.41  # Maximum resident set size: 2772 pages
%------------------------------------------------------------------------------