%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET011+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:07:55 EDT 2022
% Result : Theorem 15.54s 3.35s
% Output : CNFRefutation 15.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of clauses : 44 ( 12 unt; 12 nHn; 25 RR)
% Number of literals : 85 ( 8 equ; 33 neg)
% Maximal clause size : 3 ( 1 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 : 111 ( 13 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_11,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z26as0ds/input.p',i_0_11) ).
cnf(i_0_4,plain,
( member(X1,X2)
| member(X1,difference(X3,X2))
| ~ member(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z26as0ds/input.p',i_0_4) ).
cnf(i_0_12,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z26as0ds/input.p',i_0_12) ).
cnf(i_0_1,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z26as0ds/input.p',i_0_1) ).
cnf(i_0_6,plain,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z26as0ds/input.p',i_0_6) ).
cnf(i_0_5,plain,
( ~ member(X1,X2)
| ~ member(X1,difference(X3,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z26as0ds/input.p',i_0_5) ).
cnf(i_0_2,plain,
( member(X1,X2)
| ~ member(X1,intersection(X3,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z26as0ds/input.p',i_0_2) ).
cnf(i_0_3,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z26as0ds/input.p',i_0_3) ).
cnf(i_0_10,plain,
intersection(X1,X2) = intersection(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z26as0ds/input.p',i_0_10) ).
cnf(i_0_7,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z26as0ds/input.p',i_0_7) ).
cnf(i_0_19,negated_conjecture,
difference(esk3_0,difference(esk3_0,esk4_0)) != intersection(esk3_0,esk4_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z26as0ds/input.p',i_0_19) ).
cnf(c_0_31,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
i_0_11 ).
cnf(c_0_32,plain,
( member(X1,X2)
| member(X1,difference(X3,X2))
| ~ member(X1,X3) ),
i_0_4 ).
cnf(c_0_33,plain,
( member(esk1_2(X1,difference(X2,X3)),X3)
| subset(X1,difference(X2,X3))
| ~ member(esk1_2(X1,difference(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_34,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
i_0_12 ).
cnf(c_0_35,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
i_0_1 ).
cnf(c_0_36,plain,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
i_0_6 ).
cnf(c_0_37,plain,
( ~ member(X1,X2)
| ~ member(X1,difference(X3,X2)) ),
i_0_5 ).
cnf(c_0_38,plain,
( member(X1,X2)
| ~ member(X1,intersection(X3,X2)) ),
i_0_2 ).
cnf(c_0_39,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
i_0_3 ).
cnf(c_0_40,plain,
( member(esk1_2(X1,difference(X1,X2)),X2)
| subset(X1,difference(X1,X2)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_41,plain,
( subset(X1,intersection(X2,X3))
| ~ member(esk1_2(X1,intersection(X2,X3)),X3)
| ~ member(esk1_2(X1,intersection(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_35]) ).
cnf(c_0_42,plain,
( member(esk1_2(difference(X1,X2),X3),X1)
| subset(difference(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_36,c_0_34]) ).
cnf(c_0_43,plain,
( subset(difference(X1,X2),X3)
| ~ member(esk1_2(difference(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_37,c_0_34]) ).
cnf(c_0_44,plain,
( member(esk1_2(intersection(X1,X2),X3),X2)
| subset(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_38,c_0_34]) ).
cnf(c_0_45,plain,
( member(esk1_2(intersection(X1,X2),X3),X1)
| subset(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_39,c_0_34]) ).
cnf(c_0_46,plain,
( subset(X1,difference(X1,difference(X2,X3)))
| ~ member(esk1_2(X1,difference(X1,difference(X2,X3))),X3) ),
inference(spm,[status(thm)],[c_0_37,c_0_40]) ).
cnf(c_0_47,plain,
( subset(difference(X1,X2),intersection(X3,X1))
| ~ member(esk1_2(difference(X1,X2),intersection(X3,X1)),X3) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,plain,
intersection(X1,X2) = intersection(X2,X1),
i_0_10 ).
cnf(c_0_49,plain,
( member(esk1_2(difference(X1,difference(X2,X3)),X4),X3)
| subset(difference(X1,difference(X2,X3)),X4)
| ~ member(esk1_2(difference(X1,difference(X2,X3)),X4),X2) ),
inference(spm,[status(thm)],[c_0_43,c_0_32]) ).
cnf(c_0_50,plain,
( subset(intersection(X1,difference(X2,X3)),X4)
| ~ member(esk1_2(intersection(X1,difference(X2,X3)),X4),X3) ),
inference(spm,[status(thm)],[c_0_37,c_0_44]) ).
cnf(c_0_51,plain,
( member(esk1_2(intersection(X1,X2),difference(X1,X3)),X3)
| subset(intersection(X1,X2),difference(X1,X3)) ),
inference(spm,[status(thm)],[c_0_33,c_0_45]) ).
cnf(c_0_52,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
i_0_7 ).
cnf(c_0_53,plain,
subset(X1,difference(X1,difference(X2,X1))),
inference(spm,[status(thm)],[c_0_46,c_0_34]) ).
cnf(c_0_54,plain,
subset(difference(X1,X2),X1),
inference(spm,[status(thm)],[c_0_31,c_0_42]) ).
cnf(c_0_55,plain,
( subset(difference(X1,X2),intersection(X1,X3))
| ~ member(esk1_2(difference(X1,X2),intersection(X1,X3)),X3) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_56,plain,
( member(esk1_2(difference(X1,difference(X1,X2)),X3),X2)
| subset(difference(X1,difference(X1,X2)),X3) ),
inference(spm,[status(thm)],[c_0_49,c_0_42]) ).
cnf(c_0_57,plain,
subset(intersection(X1,difference(X2,X3)),difference(X1,X3)),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_58,plain,
difference(X1,difference(X2,X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54])]) ).
cnf(c_0_59,plain,
subset(difference(X1,difference(X1,X2)),intersection(X1,X2)),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_60,plain,
subset(intersection(X1,X2),difference(X1,difference(X3,X2))),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_61,negated_conjecture,
difference(esk3_0,difference(esk3_0,esk4_0)) != intersection(esk3_0,esk4_0),
i_0_19 ).
cnf(c_0_62,plain,
difference(X1,difference(X1,X2)) = intersection(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_59]),c_0_60])]) ).
cnf(c_0_63,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET011+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/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 05:41:16 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 15.54/3.35 # ENIGMATIC: Solved by Enigma+tptp-cade20-model02-h2e15+lgb-t150-d30-l6400-e0.15+coop-mzr02:
% 15.54/3.35 # 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)
% 15.54/3.35 # Preprocessing time : 0.868 s
% 15.54/3.35
% 15.54/3.35 # Proof found!
% 15.54/3.35 # SZS status Theorem
% 15.54/3.35 # SZS output start CNFRefutation
% See solution above
% 15.54/3.35 # Training examples: 0 positive, 0 negative
% 15.54/3.35
% 15.54/3.35 # -------------------------------------------------
% 15.54/3.35 # User time : 0.894 s
% 15.54/3.35 # System time : 0.123 s
% 15.54/3.35 # Total time : 1.017 s
% 15.54/3.35 # ...preprocessing : 0.868 s
% 15.54/3.35 # ...main loop : 0.148 s
% 15.54/3.35 # Maximum resident set size: 168824 pages
% 15.54/3.35
%------------------------------------------------------------------------------