TSTP Solution File: SEU109+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU109+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n015.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:30 EDT 2022
% Result : Theorem 15.43s 3.39s
% Output : CNFRefutation 15.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 18
% Syntax : Number of clauses : 56 ( 17 unt; 10 nHn; 46 RR)
% Number of literals : 131 ( 11 equ; 73 neg)
% Maximal clause size : 5 ( 2 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 : 87 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_12,plain,
( in(X1,X2)
| X2 != set_intersection2(X3,X4)
| ~ in(X1,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a_1fwsm_/input.p',i_0_12) ).
cnf(i_0_60,plain,
( preboolean(X1)
| ~ in(set_union2(esk12_1(X1),esk13_1(X1)),X1)
| ~ in(set_difference(esk12_1(X1),esk13_1(X1)),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a_1fwsm_/input.p',i_0_60) ).
cnf(i_0_13,plain,
( in(X1,X2)
| X3 != set_intersection2(X4,X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a_1fwsm_/input.p',i_0_13) ).
cnf(i_0_62,plain,
( preboolean(X1)
| in(esk12_1(X1),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a_1fwsm_/input.p',i_0_62) ).
cnf(i_0_61,plain,
( preboolean(X1)
| in(esk13_1(X1),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a_1fwsm_/input.p',i_0_61) ).
cnf(i_0_14,plain,
( in(X1,X2)
| X3 != set_intersection2(X2,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a_1fwsm_/input.p',i_0_14) ).
cnf(i_0_63,plain,
( in(set_difference(X1,X2),X3)
| ~ preboolean(X3)
| ~ in(X2,X3)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a_1fwsm_/input.p',i_0_63) ).
cnf(i_0_8,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a_1fwsm_/input.p',i_0_8) ).
cnf(i_0_64,plain,
( in(set_union2(X1,X2),X3)
| ~ preboolean(X3)
| ~ in(X2,X3)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a_1fwsm_/input.p',i_0_64) ).
cnf(i_0_68,negated_conjecture,
( empty(set_intersection2(esk14_0,esk15_0))
| ~ preboolean(set_intersection2(esk14_0,esk15_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a_1fwsm_/input.p',i_0_68) ).
cnf(i_0_69,negated_conjecture,
preboolean(esk15_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a_1fwsm_/input.p',i_0_69) ).
cnf(i_0_71,negated_conjecture,
preboolean(esk14_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a_1fwsm_/input.p',i_0_71) ).
cnf(i_0_82,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a_1fwsm_/input.p',i_0_82) ).
cnf(i_0_81,plain,
( X1 = empty_set
| ~ empty(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a_1fwsm_/input.p',i_0_81) ).
cnf(i_0_24,plain,
empty(empty_set),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a_1fwsm_/input.p',i_0_24) ).
cnf(i_0_65,plain,
( empty(X1)
| in(empty_set,X1)
| ~ preboolean(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a_1fwsm_/input.p',i_0_65) ).
cnf(i_0_70,negated_conjecture,
~ empty(esk15_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a_1fwsm_/input.p',i_0_70) ).
cnf(i_0_72,negated_conjecture,
~ empty(esk14_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-a_1fwsm_/input.p',i_0_72) ).
cnf(c_0_101,plain,
( in(X1,X2)
| X2 != set_intersection2(X3,X4)
| ~ in(X1,X4)
| ~ in(X1,X3) ),
i_0_12 ).
cnf(c_0_102,plain,
( preboolean(X1)
| ~ in(set_union2(esk12_1(X1),esk13_1(X1)),X1)
| ~ in(set_difference(esk12_1(X1),esk13_1(X1)),X1) ),
i_0_60 ).
cnf(c_0_103,plain,
( in(X1,set_intersection2(X2,X3))
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_101]) ).
cnf(c_0_104,plain,
( in(X1,X2)
| X3 != set_intersection2(X4,X2)
| ~ in(X1,X3) ),
i_0_13 ).
cnf(c_0_105,plain,
( preboolean(set_intersection2(X1,X2))
| ~ in(set_union2(esk12_1(set_intersection2(X1,X2)),esk13_1(set_intersection2(X1,X2))),set_intersection2(X1,X2))
| ~ in(set_difference(esk12_1(set_intersection2(X1,X2)),esk13_1(set_intersection2(X1,X2))),X2)
| ~ in(set_difference(esk12_1(set_intersection2(X1,X2)),esk13_1(set_intersection2(X1,X2))),X1) ),
inference(spm,[status(thm)],[c_0_102,c_0_103]) ).
cnf(c_0_106,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X3,X2)) ),
inference(er,[status(thm)],[c_0_104]) ).
cnf(c_0_107,plain,
( preboolean(X1)
| in(esk12_1(X1),X1) ),
i_0_62 ).
cnf(c_0_108,plain,
( preboolean(X1)
| in(esk13_1(X1),X1) ),
i_0_61 ).
cnf(c_0_109,plain,
( in(X1,X2)
| X3 != set_intersection2(X2,X4)
| ~ in(X1,X3) ),
i_0_14 ).
cnf(c_0_110,plain,
( preboolean(set_intersection2(X1,X2))
| ~ in(set_difference(esk12_1(set_intersection2(X1,X2)),esk13_1(set_intersection2(X1,X2))),X2)
| ~ in(set_difference(esk12_1(set_intersection2(X1,X2)),esk13_1(set_intersection2(X1,X2))),X1)
| ~ in(set_union2(esk12_1(set_intersection2(X1,X2)),esk13_1(set_intersection2(X1,X2))),X2)
| ~ in(set_union2(esk12_1(set_intersection2(X1,X2)),esk13_1(set_intersection2(X1,X2))),X1) ),
inference(spm,[status(thm)],[c_0_105,c_0_103]) ).
cnf(c_0_111,plain,
( in(set_difference(X1,X2),X3)
| ~ preboolean(X3)
| ~ in(X2,X3)
| ~ in(X1,X3) ),
i_0_63 ).
cnf(c_0_112,plain,
( in(esk12_1(set_intersection2(X1,X2)),X2)
| preboolean(set_intersection2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_106,c_0_107]) ).
cnf(c_0_113,plain,
( in(esk13_1(set_intersection2(X1,X2)),X2)
| preboolean(set_intersection2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_106,c_0_108]) ).
cnf(c_0_114,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X2,X3)) ),
inference(er,[status(thm)],[c_0_109]) ).
cnf(c_0_115,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
i_0_8 ).
cnf(c_0_116,plain,
( preboolean(set_intersection2(X1,X2))
| ~ in(set_difference(esk12_1(set_intersection2(X1,X2)),esk13_1(set_intersection2(X1,X2))),X1)
| ~ in(set_union2(esk12_1(set_intersection2(X1,X2)),esk13_1(set_intersection2(X1,X2))),X2)
| ~ in(set_union2(esk12_1(set_intersection2(X1,X2)),esk13_1(set_intersection2(X1,X2))),X1)
| ~ preboolean(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_111]),c_0_112]),c_0_113]) ).
cnf(c_0_117,plain,
( in(esk12_1(set_intersection2(X1,X2)),X1)
| preboolean(set_intersection2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_114,c_0_107]) ).
cnf(c_0_118,plain,
( in(esk13_1(set_intersection2(X1,X2)),X1)
| preboolean(set_intersection2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_113,c_0_115]) ).
cnf(c_0_119,plain,
( preboolean(set_intersection2(X1,X2))
| ~ in(set_union2(esk12_1(set_intersection2(X1,X2)),esk13_1(set_intersection2(X1,X2))),X2)
| ~ in(set_union2(esk12_1(set_intersection2(X1,X2)),esk13_1(set_intersection2(X1,X2))),X1)
| ~ preboolean(X2)
| ~ preboolean(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_111]),c_0_117]),c_0_118]) ).
cnf(c_0_120,plain,
( in(set_union2(X1,X2),X3)
| ~ preboolean(X3)
| ~ in(X2,X3)
| ~ in(X1,X3) ),
i_0_64 ).
cnf(c_0_121,plain,
( preboolean(set_intersection2(X1,X2))
| ~ in(set_union2(esk12_1(set_intersection2(X1,X2)),esk13_1(set_intersection2(X1,X2))),X1)
| ~ preboolean(X2)
| ~ preboolean(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_120]),c_0_112]),c_0_113]) ).
cnf(c_0_122,negated_conjecture,
( empty(set_intersection2(esk14_0,esk15_0))
| ~ preboolean(set_intersection2(esk14_0,esk15_0)) ),
i_0_68 ).
cnf(c_0_123,plain,
( preboolean(set_intersection2(X1,X2))
| ~ preboolean(X2)
| ~ preboolean(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_120]),c_0_117]),c_0_118]) ).
cnf(c_0_124,negated_conjecture,
preboolean(esk15_0),
i_0_69 ).
cnf(c_0_125,negated_conjecture,
preboolean(esk14_0),
i_0_71 ).
cnf(c_0_126,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
i_0_82 ).
cnf(c_0_127,plain,
( X1 = empty_set
| ~ empty(X1) ),
i_0_81 ).
cnf(c_0_128,negated_conjecture,
empty(set_intersection2(esk14_0,esk15_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_123]),c_0_124]),c_0_125])]) ).
cnf(c_0_129,plain,
( ~ in(X1,X2)
| ~ in(X1,X3)
| ~ empty(set_intersection2(X3,X2)) ),
inference(spm,[status(thm)],[c_0_126,c_0_103]) ).
cnf(c_0_130,plain,
set_intersection2(esk14_0,esk15_0) = empty_set,
inference(spm,[status(thm)],[c_0_127,c_0_128]) ).
cnf(c_0_131,plain,
empty(empty_set),
i_0_24 ).
cnf(c_0_132,plain,
( empty(X1)
| in(empty_set,X1)
| ~ preboolean(X1) ),
i_0_65 ).
cnf(c_0_133,negated_conjecture,
~ empty(esk15_0),
i_0_70 ).
cnf(c_0_134,negated_conjecture,
~ empty(esk14_0),
i_0_72 ).
cnf(c_0_135,plain,
( ~ in(X1,esk15_0)
| ~ in(X1,esk14_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_129,c_0_130]),c_0_131])]) ).
cnf(c_0_136,negated_conjecture,
in(empty_set,esk15_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_132,c_0_124]),c_0_133]) ).
cnf(c_0_137,negated_conjecture,
in(empty_set,esk14_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_132,c_0_125]),c_0_134]) ).
cnf(c_0_138,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_135,c_0_136]),c_0_137])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEU109+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n015.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jun 18 20:30:30 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected complete mode:
% 15.43/3.39 # ENIGMATIC: Solved by Enigma+tptp-cade20-model02-h2e15+lgb-t150-d30-l6400-e0.15+coop-mzr02:
% 15.43/3.39 # ENIGMA: LightGBM model '/export/starexec/sandbox2/solver/bin/data/Enigma/tptp-cade20-model02-h2e15/lgb-t150-d30-l6400-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 32; version: 991; iters: 150)
% 15.43/3.39 # Preprocessing time : 0.858 s
% 15.43/3.39
% 15.43/3.39 # Proof found!
% 15.43/3.39 # SZS status Theorem
% 15.43/3.39 # SZS output start CNFRefutation
% See solution above
% 15.43/3.39 # Training examples: 0 positive, 0 negative
% 15.43/3.39
% 15.43/3.39 # -------------------------------------------------
% 15.43/3.39 # User time : 0.790 s
% 15.43/3.39 # System time : 0.108 s
% 15.43/3.39 # Total time : 0.898 s
% 15.43/3.39 # ...preprocessing : 0.858 s
% 15.43/3.39 # ...main loop : 0.040 s
% 15.43/3.39 # Maximum resident set size: 167924 pages
% 15.43/3.39
%------------------------------------------------------------------------------