TSTP Solution File: SEU136+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU136+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n006.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:44 EDT 2022
% Result : Theorem 21.86s 4.12s
% Output : CNFRefutation 21.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 20
% Syntax : Number of clauses : 66 ( 26 unt; 12 nHn; 32 RR)
% Number of literals : 123 ( 32 equ; 50 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 162 ( 27 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_28,plain,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-glmbgas7/input.p',i_0_28) ).
cnf(i_0_65,lemma,
( disjoint(X1,X2)
| in(esk9_2(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-glmbgas7/input.p',i_0_65) ).
cnf(i_0_29,plain,
( in(X1,X2)
| X3 != set_difference(X2,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-glmbgas7/input.p',i_0_29) ).
cnf(i_0_66,lemma,
( disjoint(X1,X2)
| in(esk9_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-glmbgas7/input.p',i_0_66) ).
cnf(i_0_51,lemma,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-glmbgas7/input.p',i_0_51) ).
cnf(i_0_59,lemma,
subset(set_difference(X1,X2),X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-glmbgas7/input.p',i_0_59) ).
cnf(i_0_13,plain,
( in(X1,X2)
| X2 != set_union2(X3,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-glmbgas7/input.p',i_0_13) ).
cnf(i_0_14,plain,
( in(X1,X2)
| in(X1,X3)
| X4 != set_union2(X3,X2)
| ~ in(X1,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-glmbgas7/input.p',i_0_14) ).
cnf(i_0_16,plain,
( subset(X1,X2)
| in(esk3_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-glmbgas7/input.p',i_0_16) ).
cnf(i_0_3,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-glmbgas7/input.p',i_0_3) ).
cnf(i_0_53,lemma,
( set_intersection2(X1,X2) = X1
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-glmbgas7/input.p',i_0_53) ).
cnf(i_0_31,plain,
( set_intersection2(X1,X2) = empty_set
| ~ disjoint(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-glmbgas7/input.p',i_0_31) ).
cnf(i_0_15,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-glmbgas7/input.p',i_0_15) ).
cnf(i_0_62,lemma,
set_union2(X1,set_difference(X2,X1)) = set_union2(X1,X2),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-glmbgas7/input.p',i_0_62) ).
cnf(i_0_50,plain,
set_union2(X1,empty_set) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-glmbgas7/input.p',i_0_50) ).
cnf(i_0_4,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-glmbgas7/input.p',i_0_4) ).
cnf(i_0_58,lemma,
( subset(set_difference(X1,X2),set_difference(X3,X2))
| ~ subset(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-glmbgas7/input.p',i_0_58) ).
cnf(i_0_74,lemma,
subset(X1,set_union2(X1,X2)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-glmbgas7/input.p',i_0_74) ).
cnf(i_0_2,plain,
set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-glmbgas7/input.p',i_0_2) ).
cnf(i_0_68,negated_conjecture,
set_difference(set_union2(esk10_0,esk11_0),esk11_0) != set_difference(esk10_0,esk11_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-glmbgas7/input.p',i_0_68) ).
cnf(c_0_95,plain,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
i_0_28 ).
cnf(c_0_96,plain,
( ~ in(X1,set_difference(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_95]) ).
cnf(c_0_97,lemma,
( disjoint(X1,X2)
| in(esk9_2(X1,X2),X2) ),
i_0_65 ).
cnf(c_0_98,plain,
( in(X1,X2)
| X3 != set_difference(X2,X4)
| ~ in(X1,X3) ),
i_0_29 ).
cnf(c_0_99,lemma,
( disjoint(X1,set_difference(X2,X3))
| ~ in(esk9_2(X1,set_difference(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_96,c_0_97]) ).
cnf(c_0_100,lemma,
( disjoint(X1,X2)
| in(esk9_2(X1,X2),X1) ),
i_0_66 ).
cnf(c_0_101,lemma,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
i_0_51 ).
cnf(c_0_102,lemma,
subset(set_difference(X1,X2),X1),
i_0_59 ).
cnf(c_0_103,plain,
( in(X1,X2)
| X2 != set_union2(X3,X4)
| ~ in(X1,X3) ),
i_0_13 ).
cnf(c_0_104,plain,
( in(X1,X2)
| in(X1,X3)
| X4 != set_union2(X3,X2)
| ~ in(X1,X4) ),
i_0_14 ).
cnf(c_0_105,plain,
( in(X1,X2)
| ~ in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_98]) ).
cnf(c_0_106,plain,
( subset(X1,X2)
| in(esk3_2(X1,X2),X1) ),
i_0_16 ).
cnf(c_0_107,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
i_0_3 ).
cnf(c_0_108,lemma,
( set_intersection2(X1,X2) = X1
| ~ subset(X1,X2) ),
i_0_53 ).
cnf(c_0_109,plain,
( set_intersection2(X1,X2) = empty_set
| ~ disjoint(X1,X2) ),
i_0_31 ).
cnf(c_0_110,lemma,
disjoint(X1,set_difference(X2,X1)),
inference(spm,[status(thm)],[c_0_99,c_0_100]) ).
cnf(c_0_111,lemma,
( subset(X1,X2)
| ~ subset(X1,set_difference(X2,X3)) ),
inference(spm,[status(thm)],[c_0_101,c_0_102]) ).
cnf(c_0_112,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
i_0_15 ).
cnf(c_0_113,plain,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_103]) ).
cnf(c_0_114,plain,
( in(X1,X2)
| in(X1,X3)
| ~ in(X1,set_union2(X2,X3)) ),
inference(er,[status(thm)],[c_0_104]) ).
cnf(c_0_115,plain,
( in(esk3_2(set_difference(X1,X2),X3),X1)
| subset(set_difference(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_116,plain,
( set_intersection2(X1,X2) = X2
| ~ subset(X2,X1) ),
inference(spm,[status(thm)],[c_0_107,c_0_108]) ).
cnf(c_0_117,plain,
set_intersection2(X1,set_difference(X2,X1)) = empty_set,
inference(spm,[status(thm)],[c_0_109,c_0_110]) ).
cnf(c_0_118,lemma,
subset(set_difference(set_difference(X1,X2),X3),X1),
inference(spm,[status(thm)],[c_0_111,c_0_102]) ).
cnf(c_0_119,plain,
( subset(X1,set_union2(X2,X3))
| ~ in(esk3_2(X1,set_union2(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_112,c_0_113]) ).
cnf(c_0_120,plain,
( in(esk3_2(set_difference(set_union2(X1,X2),X3),X4),X1)
| in(esk3_2(set_difference(set_union2(X1,X2),X3),X4),X2)
| subset(set_difference(set_union2(X1,X2),X3),X4) ),
inference(spm,[status(thm)],[c_0_114,c_0_115]) ).
cnf(c_0_121,plain,
( set_difference(X1,X2) = empty_set
| ~ subset(set_difference(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_116,c_0_117]) ).
cnf(c_0_122,lemma,
subset(set_difference(set_difference(set_difference(X1,X2),X3),X4),X1),
inference(spm,[status(thm)],[c_0_111,c_0_118]) ).
cnf(c_0_123,plain,
( subset(set_difference(X1,X2),X3)
| ~ in(esk3_2(set_difference(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_96,c_0_106]) ).
cnf(c_0_124,plain,
( in(esk3_2(set_difference(set_union2(X1,X2),X3),set_union2(X2,X4)),X1)
| subset(set_difference(set_union2(X1,X2),X3),set_union2(X2,X4)) ),
inference(spm,[status(thm)],[c_0_119,c_0_120]) ).
cnf(c_0_125,lemma,
set_union2(X1,set_difference(X2,X1)) = set_union2(X1,X2),
i_0_62 ).
cnf(c_0_126,plain,
set_difference(set_difference(set_difference(X1,X2),X3),X1) = empty_set,
inference(spm,[status(thm)],[c_0_121,c_0_122]) ).
cnf(c_0_127,plain,
set_union2(X1,empty_set) = X1,
i_0_50 ).
cnf(c_0_128,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
i_0_4 ).
cnf(c_0_129,lemma,
( subset(set_difference(X1,X2),set_difference(X3,X2))
| ~ subset(X1,X3) ),
i_0_58 ).
cnf(c_0_130,plain,
subset(set_difference(set_union2(X1,X2),X1),set_union2(X2,X3)),
inference(spm,[status(thm)],[c_0_123,c_0_124]) ).
cnf(c_0_131,lemma,
set_union2(X1,set_difference(set_difference(X1,X2),X3)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_126]),c_0_127]) ).
cnf(c_0_132,lemma,
subset(X1,set_union2(X1,X2)),
i_0_74 ).
cnf(c_0_133,plain,
set_union2(X1,X2) = set_union2(X2,X1),
i_0_2 ).
cnf(c_0_134,negated_conjecture,
set_difference(set_union2(esk10_0,esk11_0),esk11_0) != set_difference(esk10_0,esk11_0),
i_0_68 ).
cnf(c_0_135,plain,
( set_difference(X1,X2) = set_difference(X3,X2)
| ~ subset(set_difference(X1,X2),set_difference(X3,X2))
| ~ subset(X3,X1) ),
inference(spm,[status(thm)],[c_0_128,c_0_129]) ).
cnf(c_0_136,lemma,
subset(set_difference(set_union2(X1,X2),X1),X2),
inference(spm,[status(thm)],[c_0_130,c_0_131]) ).
cnf(c_0_137,lemma,
subset(X1,set_union2(X2,X1)),
inference(spm,[status(thm)],[c_0_132,c_0_133]) ).
cnf(c_0_138,negated_conjecture,
set_difference(set_union2(esk11_0,esk10_0),esk11_0) != set_difference(esk10_0,esk11_0),
inference(rw,[status(thm)],[c_0_134,c_0_133]) ).
cnf(c_0_139,plain,
set_difference(set_union2(X1,X2),X1) = set_difference(X2,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_135,c_0_136]),c_0_125]),c_0_125]),c_0_137])]) ).
cnf(c_0_140,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_138,c_0_139])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU136+2 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n006.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % 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 : Sun Jun 19 11:46:12 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 21.86/4.12 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d60-l8000-e0.15+coop-eprover73:
% 21.86/4.12 # ENIGMA: LightGBM model '/export/starexec/sandbox2/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d60-l8000-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 23; version: 991; iters: 150)
% 21.86/4.12 # Preprocessing time : 1.227 s
% 21.86/4.12 # Presaturation interreduction done
% 21.86/4.12
% 21.86/4.12 # Proof found!
% 21.86/4.12 # SZS status Theorem
% 21.86/4.12 # SZS output start CNFRefutation
% See solution above
% 21.86/4.12 # Training examples: 0 positive, 0 negative
% 21.86/4.12
% 21.86/4.12 # -------------------------------------------------
% 21.86/4.12 # User time : 1.587 s
% 21.86/4.12 # System time : 0.166 s
% 21.86/4.12 # Total time : 1.753 s
% 21.86/4.12 # ...preprocessing : 1.227 s
% 21.86/4.12 # ...main loop : 0.526 s
% 21.86/4.12 # Maximum resident set size: 187460 pages
% 21.86/4.12
%------------------------------------------------------------------------------