↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : TOP022+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n021.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:24:30 EDT 2022

% Result   : Theorem 7.60s 2.45s
% Output   : CNFRefutation 7.60s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   17 (   9 unt;   0 nHn;  17 RR)
%            Number of literals    :   31 (   0 equ;  16 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-4 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-3 aty)
%            Number of variables   :   27 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
    ( isomorphic_groups(X1,X2)
    | ~ a_group_isomorphism_from_to(X3,X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1cftljm3/lgb.p',i_0_1) ).

cnf(i_0_7,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) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1cftljm3/lgb.p',i_0_7) ).

cnf(i_0_6,plain,
    ( a_path_from_to_in(esk2_3(X1,X2,X3),X2,X3,X1)
    | ~ path_connected(X1)
    | ~ a_member_of(X3,X1)
    | ~ a_member_of(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1cftljm3/lgb.p',i_0_6) ).

cnf(i_0_8,negated_conjecture,
    ~ isomorphic_groups(first_homotop_grp(esk3_0,esk4_0),first_homotop_grp(esk3_0,esk5_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1cftljm3/lgb.p',i_0_8) ).

cnf(i_0_11,negated_conjecture,
    path_connected(esk3_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1cftljm3/lgb.p',i_0_11) ).

cnf(i_0_9,negated_conjecture,
    a_member_of(esk5_0,esk3_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1cftljm3/lgb.p',i_0_9) ).

cnf(i_0_10,negated_conjecture,
    a_member_of(esk4_0,esk3_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1cftljm3/lgb.p',i_0_10) ).

cnf(c_0_19,plain,
    ( isomorphic_groups(X1,X2)
    | ~ a_group_isomorphism_from_to(X3,X1,X2) ),
    i_0_1 ).

cnf(c_0_20,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) ),
    i_0_7 ).

cnf(c_0_21,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_19,c_0_20]) ).

cnf(c_0_22,plain,
    ( a_path_from_to_in(esk2_3(X1,X2,X3),X2,X3,X1)
    | ~ path_connected(X1)
    | ~ a_member_of(X3,X1)
    | ~ a_member_of(X2,X1) ),
    i_0_6 ).

cnf(c_0_23,negated_conjecture,
    ~ isomorphic_groups(first_homotop_grp(esk3_0,esk4_0),first_homotop_grp(esk3_0,esk5_0)),
    i_0_8 ).

cnf(c_0_24,plain,
    ( isomorphic_groups(first_homotop_grp(X1,X2),first_homotop_grp(X1,X3))
    | ~ path_connected(X1)
    | ~ a_member_of(X3,X1)
    | ~ a_member_of(X2,X1) ),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_25,negated_conjecture,
    path_connected(esk3_0),
    i_0_11 ).

cnf(c_0_26,negated_conjecture,
    a_member_of(esk5_0,esk3_0),
    i_0_9 ).

cnf(c_0_27,negated_conjecture,
    a_member_of(esk4_0,esk3_0),
    i_0_10 ).

cnf(c_0_28,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_23,c_0_24]),c_0_25]),c_0_26]),c_0_27])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : TOP022+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n021.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:28:44 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 7.60/2.45  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.60/2.45  # No SInE strategy applied
% 7.60/2.45  # Trying AutoSched0 for 150 seconds
% 7.60/2.45  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.60/2.45  # and selection function SelectComplexExceptUniqMaxHorn.
% 7.60/2.45  #
% 7.60/2.45  # Preprocessing time       : 0.014 s
% 7.60/2.45  # Presaturation interreduction done
% 7.60/2.45  
% 7.60/2.45  # Proof found!
% 7.60/2.45  # SZS status Theorem
% 7.60/2.45  # SZS output start CNFRefutation
% See solution above
% 7.60/2.45  # Training examples: 0 positive, 0 negative
% 7.60/2.45  
% 7.60/2.45  # -------------------------------------------------
% 7.60/2.45  # User time                : 0.013 s
% 7.60/2.45  # System time              : 0.005 s
% 7.60/2.45  # Total time               : 0.018 s
% 7.60/2.45  # Maximum resident set size: 7128 pages
% 7.60/2.45  
%------------------------------------------------------------------------------