↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : TOP022+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n020.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 03:53:50 PM UTC 2026

% Result   : Theorem 0.24s 0.55s
% Output   : CNFRefutation 0.24s
% 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 (   2 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/sandbox2/benchmark/theBenchmark.p',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/sandbox2/benchmark/theBenchmark.p',m_8_2_1) ).

fof(m_8_2_2,conjecture,
    ! [X4,X5,X6] :
      ( ( a_member_of(X6,X4)
        & a_member_of(X5,X4)
        & path_connected(X4) )
     => isomorphic_groups(first_homotop_grp(X4,X5),first_homotop_grp(X4,X6)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_8_2_2) ).

fof(path_connected_defn,axiom,
    ! [X4,X5,X6] :
      ( path_connected(X4)
    <=> ( ( a_member_of(X6,X4)
          & a_member_of(X5,X4) )
       => ? [X7] : a_path_from_to_in(X7,X5,X6,X4) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',path_connected_defn) ).

fof(c_0_4,plain,
    ! [X8,X9,X11,X12,X13] :
      ( ( isomorphic_groups(X11,X12)
        | ~ a_group_isomorphism_from_to(X13,X11,X12) )
      & ( a_group_isomorphism_from_to(esk1_2(X8,X9),X8,X9)
        | ~ isomorphic_groups(X8,X9) ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[isomorphic_groups_defn])])])])])]) ).

fof(c_0_5,plain,
    ! [X24,X25,X26,X27] :
      ( a_group_isomorphism_from_to(alpha_hat(X24),first_homotop_grp(X27,X25),first_homotop_grp(X27,X26))
      | ~ a_path_from_to_in(X24,X25,X26,X27) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_8_2_1])])]) ).

fof(c_0_6,negated_conjecture,
    ~ ! [X4,X5,X6] :
        ( ( a_member_of(X6,X4)
          & a_member_of(X5,X4)
          & path_connected(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,
    ( ~ a_group_isomorphism_from_to(X1,X2,X3)
    | isomorphic_groups(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

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

fof(c_0_9,plain,
    ! [X14,X15,X16,X18,X19,X20,X21,X22,X23] :
      ( ( path_connected(X18)
        | ~ a_path_from_to_in(X23,X21,X22,X18) )
      & ( path_connected(X18)
        | a_member_of(X20,X18) )
      & ( path_connected(X18)
        | a_member_of(X19,X18) )
      & ( a_path_from_to_in(esk2_3(X14,X15,X16),X15,X16,X14)
        | ~ a_member_of(X16,X14)
        | ~ a_member_of(X15,X14)
        | ~ path_connected(X14) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[path_connected_defn])])])])])])]) ).

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

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

