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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SET071+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n012.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:48:43 EDT 2022

% Result   : Theorem 0.25s 1.43s
% Output   : CNFRefutation 0.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   18 (   4 unt;   0 def)
%            Number of atoms       :   56 (  25 equ)
%            Maximal formula atoms :   11 (   3 avg)
%            Number of connectives :   57 (  19   ~;  22   |;  12   &)
%                                         (   1 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   28 (   3 sgn  15   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(unordered_pair_defn,axiom,
    ! [X3,X1,X2] :
      ( member(X3,unordered_pair(X1,X2))
    <=> ( member(X3,universal_class)
        & ( X3 = X1
          | X3 = X2 ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',unordered_pair_defn) ).

fof(regularity,axiom,
    ! [X1] :
      ( X1 != null_class
     => ? [X3] :
          ( member(X3,universal_class)
          & member(X3,X1)
          & disjoint(X3,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',regularity) ).

fof(null_unordered_pair,conjecture,
    ! [X1,X2] :
      ( ( ~ member(X1,universal_class)
        & ~ member(X2,universal_class) )
     => unordered_pair(X1,X2) = null_class ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',null_unordered_pair) ).

fof(c_0_3,plain,
    ! [X4,X5,X6,X4,X5,X6] :
      ( ( member(X4,universal_class)
        | ~ member(X4,unordered_pair(X5,X6)) )
      & ( X4 = X5
        | X4 = X6
        | ~ member(X4,unordered_pair(X5,X6)) )
      & ( X4 != X5
        | ~ member(X4,universal_class)
        | member(X4,unordered_pair(X5,X6)) )
      & ( X4 != X6
        | ~ member(X4,universal_class)
        | member(X4,unordered_pair(X5,X6)) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[unordered_pair_defn])])])])]) ).

fof(c_0_4,plain,
    ! [X4] :
      ( ( member(esk6_1(X4),universal_class)
        | X4 = null_class )
      & ( member(esk6_1(X4),X4)
        | X4 = null_class )
      & ( disjoint(esk6_1(X4),X4)
        | X4 = null_class ) ),
    inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[regularity])])])])])]) ).

