TSTP Solution File: SEU201+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU201+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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:28 EDT 2022
% Result : Theorem 19.75s 3.91s
% Output : CNFRefutation 19.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 17
% Syntax : Number of clauses : 63 ( 10 unt; 7 nHn; 46 RR)
% Number of literals : 196 ( 41 equ; 129 neg)
% Maximal clause size : 7 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-3 aty)
% Number of variables : 187 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_13,plain,
( in(X1,X2)
| X3 != relation_rng_restriction(X2,X4)
| ~ relation(X4)
| ~ relation(X3)
| ~ in(unordered_pair(unordered_pair(X5,X1),singleton(X5)),X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h929fycp/input.p',i_0_13) ).
cnf(i_0_3,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h929fycp/input.p',i_0_3) ).
cnf(i_0_26,plain,
( in(unordered_pair(unordered_pair(esk5_3(X1,X2,X3),X3),singleton(esk5_3(X1,X2,X3))),X1)
| X2 != relation_rng(X1)
| ~ relation(X1)
| ~ in(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h929fycp/input.p',i_0_26) ).
cnf(i_0_11,plain,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3)
| X3 != relation_rng_restriction(X4,X5)
| ~ relation(X3)
| ~ relation(X5)
| ~ in(X2,X4)
| ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X5) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h929fycp/input.p',i_0_11) ).
cnf(i_0_35,plain,
( relation(relation_rng_restriction(X1,X2))
| ~ relation(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h929fycp/input.p',i_0_35) ).
cnf(i_0_25,plain,
( in(X1,X2)
| X2 != relation_rng(X3)
| ~ relation(X3)
| ~ in(unordered_pair(unordered_pair(X4,X1),singleton(X4)),X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h929fycp/input.p',i_0_25) ).
cnf(i_0_20,plain,
( in(X1,X2)
| X2 != set_intersection2(X3,X4)
| ~ in(X1,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h929fycp/input.p',i_0_20) ).
cnf(i_0_22,plain,
( in(X1,X2)
| X3 != set_intersection2(X2,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h929fycp/input.p',i_0_22) ).
cnf(i_0_14,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h929fycp/input.p',i_0_14) ).
cnf(i_0_15,plain,
( subset(X1,X2)
| in(esk3_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h929fycp/input.p',i_0_15) ).
cnf(i_0_16,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h929fycp/input.p',i_0_16) ).
cnf(i_0_62,plain,
( subset(relation_rng(relation_rng_restriction(X1,X2)),relation_rng(X2))
| ~ relation(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h929fycp/input.p',i_0_62) ).
cnf(i_0_21,plain,
( in(X1,X2)
| X3 != set_intersection2(X4,X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h929fycp/input.p',i_0_21) ).
cnf(i_0_5,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h929fycp/input.p',i_0_5) ).
cnf(i_0_63,negated_conjecture,
relation_rng(relation_rng_restriction(esk15_0,esk16_0)) != set_intersection2(relation_rng(esk16_0),esk15_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h929fycp/input.p',i_0_63) ).
cnf(i_0_4,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h929fycp/input.p',i_0_4) ).
cnf(i_0_64,negated_conjecture,
relation(esk16_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-h929fycp/input.p',i_0_64) ).
cnf(c_0_82,plain,
( in(X1,X2)
| X3 != relation_rng_restriction(X2,X4)
| ~ relation(X4)
| ~ relation(X3)
| ~ in(unordered_pair(unordered_pair(X5,X1),singleton(X5)),X3) ),
i_0_13 ).
cnf(c_0_83,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
i_0_3 ).
cnf(c_0_84,plain,
( in(unordered_pair(unordered_pair(esk5_3(X1,X2,X3),X3),singleton(esk5_3(X1,X2,X3))),X1)
| X2 != relation_rng(X1)
| ~ relation(X1)
| ~ in(X3,X2) ),
i_0_26 ).
cnf(c_0_85,plain,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3)
| X3 != relation_rng_restriction(X4,X5)
| ~ relation(X3)
| ~ relation(X5)
| ~ in(X2,X4)
| ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X5) ),
i_0_11 ).
cnf(c_0_86,plain,
( in(X1,X2)
| X3 != relation_rng_restriction(X2,X4)
| ~ in(unordered_pair(unordered_pair(X1,X5),singleton(X5)),X3)
| ~ relation(X4)
| ~ relation(X3) ),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_87,plain,
( in(unordered_pair(unordered_pair(X1,esk5_3(X2,X3,X1)),singleton(esk5_3(X2,X3,X1))),X2)
| X3 != relation_rng(X2)
| ~ in(X1,X3)
| ~ relation(X2) ),
inference(rw,[status(thm)],[c_0_84,c_0_83]) ).
cnf(c_0_88,plain,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X2)),X3)
| X3 != relation_rng_restriction(X4,X5)
| ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X2)),X5)
| ~ in(X1,X4)
| ~ relation(X5)
| ~ relation(X3) ),
inference(spm,[status(thm)],[c_0_85,c_0_83]) ).
cnf(c_0_89,plain,
( in(X1,X2)
| X3 != relation_rng_restriction(X2,X4)
| X5 != relation_rng(X3)
| ~ in(X1,X5)
| ~ relation(X4)
| ~ relation(X3) ),
inference(spm,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_90,plain,
( relation(relation_rng_restriction(X1,X2))
| ~ relation(X2) ),
i_0_35 ).
cnf(c_0_91,plain,
( in(X1,X2)
| X2 != relation_rng(X3)
| ~ relation(X3)
| ~ in(unordered_pair(unordered_pair(X4,X1),singleton(X4)),X3) ),
i_0_25 ).
cnf(c_0_92,plain,
( in(unordered_pair(unordered_pair(X1,esk5_3(X2,X3,X1)),singleton(esk5_3(X2,X3,X1))),X4)
| X4 != relation_rng_restriction(X5,X2)
| X3 != relation_rng(X2)
| ~ in(X1,X5)
| ~ in(X1,X3)
| ~ relation(X2)
| ~ relation(X4) ),
inference(spm,[status(thm)],[c_0_88,c_0_87]) ).
cnf(c_0_93,plain,
( in(X1,X2)
| X2 != set_intersection2(X3,X4)
| ~ in(X1,X4)
| ~ in(X1,X3) ),
i_0_20 ).
cnf(c_0_94,plain,
( in(X1,X2)
| X3 != relation_rng(relation_rng_restriction(X2,X4))
| ~ in(X1,X3)
| ~ relation(X4) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_89]),c_0_90]) ).
cnf(c_0_95,plain,
( in(X1,X2)
| X2 != relation_rng(X3)
| ~ in(unordered_pair(unordered_pair(X1,X4),singleton(X4)),X3)
| ~ relation(X3) ),
inference(spm,[status(thm)],[c_0_91,c_0_83]) ).
cnf(c_0_96,plain,
( in(unordered_pair(unordered_pair(X1,esk5_3(X2,X3,X1)),singleton(esk5_3(X2,X3,X1))),relation_rng_restriction(X4,X2))
| X3 != relation_rng(X2)
| ~ in(X1,X4)
| ~ in(X1,X3)
| ~ relation(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_92]),c_0_90]) ).
cnf(c_0_97,plain,
( in(X1,X2)
| X3 != set_intersection2(X2,X4)
| ~ in(X1,X3) ),
i_0_22 ).
cnf(c_0_98,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
i_0_14 ).
cnf(c_0_99,plain,
( in(X1,set_intersection2(X2,X3))
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_93]) ).
cnf(c_0_100,plain,
( in(X1,X2)
| ~ in(X1,relation_rng(relation_rng_restriction(X2,X3)))
| ~ relation(X3) ),
inference(er,[status(thm)],[c_0_94]) ).
cnf(c_0_101,plain,
( subset(X1,X2)
| in(esk3_2(X1,X2),X1) ),
i_0_15 ).
cnf(c_0_102,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
i_0_16 ).
cnf(c_0_103,plain,
( subset(relation_rng(relation_rng_restriction(X1,X2)),relation_rng(X2))
| ~ relation(X2) ),
i_0_62 ).
cnf(c_0_104,plain,
( in(X1,X2)
| X2 != relation_rng(relation_rng_restriction(X3,X4))
| X5 != relation_rng(X4)
| ~ in(X1,X3)
| ~ in(X1,X5)
| ~ relation(X4) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_90]) ).
cnf(c_0_105,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X2,X3)) ),
inference(er,[status(thm)],[c_0_97]) ).
cnf(c_0_106,plain,
( subset(X1,set_intersection2(X2,X3))
| ~ in(esk3_2(X1,set_intersection2(X2,X3)),X3)
| ~ in(esk3_2(X1,set_intersection2(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_98,c_0_99]) ).
cnf(c_0_107,plain,
( in(esk3_2(relation_rng(relation_rng_restriction(X1,X2)),X3),X1)
| subset(relation_rng(relation_rng_restriction(X1,X2)),X3)
| ~ relation(X2) ),
inference(spm,[status(thm)],[c_0_100,c_0_101]) ).
cnf(c_0_108,plain,
( in(X1,relation_rng(X2))
| ~ in(X1,relation_rng(relation_rng_restriction(X3,X2)))
| ~ relation(X2) ),
inference(spm,[status(thm)],[c_0_102,c_0_103]) ).
cnf(c_0_109,plain,
( in(X1,relation_rng(relation_rng_restriction(X2,X3)))
| X4 != relation_rng(X3)
| ~ in(X1,X2)
| ~ in(X1,X4)
| ~ relation(X3) ),
inference(er,[status(thm)],[c_0_104]) ).
cnf(c_0_110,plain,
( in(esk3_2(set_intersection2(X1,X2),X3),X1)
| subset(set_intersection2(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_105,c_0_101]) ).
cnf(c_0_111,plain,
( in(X1,X2)
| X3 != set_intersection2(X4,X2)
| ~ in(X1,X3) ),
i_0_21 ).
cnf(c_0_112,plain,
( subset(relation_rng(relation_rng_restriction(X1,X2)),set_intersection2(X3,X1))
| ~ in(esk3_2(relation_rng(relation_rng_restriction(X1,X2)),set_intersection2(X3,X1)),X3)
| ~ relation(X2) ),
inference(spm,[status(thm)],[c_0_106,c_0_107]) ).
cnf(c_0_113,plain,
( in(esk3_2(relation_rng(relation_rng_restriction(X1,X2)),X3),relation_rng(X2))
| subset(relation_rng(relation_rng_restriction(X1,X2)),X3)
| ~ relation(X2) ),
inference(spm,[status(thm)],[c_0_108,c_0_101]) ).
cnf(c_0_114,plain,
( in(esk3_2(set_intersection2(X1,X2),X3),relation_rng(relation_rng_restriction(X4,X5)))
| subset(set_intersection2(X1,X2),X3)
| X1 != relation_rng(X5)
| ~ in(esk3_2(set_intersection2(X1,X2),X3),X4)
| ~ relation(X5) ),
inference(spm,[status(thm)],[c_0_109,c_0_110]) ).
cnf(c_0_115,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X3,X2)) ),
inference(er,[status(thm)],[c_0_111]) ).
cnf(c_0_116,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
i_0_5 ).
cnf(c_0_117,plain,
( subset(relation_rng(relation_rng_restriction(X1,X2)),set_intersection2(relation_rng(X2),X1))
| ~ relation(X2) ),
inference(spm,[status(thm)],[c_0_112,c_0_113]) ).
cnf(c_0_118,plain,
( subset(set_intersection2(X1,X2),relation_rng(relation_rng_restriction(X3,X4)))
| X1 != relation_rng(X4)
| ~ in(esk3_2(set_intersection2(X1,X2),relation_rng(relation_rng_restriction(X3,X4))),X3)
| ~ relation(X4) ),
inference(spm,[status(thm)],[c_0_98,c_0_114]) ).
cnf(c_0_119,plain,
( in(esk3_2(set_intersection2(X1,X2),X3),X2)
| subset(set_intersection2(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_115,c_0_101]) ).
cnf(c_0_120,negated_conjecture,
relation_rng(relation_rng_restriction(esk15_0,esk16_0)) != set_intersection2(relation_rng(esk16_0),esk15_0),
i_0_63 ).
cnf(c_0_121,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
i_0_4 ).
cnf(c_0_122,plain,
( relation_rng(relation_rng_restriction(X1,X2)) = set_intersection2(relation_rng(X2),X1)
| ~ subset(set_intersection2(relation_rng(X2),X1),relation_rng(relation_rng_restriction(X1,X2)))
| ~ relation(X2) ),
inference(spm,[status(thm)],[c_0_116,c_0_117]) ).
cnf(c_0_123,plain,
( subset(set_intersection2(X1,X2),relation_rng(relation_rng_restriction(X2,X3)))
| X1 != relation_rng(X3)
| ~ relation(X3) ),
inference(spm,[status(thm)],[c_0_118,c_0_119]) ).
cnf(c_0_124,negated_conjecture,
relation_rng(relation_rng_restriction(esk15_0,esk16_0)) != set_intersection2(esk15_0,relation_rng(esk16_0)),
inference(rw,[status(thm)],[c_0_120,c_0_121]) ).
cnf(c_0_125,plain,
( relation_rng(relation_rng_restriction(X1,X2)) = set_intersection2(relation_rng(X2),X1)
| ~ relation(X2) ),
inference(spm,[status(thm)],[c_0_122,c_0_123]) ).
cnf(c_0_126,negated_conjecture,
relation(esk16_0),
i_0_64 ).
cnf(c_0_127,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_125]),c_0_121]),c_0_126])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU201+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n026.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 : Mon Jun 20 07:10:57 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 19.75/3.91 # ENIGMATIC: Solved by Enigma+tptp-cade20-model02-h2e15+lgb-t150-d30-l6400-e0.15+coop-mzr02:
% 19.75/3.91 # 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: 37; version: 991; iters: 150)
% 19.75/3.91 # Preprocessing time : 1.217 s
% 19.75/3.91
% 19.75/3.91 # Proof found!
% 19.75/3.91 # SZS status Theorem
% 19.75/3.91 # SZS output start CNFRefutation
% See solution above
% 19.75/3.91 # Training examples: 0 positive, 0 negative
% 19.75/3.91
% 19.75/3.91 # -------------------------------------------------
% 19.75/3.91 # User time : 1.526 s
% 19.75/3.91 # System time : 0.117 s
% 19.75/3.91 # Total time : 1.643 s
% 19.75/3.91 # ...preprocessing : 1.217 s
% 19.75/3.91 # ...main loop : 0.425 s
% 19.75/3.91 # Maximum resident set size: 167292 pages
% 19.75/3.91
%------------------------------------------------------------------------------