TSTP Solution File: SET605+3 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SET605+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n009.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:52:24 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(prove_th76,conjecture,
    ! [X1,X2] : difference(X1,union(X1,X2)) = empty_set,
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_th76) ).

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

fof(difference_empty_set,axiom,
    ! [X1,X2] :
      ( difference(X1,X2) = empty_set
    <=> subset(X1,X2) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',difference_empty_set) ).

fof(subset_of_union,axiom,
    ! [X1,X2] : subset(X1,union(X1,X2)),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',subset_of_union) ).

fof(c_0_4,negated_conjecture,
    ~ ! [X1,X2] : difference(X1,union(X1,X2)) = empty_set,
    inference(assume_negation,[status(cth)],[prove_th76]) ).

fof(c_0_5,negated_conjecture,
    difference(esk1_0,union(esk1_0,esk2_0)) != empty_set,
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).

fof(c_0_6,plain,
    ! [X3,X4] : union(X3,X4) = union(X4,X3),
    inference(variable_rename,[status(thm)],[commutativity_of_union]) ).

cnf(c_0_7,negated_conjecture,
    difference(esk1_0,union(esk1_0,esk2_0)) != empty_set,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_8,plain,
    union(X1,X2) = union(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

fof(c_0_9,plain,
    ! [X3,X4,X3,X4] :
      ( ( difference(X3,X4) != empty_set
        | subset(X3,X4) )
      & ( ~ subset(X3,X4)
        | difference(X3,X4) = empty_set ) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[difference_empty_set])])])]) ).

fof(c_0_10,plain,
    ! [X3,X4] : subset(X3,union(X3,X4)),
    inference(variable_rename,[status(thm)],[subset_of_union]) ).

cnf(c_0_11,negated_conjecture,
    difference(esk1_0,union(esk2_0,esk1_0)) != empty_set,
    inference(rw,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_12,plain,
    ( difference(X1,X2) = empty_set
    | ~ subset(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_13,plain,
    subset(X1,union(X1,X2)),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_14,negated_conjecture,
    ~ subset(esk1_0,union(esk2_0,esk1_0)),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,plain,
    subset(X1,union(X2,X1)),
    inference(spm,[status(thm)],[c_0_13,c_0_8]) ).

cnf(c_0_16,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SET605+3 : TPTP v8.1.0. Released v2.2.0.
% 0.13/0.13  % Command  : run_ET %s %d
% 0.14/0.34  % Computer : n009.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 : Mon Jul 11 02:00:52 EDT 2022
% 0.21/0.35  % CPUTime  : 
% 0.24/1.42  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42  # Preprocessing time       : 0.015 s
% 0.24/1.42  
% 0.24/1.42  # Proof found!
% 0.24/1.42  # SZS status Theorem
% 0.24/1.42  # SZS output start CNFRefutation
% See solution above
% 0.24/1.42  # Proof object total steps             : 17
% 0.24/1.42  # Proof object clause steps            : 8
% 0.24/1.42  # Proof object formula steps           : 9
% 0.24/1.42  # Proof object conjectures             : 7
% 0.24/1.42  # Proof object clause conjectures      : 4
% 0.24/1.42  # Proof object formula conjectures     : 3
% 0.24/1.42  # Proof object initial clauses used    : 4
% 0.24/1.42  # Proof object initial formulas used   : 4
% 0.24/1.42  # Proof object generating inferences   : 2
% 0.24/1.42  # Proof object simplifying inferences  : 3
% 0.24/1.42  # Training examples: 0 positive, 0 negative
% 0.24/1.42  # Parsed axioms                        : 12
% 0.24/1.42  # Removed by relevancy pruning/SinE    : 1
% 0.24/1.42  # Initial clauses                      : 23
% 0.24/1.42  # Removed in clause preprocessing      : 2
% 0.24/1.42  # Initial clauses in saturation        : 21
% 0.24/1.42  # Processed clauses                    : 25
% 0.24/1.42  # ...of these trivial                  : 0
% 0.24/1.42  # ...subsumed                          : 0
% 0.24/1.42  # ...remaining for further processing  : 25
% 0.24/1.42  # Other redundant clauses eliminated   : 2
% 0.24/1.42  # Clauses deleted for lack of memory   : 0
% 0.24/1.42  # Backward-subsumed                    : 0
% 0.24/1.42  # Backward-rewritten                   : 2
% 0.24/1.42  # Generated clauses                    : 50
% 0.24/1.42  # ...of the previous two non-trivial   : 35
% 0.24/1.42  # Contextual simplify-reflections      : 0
% 0.24/1.42  # Paramodulations                      : 46
% 0.24/1.42  # Factorizations                       : 2
% 0.24/1.42  # Equation resolutions                 : 2
% 0.24/1.42  # Current number of processed clauses  : 21
% 0.24/1.42  #    Positive orientable unit clauses  : 4
% 0.24/1.42  #    Positive unorientable unit clauses: 1
% 0.24/1.42  #    Negative unit clauses             : 2
% 0.24/1.42  #    Non-unit-clauses                  : 14
% 0.24/1.42  # Current number of unprocessed clauses: 31
% 0.24/1.42  # ...number of literals in the above   : 80
% 0.24/1.42  # Current number of archived formulas  : 0
% 0.24/1.42  # Current number of archived clauses   : 2
% 0.24/1.42  # Clause-clause subsumption calls (NU) : 8
% 0.24/1.42  # Rec. Clause-clause subsumption calls : 8
% 0.24/1.42  # Non-unit clause-clause subsumptions  : 0
% 0.24/1.42  # Unit Clause-clause subsumption calls : 0
% 0.24/1.42  # Rewrite failures with RHS unbound    : 0
% 0.24/1.42  # BW rewrite match attempts            : 6
% 0.24/1.42  # BW rewrite match successes           : 5
% 0.24/1.42  # Condensation attempts                : 0
% 0.24/1.42  # Condensation successes               : 0
% 0.24/1.42  # Termbank termtop insertions          : 1566
% 0.24/1.42  
% 0.24/1.42  # -------------------------------------------------
% 0.24/1.42  # User time                : 0.015 s
% 0.24/1.42  # System time              : 0.002 s
% 0.24/1.42  # Total time               : 0.017 s
% 0.24/1.42  # Maximum resident set size: 2776 pages
%------------------------------------------------------------------------------