↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n013.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 00:12:29 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
    ( subset(X1,X2)
    | ~ subset(X3,X2)
    | ~ subset(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-225hn15r/lgb.p',i_0_1) ).

cnf(i_0_2,plain,
    ( subset(difference(X1,X2),difference(X3,X2))
    | ~ subset(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-225hn15r/lgb.p',i_0_2) ).

cnf(i_0_3,plain,
    ( subset(difference(X1,X2),difference(X1,X3))
    | ~ subset(X3,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-225hn15r/lgb.p',i_0_3) ).

cnf(i_0_11,negated_conjecture,
    ~ subset(difference(esk2_0,esk5_0),difference(esk3_0,esk4_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-225hn15r/lgb.p',i_0_11) ).

cnf(i_0_13,negated_conjecture,
    subset(esk2_0,esk3_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-225hn15r/lgb.p',i_0_13) ).

cnf(i_0_12,negated_conjecture,
    subset(esk4_0,esk5_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-225hn15r/lgb.p',i_0_12) ).

cnf(c_0_20,plain,
    ( subset(X1,X2)
    | ~ subset(X3,X2)
    | ~ subset(X1,X3) ),
    i_0_1 ).

cnf(c_0_21,plain,
    ( subset(difference(X1,X2),difference(X3,X2))
    | ~ subset(X1,X3) ),
    i_0_2 ).

cnf(c_0_22,plain,
    ( subset(X1,difference(X2,X3))
    | ~ subset(X1,difference(X4,X3))
    | ~ subset(X4,X2) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_23,plain,
    ( subset(difference(X1,X2),difference(X1,X3))
    | ~ subset(X3,X2) ),
    i_0_3 ).

cnf(c_0_24,negated_conjecture,
    ~ subset(difference(esk2_0,esk5_0),difference(esk3_0,esk4_0)),
    i_0_11 ).

cnf(c_0_25,plain,
    ( subset(difference(X1,X2),difference(X3,X4))
    | ~ subset(X1,X3)
    | ~ subset(X4,X2) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_26,negated_conjecture,
    subset(esk2_0,esk3_0),
    i_0_13 ).

cnf(c_0_27,negated_conjecture,
    subset(esk4_0,esk5_0),
    i_0_12 ).

cnf(c_0_28,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SET589+3 : TPTP v8.1.0. Released v2.2.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n013.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 Jul 10 12:45:46 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 7.05/2.22  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.05/2.22  # No SInE strategy applied
% 7.05/2.22  # Trying AutoSched0 for 150 seconds
% 7.05/2.22  # AutoSched0-Mode selected heuristic G_E___042_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 7.05/2.22  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.05/2.22  #
% 7.05/2.22  # Preprocessing time       : 0.012 s
% 7.05/2.22  # Presaturation interreduction done
% 7.05/2.22  
% 7.05/2.22  # Proof found!
% 7.05/2.22  # SZS status Theorem
% 7.05/2.22  # SZS output start CNFRefutation
% See solution above
% 7.05/2.22  # Training examples: 0 positive, 0 negative
% 7.05/2.22  
% 7.05/2.22  # -------------------------------------------------
% 7.05/2.22  # User time                : 0.022 s
% 7.05/2.22  # System time              : 0.001 s
% 7.05/2.22  # Total time               : 0.023 s
% 7.05/2.22  # Maximum resident set size: 7128 pages
% 7.05/2.22  
%------------------------------------------------------------------------------