TSTP Solution File: SEU135+1 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SEU135+1 : TPTP v8.1.0. Released v3.3.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 : Tue Jul 19 08:38:43 EDT 2022

% Result   : Theorem 18.16s 3.67s
% Output   : CNFRefutation 18.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   48 (  14 unt;  15 nHn;  26 RR)
%            Number of literals    :  103 (  22 equ;  40 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :  132 (  14 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_9,plain,
    ( in(X1,X2)
    | X2 != set_union2(X3,X4)
    | ~ in(X1,X4) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bkhuy3mi/input.p',i_0_9) ).

cnf(i_0_10,plain,
    ( in(X1,X2)
    | X2 != set_union2(X3,X4)
    | ~ in(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bkhuy3mi/input.p',i_0_10) ).

cnf(i_0_11,plain,
    ( in(X1,X2)
    | in(X1,X3)
    | X4 != set_union2(X3,X2)
    | ~ in(X1,X4) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bkhuy3mi/input.p',i_0_11) ).

cnf(i_0_12,plain,
    ( subset(X1,X2)
    | ~ in(esk2_2(X1,X2),X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bkhuy3mi/input.p',i_0_12) ).

cnf(i_0_13,plain,
    ( subset(X1,X2)
    | in(esk2_2(X1,X2),X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bkhuy3mi/input.p',i_0_13) ).

cnf(i_0_20,plain,
    ( in(X1,X2)
    | X3 != set_difference(X2,X4)
    | ~ in(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bkhuy3mi/input.p',i_0_20) ).

cnf(i_0_18,plain,
    ( in(X1,X2)
    | in(X1,X3)
    | X2 != set_difference(X4,X3)
    | ~ in(X1,X4) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bkhuy3mi/input.p',i_0_18) ).

cnf(i_0_3,plain,
    ( X1 = X2
    | ~ subset(X2,X1)
    | ~ subset(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bkhuy3mi/input.p',i_0_3) ).

cnf(i_0_2,plain,
    set_union2(X1,X2) = set_union2(X2,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bkhuy3mi/input.p',i_0_2) ).

cnf(i_0_32,negated_conjecture,
    set_union2(esk6_0,set_difference(esk7_0,esk6_0)) != set_union2(esk6_0,esk7_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bkhuy3mi/input.p',i_0_32) ).

cnf(c_0_43,plain,
    ( in(X1,X2)
    | X2 != set_union2(X3,X4)
    | ~ in(X1,X4) ),
    i_0_9 ).

cnf(c_0_44,plain,
    ( in(X1,X2)
    | X2 != set_union2(X3,X4)
    | ~ in(X1,X3) ),
    i_0_10 ).

cnf(c_0_45,plain,
    ( in(X1,X2)
    | in(X1,X3)
    | X4 != set_union2(X3,X2)
    | ~ in(X1,X4) ),
    i_0_11 ).

cnf(c_0_46,plain,
    ( subset(X1,X2)
    | ~ in(esk2_2(X1,X2),X2) ),
    i_0_12 ).

cnf(c_0_47,plain,
    ( in(X1,set_union2(X2,X3))
    | ~ in(X1,X3) ),
    inference(er,[status(thm)],[c_0_43]) ).

cnf(c_0_48,plain,
    ( in(X1,set_union2(X2,X3))
    | ~ in(X1,X2) ),
    inference(er,[status(thm)],[c_0_44]) ).

cnf(c_0_49,plain,
    ( in(X1,X2)
    | in(X1,X3)
    | ~ in(X1,set_union2(X2,X3)) ),
    inference(er,[status(thm)],[c_0_45]) ).

cnf(c_0_50,plain,
    ( subset(X1,X2)
    | in(esk2_2(X1,X2),X1) ),
    i_0_13 ).

cnf(c_0_51,plain,
    ( in(X1,X2)
    | X3 != set_difference(X2,X4)
    | ~ in(X1,X3) ),
    i_0_20 ).

cnf(c_0_52,plain,
    ( subset(X1,set_union2(X2,X3))
    | ~ in(esk2_2(X1,set_union2(X2,X3)),X3) ),
    inference(spm,[status(thm)],[c_0_46,c_0_47]) ).

cnf(c_0_53,plain,
    ( subset(X1,set_union2(X2,X3))
    | ~ in(esk2_2(X1,set_union2(X2,X3)),X2) ),
    inference(spm,[status(thm)],[c_0_46,c_0_48]) ).

cnf(c_0_54,plain,
    ( in(esk2_2(set_union2(X1,X2),X3),X2)
    | in(esk2_2(set_union2(X1,X2),X3),X1)
    | subset(set_union2(X1,X2),X3) ),
    inference(spm,[status(thm)],[c_0_49,c_0_50]) ).

cnf(c_0_55,plain,
    ( in(X1,X2)
    | ~ in(X1,set_difference(X2,X3)) ),
    inference(er,[status(thm)],[c_0_51]) ).

cnf(c_0_56,plain,
    ( subset(X1,set_union2(X2,set_union2(X3,X4)))
    | ~ in(esk2_2(X1,set_union2(X2,set_union2(X3,X4))),X3) ),
    inference(spm,[status(thm)],[c_0_52,c_0_48]) ).

cnf(c_0_57,plain,
    ( in(esk2_2(set_union2(X1,X2),set_union2(X1,X3)),X2)
    | subset(set_union2(X1,X2),set_union2(X1,X3)) ),
    inference(spm,[status(thm)],[c_0_53,c_0_54]) ).

cnf(c_0_58,plain,
    ( in(esk2_2(set_union2(X1,X2),set_union2(X3,X1)),X2)
    | subset(set_union2(X1,X2),set_union2(X3,X1)) ),
    inference(spm,[status(thm)],[c_0_52,c_0_54]) ).

cnf(c_0_59,plain,
    ( in(esk2_2(set_union2(X1,set_difference(X2,X3)),X4),X1)
    | in(esk2_2(set_union2(X1,set_difference(X2,X3)),X4),X2)
    | subset(set_union2(X1,set_difference(X2,X3)),X4) ),
    inference(spm,[status(thm)],[c_0_55,c_0_54]) ).

cnf(c_0_60,plain,
    ( in(X1,X2)
    | in(X1,X3)
    | X2 != set_difference(X4,X3)
    | ~ in(X1,X4) ),
    i_0_18 ).

cnf(c_0_61,plain,
    ( X1 = X2
    | ~ subset(X2,X1)
    | ~ subset(X1,X2) ),
    i_0_3 ).

cnf(c_0_62,plain,
    subset(set_union2(X1,X2),set_union2(X1,set_union2(X2,X3))),
    inference(spm,[status(thm)],[c_0_56,c_0_57]) ).

cnf(c_0_63,plain,
    subset(set_union2(X1,set_union2(X2,X1)),set_union2(X2,X1)),
    inference(spm,[status(thm)],[c_0_46,c_0_58]) ).

cnf(c_0_64,plain,
    subset(X1,set_union2(X2,X1)),
    inference(spm,[status(thm)],[c_0_52,c_0_50]) ).

cnf(c_0_65,plain,
    ( in(esk2_2(set_union2(X1,set_difference(X1,X2)),X3),X1)
    | subset(set_union2(X1,set_difference(X1,X2)),X3) ),
    inference(ef,[status(thm)],[c_0_59]) ).

cnf(c_0_66,plain,
    set_union2(X1,X2) = set_union2(X2,X1),
    i_0_2 ).

cnf(c_0_67,plain,
    ( in(X1,set_difference(X2,X3))
    | in(X1,X3)
    | ~ in(X1,X2) ),
    inference(er,[status(thm)],[c_0_60]) ).

cnf(c_0_68,plain,
    ( set_union2(X1,set_union2(X2,X3)) = set_union2(X1,X2)
    | ~ subset(set_union2(X1,set_union2(X2,X3)),set_union2(X1,X2)) ),
    inference(spm,[status(thm)],[c_0_61,c_0_62]) ).

cnf(c_0_69,plain,
    set_union2(X1,set_union2(X2,X1)) = set_union2(X2,X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_63]),c_0_64])]) ).

cnf(c_0_70,plain,
    subset(set_union2(X1,set_difference(X1,X2)),X1),
    inference(spm,[status(thm)],[c_0_46,c_0_65]) ).

cnf(c_0_71,plain,
    subset(X1,set_union2(X1,X2)),
    inference(spm,[status(thm)],[c_0_64,c_0_66]) ).

cnf(c_0_72,plain,
    ( in(esk2_2(X1,set_union2(set_difference(X2,X3),X4)),X3)
    | subset(X1,set_union2(set_difference(X2,X3),X4))
    | ~ in(esk2_2(X1,set_union2(set_difference(X2,X3),X4)),X2) ),
    inference(spm,[status(thm)],[c_0_53,c_0_67]) ).

cnf(c_0_73,plain,
    ( set_union2(X1,set_union2(X2,X3)) = set_union2(X1,X3)
    | ~ subset(set_union2(X1,set_union2(X2,X3)),set_union2(X1,X3)) ),
    inference(spm,[status(thm)],[c_0_68,c_0_69]) ).

cnf(c_0_74,plain,
    set_union2(X1,set_difference(X1,X2)) = X1,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_70]),c_0_71])]) ).

cnf(c_0_75,plain,
    ( in(esk2_2(set_union2(X1,X2),set_union2(set_difference(X2,X3),X1)),X3)
    | subset(set_union2(X1,X2),set_union2(set_difference(X2,X3),X1)) ),
    inference(spm,[status(thm)],[c_0_72,c_0_58]) ).

cnf(c_0_76,plain,
    ( set_union2(X1,set_difference(X2,X3)) = set_union2(X1,X2)
    | ~ subset(set_union2(X1,X2),set_union2(X1,set_difference(X2,X3))) ),
    inference(spm,[status(thm)],[c_0_73,c_0_74]) ).

cnf(c_0_77,plain,
    subset(set_union2(X1,X2),set_union2(X1,set_difference(X2,X1))),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_75]),c_0_66]) ).

cnf(c_0_78,negated_conjecture,
    set_union2(esk6_0,set_difference(esk7_0,esk6_0)) != set_union2(esk6_0,esk7_0),
    i_0_32 ).

cnf(c_0_79,plain,
    set_union2(X1,set_difference(X2,X1)) = set_union2(X1,X2),
    inference(spm,[status(thm)],[c_0_76,c_0_77]) ).

cnf(c_0_80,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_79])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SEU135+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13  % 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.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Mon Jun 20 11:14:35 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 18.16/3.67  # ENIGMATIC: Solved by Enigma+tptp-cade20-model02-h2e15+lgb-t150-d30-l6400-e0.15+coop-mzr02:
% 18.16/3.67  # ENIGMA: LightGBM model '/export/starexec/sandbox/solver/bin/data/Enigma/tptp-cade20-model02-h2e15/lgb-t150-d30-l6400-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 23; version: 991; iters: 150)
% 18.16/3.67  # Preprocessing time       : 0.855 s
% 18.16/3.67  
% 18.16/3.67  # Proof found!
% 18.16/3.67  # SZS status Theorem
% 18.16/3.67  # SZS output start CNFRefutation
% See solution above
% 18.16/3.67  # Training examples: 0 positive, 0 negative
% 18.16/3.67  
% 18.16/3.67  # -------------------------------------------------
% 18.16/3.67  # User time                : 1.299 s
% 18.16/3.67  # System time              : 0.135 s
% 18.16/3.67  # Total time               : 1.434 s
% 18.16/3.67  # ...preprocessing         : 0.855 s
% 18.16/3.67  # ...main loop             : 0.580 s
% 18.16/3.67  # Maximum resident set size: 168620 pages
% 18.16/3.67  
%------------------------------------------------------------------------------