%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU162+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n019.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:02 EDT 2022
% Result : Theorem 8.42s 2.52s
% Output : CNFRefutation 8.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 18
% Syntax : Number of clauses : 51 ( 23 unt; 10 nHn; 26 RR)
% Number of literals : 81 ( 30 equ; 28 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 81 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_63,plain,
( X1 = X2
| proper_subset(X1,X2)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nbq3by1f/lgb.p',i_0_63) ).
cnf(i_0_119,lemma,
subset(set_difference(X1,X2),X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nbq3by1f/lgb.p',i_0_119) ).
cnf(i_0_146,negated_conjecture,
( in(esk23_0,esk22_0)
| set_difference(esk22_0,unordered_pair(esk23_0,esk23_0)) != esk22_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nbq3by1f/lgb.p',i_0_146) ).
cnf(i_0_136,lemma,
set_difference(set_union2(X1,X2),X2) = set_difference(X1,X2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nbq3by1f/lgb.p',i_0_136) ).
cnf(i_0_4,plain,
set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nbq3by1f/lgb.p',i_0_4) ).
cnf(i_0_127,lemma,
set_union2(X1,set_difference(X2,X1)) = set_union2(X1,X2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nbq3by1f/lgb.p',i_0_127) ).
cnf(i_0_89,lemma,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nbq3by1f/lgb.p',i_0_89) ).
cnf(i_0_151,lemma,
subset(X1,set_union2(X1,X2)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nbq3by1f/lgb.p',i_0_151) ).
cnf(i_0_143,lemma,
( ~ proper_subset(X1,X2)
| ~ subset(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nbq3by1f/lgb.p',i_0_143) ).
cnf(i_0_90,lemma,
( subset(X1,X2)
| set_difference(X1,X2) != empty_set ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nbq3by1f/lgb.p',i_0_90) ).
cnf(i_0_13,plain,
( X1 = empty_set
| in(esk2_1(X1),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nbq3by1f/lgb.p',i_0_13) ).
cnf(i_0_5,plain,
set_difference(X1,set_difference(X1,X2)) = set_difference(X2,set_difference(X2,X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nbq3by1f/lgb.p',i_0_5) ).
cnf(i_0_131,plain,
set_difference(X1,empty_set) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nbq3by1f/lgb.p',i_0_131) ).
cnf(i_0_141,lemma,
( ~ disjoint(X1,X2)
| ~ in(X3,set_difference(X1,set_difference(X1,X2))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nbq3by1f/lgb.p',i_0_141) ).
cnf(i_0_152,lemma,
( disjoint(X1,X2)
| set_difference(X1,X2) != X1 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nbq3by1f/lgb.p',i_0_152) ).
cnf(i_0_86,lemma,
( in(X1,X2)
| disjoint(unordered_pair(X1,X1),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nbq3by1f/lgb.p',i_0_86) ).
cnf(i_0_85,lemma,
( ~ in(X1,X2)
| ~ disjoint(unordered_pair(X1,X1),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nbq3by1f/lgb.p',i_0_85) ).
cnf(i_0_145,negated_conjecture,
( set_difference(esk22_0,unordered_pair(esk23_0,esk23_0)) = esk22_0
| ~ in(esk23_0,esk22_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nbq3by1f/lgb.p',i_0_145) ).
cnf(c_0_171,plain,
( X1 = X2
| proper_subset(X1,X2)
| ~ subset(X1,X2) ),
i_0_63 ).
cnf(c_0_172,lemma,
subset(set_difference(X1,X2),X1),
i_0_119 ).
cnf(c_0_173,negated_conjecture,
( in(esk23_0,esk22_0)
| set_difference(esk22_0,unordered_pair(esk23_0,esk23_0)) != esk22_0 ),
i_0_146 ).
cnf(c_0_174,lemma,
( set_difference(X1,X2) = X1
| proper_subset(set_difference(X1,X2),X1) ),
inference(spm,[status(thm)],[c_0_171,c_0_172]) ).
cnf(c_0_175,lemma,
set_difference(set_union2(X1,X2),X2) = set_difference(X1,X2),
i_0_136 ).
cnf(c_0_176,plain,
set_union2(X1,X2) = set_union2(X2,X1),
i_0_4 ).
cnf(c_0_177,lemma,
set_union2(X1,set_difference(X2,X1)) = set_union2(X1,X2),
i_0_127 ).
cnf(c_0_178,lemma,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
i_0_89 ).
cnf(c_0_179,lemma,
subset(X1,set_union2(X1,X2)),
i_0_151 ).
cnf(c_0_180,lemma,
( ~ proper_subset(X1,X2)
| ~ subset(X2,X1) ),
i_0_143 ).
cnf(c_0_181,negated_conjecture,
( proper_subset(set_difference(esk22_0,unordered_pair(esk23_0,esk23_0)),esk22_0)
| in(esk23_0,esk22_0) ),
inference(spm,[status(thm)],[c_0_173,c_0_174]) ).
cnf(c_0_182,lemma,
( subset(X1,X2)
| set_difference(X1,X2) != empty_set ),
i_0_90 ).
cnf(c_0_183,plain,
( X1 = empty_set
| in(esk2_1(X1),X1) ),
i_0_13 ).
cnf(c_0_184,plain,
set_difference(X1,set_difference(X1,X2)) = set_difference(X2,set_difference(X2,X1)),
i_0_5 ).
cnf(c_0_185,lemma,
set_difference(set_union2(X1,X2),X1) = set_difference(X2,X1),
inference(spm,[status(thm)],[c_0_175,c_0_176]) ).
cnf(c_0_186,lemma,
set_difference(set_union2(X1,X2),set_difference(X2,X1)) = set_difference(X1,set_difference(X2,X1)),
inference(spm,[status(thm)],[c_0_175,c_0_177]) ).
cnf(c_0_187,lemma,
set_difference(X1,set_union2(X1,X2)) = empty_set,
inference(spm,[status(thm)],[c_0_178,c_0_179]) ).
cnf(c_0_188,plain,
set_difference(X1,empty_set) = X1,
i_0_131 ).
cnf(c_0_189,lemma,
( ~ disjoint(X1,X2)
| ~ in(X3,set_difference(X1,set_difference(X1,X2))) ),
i_0_141 ).
cnf(c_0_190,lemma,
( in(esk23_0,esk22_0)
| ~ subset(esk22_0,set_difference(esk22_0,unordered_pair(esk23_0,esk23_0))) ),
inference(spm,[status(thm)],[c_0_180,c_0_181]) ).
cnf(c_0_191,plain,
( subset(X1,X2)
| in(esk2_1(set_difference(X1,X2)),set_difference(X1,X2)) ),
inference(spm,[status(thm)],[c_0_182,c_0_183]) ).
cnf(c_0_192,lemma,
( disjoint(X1,X2)
| set_difference(X1,X2) != X1 ),
i_0_152 ).
cnf(c_0_193,plain,
set_difference(X1,set_difference(X2,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_184,c_0_185]),c_0_186]),c_0_187]),c_0_188]) ).
cnf(c_0_194,lemma,
( ~ disjoint(X1,X2)
| ~ in(X3,set_difference(X2,set_difference(X2,X1))) ),
inference(spm,[status(thm)],[c_0_189,c_0_184]) ).
cnf(c_0_195,plain,
( in(esk2_1(set_difference(esk22_0,set_difference(esk22_0,unordered_pair(esk23_0,esk23_0)))),set_difference(esk22_0,set_difference(esk22_0,unordered_pair(esk23_0,esk23_0))))
| in(esk23_0,esk22_0) ),
inference(spm,[status(thm)],[c_0_190,c_0_191]) ).
cnf(c_0_196,lemma,
( in(X1,X2)
| disjoint(unordered_pair(X1,X1),X2) ),
i_0_86 ).
cnf(c_0_197,lemma,
( ~ in(X1,X2)
| ~ disjoint(unordered_pair(X1,X1),X2) ),
i_0_85 ).
cnf(c_0_198,lemma,
disjoint(X1,set_difference(X2,X1)),
inference(spm,[status(thm)],[c_0_192,c_0_193]) ).
cnf(c_0_199,negated_conjecture,
( set_difference(esk22_0,unordered_pair(esk23_0,esk23_0)) = esk22_0
| ~ in(esk23_0,esk22_0) ),
i_0_145 ).
cnf(c_0_200,lemma,
in(esk23_0,esk22_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_194,c_0_195]),c_0_196]) ).
cnf(c_0_201,lemma,
~ in(X1,set_difference(X2,unordered_pair(X1,X1))),
inference(spm,[status(thm)],[c_0_197,c_0_198]) ).
cnf(c_0_202,negated_conjecture,
set_difference(esk22_0,unordered_pair(esk23_0,esk23_0)) = esk22_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_199,c_0_200])]) ).
cnf(c_0_203,lemma,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_201,c_0_202]),c_0_200])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU162+2 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 20 01:10:56 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected complete mode:
% 8.42/2.52 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.42/2.52 # No SInE strategy applied
% 8.42/2.52 # Trying AutoSched0 for 150 seconds
% 8.42/2.52 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S006A
% 8.42/2.52 # and selection function SelectLargestNegLit.
% 8.42/2.52 #
% 8.42/2.52 # Preprocessing time : 0.013 s
% 8.42/2.52 # Presaturation interreduction done
% 8.42/2.52
% 8.42/2.52 # Proof found!
% 8.42/2.52 # SZS status Theorem
% 8.42/2.52 # SZS output start CNFRefutation
% See solution above
% 8.42/2.52 # Training examples: 0 positive, 0 negative
% 8.42/2.52
% 8.42/2.52 # -------------------------------------------------
% 8.42/2.52 # User time : 0.108 s
% 8.42/2.52 # System time : 0.006 s
% 8.42/2.52 # Total time : 0.114 s
% 8.42/2.52 # Maximum resident set size: 7124 pages
% 8.42/2.52
%------------------------------------------------------------------------------