↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n010.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:25 EDT 2022

% Result   : Theorem 7.92s 2.30s
% Output   : CNFRefutation 7.92s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   13 (   6 unt;   0 nHn;   9 RR)
%            Number of literals    :   24 (   0 equ;  15 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   12 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_43,negated_conjecture,
    ~ subset(relation_rng(relation_dom_restriction(esk9_0,esk8_0)),relation_rng(esk9_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pg0un0em/lgb.p',i_0_43) ).

cnf(i_0_32,plain,
    ( subset(relation_rng(X1),relation_rng(X2))
    | ~ relation(X2)
    | ~ relation(X1)
    | ~ subset(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pg0un0em/lgb.p',i_0_32) ).

cnf(i_0_44,negated_conjecture,
    relation(esk9_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pg0un0em/lgb.p',i_0_44) ).

cnf(i_0_41,plain,
    ( subset(relation_dom_restriction(X1,X2),X1)
    | ~ relation(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pg0un0em/lgb.p',i_0_41) ).

cnf(i_0_7,plain,
    ( relation(relation_dom_restriction(X1,X2))
    | ~ relation(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pg0un0em/lgb.p',i_0_7) ).

cnf(c_0_50,negated_conjecture,
    ~ subset(relation_rng(relation_dom_restriction(esk9_0,esk8_0)),relation_rng(esk9_0)),
    i_0_43 ).

cnf(c_0_51,plain,
    ( subset(relation_rng(X1),relation_rng(X2))
    | ~ relation(X2)
    | ~ relation(X1)
    | ~ subset(X1,X2) ),
    i_0_32 ).

cnf(c_0_52,negated_conjecture,
    relation(esk9_0),
    i_0_44 ).

cnf(c_0_53,negated_conjecture,
    ( ~ relation(relation_dom_restriction(esk9_0,esk8_0))
    | ~ subset(relation_dom_restriction(esk9_0,esk8_0),esk9_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52])]) ).

cnf(c_0_54,plain,
    ( subset(relation_dom_restriction(X1,X2),X1)
    | ~ relation(X1) ),
    i_0_41 ).

cnf(c_0_55,plain,
    ~ relation(relation_dom_restriction(esk9_0,esk8_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_52])]) ).

cnf(c_0_56,plain,
    ( relation(relation_dom_restriction(X1,X2))
    | ~ relation(X1) ),
    i_0_7 ).

cnf(c_0_57,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_52])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SEU196+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n010.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 : Sun Jun 19 19:55:39 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 7.92/2.30  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.92/2.30  # No SInE strategy applied
% 7.92/2.30  # Trying AutoSched0 for 150 seconds
% 7.92/2.30  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S05CN
% 7.92/2.30  # and selection function PSelectUnlessUniqMaxSmallestOrientable.
% 7.92/2.30  #
% 7.92/2.30  # Preprocessing time       : 0.022 s
% 7.92/2.30  # Presaturation interreduction done
% 7.92/2.30  
% 7.92/2.30  # Proof found!
% 7.92/2.30  # SZS status Theorem
% 7.92/2.30  # SZS output start CNFRefutation
% See solution above
% 7.92/2.30  # Training examples: 0 positive, 0 negative
% 7.92/2.30  
% 7.92/2.30  # -------------------------------------------------
% 7.92/2.30  # User time                : 0.022 s
% 7.92/2.30  # System time              : 0.004 s
% 7.92/2.30  # Total time               : 0.026 s
% 7.92/2.30  # Maximum resident set size: 7124 pages
% 7.92/2.30  
%------------------------------------------------------------------------------