↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n009.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 08:39:41 EDT 2022

% Result   : Theorem 8.61s 2.37s
% Output   : CNFRefutation 8.61s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   18 (  10 unt;   0 nHn;  18 RR)
%            Number of literals    :   30 (  13 equ;  14 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-1 aty)
%            Number of variables   :    6 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
    ( relation_inverse(X1) = function_inverse(X1)
    | ~ relation(X1)
    | ~ function(X1)
    | ~ one_to_one(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zbzw6a9a/lgb.p',i_0_1) ).

cnf(i_0_18,negated_conjecture,
    one_to_one(esk3_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zbzw6a9a/lgb.p',i_0_18) ).

cnf(i_0_19,negated_conjecture,
    function(esk3_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zbzw6a9a/lgb.p',i_0_19) ).

cnf(i_0_20,negated_conjecture,
    relation(esk3_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zbzw6a9a/lgb.p',i_0_20) ).

cnf(i_0_15,plain,
    ( relation_rng(relation_inverse(X1)) = relation_dom(X1)
    | ~ relation(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zbzw6a9a/lgb.p',i_0_15) ).

cnf(i_0_16,plain,
    ( relation_dom(relation_inverse(X1)) = relation_rng(X1)
    | ~ relation(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zbzw6a9a/lgb.p',i_0_16) ).

cnf(i_0_17,negated_conjecture,
    ( relation_dom(function_inverse(esk3_0)) != relation_rng(esk3_0)
    | relation_dom(esk3_0) != relation_rng(function_inverse(esk3_0)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zbzw6a9a/lgb.p',i_0_17) ).

cnf(c_0_28,plain,
    ( relation_inverse(X1) = function_inverse(X1)
    | ~ relation(X1)
    | ~ function(X1)
    | ~ one_to_one(X1) ),
    i_0_1 ).

cnf(c_0_29,negated_conjecture,
    one_to_one(esk3_0),
    i_0_18 ).

cnf(c_0_30,negated_conjecture,
    function(esk3_0),
    i_0_19 ).

cnf(c_0_31,negated_conjecture,
    relation(esk3_0),
    i_0_20 ).

cnf(c_0_32,plain,
    ( relation_rng(relation_inverse(X1)) = relation_dom(X1)
    | ~ relation(X1) ),
    i_0_15 ).

cnf(c_0_33,plain,
    ( relation_dom(relation_inverse(X1)) = relation_rng(X1)
    | ~ relation(X1) ),
    i_0_16 ).

cnf(c_0_34,negated_conjecture,
    ( relation_dom(function_inverse(esk3_0)) != relation_rng(esk3_0)
    | relation_dom(esk3_0) != relation_rng(function_inverse(esk3_0)) ),
    i_0_17 ).

cnf(c_0_35,negated_conjecture,
    function_inverse(esk3_0) = relation_inverse(esk3_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31])]) ).

cnf(c_0_36,negated_conjecture,
    relation_rng(relation_inverse(esk3_0)) = relation_dom(esk3_0),
    inference(spm,[status(thm)],[c_0_32,c_0_31]) ).

cnf(c_0_37,negated_conjecture,
    relation_dom(relation_inverse(esk3_0)) = relation_rng(esk3_0),
    inference(spm,[status(thm)],[c_0_33,c_0_31]) ).

cnf(c_0_38,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_35]),c_0_37])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SEU219+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n009.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 Jun 19 17:05:39 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 8.61/2.37  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.61/2.37  # No SInE strategy applied
% 8.61/2.37  # Trying AutoSched0 for 150 seconds
% 8.61/2.37  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S04AI
% 8.61/2.37  # and selection function SelectComplexExceptUniqMaxHorn.
% 8.61/2.37  #
% 8.61/2.37  # Preprocessing time       : 0.022 s
% 8.61/2.37  # Presaturation interreduction done
% 8.61/2.37  
% 8.61/2.37  # Proof found!
% 8.61/2.37  # SZS status Theorem
% 8.61/2.37  # SZS output start CNFRefutation
% See solution above
% 8.61/2.37  # Training examples: 0 positive, 0 negative
% 8.61/2.37  
% 8.61/2.37  # -------------------------------------------------
% 8.61/2.37  # User time                : 0.023 s
% 8.61/2.37  # System time              : 0.004 s
% 8.61/2.37  # Total time               : 0.028 s
% 8.61/2.37  # Maximum resident set size: 7124 pages
% 8.61/2.37  
%------------------------------------------------------------------------------