%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU111+1 : TPTP v8.1.0. Released v3.2.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:38:31 EDT 2022
% Result : Theorem 18.02s 3.63s
% Output : CNFRefutation 18.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of clauses : 50 ( 16 unt; 11 nHn; 28 RR)
% Number of literals : 105 ( 13 equ; 46 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 114 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_19,plain,
( in(X1,X2)
| X3 != set_intersection2(X4,X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qfm431jp/input.p',i_0_19) ).
cnf(i_0_26,plain,
( subset(X1,X2)
| X3 != finite_subsets(X2)
| ~ preboolean(X3)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qfm431jp/input.p',i_0_26) ).
cnf(i_0_27,plain,
preboolean(finite_subsets(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qfm431jp/input.p',i_0_27) ).
cnf(i_0_13,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qfm431jp/input.p',i_0_13) ).
cnf(i_0_24,plain,
( in(X1,X2)
| X2 != finite_subsets(X3)
| ~ finite(X1)
| ~ preboolean(X2)
| ~ subset(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qfm431jp/input.p',i_0_24) ).
cnf(i_0_73,plain,
( subset(X1,set_intersection2(X2,X3))
| ~ subset(X1,X3)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qfm431jp/input.p',i_0_73) ).
cnf(i_0_8,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qfm431jp/input.p',i_0_8) ).
cnf(i_0_74,plain,
( element(X1,X2)
| ~ in(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qfm431jp/input.p',i_0_74) ).
cnf(i_0_75,plain,
( subset(finite_subsets(X1),finite_subsets(X2))
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qfm431jp/input.p',i_0_75) ).
cnf(i_0_72,plain,
subset(set_intersection2(X1,X2),X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qfm431jp/input.p',i_0_72) ).
cnf(i_0_7,plain,
( finite(X1)
| ~ element(X1,finite_subsets(X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qfm431jp/input.p',i_0_7) ).
cnf(i_0_12,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qfm431jp/input.p',i_0_12) ).
cnf(i_0_9,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qfm431jp/input.p',i_0_9) ).
cnf(i_0_76,negated_conjecture,
set_intersection2(finite_subsets(esk14_0),finite_subsets(esk15_0)) != finite_subsets(set_intersection2(esk14_0,esk15_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qfm431jp/input.p',i_0_76) ).
cnf(c_0_91,plain,
( in(X1,X2)
| X3 != set_intersection2(X4,X2)
| ~ in(X1,X3) ),
i_0_19 ).
cnf(c_0_92,plain,
( subset(X1,X2)
| X3 != finite_subsets(X2)
| ~ preboolean(X3)
| ~ in(X1,X3) ),
i_0_26 ).
cnf(c_0_93,plain,
preboolean(finite_subsets(X1)),
i_0_27 ).
cnf(c_0_94,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X3,X2)) ),
inference(er,[status(thm)],[c_0_91]) ).
cnf(c_0_95,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
i_0_13 ).
cnf(c_0_96,plain,
( subset(X1,X2)
| ~ in(X1,finite_subsets(X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_92]),c_0_93])]) ).
cnf(c_0_97,plain,
( in(esk1_2(set_intersection2(X1,X2),X3),X2)
| subset(set_intersection2(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_94,c_0_95]) ).
cnf(c_0_98,plain,
( in(X1,X2)
| X2 != finite_subsets(X3)
| ~ finite(X1)
| ~ preboolean(X2)
| ~ subset(X1,X3) ),
i_0_24 ).
cnf(c_0_99,plain,
( subset(X1,set_intersection2(X2,X3))
| ~ subset(X1,X3)
| ~ subset(X1,X2) ),
i_0_73 ).
cnf(c_0_100,plain,
( subset(esk1_2(set_intersection2(X1,finite_subsets(X2)),X3),X2)
| subset(set_intersection2(X1,finite_subsets(X2)),X3) ),
inference(spm,[status(thm)],[c_0_96,c_0_97]) ).
cnf(c_0_101,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
i_0_8 ).
cnf(c_0_102,plain,
( in(X1,finite_subsets(X2))
| ~ subset(X1,X2)
| ~ preboolean(finite_subsets(X2))
| ~ finite(X1) ),
inference(er,[status(thm)],[c_0_98]) ).
cnf(c_0_103,plain,
( subset(esk1_2(set_intersection2(X1,finite_subsets(X2)),X3),set_intersection2(X4,X2))
| subset(set_intersection2(X1,finite_subsets(X2)),X3)
| ~ subset(esk1_2(set_intersection2(X1,finite_subsets(X2)),X3),X4) ),
inference(spm,[status(thm)],[c_0_99,c_0_100]) ).
cnf(c_0_104,plain,
( subset(esk1_2(set_intersection2(finite_subsets(X1),X2),X3),X1)
| subset(set_intersection2(finite_subsets(X1),X2),X3) ),
inference(spm,[status(thm)],[c_0_100,c_0_101]) ).
cnf(c_0_105,plain,
( element(X1,X2)
| ~ in(X1,X2) ),
i_0_74 ).
cnf(c_0_106,plain,
( subset(finite_subsets(X1),finite_subsets(X2))
| ~ subset(X1,X2) ),
i_0_75 ).
cnf(c_0_107,plain,
subset(set_intersection2(X1,X2),X1),
i_0_72 ).
cnf(c_0_108,plain,
( in(X1,finite_subsets(X2))
| ~ subset(X1,X2)
| ~ finite(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_102,c_0_93])]) ).
cnf(c_0_109,plain,
( subset(esk1_2(set_intersection2(finite_subsets(X1),finite_subsets(X2)),X3),set_intersection2(X1,X2))
| subset(set_intersection2(finite_subsets(X1),finite_subsets(X2)),X3) ),
inference(spm,[status(thm)],[c_0_103,c_0_104]) ).
cnf(c_0_110,plain,
( finite(X1)
| ~ element(X1,finite_subsets(X2)) ),
i_0_7 ).
cnf(c_0_111,plain,
( element(esk1_2(set_intersection2(X1,X2),X3),X2)
| subset(set_intersection2(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_105,c_0_97]) ).
cnf(c_0_112,plain,
subset(finite_subsets(set_intersection2(X1,X2)),finite_subsets(X1)),
inference(spm,[status(thm)],[c_0_106,c_0_107]) ).
cnf(c_0_113,plain,
subset(set_intersection2(X1,X2),X2),
inference(spm,[status(thm)],[c_0_107,c_0_101]) ).
cnf(c_0_114,plain,
( in(esk1_2(set_intersection2(finite_subsets(X1),finite_subsets(X2)),X3),finite_subsets(set_intersection2(X1,X2)))
| subset(set_intersection2(finite_subsets(X1),finite_subsets(X2)),X3)
| ~ finite(esk1_2(set_intersection2(finite_subsets(X1),finite_subsets(X2)),X3)) ),
inference(spm,[status(thm)],[c_0_108,c_0_109]) ).
cnf(c_0_115,plain,
( subset(set_intersection2(X1,finite_subsets(X2)),X3)
| finite(esk1_2(set_intersection2(X1,finite_subsets(X2)),X3)) ),
inference(spm,[status(thm)],[c_0_110,c_0_111]) ).
cnf(c_0_116,plain,
( subset(finite_subsets(set_intersection2(X1,X2)),set_intersection2(X3,finite_subsets(X1)))
| ~ subset(finite_subsets(set_intersection2(X1,X2)),X3) ),
inference(spm,[status(thm)],[c_0_99,c_0_112]) ).
cnf(c_0_117,plain,
subset(finite_subsets(set_intersection2(X1,X2)),finite_subsets(X2)),
inference(spm,[status(thm)],[c_0_106,c_0_113]) ).
cnf(c_0_118,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
i_0_12 ).
cnf(c_0_119,plain,
( in(esk1_2(set_intersection2(finite_subsets(X1),finite_subsets(X2)),X3),finite_subsets(set_intersection2(X1,X2)))
| subset(set_intersection2(finite_subsets(X1),finite_subsets(X2)),X3) ),
inference(spm,[status(thm)],[c_0_114,c_0_115]) ).
cnf(c_0_120,plain,
subset(finite_subsets(set_intersection2(X1,X2)),set_intersection2(finite_subsets(X2),finite_subsets(X1))),
inference(spm,[status(thm)],[c_0_116,c_0_117]) ).
cnf(c_0_121,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
i_0_9 ).
cnf(c_0_122,plain,
subset(set_intersection2(finite_subsets(X1),finite_subsets(X2)),finite_subsets(set_intersection2(X1,X2))),
inference(spm,[status(thm)],[c_0_118,c_0_119]) ).
cnf(c_0_123,plain,
subset(finite_subsets(set_intersection2(X1,X2)),set_intersection2(finite_subsets(X1),finite_subsets(X2))),
inference(spm,[status(thm)],[c_0_120,c_0_101]) ).
cnf(c_0_124,negated_conjecture,
set_intersection2(finite_subsets(esk14_0),finite_subsets(esk15_0)) != finite_subsets(set_intersection2(esk14_0,esk15_0)),
i_0_76 ).
cnf(c_0_125,plain,
set_intersection2(finite_subsets(X1),finite_subsets(X2)) = finite_subsets(set_intersection2(X1,X2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_122]),c_0_123])]) ).
cnf(c_0_126,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_124,c_0_125])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU111+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n019.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 00:12:26 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 18.02/3.63 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d30-l6400-e0.15+coop-eprover66:
% 18.02/3.63 # ENIGMA: LightGBM model '/export/starexec/sandbox2/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d30-l6400-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 28; version: 991; iters: 150)
% 18.02/3.63 # Preprocessing time : 0.811 s
% 18.02/3.63 # Presaturation interreduction done
% 18.02/3.63
% 18.02/3.63 # Proof found!
% 18.02/3.63 # SZS status Theorem
% 18.02/3.63 # SZS output start CNFRefutation
% See solution above
% 18.02/3.63 # Training examples: 0 positive, 0 negative
% 18.02/3.63
% 18.02/3.63 # -------------------------------------------------
% 18.02/3.63 # User time : 1.169 s
% 18.02/3.63 # System time : 0.114 s
% 18.02/3.63 # Total time : 1.282 s
% 18.02/3.63 # ...preprocessing : 0.811 s
% 18.02/3.63 # ...main loop : 0.471 s
% 18.02/3.63 # Maximum resident set size: 167420 pages
% 18.02/3.63
%------------------------------------------------------------------------------