↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n017.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:34 EDT 2022

% Result   : Theorem 7.65s 2.39s
% Output   : CNFRefutation 7.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   38 (  12 unt;   8 nHn;  33 RR)
%            Number of literals    :   89 (  26 equ;  48 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   24 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_18,negated_conjecture,
    ( union(esk4_0,esk5_0) = esk3_0
    | subset(esk3_0,X1)
    | ~ subset(esk4_0,X1)
    | ~ subset(esk5_0,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9c54zcws/lgb.p',i_0_18) ).

cnf(i_0_1,plain,
    subset(X1,union(X1,X2)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9c54zcws/lgb.p',i_0_1) ).

cnf(i_0_12,plain,
    union(X1,X2) = union(X2,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9c54zcws/lgb.p',i_0_12) ).

cnf(i_0_20,negated_conjecture,
    ( union(esk4_0,esk5_0) = esk3_0
    | subset(esk4_0,esk3_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9c54zcws/lgb.p',i_0_20) ).

cnf(i_0_9,plain,
    ( X1 = X2
    | ~ subset(X2,X1)
    | ~ subset(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9c54zcws/lgb.p',i_0_9) ).

cnf(i_0_19,negated_conjecture,
    ( union(esk4_0,esk5_0) = esk3_0
    | subset(esk5_0,esk3_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9c54zcws/lgb.p',i_0_19) ).

cnf(i_0_22,negated_conjecture,
    ( subset(esk5_0,esk6_0)
    | union(esk4_0,esk5_0) != esk3_0
    | ~ subset(esk4_0,esk3_0)
    | ~ subset(esk5_0,esk3_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9c54zcws/lgb.p',i_0_22) ).

cnf(i_0_23,negated_conjecture,
    ( subset(esk4_0,esk6_0)
    | union(esk4_0,esk5_0) != esk3_0
    | ~ subset(esk4_0,esk3_0)
    | ~ subset(esk5_0,esk3_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9c54zcws/lgb.p',i_0_23) ).

cnf(i_0_21,negated_conjecture,
    ( union(esk4_0,esk5_0) != esk3_0
    | ~ subset(esk3_0,esk6_0)
    | ~ subset(esk4_0,esk3_0)
    | ~ subset(esk5_0,esk3_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9c54zcws/lgb.p',i_0_21) ).

cnf(i_0_2,plain,
    ( subset(union(X1,X2),X3)
    | ~ subset(X2,X3)
    | ~ subset(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9c54zcws/lgb.p',i_0_2) ).

cnf(c_0_34,negated_conjecture,
    ( union(esk4_0,esk5_0) = esk3_0
    | subset(esk3_0,X1)
    | ~ subset(esk4_0,X1)
    | ~ subset(esk5_0,X1) ),
    i_0_18 ).

cnf(c_0_35,plain,
    subset(X1,union(X1,X2)),
    i_0_1 ).

cnf(c_0_36,plain,
    union(X1,X2) = union(X2,X1),
    i_0_12 ).

cnf(c_0_37,plain,
    ( union(esk4_0,esk5_0) = esk3_0
    | subset(esk3_0,union(esk5_0,X1))
    | ~ subset(esk4_0,union(esk5_0,X1)) ),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_38,plain,
    subset(X1,union(X2,X1)),
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_39,negated_conjecture,
    ( union(esk4_0,esk5_0) = esk3_0
    | subset(esk4_0,esk3_0) ),
    i_0_20 ).

cnf(c_0_40,plain,
    ( X1 = X2
    | ~ subset(X2,X1)
    | ~ subset(X1,X2) ),
    i_0_9 ).

cnf(c_0_41,plain,
    ( union(esk4_0,esk5_0) = esk3_0
    | subset(esk3_0,union(esk4_0,esk5_0)) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_36]) ).

cnf(c_0_42,negated_conjecture,
    ( union(esk4_0,esk5_0) = esk3_0
    | subset(esk5_0,esk3_0) ),
    i_0_19 ).

cnf(c_0_43,negated_conjecture,
    ( subset(esk5_0,esk6_0)
    | union(esk4_0,esk5_0) != esk3_0
    | ~ subset(esk4_0,esk3_0)
    | ~ subset(esk5_0,esk3_0) ),
    i_0_22 ).

cnf(c_0_44,negated_conjecture,
    subset(esk4_0,esk3_0),
    inference(spm,[status(thm)],[c_0_35,c_0_39]) ).

cnf(c_0_45,negated_conjecture,
    ( subset(esk4_0,esk6_0)
    | union(esk4_0,esk5_0) != esk3_0
    | ~ subset(esk4_0,esk3_0)
    | ~ subset(esk5_0,esk3_0) ),
    i_0_23 ).

cnf(c_0_46,negated_conjecture,
    ( union(esk4_0,esk5_0) != esk3_0
    | ~ subset(esk3_0,esk6_0)
    | ~ subset(esk4_0,esk3_0)
    | ~ subset(esk5_0,esk3_0) ),
    i_0_21 ).

cnf(c_0_47,plain,
    ( union(esk4_0,esk5_0) = esk3_0
    | ~ subset(union(esk4_0,esk5_0),esk3_0) ),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

cnf(c_0_48,plain,
    ( subset(union(X1,X2),X3)
    | ~ subset(X2,X3)
    | ~ subset(X1,X3) ),
    i_0_2 ).

cnf(c_0_49,negated_conjecture,
    subset(esk5_0,esk3_0),
    inference(spm,[status(thm)],[c_0_38,c_0_42]) ).

cnf(c_0_50,negated_conjecture,
    ( subset(esk5_0,esk6_0)
    | union(esk4_0,esk5_0) != esk3_0
    | ~ subset(esk5_0,esk3_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]) ).

cnf(c_0_51,negated_conjecture,
    ( subset(esk4_0,esk6_0)
    | union(esk4_0,esk5_0) != esk3_0
    | ~ subset(esk5_0,esk3_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_44])]) ).

cnf(c_0_52,negated_conjecture,
    ( union(esk4_0,esk5_0) != esk3_0
    | ~ subset(esk5_0,esk3_0)
    | ~ subset(esk3_0,esk6_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_44])]) ).

cnf(c_0_53,plain,
    union(esk4_0,esk5_0) = esk3_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),c_0_44])]) ).

cnf(c_0_54,negated_conjecture,
    ( subset(esk5_0,esk6_0)
    | union(esk4_0,esk5_0) != esk3_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_49])]) ).

cnf(c_0_55,negated_conjecture,
    ( subset(esk4_0,esk6_0)
    | union(esk4_0,esk5_0) != esk3_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_49])]) ).

cnf(c_0_56,negated_conjecture,
    ( union(esk4_0,esk5_0) != esk3_0
    | ~ subset(esk3_0,esk6_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_49])]) ).

cnf(c_0_57,plain,
    ( subset(esk3_0,X1)
    | ~ subset(esk5_0,X1)
    | ~ subset(esk4_0,X1) ),
    inference(spm,[status(thm)],[c_0_48,c_0_53]) ).

cnf(c_0_58,negated_conjecture,
    subset(esk5_0,esk6_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_53])]) ).

cnf(c_0_59,negated_conjecture,
    subset(esk4_0,esk6_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_53])]) ).

cnf(c_0_60,negated_conjecture,
    ~ subset(esk3_0,esk6_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_53])]) ).

cnf(c_0_61,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59])]),c_0_60]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14  % Problem  : SET597+3 : TPTP v8.1.0. Released v2.2.0.
% 0.04/0.14  % Command  : enigmatic-eprover.py %s %d 1
% 0.14/0.36  % Computer : n017.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Sun Jul 10 15:05:20 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.22/0.48  # ENIGMATIC: Selected complete mode:
% 7.65/2.39  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.65/2.39  # No SInE strategy applied
% 7.65/2.39  # Trying AutoSched0 for 150 seconds
% 7.65/2.39  # AutoSched0-Mode selected heuristic G_E___301_C18_F1_URBAN_S0Y
% 7.65/2.39  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.65/2.39  #
% 7.65/2.39  # Preprocessing time       : 0.012 s
% 7.65/2.39  
% 7.65/2.39  # Proof found!
% 7.65/2.39  # SZS status Theorem
% 7.65/2.39  # SZS output start CNFRefutation
% See solution above
% 7.65/2.39  # Training examples: 0 positive, 0 negative
% 7.65/2.39  
% 7.65/2.39  # -------------------------------------------------
% 7.65/2.39  # User time                : 0.014 s
% 7.65/2.39  # System time              : 0.005 s
% 7.65/2.39  # Total time               : 0.018 s
% 7.65/2.39  # Maximum resident set size: 7124 pages
% 7.65/2.39  
%------------------------------------------------------------------------------