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

View Problem - Process Solution

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

% Computer : n029.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 : Sun Jul 17 22:43:06 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(axiom1,axiom,
    ! [X1,X2,X3] :
      ( ( s_contains(X1,X2)
        & s_contains(X2,X3) )
     => s_contains(X1,X3) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom1) ).

fof(mexico_in_america_1,conjecture,
    s_contains(s_g019,s_MX),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mexico_in_america_1) ).

fof(kb74,axiom,
    s_contains(s_g013,s_MX),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',kb74) ).

fof(kb18,axiom,
    s_contains(s_g019,s_g013),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',kb18) ).

fof(c_0_4,plain,
    ! [X4,X5,X6] :
      ( ~ s_contains(X4,X5)
      | ~ s_contains(X5,X6)
      | s_contains(X4,X6) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom1])]) ).

fof(c_0_5,negated_conjecture,
    ~ s_contains(s_g019,s_MX),
    inference(assume_negation,[status(cth)],[mexico_in_america_1]) ).

cnf(c_0_6,plain,
    ( s_contains(X1,X2)
    | ~ s_contains(X3,X2)
    | ~ s_contains(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,plain,
    s_contains(s_g013,s_MX),
    inference(split_conjunct,[status(thm)],[kb74]) ).

fof(c_0_8,negated_conjecture,
    ~ s_contains(s_g019,s_MX),
    inference(fof_simplification,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    ( s_contains(X1,s_MX)
    | ~ s_contains(X1,s_g013) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_10,plain,
    s_contains(s_g019,s_g013),
    inference(split_conjunct,[status(thm)],[kb18]) ).

cnf(c_0_11,negated_conjecture,
    ~ s_contains(s_g019,s_MX),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

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

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