cnf(c_0_12,plain,
    ( ~ a_member_of(X3,X1)
    | ~ a_member_of(X2,X1)
    | ~ path_connected(X1)
    | a_path_from_to_in(esk2_3(X1,X2,X3),X2,X3,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,
    ( ~ path_connected(X1)
    | ~ a_member_of(X2,X1)
    | ~ a_member_of(X3,X1)
    | isomorphic_groups(first_homotop_grp(X1,X2),first_homotop_grp(X1,X3)) ),
    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.00/0.05  % Problem  : TOP022+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.45  % Computer : n020.cluster.edu
% 0.20/0.45  % Model    : x86_64 x86_64
% 0.20/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45  % Memory   : 8046.5625MB
% 0.20/0.45  % OS       : Linux 6.8.0-71-generic
% 0.20/0.45  % CPULimit : 300
% 0.20/0.45  % WCLimit  : 300
% 0.20/0.45  % DateTime : Mon Sep 21 12:39:17 UTC 2026
% 0.20/0.46  % CPUTime  : 
% 0.20/0.46  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.51  Running first-order theorem proving
% 0.24/0.51  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.24/0.55  % Version: 3.5.1
% 0.24/0.55  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.24/0.55  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.55  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.24/0.55  % Starting new_bool_3 with 300s (1) cores
% 0.24/0.55  % Starting new_bool_1 with 300s (1) cores
% 0.24/0.55  % Starting sh5l with 300s (1) cores
% 0.24/0.55  % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2925582 completed with status 0
% 0.24/0.55  % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.24/0.55  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.24/0.55  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.55  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.24/0.55  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.55  % No SInE strategy applied
% 0.24/0.55  % Search class: FGUNF-FFSS32-SFFFFFNN
% 0.24/0.55  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.55  % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.55  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.24/0.55  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.24/0.55  % Starting new_bool_3 with 136s (1) cores
% 0.24/0.55  % Starting new_bool_1 with 136s (1) cores
% 0.24/0.55  % SubtermCWHack with pid 2925586 completed with status 0
% 0.24/0.55  % Result found by SubtermCWHack
% 0.24/0.55  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.24/0.55  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.55  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.24/0.55  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.55  % No SInE strategy applied
% 0.24/0.55  % Search class: FGUNF-FFSS32-SFFFFFNN
% 0.24/0.55  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.55  % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.55  % Preprocessing time       : 0.001 s
% 0.24/0.55  
% 0.24/0.55  % Proof found!
% 0.24/0.55  % SZS status Theorem
% 0.24/0.55  % SZS output start CNFRefutation
% See solution above
% 0.24/0.55  % Parsed axioms                        : 4
% 0.24/0.55  % Removed by relevancy pruning/SinE    : 0
% 0.24/0.55  % Initial clauses                      : 11
% 0.24/0.55  % Removed in clause preprocessing      : 0
% 0.24/0.55  % Initial clauses in saturation        : 11
% 0.24/0.55  % Processed clauses                    : 13
% 0.24/0.55  % ...of these trivial                  : 0
% 0.24/0.55  % ...subsumed                          : 1
% 0.24/0.55  % ...remaining for further processing  : 12
% 0.24/0.55  % Other redundant clauses eliminated   : 0
% 0.24/0.55  % Clauses deleted for lack of memory   : 0
% 0.24/0.55  % Backward-subsumed                    : 0
% 0.24/0.55  % Backward-rewritten                   : 0
% 0.24/0.55  % Generated clauses                    : 5
% 0.24/0.55  % ...of the previous two non-redundant : 2
% 0.24/0.55  % ...aggressively subsumed             : 0
% 0.24/0.55  % Contextual simplify-reflections      : 0
% 0.24/0.55  % Paramodulations                      : 5
% 0.24/0.55  % Factorizations                       : 0
% 0.24/0.55  % NegExts                              : 0
% 0.24/0.55  % Equation resolutions                 : 0
% 0.24/0.55  % Disequality decompositions           : 0
% 0.24/0.55  % Total rewrite steps                  : 3
% 0.24/0.55  % ...of those cached                   : 0
% 0.24/0.55  % Propositional unsat checks           : 0
% 0.24/0.55  %    Propositional check models        : 0
% 0.24/0.55  %    Propositional check unsatisfiable : 0
% 0.24/0.55  %    Propositional clauses             : 0
% 0.24/0.55  %    Propositional clauses after purity: 0
% 0.24/0.55  %    Propositional unsat core size     : 0
% 0.24/0.55  %    Propositional preprocessing time  : 0.000
% 0.24/0.55  %    Propositional encoding time       : 0.000
% 0.24/0.55  %    Propositional solver time         : 0.000
% 0.24/0.55  %    Success case prop preproc time    : 0.000
% 0.24/0.55  %    Success case prop encoding time   : 0.000
% 0.24/0.55  %    Success case prop solver time     : 0.000
% 0.24/0.55  % Current number of processed clauses  : 12
% 0.24/0.55  %    Positive orientable unit clauses  : 3
% 0.24/0.55  %    Positive unorientable unit clauses: 0
% 0.24/0.55  %    Negative unit clauses             : 1
% 0.24/0.55  %    Non-unit-clauses                  : 8
% 0.24/0.55  % Current number of unprocessed clauses: 0
% 0.24/0.55  % ...number of literals in the above   : 0
% 0.24/0.55  % Current number of archived formulas  : 0
% 0.24/0.55  % Current number of archived clauses   : 0
% 0.24/0.55  % Clause-clause subsumption calls (NU) : 6
% 0.24/0.55  % Rec. Clause-clause subsumption calls : 5
% 0.24/0.55  % Non-unit clause-clause subsumptions  : 1
% 0.24/0.55  % Unit Clause-clause subsumption calls : 0
% 0.24/0.55  % Rewrite failures with RHS unbound    : 0
% 0.24/0.55  % BW rewrite match attempts            : 0
% 0.24/0.55  % BW rewrite match successes           : 0
% 0.24/0.55  % Condensation attempts                : 0
% 0.24/0.55  % Condensation successes               : 0
% 0.24/0.55  % Termbank termtop insertions          : 810
% 0.24/0.55  % Search garbage collected termcells   : 250
% 0.24/0.55  
% 0.24/0.55  % -------------------------------------------------
% 0.24/0.55  % User time                : 0.005 s
% 0.24/0.55  % System time              : 0.001 s
% 0.24/0.55  % Total time               : 0.006 s
% 0.24/0.55  % Maximum resident set size: 3632 pages
% 0.24/0.55  
% 0.24/0.55  % -------------------------------------------------
% 0.24/0.55  % User time                : 0.010 s
% 0.24/0.55  % System time              : 0.012 s
% 0.24/0.55  % Total time               : 0.022 s
% 0.24/0.55  % Maximum resident set size: 4608 pages
% 0.24/0.55  % E exiting
%------------------------------------------------------------------------------