cnf(c_0_5,plain,
    ( X1 = X3
    | X1 = X2
    | ~ member(X1,unordered_pair(X2,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,plain,
    ( X1 = null_class
    | member(esk6_1(X1),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

fof(c_0_7,negated_conjecture,
    ~ ! [X1,X2] :
        ( ( ~ member(X1,universal_class)
          & ~ member(X2,universal_class) )
       => unordered_pair(X1,X2) = null_class ),
    inference(assume_negation,[status(cth)],[null_unordered_pair]) ).

cnf(c_0_8,plain,
    ( X1 = null_class
    | member(esk6_1(X1),universal_class) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_9,plain,
    ( esk6_1(unordered_pair(X1,X2)) = X2
    | esk6_1(unordered_pair(X1,X2)) = X1
    | unordered_pair(X1,X2) = null_class ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

fof(c_0_10,negated_conjecture,
    ( ~ member(esk8_0,universal_class)
    & ~ member(esk9_0,universal_class)
    & unordered_pair(esk8_0,esk9_0) != null_class ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_7])])])]) ).

cnf(c_0_11,plain,
    ( esk6_1(unordered_pair(X1,X2)) = X2
    | unordered_pair(X1,X2) = null_class
    | member(X1,universal_class) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,negated_conjecture,
    ~ member(esk9_0,universal_class),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_13,plain,
    ( unordered_pair(X1,X2) = null_class
    | member(X1,universal_class)
    | member(X2,universal_class) ),
    inference(spm,[status(thm)],[c_0_8,c_0_11]) ).

cnf(c_0_14,negated_conjecture,
    ~ member(esk8_0,universal_class),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_15,negated_conjecture,
    ( unordered_pair(X1,esk9_0) = null_class
    | member(X1,universal_class) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_16,negated_conjecture,
    unordered_pair(esk8_0,esk9_0) != null_class,
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_17,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : SET071+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.08/0.14  % Command  : run_ET %s %d
% 0.13/0.35  % Computer : n012.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Sun Jul 10 08:53:28 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.25/1.43  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.43  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.43  # Preprocessing time       : 0.015 s
% 0.25/1.43  
% 0.25/1.43  # Failure: Out of unprocessed clauses!
% 0.25/1.43  # OLD status GaveUp
% 0.25/1.43  # Parsed axioms                        : 44
% 0.25/1.43  # Removed by relevancy pruning/SinE    : 37
% 0.25/1.43  # Initial clauses                      : 14
% 0.25/1.43  # Removed in clause preprocessing      : 2
% 0.25/1.43  # Initial clauses in saturation        : 12
% 0.25/1.43  # Processed clauses                    : 14
% 0.25/1.43  # ...of these trivial                  : 0
% 0.25/1.43  # ...subsumed                          : 0
% 0.25/1.43  # ...remaining for further processing  : 14
% 0.25/1.43  # Other redundant clauses eliminated   : 2
% 0.25/1.43  # Clauses deleted for lack of memory   : 0
% 0.25/1.43  # Backward-subsumed                    : 0
% 0.25/1.43  # Backward-rewritten                   : 0
% 0.25/1.43  # Generated clauses                    : 6
% 0.25/1.43  # ...of the previous two non-trivial   : 2
% 0.25/1.43  # Contextual simplify-reflections      : 0
% 0.25/1.43  # Paramodulations                      : 4
% 0.25/1.43  # Factorizations                       : 0
% 0.25/1.43  # Equation resolutions                 : 2
% 0.25/1.43  # Current number of processed clauses  : 12
% 0.25/1.43  #    Positive orientable unit clauses  : 1
% 0.25/1.43  #    Positive unorientable unit clauses: 0
% 0.25/1.43  #    Negative unit clauses             : 4
% 0.25/1.43  #    Non-unit-clauses                  : 7
% 0.25/1.43  # Current number of unprocessed clauses: 0
% 0.25/1.43  # ...number of literals in the above   : 0
% 0.25/1.43  # Current number of archived formulas  : 0
% 0.25/1.43  # Current number of archived clauses   : 2
% 0.25/1.43  # Clause-clause subsumption calls (NU) : 4
% 0.25/1.43  # Rec. Clause-clause subsumption calls : 4
% 0.25/1.43  # Non-unit clause-clause subsumptions  : 0
% 0.25/1.43  # Unit Clause-clause subsumption calls : 0
% 0.25/1.43  # Rewrite failures with RHS unbound    : 0
% 0.25/1.43  # BW rewrite match attempts            : 0
% 0.25/1.43  # BW rewrite match successes           : 0
% 0.25/1.43  # Condensation attempts                : 0
% 0.25/1.43  # Condensation successes               : 0
% 0.25/1.43  # Termbank termtop insertions          : 1178
% 0.25/1.43  
% 0.25/1.43  # -------------------------------------------------
% 0.25/1.43  # User time                : 0.012 s
% 0.25/1.43  # System time              : 0.004 s
% 0.25/1.43  # Total time               : 0.016 s
% 0.25/1.43  # Maximum resident set size: 2776 pages
% 0.25/1.43  # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.25/1.43  # Preprocessing time       : 0.020 s
% 0.25/1.43  
% 0.25/1.43  # Proof found!
% 0.25/1.43  # SZS status Theorem
% 0.25/1.43  # SZS output start CNFRefutation
% See solution above
% 0.25/1.43  # Proof object total steps             : 18
% 0.25/1.43  # Proof object clause steps            : 11
% 0.25/1.43  # Proof object formula steps           : 7
% 0.25/1.43  # Proof object conjectures             : 8
% 0.25/1.43  # Proof object clause conjectures      : 5
% 0.25/1.43  # Proof object formula conjectures     : 3
% 0.25/1.43  # Proof object initial clauses used    : 6
% 0.25/1.43  # Proof object initial formulas used   : 3
% 0.25/1.43  # Proof object generating inferences   : 5
% 0.25/1.43  # Proof object simplifying inferences  : 1
% 0.25/1.43  # Training examples: 0 positive, 0 negative
% 0.25/1.43  # Parsed axioms                        : 44
% 0.25/1.43  # Removed by relevancy pruning/SinE    : 0
% 0.25/1.43  # Initial clauses                      : 92
% 0.25/1.43  # Removed in clause preprocessing      : 8
% 0.25/1.43  # Initial clauses in saturation        : 84
% 0.25/1.43  # Processed clauses                    : 4666
% 0.25/1.43  # ...of these trivial                  : 12
% 0.25/1.43  # ...subsumed                          : 3239
% 0.25/1.43  # ...remaining for further processing  : 1415
% 0.25/1.43  # Other redundant clauses eliminated   : 19
% 0.25/1.43  # Clauses deleted for lack of memory   : 0
% 0.25/1.43  # Backward-subsumed                    : 70
% 0.25/1.43  # Backward-rewritten                   : 164
% 0.25/1.43  # Generated clauses                    : 54130
% 0.25/1.43  # ...of the previous two non-trivial   : 49821
% 0.25/1.43  # Contextual simplify-reflections      : 1039
% 0.25/1.43  # Paramodulations                      : 54081
% 0.25/1.43  # Factorizations                       : 28
% 0.25/1.43  # Equation resolutions                 : 21
% 0.25/1.43  # Current number of processed clauses  : 1177
% 0.25/1.43  #    Positive orientable unit clauses  : 51
% 0.25/1.43  #    Positive unorientable unit clauses: 0
% 0.25/1.43  #    Negative unit clauses             : 40
% 0.25/1.43  #    Non-unit-clauses                  : 1086
% 0.25/1.43  # Current number of unprocessed clauses: 37931
% 0.25/1.43  # ...number of literals in the above   : 143445
% 0.25/1.43  # Current number of archived formulas  : 0
% 0.25/1.43  # Current number of archived clauses   : 242
% 0.25/1.43  # Clause-clause subsumption calls (NU) : 290458
% 0.25/1.43  # Rec. Clause-clause subsumption calls : 172376
% 0.25/1.43  # Non-unit clause-clause subsumptions  : 2603
% 0.25/1.43  # Unit Clause-clause subsumption calls : 9165
% 0.25/1.43  # Rewrite failures with RHS unbound    : 0
% 0.25/1.43  # BW rewrite match attempts            : 60
% 0.25/1.43  # BW rewrite match successes           : 22
% 0.25/1.43  # Condensation attempts                : 0
% 0.25/1.43  # Condensation successes               : 0
% 0.25/1.43  # Termbank termtop insertions          : 1431086
% 0.25/1.43  
% 0.25/1.43  # -------------------------------------------------
% 0.25/1.43  # User time                : 0.755 s
% 0.25/1.43  # System time              : 0.024 s
% 0.25/1.43  # Total time               : 0.779 s
% 0.25/1.43  # Maximum resident set size: 43236 pages
% 0.25/23.45  eprover: CPU time limit exceeded, terminating
% 0.25/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46  eprover: No such file or directory
% 0.25/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46  eprover: No such file or directory
% 0.25/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47  eprover: No such file or directory
% 0.25/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47  eprover: No such file or directory
% 0.25/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.48  eprover: No such file or directory
% 0.25/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.48  eprover: No such file or directory
% 0.25/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.48  eprover: No such file or directory
% 0.25/23.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.49  eprover: No such file or directory
% 0.25/23.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.49  eprover: No such file or directory
% 0.25/23.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.49  eprover: No such file or directory
% 0.25/23.50  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.50  eprover: No such file or directory
%------------------------------------------------------------------------------