↑ Up

ET---2.0.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : TOP022+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n027.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 : Thu Jul 21 21:25:27 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(isomorphic_groups_defn,axiom,
    ! [X1,X2] :
      ( isomorphic_groups(X1,X2)
    <=> ? [X3] : a_group_isomorphism_from_to(X3,X1,X2) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',isomorphic_groups_defn) ).

fof(m_8_2_1,axiom,
    ! [X1,X5,X6,X4] :
      ( a_path_from_to_in(X1,X5,X6,X4)
     => a_group_isomorphism_from_to(alpha_hat(X1),first_homotop_grp(X4,X5),first_homotop_grp(X4,X6)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m_8_2_1) ).

fof(m_8_2_2,conjecture,
    ! [X4,X5,X6] :
      ( ( path_connected(X4)
        & a_member_of(X5,X4)
        & a_member_of(X6,X4) )
     => isomorphic_groups(first_homotop_grp(X4,X5),first_homotop_grp(X4,X6)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m_8_2_2) ).

fof(path_connected_defn,axiom,
    ! [X4,X5,X6] :
      ( path_connected(X4)
    <=> ( ( a_member_of(X5,X4)
          & a_member_of(X6,X4) )
       => ? [X7] : a_path_from_to_in(X7,X5,X6,X4) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',path_connected_defn) ).

fof(c_0_4,plain,
    ! [X4,X5,X4,X5,X7] :
      ( ( ~ isomorphic_groups(X4,X5)
        | a_group_isomorphism_from_to(esk1_2(X4,X5),X4,X5) )
      & ( ~ a_group_isomorphism_from_to(X7,X4,X5)
        | isomorphic_groups(X4,X5) ) ),
    inference(shift_quantors,[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)],[isomorphic_groups_defn])])])])])]) ).

fof(c_0_5,plain,
    ! [X7,X8,X9,X10] :
      ( ~ a_path_from_to_in(X7,X8,X9,X10)
      | a_group_isomorphism_from_to(alpha_hat(X7),first_homotop_grp(X10,X8),first_homotop_grp(X10,X9)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_8_2_1])]) ).

fof(c_0_6,negated_conjecture,
    ~ ! [X4,X5,X6] :
        ( ( path_connected(X4)
          & a_member_of(X5,X4)
          & a_member_of(X6,X4) )
       => isomorphic_groups(first_homotop_grp(X4,X5),first_homotop_grp(X4,X6)) ),
    inference(assume_negation,[status(cth)],[m_8_2_2]) ).

cnf(c_0_7,plain,
    ( isomorphic_groups(X1,X2)
    | ~ a_group_isomorphism_from_to(X3,X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,plain,
    ( a_group_isomorphism_from_to(alpha_hat(X1),first_homotop_grp(X2,X3),first_homotop_grp(X2,X4))
    | ~ a_path_from_to_in(X1,X3,X4,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

fof(c_0_9,plain,
    ! [X8,X9,X10,X8,X9,X10,X9,X10,X12] :
      ( ( ~ path_connected(X8)
        | ~ a_member_of(X9,X8)
        | ~ a_member_of(X10,X8)
        | a_path_from_to_in(esk2_3(X8,X9,X10),X9,X10,X8) )
      & ( a_member_of(X9,X8)
        | path_connected(X8) )
      & ( a_member_of(X10,X8)
        | path_connected(X8) )
      & ( ~ a_path_from_to_in(X12,X9,X10,X8)
        | path_connected(X8) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[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)],[path_connected_defn])])])])])])]) ).

fof(c_0_10,negated_conjecture,
    ( path_connected(esk3_0)
    & a_member_of(esk4_0,esk3_0)
    & a_member_of(esk5_0,esk3_0)
    & ~ isomorphic_groups(first_homotop_grp(esk3_0,esk4_0),first_homotop_grp(esk3_0,esk5_0)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).

cnf(c_0_11,plain,
    ( isomorphic_groups(first_homotop_grp(X1,X2),first_homotop_grp(X1,X3))
    | ~ a_path_from_to_in(X4,X2,X3,X1) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_12,plain,
    ( a_path_from_to_in(esk2_3(X1,X2,X3),X2,X3,X1)
    | ~ a_member_of(X3,X1)
    | ~ a_member_of(X2,X1)
    | ~ path_connected(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_13,negated_conjecture,
    ~ isomorphic_groups(first_homotop_grp(esk3_0,esk4_0),first_homotop_grp(esk3_0,esk5_0)),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_14,plain,
    ( isomorphic_groups(first_homotop_grp(X1,X2),first_homotop_grp(X1,X3))
    | ~ a_member_of(X3,X1)
    | ~ a_member_of(X2,X1)
    | ~ path_connected(X1) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,negated_conjecture,
    a_member_of(esk5_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_16,negated_conjecture,
    a_member_of(esk4_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_17,negated_conjecture,
    path_connected(esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

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

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